NFTs API
The Merkle proof of one compressed NFT, Solana only
The inclusion proof of a Solana compressed NFT — tree, root, leaf, node index and Merkle path — that a transfer, burn or redemption of it must carry.
/api/external/nft-analysis/compressed-nft-proof/{chain}/{address}What it returns
Returns the inclusion proof of one Solana compressed NFT: the tree holding it, the root the proof verifies against, the leaf hash, the leaf's node index and the Merkle path. A transfer, burn, delegation or redemption of a compressed NFT must carry this proof. found: false is a full answer, not an error: the id is not a compressed NFT the index holds (a regular NFT, a token mint, a burnt asset or no asset at all). The proof ages with the tree — every mint, transfer or burn in the same tree moves the root — so submit it promptly or ask again.
Chains
- Solana SOL
Request
Send your key in the x-dex-data-key header. Replace each <placeholder> with a real value.
curl -H "x-dex-data-key: $DEXDATA_API_KEY" \ "https://api.dexdata.io/api/external/nft-analysis/compressed-nft-proof/SOL/<address>"
| Parameter | Description |
|---|---|
chainpath · string · required | SOL. Every other chain returns 400: compressed NFTs are leaves of a Solana concurrent Merkle tree. |
addresspath · string · required | The compressed NFT's asset id, base58 — the id wallets and marketplaces show for it (a compressed NFT has no mint account). |
Response fields
A JSON response. Every field is always present; null means the value could not be established, never zero.
| Field | Type | Description |
|---|---|---|
asset | string | The asset id asked about. |
found | boolean | True when the id is a compressed NFT the index holds a proof for. |
indexedSlot | integer | null | The slot the index had reached when it answered; null when nothing was found. |
proof | object | null | The inclusion proof. Null whenever found is false. |
proof.tree | string | The Merkle tree holding the NFT's leaf. |
proof.root | string | The tree root this proof verifies against. |
proof.leaf | string | The leaf hash. |
proof.nodeIndex | integer | The leaf's node index in the tree's heap numbering: 2 to the tree depth, plus the leaf's position. |
proof.path | string[] | The sibling hashes from the leaf up to the root, bottom first; as many as the tree is deep. |
Start building with DexData today
Sign in, create a key and make your first call in a minute. Free credits every month, and you only pay for calls that succeed.
Get a free API key