DAG Architecture
The Virtual Mempool employs a directed acyclic graph (DAG) structure:
- Nodes represent individual transactions
- Edges encode dependencies between VTXOs (inputs and outputs)
- Independent branches execute in parallel, enabling massive throughput
This DAG design eliminates the bottlenecks inherent in account-based systems. Transactions need only respect their local dependencies rather than competing for updates to a globally serialized state.
How It Works
When users submit transactions to Arkade, the following process occurs:- Validation: The Arkade Operator verifies the transaction request against the current VTXO set
- Cosigning: Valid requests are forwarded to the Arkade Signer for cosignature authorization
- Update: The Virtual Mempool DAG updates immediately, making transaction outputs instantly spendable
From Preconfirmation to Finality
Virtual Mempool transactions exist in a preconfirmed state:- Instantly valid within Arkade upon cosigning by the Arkade Signer
- Chainable and composable for complex offchain operations
- Not yet anchored to Bitcoin’s consensus