Merkle Distributor Development for Mass Token Payouts - Save 95% on Gas

We design and develop full-cycle blockchain solutions: from smart contract architecture to launching DeFi protocols, NFT marketplaces and crypto exchanges. Security audits, tokenomics, integration with existing infrastructure.
Showing 1 of 1All 1305 services
Merkle Distributor Development for Mass Token Payouts - Save 95% on Gas
Medium
~2-3 days
Frequently Asked Questions

Blockchain Development Services

Blockchain Development Stages

Latest works

  • image_website-b2b-advance_0.webp
    B2B ADVANCE company website development
    1356
  • image_web-applications_feedme_466_0.webp
    Development of a web application for FEEDME
    1248
  • image_websites_belfingroup_462_0.webp
    Website development for BELFINGROUP
    953
  • image_ecommerce_furnoro_435_0.webp
    Development of an online store for the company FURNORO
    1187
  • image_logo-advance_0.webp
    B2B Advance company logo design
    644
  • image_crm_enviok_479_0.webp
    Development of a web application for Enviok
    925

We develop Merkle Distributors for mass token payouts – gas-efficient airdrop contracts that use Merkle trees. A direct mapping of 50,000 addresses costs ~2.5 ETH in deployment gas, while our Merkle-based solution costs only ~0.08 ETH – a 32x reduction. At ETH $2000, that’s $5000 vs $160, saving $4840. Each claim costs 80k gas fixed, compared to 300k+ for batch mapping. This is why Merkle Distributor is the industry standard for large-scale airdrops.

How Does the Merkle Distributor Work?

The contract stores only a single bytes32 merkleRoot — the root of the tree. The entire payout table (address → amount) remains off-chain. Recipients claim their tokens by providing a merkleProof — a set of hashes proving their inclusion in the tree.

On-chain verification:

function claim(
    uint256 index,
    address account,
    uint256 amount,
    bytes32[] calldata merkleProof
) external {
    require(!isClaimed(index), "Already claimed");

    bytes32 node = keccak256(abi.encodePacked(index, account, amount));
    require(MerkleProof.verify(merkleProof, merkleRoot, node), "Invalid proof");

    _setClaimed(index);
    require(IERC20(token).transfer(account, amount), "Transfer failed");

    emit Claimed(index, account, amount);
}

isClaimed(index) checks one bit in a mapping(uint256 => uint256) — a packed bitmask. 50,000 recipients = ~1,563 uint256 slots instead of 50,000. Storage savings — by orders of magnitude. We employ assembly optimizations for bitmask operations to further reduce gas.

Why the Tree-Based Method Is the Standard for Airdrops

Compare deployment costs for 50,000 recipients:

Approach Storage Slots Approximate Gas Cost USD at $2000 ETH
Direct mapping 50,000 ~2.5 ETH $5,000
Merkle Distributor ~1,563 ~0.08 ETH $160

Savings over 95%. Additionally, the off-chain table is easily updated without redeploying the contract. Per-claim costs are also lower:

Method Gas per Claim Notes
Mapping + batch ~300k+ Depends on number of recipients
Merkle Distributor ~80k Fixed cost

With 50,000 claims, savings amount to tens of ETH. The tree-based distributor outperforms direct storage by 32x in deployment gas.

How to Build a Merkle Tree: Step-by-Step Guide

Detailed tree construction instructions
  1. Prepare data: list of recipients with indices, addresses, and amounts.
  2. Form leaves: leaf = keccak256(abi.encodePacked(index, address, amount)) — double hashing protects against second preimage attacks.
  3. Build the tree: use the @openzeppelin/merkle-tree library (JS/TS) or rs_merkle (Rust). Each internal node = keccak256(abi.encodePacked(left, right)) with canonical ordering (smaller hash on the left).
  4. Obtain the root: tree.root — the single value stored in the contract.
  5. Generate proofs: for each recipient using tree.getProof(...). Distribute proofs via API or publish them on IPFS along with the full table.

Typical script:

import { StandardMerkleTree } from "@openzeppelin/merkle-tree";

const values = recipients.map(([address, amount], index) => [
    index, address, amount
]);
const tree = StandardMerkleTree.of(values, ["uint256", "address", "uint256"]);
console.log("Root:", tree.root);

// proof for a specific recipient
const proof = tree.getProof([index, address, amount]);

Common Mistakes in Merkle Distributor Implementation

