Why are one-time-use proofs being cached? Why is the cache key exactly not what is being proven ??
Login to reply
Replies (2)
Computationally cheaper
They were saving computational horsepower. But their cashed values had a sort of architectural ambiguity and could be faked out. Once the attacker learned how to take advantage of the cache he was able to bypass the range proof and enter a negative value for LBTC.