This change limits the amount of wants and haves data that is sent
to the serving side of a fetch.
When a RefsAt announcement is sent, the fetching peer can calculate
the difference between the rad/sigrefs they’re aware of – if it
exists – and the newly advertised rad/sigrefs. This means they can
efficiently ask for the wants and haves of references that have
changed – saving some data sent over to the serving side.
This change limits the amount of wants and haves data that is sent
to the serving side of a fetch.
When a RefsAt announcement is sent, the fetching peer can calculate
the difference between the rad/sigrefs they’re aware of – if it
exists – and the newly advertised rad/sigrefs. This means they can
efficiently ask for the wants and haves of references that have
changed – saving some data sent over to the serving side.
Changes:
- Rename
RefsUpdatetoSignedRefsUpdate - Rebase on latest and fix merge conflicts
Rebase.