On 01/02/2023 18:28, Eduard Zingerman wrote: > How about the following? > > ---- 8< --------------------------- > > For each processed instruction, the verifier tracks read and written > registers and stack slots. The main idea of the algorithm is that read > marks propagate back along the state parentage chain until they hit a > write mark, which 'screens off' earlier states from the read. The > information about reads is propagated by function ``mark_reg_read()`` > which could be summarized as follows:: > > ---- >8 --------------------------- SGTM.
