agorix
AirdropMarketsCollectionsLeaderboardActivity
Agorix · Decentralized Marketplace
Independent · Resilient · Community-Run

A cross-chain marketplace, run by the community.

Discover, list, and trade across Bitcoin, Ethereum, and Solana on an open, community-run network.

Marketplace
CollectionsMarketsLeaderboardActivity
Network
GovernanceExplorerAirdropDocs
Account
ProfileSettings
Legal
Terms of ServicePrivacy PolicyYour Privacy Choices
agorix.io — Lasting Access
CID: 0xA60R1X · v0.1
AirdropMarketsCollections
D
Protocol Docs
Proof of AccessNetwork Fee RoutingRelease VerificationMPC Treasury SecurityPSBT SecurityNode AuthenticationRate LimitingBundle Integrity VerificationTransaction Session Reconciliation
Docs/Security & Verification/Proof of Access
Security & Verification

Proof of Access

Chain verification challenges. How nodes prove real-time RPC access to supported blockchains through deterministic historical state queries.

#Proof of Access (PoA)

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.

#Deterministic Challenge Derivation

All challenges are derived deterministically so every node in a quorum produces the same challenge set independently. The seed formula:

text
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:

text
blockOffset = challengeSeed[0..4] mod 900 + 100   // 100 to 1000 blocks back
inscriptionOffset = challengeSeed[4..8] mod 10000  // 10,000 recent inscriptions

Nodes cannot pre-cache answers because the seed incorporates the time window and chain-specific entropy. But any node can independently verify the derivation.

#Challenge Types per Chain

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.

#TypeSourceWhat It Verifies
1current_itemBTC RPCUTXO status of the item being traded
2current_chain_eventBTC RPCBest block hash at query time
3historical_chain_eventBTC RPCBlock hash 100-1000 blocks back
4current_ordinal_eventOrd indexerInscription content hash for a recent inscription
5historical_ordinal_eventOrd indexerInscription data from the 10,000 recent inscriptions range

Ethereum (3 challenges):

#TypeWhat It Verifies
1BLOCK_HASHBlock hash at a historical height (100-1000 blocks back)
2TX_DATATransaction receipt from a historical block
3ACCOUNT_STATEBalance or storage slot at a historical block

Solana (3 challenges):

#TypeWhat It Verifies
1BLOCK_HASHSlot hash for a recent confirmed slot
2ACCOUNT_STATEAccount data at a recent slot
3TX_DATATransaction signature history

#Historical Block Range

Challenge block offsets are always between 100 and 1000 blocks behind the current tip. This range is chosen deliberately:

  • 100 minimum prevents challenges that could be answered from mempool data or unconfirmed state.
  • 1000 maximum ensures standard pruned nodes can still answer (most prune beyond 1000).
  • Ordinal inscription range covers the 10,000 most recent inscriptions, which requires an actively synced ord indexer.

#Over-Subscription

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.

#Scoring and Misbehavior

  • Correct answer: the node passes and is eligible for quorum selection.
  • Wrong answer: recorded as a misbehavior strike. Wrong answers indicate either a desynchronized chain or deliberate malice. Accumulated strikes feed into the governance misbehavior system and can result in slashing.
  • Timeout: the node is excluded from this quorum but receives no strike. Timeouts indicate infrastructure issues, not malicious intent.
  • Critical distinction: this separation prevents honest nodes with temporary connectivity problems from being penalized the same way as actively malicious nodes.

#Quorum Formation

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.

#Why This Matters

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.

PreviousSettlement FlowsNext Network Fee Routing

On this page

  • Proof of Access (PoA)
  • Deterministic Challenge Derivation
  • Challenge Types per Chain
  • Historical Block Range
  • Over-Subscription
  • Scoring and Misbehavior
  • Quorum Formation
  • Why This Matters