The first and most common mistake is an incorrect bitmask for double-spend protection. If _setClaimed sets the bit incorrectly, a repeat claim is possible. Use the proven pattern from the OpenZeppelin MerkleDistributor. The second issue — leaf collision: if leaves are formed without index (keccak256(abi.encodePacked(address, amount))), two recipients with the same amount could prove a claim on each other — though this gives them a different address, in practice the collision is unsafe. Adding index guarantees uniqueness. The third mistake — encoding mismatch: abi.encodePacked off-chain and abi.encodePacked in Solidity must match. Uniswap and Optimism use abi.encodePacked for leaves.

Advanced Patterns

Multi-round distributor. A new merkleRoot each week/epoch. Instead of deploying a new contract, an updatable root via updateMerkleRoot(bytes32) with onlyOwner or governance. The claimed bitmask is reset for the new epoch or indexed by epoch: mapping(uint256 epoch => mapping(uint256 wordIndex => uint256 bitmask)).

Delegated claiming. The recipient signs a permission to claim on their behalf — useful for gasless UX via a relayer or ERC-2771 meta-transactions. Pattern: claimFor(address account, uint256 amount, bytes32[] calldata proof, bytes calldata signature).

Testing with Foundry

function test_ClaimValidProof() public {
    // build tree in test
    bytes32[] memory leaves = new bytes32[](3);
    leaves[0] = keccak256(abi.encodePacked(uint256(0), alice, uint256(100e18)));
    // merkle proof computed manually or via FFI to JS script
    distributor.claim(0, alice, 100e18, proof);
    assertEq(token.balanceOf(alice), 100e18);
    vm.expectRevert("Already claimed");
    distributor.claim(0, alice, 100e18, proof); // double claim
}

To generate proofs in Foundry tests: vm.ffi calling a TypeScript script with @openzeppelin/merkle-tree. Or write a pure Solidity implementation in setUp() — slower but without external dependencies.

What Our Development Includes

With over 5 years in blockchain development and 20+ distributor contracts deployed, we deliver robust solutions. Our package includes:

  • Smart contract source code in Solidity (tested with Foundry, including fuzz tests).
  • Off-chain scripts: tree construction, proof generation, deployment and verification (TypeScript, ethers.js).
  • Documentation: architecture description, deployment instructions, API description.
  • Adaptation to your token: ERC-20, ERC-721, ERC-1155, or cross-chain via bridge.
  • One month of post-launch support: bug fixes, integration consultations.

Timeline and Cost

Basic Merkle Distributor with single root: 2-3 days including off-chain scripts. Multi-round with governance and gasless claiming: 4-5 days. Contract deployment and verification on mainnet — additional few hours. Cost is calculated individually after clarifying details. Contact us for an estimate of your project — we'll analyze recipient count, epoch requirements, and UX. Order Merkle Distributor development and we'll help you save thousands of dollars on gas. Get a consultation right now.

Smart Contract Development

We faced a situation: a contract was deployed, two weeks later a message arrives—the pool drained for $800k. Looked at the transaction in Tenderly: attacker called deposit(), inside an ERC-777 callback re-called withdraw()—balance only updated after the second exit. Classic reentrancy, but not via ETH transfer—through an ERC-777 hook. ReentrancyGuard was only on withdraw().

Such cases are not rare. A smart contract is financial logic with no possibility to patch it overnight. Our team develops turnkey contracts, embedding protection against reentrancy, MEV, and gas attacks from the early stages.

How We Develop Smart Contracts Turnkey

We start with business logic audit and stack selection. Solidity 0.8.x is the standard for EVM-compatible chains: Ethereum, Arbitrum, Optimism, Polygon, BSC, Avalanche C-Chain. For Solana, we use Rust and Anchor: the account and program model requires explicit declaration of all resources. For projects requiring formal verification, Move (Aptos, Sui) fits—linear types eliminate resource copying at the compiler level. Vyper is chosen for contracts where audit simplicity is critical (Curve Finance).

Language Execution Model Typical Domain Risks
Solidity 0.8.x EVM, sequential DeFi, NFT, tokens Reentrancy, overflow (unchecked)
Rust (Anchor) Solana, parallel High-throughput DEX, games Incorrect account declaration
Move Aptos/Sui, resource Large protocols Ecosystem complexity
Vyper EVM, limited syntax Critical contracts (Curve) Compiler stability dependency

