You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In EIP170, the max size of contract has been set to 24768 bytes. Recently I am doing work about Zksnarks, and using zokrates to generate the verifier contract, though a very simple hash verifier contract does not exceed the limit, I am having trouble understanding the thoughts in this discussion:
(deleted)
From my understanding, every OpCode in the EVM has its gas cost, and user has to pay more if the call consumes more. Why we need to constrain the limit of the contract?
when a contract is called, even though the call takes a constant amount of gas, the call can trigger O(n) cost in terms of reading the code from disk, preprocessing the code for VM execution, and also adding O(n) data to the Merkle proof for the block's proof-of-validity
Why constant amount of gas? Why O(n) cost reading the code from disk? And what causes adding O(n) data to the merkle proof? Is it logging or storing something? but logging and storing are expensive.
The text was updated successfully, but these errors were encountered:
Though this(deleted)
makes it clearer, I still don't understand what the "adding O(n) data to the merkle proof" is from?
n here means the code size, right? Why the added data in merkle proof has something to do with the code size?
In EIP170, the max size of contract has been set to 24768 bytes. Recently I am doing work about Zksnarks, and using zokrates to generate the verifier contract, though a very simple hash verifier contract does not exceed the limit, I am having trouble understanding the thoughts in this discussion:
(deleted)
From my understanding, every OpCode in the EVM has its gas cost, and user has to pay more if the call consumes more. Why we need to constrain the limit of the contract?
Why constant amount of gas? Why O(n) cost reading the code from disk? And what causes adding O(n) data to the merkle proof? Is it logging or storing something? but logging and storing are expensive.
The text was updated successfully, but these errors were encountered: