cid 287fdabccda6dbc0908dd5e361a20846519401e192b322e41060537d385b7067 · original · open access · via openalex
Title: DualEdge: A Dual-Lock Transaction Architecture for Decentralised Compute Marketplaces Authors: Zeba Mahmood; Stephan Recker Venue: Conference on Local Computer Networks Year: 2026 Canonical: doi:10.1109/lcn67947.2026.11660794 URL: https://doi.org/10.1109/lcn67947.2026.11660794 Collector: openalex OA: true ABSTRACT A decentralised compute marketplace must propagate two kinds of state simultaneously. Resource availability (soft-state) tolerates brief staleness; contract commitments (hard-state) require exact validator agreement. Existing platforms flatten this distinction, either gossiping everything (risking double-selling) or routing everything through Byzantine Fault-Tolerant (BFT) consensus (paying finality latency on discovery queries). DualEdge keeps the layers separate: Serf gossip handles soft-state discovery; CometBFT handles hard-state settlement. A dual-lock mechanism ties them together via a strict on-chain admission rule over hardware identifiers and a bounded-delay gossip tag update, implemented in the Application BlockChain Interface (ABCI++) application layer above CometBFT. On a 12-validator CometBFT testbed within a 25-node containerlab deployment, seven experiments establish: per-query discovery is 448× faster than consensus commit at the layer level; throughput scales from 8.18 to 141.61 transactions per second (TPS), a 17.3 × increase, with 100% success; without the lock, 50 concurrent transactions over-committed by 24.5×, while with it, seven contention trials covering 2,350 transactions held every conservation and balance invariant; admission control achieves deterministic 100%/0% valid/invalid visibility asymmetry; and a targeted Byzantine overspend attempt is rejected at CheckTx without protocol modification.