the negentropy set-reconciliation protocol

Article describing the protocol.

At a surface level this is similar to Prolly Trees, but seems less secure due to the way it constructs incremental hashes by xor'ing digests. It also seems inelegant that the protocol rounds are based on a binary subdivision of records, when the records are already grouped into a wider b-tree-like structure that's used to derive the hashes.