Whitelist/Allowlist Development for NFT Minting
Typical scenario: a 10,000 NFT collection, whitelist mint for 3,000 addresses 12 hours before public. Storing the whitelist on-chain as mapping(address => bool) costs about 15-20M gas just for SSTORE during contract deployment. At 20 gwei gas price, that's around $4,000. Our team with 7+ years of experience in blockchain development and 50+ completed NFT mint projects offers efficient solutions. We develop turnkey whitelist/allowlist systems using Merkle tree, reducing costs to 50k gas — saving up to $4,000. Evaluate your project in 1 day — get a consultation.
How Merkle proof works and where mistakes happen
A Merkle tree is built off-chain: each address is hashed via keccak256(abi.encodePacked(address)), and the tree is built by pairwise hashing of leaves. The result is a 32-byte merkleRoot. This root is deployed in the contract. During mint, the user provides a proof[] — an array of sibling hashes along the path from their leaf to the root. The contract verifies it via MerkleProof.verify() from OpenZeppelin.
Common mistake — double mint. If the contract lacks a mapping(address => bool) public hasMinted (or mapping(address => uint256) public mintedCount), a whitelisted user can mint unlimited times. The proof remains valid. The contract has no record that the address already minted.
Another serious issue is leaf encoding. OpenZeppelin's MerkleProof expects the leaf to be keccak256(keccak256(data)) (double hash) to protect against preimage attacks in case tree nodes coincide with leaves. If you generate the tree via merkletreejs with single hashing, but the contract uses _leaf = keccak256(abi.encodePacked(account)) without double hashing, a collision attack may be possible under certain configurations. We use keccak256(bytes.concat(keccak256(abi.encode(addr)))) or the standard pairing of @openzeppelin/merkle-tree JS library + MerkleProof.sol.
Which method to choose for your project?
There are three main approaches to implementing a whitelist. Compare their characteristics:
| Criteria |
Merkle proof |
ECDSA signature |
On-chain mapping |
| Deployment cost (gas) |
50k (fixed) |
50k + base cost |
20k * N addresses |
| Update flexibility |
Requires root change |
Dynamic (any changes) |
Owner-only functions |
| Centralization |
None |
Depends on signer key |
None |
| Security |
High (proven) |
Medium (key risk) |
High |
| Ideal list size |
100 — 1M+ |
Any, with unknown changes |
< 100 addresses |
Merkle proof is the market standard, 40x cheaper than on-chain mapping for 10,000 addresses. ECDSA is used in gaming mints and dynamic campaigns. On-chain mapping is suitable only for very small fixed lists.
Comparison of schemes for multi-tier and phases
For projects with different access levels (OG, core, community) or time phases (pre-sale, allowlist, public), additional logic is needed. Typical configurations:
| Scheme |
Number of roots |
Management |
Gas per mint |
| Single root + multi-tier via encoding |
1 |
Simple but fixed quotas |
~60k-70k |
| Separate roots per phase |
3-5 |
Owner setPhase(), different prices |
~50k + root change |
| Hybrid: root + ECDSA for dynamics |
1 signature |
Backend signs permissions |
~70k + signer risk |
The choice depends on requirements: if quotas can change before mint, ECDSA is better; if fixed, Merkle proof with multi-tier encoding is preferable.
How to generate Merkle tree in practice?
- Collect all addresses and quotas into an array.
- Use the
@openzeppelin/merkle-tree library:
const { StandardMerkleTree } = require('@openzeppelin/merkle-tree');
const values = [
['0x...', 1],
['0x...', 3],
];
const tree = StandardMerkleTree.of(values, ['address', 'uint256']);
const root = tree.root;
- Store the root in the contract.
- For each user, generate a proof via
tree.getProof([address, maxMint]) and pass it during mint.
Why Merkle proof is the market standard?
Regardless of list size, deployment costs are the same. The proof is submitted by the user (frontend generates it automatically); the contract only verifies it. We ensure no reentrancy and correct proof verification. Our contracts are audited using Slither and Mythril.
Additional mechanics
Multi-tier whitelist — different quotas for different levels. The Merkle tree contains leaves keccak256(abi.encode(address, maxMintAmount)). The user provides the proof plus their maxMintAmount; the contract verifies both parameters together.
Temporal phases — WL → Allowlist → Public. The contract holds enum SalePhase { PAUSED, WHITELIST, ALLOWLIST, PUBLIC }. Different roots for different phases, different prices. The owner changes the phase via setPhase().
Batch mint with WL — a user can mint N NFTs in one transaction if their quota allows. mintedCount[msg.sender] += amount instead of a bool flag.
What's included in development
- Smart contract with Merkle verify, hasMinted mapping, and phase management
- Comprehensive test suite in Foundry (edge cases: double mint, invalid proof, exhausted quota)
- Frontend integration (proof generation via
@openzeppelin/merkle-tree, wagmi useMint() hook)
- Deployment via Foundry script with automatic Etherscan verification
- Documentation and post-launch support
Time estimates
Whitelist contract with Merkle proof — 2-3 days including tests and frontend integration. Cost is calculated individually. Contact us to discuss your project — we will help you choose the optimal scheme and implement it with security guarantees.
Why does NFT marketplace development require a comprehensive approach?
We see that at first glance, an NFT contract looks simple: ERC-721, mint(), IPFS for metadata — that's it. In practice, it's this 'simplicity' that hides most problems — from bots buying out the entire mint in the first block to broken royalties on the secondary market. We often hear: Make a collection like others in a week — and a month later it turns out gas has tripled due to an unoptimized for loop, or OpenSea cannot see metadata after reveal. We know each of these pitfalls and build processes to avoid them.
Over 5 years of working with blockchains, we have implemented 40+ NFT projects, including marketplaces with dynamic attributes and cross-chain bridges. We have accumulated a library of proven templates — some of which we break down below.
Which standard to choose: ERC-721 or ERC-1155?
ERC-721 — each token is unique, one owner. Suitable for collections where each NFT has individual attributes and a direct owner → tokenId mapping.
ERC-1155 — multi-token standard: one contract holds both fungible and non-fungible tokens. It uses balanceOf(address, tokenId) instead of ownerOf(tokenId). A single transaction can transfer multiple different tokens via safeBatchTransferFrom. This saves gas on bulk operations — important for game items, tickets, edition collections. ERC-1155 is 2–3× more gas-efficient than ERC-721 for batch transfers.
| Criteria |
ERC-721 |
ERC-1155 |
| Token uniqueness |
Each token is unique |
One tokenId can have multiple copies |
| User balance |
Only ownerOf (one) |
balanceOf(address, tokenId) |
| Gas per transfer |
~25,000 gas |
~18,000 gas (batch even lower) |
| Batch operations |
No native support |
safeBatchTransferFrom |
| Ideal scenario |
Art collections, PFPs |
Games, tickets, editions |
Specific case: a game project with 50 types of items, each with a supply of 10,000. ERC-721 — 500,000 unique tokens, huge overhead on mappings. ERC-1155 — 50 tokenIds, balanceOf per player. Gas per transfer is 2–3 times lower, contract deployment is cheaper. For such tasks, we use OpenZeppelin ERC-1155 with custom modifications.
Metadata: on-chain vs IPFS vs centralized
The standard route is tokenURI() returning a link to a JSON with fields name, description, image, attributes. Three storage options:
- Centralized server — cheapest and most flexible. Risk: server goes down, company closes — NFT loses metadata. Not suitable for collections claiming long-term value.
- IPFS + Pinning — content-addressed storage, the link is bound to the content hash. Pinata or NFT.Storage provide pinning. Important: IPFS does not guarantee availability by itself — an active pinning service is needed. If it shuts down, data may disappear if no one keeps a copy.
- On-chain metadata — base64-encoded SVG or JSON directly in tokenURI. Maximum reliability, but expensive: for a collection of 10,000 tokens, gas costs may exceed $5,000. Suitable for generative art projects where visuals are generated from on-chain attributes (Nouns, Loot).
For most collections, we choose IPFS with Pinata for images + on-chain attributes for traits — a good balance. We validate files against a JSON Schema before upload; a typical mistake is unescaped quotes, causing marketplaces to display a blank screen.
Typical JSON metadata format
{
"name": "Token #1",
"description": "A unique NFT",
"image": "ipfs://QmHash/image.png",
"attributes": [{"trait_type": "Background", "value": "Red"}]
}
Dynamic NFT: metadata that changes
Dynamic NFT updates metadata in response to external events — match results, character levels, real-world data via Chainlink. Architecturally, it's a combination: the smart contract stores state → tokenURI() generates metadata from the state on-chain. Caching problem: OpenSea and other marketplaces aggressively cache. The standard invalidation mechanism is a MetadataUpdate(tokenId) event from ERC-4906. OpenSea listens to this event and clears the cache. Without it, updated metadata may not appear for weeks.
Chainlink Automation (formerly Keepers) for automatically updating state on the contract on a schedule or condition — a standard solution for dynamics.
How to protect mint from bots?
Allowlist via Merkle tree — standard. The list of addresses is hashed into a Merkle root, stored in the contract. During mint, the user provides a Merkle proof — the contract verifies without storing the full list. We use OpenZeppelin MerkleProof library.
Reveal mechanism — on mint, a placeholder is issued; real traits are revealed after the sale ends. Otherwise, bots can scan pending transactions and snipe rare traits via frontrunning. But reveal requires a commitment scheme — the random seed must be fixed before mint or use Chainlink VRF.
Chainlink VRF for fair randomization of traits. VRF request at mint → callback with verifiable random number → assign traits. This adds ~2 transactions and latency but guarantees fairness. Chainlink VRF v2.5.
Rate limiting — require(mintedPerWallet[msg.sender] < maxPerWallet). Does not protect against multi-wallets but raises attack cost. For premium projects, we often add proof-of-work directly in the contract (via EIP-2612 signatures).
Royalties: the real market state
ERC-2981 — on-chain royalty standard. The contract returns (recipient, amount) for any sale price via royaltyInfo(tokenId, salePrice). Marketplaces query this on each sale. Problem: adherence to royalties is voluntary for marketplaces. Blur launched with zero royalties, triggering a wave of other platforms. The situation has partially stabilized: OpenSea supports ERC-2981, Blur added optional ones. Royalty payments can represent 5–10% of secondary sale volume, so getting them right matters.
Attempts to enforce royalties on-chain by restricting transfers only to approved marketplaces (operator filtering) were proposed by OpenSea via OperatorFilterRegistry. This breaks composability — you cannot transfer an NFT through a custom contract. Most serious projects have abandoned this approach. For projects where royalties are critical, we build a custom marketplace within the ecosystem plus an incentive structure for users to trade there.
Lazy minting and gas-free mint
Gas-free mint via signature: the creator signs a voucher (tokenId, tokenURI, price, signature), the buyer provides the voucher in mint() — the contract verifies the signature via ECDSA.recover() and mints. Works on OpenSea via their Seaport protocol. Seaport is an optimized contract with minimal gas usage. Understanding its mechanics is important when integrating custom marketplace logic.
Stack for NFT projects
- Contracts: Solidity 0.8.x, OpenZeppelin ERC721Enumerable or ERC721A (Azuki) for gas-optimized batch mint, ERC1155 from OpenZeppelin
- VRF and automation: Chainlink VRF v2.5, Chainlink Automation
- Storage: Pinata (IPFS pinning), NFT.Storage, Arweave for permanent storage
- Marketplace: OpenSea Seaport protocol, custom integration
- Frontend: wagmi v2 + viem, RainbowKit for wallet connection, React + TypeScript
Development process
-
Mint mechanics design — allowlist, public sale, price curve (Dutch auction or fixed), limits per wallet
-
Contracts — with Foundry fuzz tests on mint limits, Merkle proof verification, royalty calculations
-
IPFS deployment — upload metadata and images before reveal, pin on at least two services
-
Reveal — if using Chainlink VRF, test on testnet mandatory: VRF subscription must be funded with LINK tokens
-
Marketplace integration — verify collection on OpenSea, configure royalties, test MetadataUpdate events
-
Deployment and monitoring — Tenderly for reentrancy detection, Etherscan API for contract verification, set up event alerts
Deliverables
- Source code of smart contracts (Solidity, Rust for Solana) with comments
- Test suite (Foundry/Hardhat) with ≥90% coverage
- Deployment documentation and integration instructions
- Access to pinning services (Pinata/Pinfluence)
- Metadata generation scripts (Python/JS)
- Support during marketplace verification
- 30 days of technical support after deployment
Timeline
| Task type |
Approximate timeline |
| Basic ERC-721 without reveal |
from 2 weeks |
| NFT collection with allowlist, reveal, VRF |
from 5 weeks |
| ERC-1155 with marketplace and royalties |
from 6 weeks |
| Dynamic NFT with external data |
from 8 weeks |
Cost is calculated individually after auditing your task. Send a brief with your project description — we will provide a transparent estimate within 3 business days. For regular clients, there is a flexible discount system on batch orders. If you need a gas-optimized contract, order a free gas analysis. Get a consultation on marketplace architecture — leave a request, and we will evaluate your project in three days.