There are three TODOs in read_write_memory.rs of the form "TODO: Compute opening without instantiating * polynomial itself"
Currently, these openings require the verifier to do work linear in the memory used. These openings should be linear in |bytecode| + |program IO|. Assuming the verifier knows the bytecode and program inputs/outputs, it can evaluate the necessary openings without reconstructing the full memory MLE.
There are three
TODOs inread_write_memory.rsof the form "TODO: Compute opening without instantiating * polynomial itself"Currently, these openings require the verifier to do work linear in the memory used. These openings should be linear in
|bytecode| + |program IO|. Assuming the verifier knows the bytecode and program inputs/outputs, it can evaluate the necessary openings without reconstructing the full memory MLE.