The list of accessed addresses and storage keys are now stored as a sorted linked list. In this way insertion and deletion can be done non-deterministically in O(1) cycles, instead of the previous O(|list|) cycles.
For erc20 it goes from
arithmetic_len: 14372, byte_packing_len: 17334, cpu_len: 65800, keccak_len: 12696, keccak_sponge_len: 529, logic_len: 4496, memory_len: 364123
to
arithmetic_len: 14365, byte_packing_len: 17063, cpu_len: 64971, keccak_len: 12768, keccak_sponge_len: 532, logic_len: 4530, memory_len: 362246
The list of accessed addresses and storage keys are now stored as a sorted linked list. In this way insertion and deletion can be done non-deterministically in O(1) cycles, instead of the previous O(|list|) cycles. For erc20 it goes from
arithmetic_len: 14372, byte_packing_len: 17334, cpu_len: 65800, keccak_len: 12696, keccak_sponge_len: 529, logic_len: 4496, memory_len: 364123
toarithmetic_len: 14365, byte_packing_len: 17063, cpu_len: 64971, keccak_len: 12768, keccak_sponge_len: 532, logic_len: 4530, memory_len: 362246