Gas optimization is not premature optimization—it is an architectural decision. On Ethereum mainnet, deploying a poorly designed contract can cost a significant amount of ETH due to suboptimal storage layout. Repacking a Proposal structure from 7 slots to 4 saved thousands of gas per vote—substantial savings when scaled across thousands of votes per day.

Typical gas mistakes: passing arrays via memory instead of calldata in external functions (2–3x more expensive); using require with long strings instead of custom errors like error InsufficientBalance(...). Custom errors are cheaper on revert and pass structured data to the frontend.

Why Smart Contract Audit Is Critical for Security

Audit is not a one-time check—it is a built-in development stage. We use three levels:

  1. Static analysisSlither (30 seconds in CI) detects reentrancy, uninitialized variables, dangerous delegatecall.
  2. Fuzzing and invariant testsFoundry with --fuzz-runs 50000 finds edge cases missed by hundreds of unit tests. Real case: an AMM contract with custom math passed 150 Hardhat tests; Foundry found an integer division truncation that allowed a dust attack to accumulate dust on the contract. Echidna checks invariants ("sum of all balances ≤ totalSupply").
  3. Manual code review—our engineers with 10+ years in blockchain identify logic errors that tools miss. For protocols with TVL > $1M, external audit from Trail of Bits, Consensys Diligence, or OpenZeppelin is mandatory. Timeline: 2–4 weeks.

Any upgradeable protocol must have a timelock. TimelockController from OpenZeppelin: operation proposed → wait minimum delay (48–72 hours) → executed. Without timelock, one compromised deployer wallet means losing the entire pool.

What Upgrade Patterns Do We Choose?

Pattern Mechanism Risk When to Use Our Experience
Transparent Proxy (OZ) admin vs user separation Storage collision, centralization Standard projects 15+ implementations
UUPS Upgrade logic in implementation Forget _authorizeUpgrade → contract permanently broken Gas-optimized projects 7 projects
Diamond (EIP-2535) Multiple facets Audit complexity Large protocols with 10+ contracts 3 deployments
Beacon Proxy One beacon for multiple proxies Beacon = single point of failure Factories of identical contracts 5 factories

Storage collision is the main danger of proxies. Implementation v2 must not add variables before existing ones. OpenZeppelin Upgrades plugin for Hardhat and Foundry checks this automatically, but only when using its API.

How to Protect a Contract from MEV and Front-Running

On Ethereum mainnet, transactions in the mempool are visible to all. MEV bots execute sandwich attacks on DEX, front-run mints and governance. Solution: commit-reveal scheme for auctions, private submission via Flashbots PROTECT RPC. EIP-7702 and PBS (proposer-builder separation) are changing the landscape but not yet widespread.

What Is the Development Process?

  1. Analysis—functional specification, call diagram, edge case analysis. Without this, coding starts in vain.
  2. Development—Solidity/Rust with tests in parallel. Test → code → refactoring. Use Foundry for fuzz and invariant tests.
  3. Internal audit—Slither + Echidna + manual code review. Foundry invariant tests for protocol invariants.
  4. External audit—for projects with real money. Timeline: 2–4 weeks.
  5. Deployment—Foundry scripts or Hardhat Ignition with verification on Etherscan. Gnosis Safe for ownership transfer immediately after deployment.
  6. Monitoring—Tenderly alerts, OpenZeppelin Defender, Forta Network.

What Is Included

  • Architecture documentation and contract specification (NatSpec).
  • Source code with repository and CI (Slither, Foundry, coverage).
  • Deployed contract with verification on blockchain explorer.
  • Audit results (internal and external upon request).
  • Access to monitoring and management (Gnosis Safe).
  • Code warranty: critical bug fixes within one month after deployment.
  • Consultation on web integration (wagmi, RainbowKit).

Estimated Timelines

  • ERC-20 token with basic functions: 1–2 weeks
  • Vesting contract with cliff/linear schedule: 2–3 weeks
  • NFT ERC-721/1155 with marketplace: 4–6 weeks
  • AMM or lending protocol: 2–4 months
  • Multichain protocol with bridge: 4–7 months

Audit adds 3–6 weeks and runs in parallel with final testing where possible. Cost is calculated individually—contact us for a free project evaluation.

Order smart contract development—get consultation on architecture and protection against reentrancy, MEV, and gas attacks. Want to discuss details? Write to us—we will select the optimal stack for your task.