Minting and Burning Mechanics Flashcards

In an allowlist mint, what data structure efficiently verifies eligibility on-chain with minimal storage?

Answer: A Merkle tree with the root stored on-chain

A Merkle root lets the contract verify membership proofs without storing every address.

What is the purpose of a 'reveal' mechanism combined with minting?

Answer: Tokens mint with placeholder metadata that is later swapped to final art

Reveal mints assign placeholder metadata first, then update the base URI to expose final artwork.

Why is updating the baseURI the typical reveal step rather than re-minting tokens?

Answer: tokenURI derives from baseURI so changing it updates all metadata cheaply

Since tokenURI concatenates baseURI and tokenId, swapping the base reveals all tokens at once.

What does a 'burn-to-redeem' (burn-and-mint) mechanic typically do?

Answer: Burns one or more tokens to mint a new upgraded token

Burn-to-redeem destroys input tokens and mints a new token, often an upgrade or combined item.

When implementing a burn function that should permanently reduce supply, why avoid reusing burned tokenIds?

Answer: Reusing ids can confuse provenance and off-chain indexers

Reusing burned ids breaks token history and confuses marketplaces and indexers tracking provenance.

In a soulbound (non-transferable) token, where is the transfer restriction usually enforced while still allowing minting and burning?

Answer: In the _beforeTokenTransfer hook, allowing only from==0 or to==0

Overriding _beforeTokenTransfer to permit only mints (from==0) and burns (to==0) blocks ordinary transfers.

What is a benefit of using ERC-721A over standard ERC-721 for batch minting?

Answer: It drastically lowers gas when minting multiple tokens in one transaction

ERC-721A optimizes consecutive batch mints to reduce per-token gas costs significantly.