In many blockchains, each block changes only a small portion of the overall state. Yet validators still need to produce a state root that commits to the entire authenticated tree, forcing them to update data structures that span all state even when most of it is untouched.

The arXiv preprint "A BUD You Can Count On: Efficient, Verifiable Membership Proofs" addresses this mismatch. The authors show how to support verifiable reads using only the writes included in a block, rather than requiring a full update of the authenticated tree. This means a validator could answer read queries about the new state without having to recompute or maintain the whole tree.

The approach is presented as a way to make membership proofs more efficient and verifiable in the presence of small, incremental changes. The abstract does not provide implementation details or benchmark results, so the practical gains are not yet quantified in the source.