Skip to content

Commit

Permalink
Specify one Helper & compute two VDAF rounds per DAP aggregation step.
Browse files Browse the repository at this point in the history
This is based on the "ping-pong" communication pattern described in the
VDAF specification, and reduces the number of network round-trips
required to complete an aggregation by about half for all VDAFs, from
`ROUNDS + 1` to `ceil((ROUNDS + 1) / 2)`. In particular, for 1-round
VDAFs like those in the Prio family, this reduces aggregation to a
single network round-trip.

Implementing this change requires specifying to exactly two aggregators,
i.e. exactly one Helper. The text of the aggregation section is updated
to explicitly specify one Helper.
  • Loading branch information
branlwyd authored and cjpatton committed Jun 15, 2023
1 parent f006e45 commit c5868ea
Showing 1 changed file with 658 additions and 565 deletions.
Loading

0 comments on commit c5868ea

Please sign in to comment.