Diamond pattern (EIP-2535) in Blockchain / Solidity - Time & Space Complexity

Time Complexity: Diamond pattern (EIP-2535)

O(n)

Understanding Time Complexity

When working with the Diamond pattern in blockchain, it's important to understand how the number of operations grows as more facets and functions are added.

We want to know how the execution time changes when the contract manages many facets.

Scenario Under Consideration

Analyze the time complexity of the following facet lookup code.

function facetAddress(bytes4 _functionSelector) external view returns (address) {
    return selectorToFacet[_functionSelector];
}

function addFacet(address _facetAddress, bytes4[] memory _selectors) external {
    for (uint i = 0; i < _selectors.length; i++) {
        selectorToFacet[_selectors[i]] = _facetAddress;
    }
}
    

This code maps function selectors to facet addresses and updates them when adding a new facet.

Identify Repeating Operations

Look for loops or repeated steps.

• Primary operation: Looping over the list of function selectors when adding a facet.
• How many times: Once for each function selector in the new facet.

How Execution Grows With Input

As the number of function selectors in a facet grows, the time to add that facet grows too.

Input Size (n)	Approx. Operations
10	10 assignments
100	100 assignments
1000	1000 assignments

Pattern observation: The time grows directly with the number of selectors added.

Final Time Complexity

Time Complexity: O(n)

This means the time to add a facet grows linearly with the number of function selectors it has.

Common Mistake

[X] Wrong: "Adding a facet always takes the same time regardless of its size."

[OK] Correct: Because the code loops over each function selector, more selectors mean more steps and more time.

Interview Connect

Understanding how adding facets scales helps you explain contract upgrade patterns clearly and shows you can reason about smart contract efficiency.

Self-Check

"What if the mapping used a more complex data structure for selectors? How would that affect the time complexity?"