- a new node with two leaves: r on the left and a new leaf containing key and value on the right
- whether we found the correct leaf and the key contains it
- whether to go left or right when searching for key and standing at r
Deletions go down the tree twice -- once to find the leaf and realize that it needs to be deleted, and the second time to actually perform the deletion.
Deletions go down the tree twice -- once to find the leaf and realize that it needs to be deleted, and the second time to actually perform the deletion. This method will re-create comparison results. Each time it's called, it will give the next comparison result of key and node.key, where node starts at the root and progresses down the tree according to the comparison results.
- result of previous comparison of key and relevant node's key
The digest consists of the label of the root node followed by its height, expressed as a single (unsigned) byte
The digest consists of the label of the root node followed by its height, expressed as a single (unsigned) byte
Code common to the prover and verifier of https://eprint.iacr.org/2016/994 (see Appendix B, "Our Algorithms")