[messaging] RFC: Bao, a tree hash and encoding format for incremental verification

Jack O'Connor oconnor663 at gmail.com
Wed Nov 14 19:31:34 PST 2018

Bao uses a similar algorithm for hashing input incrementally. There's a
stack of partially completed subtrees, which get merged together as more
input arrives. There's also a cute trick, where you can use the number of
binary 1's in the count of leaves so far, to tell you when to merge
subtrees. Here's the Python version:
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://moderncrypto.org/mail-archive/messaging/attachments/20181114/52e1e999/attachment.html>

More information about the Messaging mailing list