Minimal proxy (clone) pattern in Blockchain / Solidity - Time & Space Complexity
Start learning this pattern below
Jump into concepts and practice - no test required
When using the minimal proxy pattern in blockchain, we want to know how the cost of creating clones grows as we make more copies.
We ask: How does the time to deploy or interact with clones change as we increase the number of clones?
Analyze the time complexity of the following minimal proxy deployment code.
function clone(address implementation) external returns (address instance) {
bytes20 targetBytes = bytes20(implementation);
assembly {
let clone := mload(0x40)
mstore(clone, 0x3d602d80600a3d3981f3)
mstore(add(clone, 0x14), targetBytes)
mstore(add(clone, 0x28), 0x5af43d82803e903d91602b57fd5bf3)
instance := create(0, clone, 0x37)
}
}
This code creates a minimal proxy clone that points to an existing contract, using a fixed-size bytecode template.
Identify the loops, recursion, array traversals that repeat.
- Primary operation: Deploying a clone involves a fixed sequence of memory stores and a single create call.
- How many times: Each clone deployment repeats this fixed sequence once per clone.
Each clone deployment takes about the same time, regardless of how many clones exist before.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | 10 fixed deployments |
| 100 | 100 fixed deployments |
| 1000 | 1000 fixed deployments |
Pattern observation: The total work grows linearly with the number of clones created.
Time Complexity: O(n)
This means the time to deploy clones grows directly in proportion to how many clones you create.
[X] Wrong: "Deploying a clone gets faster as more clones exist because the code is reused."
[OK] Correct: Each clone deployment runs the same fixed steps independently; previous clones do not speed up new deployments.
Understanding how clone deployment scales helps you explain efficient contract creation in blockchain projects.
"What if the clone initialization included a loop over a list of addresses? How would the time complexity change?"
Practice
Minimal proxy (clone) pattern in blockchain development?Solution
Step 1: Understand the pattern's goal
The minimal proxy pattern is designed to save gas and storage by creating lightweight copies of a contract.Step 2: Identify the correct purpose
It achieves this by forwarding calls to the original contract instead of duplicating all code.Final Answer:
To create cheap copies of contracts by forwarding calls -> Option CQuick Check:
Minimal proxy pattern = cheap contract copies [OK]
- Thinking it increases contract size
- Confusing it with data storage methods
- Assuming it replaces original contracts
create opcode?Solution
Step 1: Identify the correct opcode for minimal proxy creation
Thecreateopcode is used to deploy a new contract with given bytecode.Step 2: Match the syntax
The syntaxcreate(0, bytecode, bytecode.length)correctly usescreatewith zero value and bytecode parameters.Final Answer:
address clone = create(0, bytecode, bytecode.length); -> Option AQuick Check:
Minimal proxy uses create opcode like address clone = create(0, bytecode, bytecode.length); [OK]
- Using new keyword which deploys full contract
- Confusing create2 with create
- Using delegatecall which does not deploy
clone.owner() if the original contract's owner is set to address 0x1234...?
address clone = Clones.clone(original); // original.owner() returns 0x1234... // clone forwards calls to original
Solution
Step 1: Understand call forwarding in minimal proxy
The clone forwards calls to the original contract, but storage is separate, so state variables like owner are not shared.Step 2: Determine owner value returned
Sinceowner()reads from the clone's storage which is uninitialized, it returns0x0000...(zero address).Final Answer:
0x0000... (zero address) -> Option BQuick Check:
Clone forwards calls but has separate storage, owner = zero address [OK]
- Assuming clone shares storage with original
- Expecting original owner to be returned
- Thinking clone address is returned
function clone(address implementation) external returns (address instance) {
bytes20 targetBytes = bytes20(implementation);
assembly {
let clone_code := mload(0x40)
mstore(clone_code, 0x3d602d80600a3d3981f3)
mstore(add(clone_code, 0x14), targetBytes)
instance := create(0, clone_code, 0x37)
}
require(instance != address(0), "Create failed");
}Solution
Step 1: Check the length parameter for create
The minimal proxy bytecode length is typically 0x2d (45 bytes), but 0x37 (55 bytes) is passed incorrectly.Step 2: Understand impact of wrong length
Passing wrong length causes deployment of invalid bytecode, leading to failure or unexpected behavior.Final Answer:
Incorrect length passed to create (0x37 instead of 0x2d) -> Option DQuick Check:
Create length must match bytecode size [OK]
- Ignoring bytecode length mismatch
- Confusing bytes20 and bytes32 usage
- Assuming delegatecall needed in deployment
Solution
Step 1: Understand minimal proxy benefits
Minimal proxies save gas by sharing code but have separate storage for each clone.Step 2: Assign unique owners per clone
Storing owner in each clone's storage allows unique ownership while sharing logic.Step 3: Evaluate options
Use minimal proxies forwarding to one implementation and store owner in each clone's storage uses minimal proxies with per-clone storage, reducing gas and allowing unique owners.Final Answer:
Use minimal proxies forwarding to one implementation and store owner in each clone's storage -> Option AQuick Check:
Minimal proxy + per-clone storage = cheap unique owners [OK]
- Storing owner only in implementation (shared state)
- Deploying full contracts wastes gas
- Sharing one owner for all clones
