Ethereum Virtual Machine (EVM) in Blockchain / Solidity - Time & Space Complexity
When running code on the Ethereum Virtual Machine (EVM), it is important to understand how the time it takes grows as the input gets bigger.
We want to know how the number of steps changes when the data or instructions increase.
Analyze the time complexity of the following EVM bytecode loop.
// Pseudocode for EVM loop
for (uint i = 0; i < n; i++) {
sum += data[i];
}
This code sums up values from an array of size n by looping through each element once.
Look for repeated actions that take time.
- Primary operation: Looping through each element of the array.
- How many times: Exactly n times, once per element.
As the array size grows, the number of steps grows too.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | 10 steps |
| 100 | 100 steps |
| 1000 | 1000 steps |
Pattern observation: The steps increase directly with the input size. Double the input, double the steps.
Time Complexity: O(n)
This means the time to run the code grows in a straight line with the size of the input.
[X] Wrong: "The loop runs in constant time because it just adds numbers."
[OK] Correct: Even though adding is simple, the loop runs once for each item, so more items mean more steps.
Understanding how loops affect execution time in the EVM helps you write efficient smart contracts and explain your code clearly in conversations.
"What if we replaced the loop with a recursive function that sums the array? How would the time complexity change?"
Practice
Ethereum Virtual Machine (EVM) in the Ethereum network?Solution
Step 1: Understand EVM's purpose
The EVM is a virtual computer that runs smart contracts on Ethereum.Step 2: Identify correct role
It executes compiled bytecode from smart contracts, enabling decentralized apps to run safely and consistently.Final Answer:
It executes smart contract bytecode to run decentralized applications. -> Option AQuick Check:
EVM runs smart contracts = B [OK]
- Confusing EVM with blockchain storage
- Thinking EVM mines blocks
- Mixing EVM with wallet software
Solution
Step 1: Recall EVM instruction format
EVM uses stack operations like PUSH1 to push values, then ADD to add top stack items.Step 2: Identify correct instruction sequence
"PUSH1 5 PUSH1 3 ADD" pushes 5 and 3, then adds them on the stack.Final Answer:
PUSH1 5 PUSH1 3 ADD -> Option BQuick Check:
Push values then add = C [OK]
- Using invalid instructions like ADD 5 3 directly
- Confusing LOAD with PUSH
- Using non-EVM commands like SUM
PUSH1 0x02
PUSH1 0x03
ADD
What is the result on the stack after execution?
Solution
Step 1: Understand PUSH1 and ADD operations
PUSH1 0x02 pushes 2, PUSH1 0x03 pushes 3, ADD adds top two stack values.Step 2: Calculate addition result
2 + 3 = 5, so 0x05 remains on the stack.Final Answer:
0x05 -> Option AQuick Check:
2 + 3 = 5 = 0x05 [OK]
- Adding hex as strings instead of numbers
- Confusing 0x02 + 0x03 as 0x06
- Misreading PUSH1 as PUSH2
PUSH1 0x01
ADD
Solution
Step 1: Check stack before ADD
PUSH1 0x01 pushes one value, but ADD needs two values on stack.Step 2: Identify missing operand
Since only one value is pushed, ADD causes stack underflow error.Final Answer:
Missing second operand on stack for ADD instruction. -> Option DQuick Check:
ADD needs two stack values [OK]
- Assuming ADD works with one operand
- Thinking PUSH1 is invalid
- Believing code is correct as is
Solution
Step 1: Understand operation order
(4 + 5) * 3 means add 4 and 5 first, then multiply by 3.Step 2: Match EVM instructions to operations
PUSH1 0x04 PUSH1 0x05 ADD pushes 4 and 5, adds them; then PUSH1 0x03 MUL multiplies result by 3.Step 3: Check other options
Options B, C, and D change operation order or operands, producing incorrect results (B: 23, C: 35, D: 17).Final Answer:
PUSH1 0x04 PUSH1 0x05 ADD PUSH1 0x03 MUL -> Option CQuick Check:
Add then multiply = A [OK]
- Changing operation order incorrectly
- Confusing MUL and ADD positions
- Ignoring operator precedence
Ready to prove it?
Pass the test and this pattern moves unknown
