Storage-optimized replay protection: from hash => bool to packed flag lanes, and can the protocol offer better?
In briefStorage-optimized replay protection: packed flag lanes versus per-flag booleans, and whether the protocol could offer cheaper storage.
SummaryThe post covers protocols that must permanently record one small flag per event, such as privacy-pool nullifiers and unordered nonces. It compares three layouts: one boolean per flag, a 256-flag bitmap word, and per-party lanes within a word, with gas estimates for each. The author argues that packing can only approach fixed cost floors, and asks whether the execution layer could offer replay flags directly at a price suited to that use.