Chain verification challenges. How nodes prove real-time RPC access to supported blockchains through deterministic historical state queries.
Proof of Access ensures every node in a quorum has real-time access to the blockchain it claims to support. Without PoA, a node could fake attestations by parroting answers from honest peers.
All challenges are derived deterministically so every node in a quorum produces the same challenge set independently. The seed formula:
challengeSeed = SHA256("poa-challenge-v1|{chain}|{seed}|{windowStart}")Time windowing: challenges operate on 60-second intervals. The window start is computed as floor(now / 60) * 60 (Unix epoch seconds). This means all nodes querying within the same 60s window derive identical challenges without coordination.
The seed feeds into per-challenge offset derivation:
blockOffset = challengeSeed[0..4] mod 900 + 100 // 100 to 1000 blocks back
inscriptionOffset = challengeSeed[4..8] mod 10000 // 10,000 recent inscriptionsNodes cannot pre-cache answers because the seed incorporates the time window and chain-specific entropy. But any node can independently verify the derivation.
Bitcoin (5 challenges, highest bar):
Bitcoin requires the most challenges because ordinal trading depends on two separate infrastructure components: a full BTC node and an ord indexer.
| # | Type | Source | What It Verifies |
|---|---|---|---|
| 1 | current_item | BTC RPC | UTXO status of the item being traded |
| 2 | current_chain_event | BTC RPC | Best block hash at query time |
| 3 | historical_chain_event | BTC RPC | Block hash 100-1000 blocks back |
| 4 | current_ordinal_event | Ord indexer | Inscription content hash for a recent inscription |
| 5 | historical_ordinal_event | Ord indexer | Inscription data from the 10,000 recent inscriptions range |
Ethereum (3 challenges):
| # | Type | What It Verifies |
|---|---|---|
| 1 | BLOCK_HASH | Block hash at a historical height (100-1000 blocks back) |
| 2 | TX_DATA | Transaction receipt from a historical block |
| 3 | ACCOUNT_STATE | Balance or storage slot at a historical block |
Solana (3 challenges):
| # | Type | What It Verifies |
|---|---|---|
| 1 | BLOCK_HASH | Slot hash for a recent confirmed slot |
| 2 | ACCOUNT_STATE | Account data at a recent slot |
| 3 | TX_DATA | Transaction signature history |
Challenge block offsets are always between 100 and 1000 blocks behind the current tip. This range is chosen deliberately:
ord indexer.When forming a quorum, the protocol invites 1.5x the required number of nodes plus a small fixed extra count. This absorbs timeouts and infrastructure failures without restarting the entire round. Only the fastest correct responders are selected into the final quorum.
A quorum forms exclusively from nodes that passed all PoA challenges for the relevant chain. The fastest correct responders (within the over-subscribed pool) are selected. Every attesting node has independently verified the transaction using its own RPC connection. No delegation, no shortcuts.
Without PoA, a colluding minority could run lightweight nodes without real chain access, copy attestations from honest nodes, and participate in quorums without performing real verification. PoA makes that impossible because each challenge requires data that can only be obtained by querying the actual blockchain at the specified historical point.