O(logn) insert time O(log²n) search time O(logn) inclusion proof size O(log²n) exclusion proof size O(n) size on disk Superficially it might sound like "Merkle Search Tree, but worse". Although MST ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback