Updated Zipzip Now

Recent research published in early 2026 has expanded the utility of these structures:

) per node, making them highly suitable for memory-constrained environments. Updated Zipzip

New "just-in-time" models have been developed that use an expected constant number of bits ( Recent research published in early 2026 has expanded

Like their predecessors, they are history-independent , meaning the tree's final structure depends only on the keys it contains, not the order in which they were inserted or deleted. Current Developments (2025–2026) they are history-independent

solve this by introducing a double-ranking system: Balancing the Bias: By using two independent ranks (