Open fare opened 5 years ago
NB: If your code manages 4GB of data, just walking the data structure 4 bytes at a time will take 1 billion operations, which if operation takes 30 minutes to get confirmed will last for 57 millenia. Therefore, to usefully deal with large data structures in finite time, we need a technique to accelerate time just like we can use merklization of balanced trees to compress space. That's #129.
Use Merkle commitments to large data structure so that a contract can verify a computation with a large state. Verification of a step happens in two steps:
Sending a step for verification requires:
Of course, large states are useless without a way to deal with large times, but that's next issue #129.