← back to paper

Review history

arxiv: 2607.00876 · 2 revisions

The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting

1. 2026-07-03 UNVERDICTED LOW v0.9.1-grok novelty 8.0
   34275 ms 5721 in 1064 out 2026-07-03T18:02:31.205831+00:00
2. 2026-07-02 UNVERDICTED LOW v0.9.1-grok novelty 8.0
   54064 ms 5721 in 1197 out 2026-07-02T04:23:57.078450+00:00