• Computer Science > Distributed, Parallel, and Cluster Computing [Submitted on 18 Feb 2026] Title:push0: Scalable and Fault-Tolerant Orchestration for Zero-Knowledge Proof Generation View PDF HTML (experimental)Abstract:Zero-knowledge proof generation imposes stringent timing and reliability constraints on blockchain systems. • For ZK-rollups, delayed proofs cause finality lag and economic loss; for Ethereum’s emerging L1 zkEVM, proofs must complete within the 12-second slot window to enable stateless validation. • The Ethereum Foundation’s Ethproofs initiative coordinates multiple independent zkVMs across proving clusters to achieve real-time block proving, yet no principled orchestration framework addresses the joint challenges of (i) strict head-of-chain ordering, (ii) sub-slot latency bounds, (iii) fault-tolerant task reassignment, and (iv) prover-agnostic workflow composition. • We present push0, a cloud-native proof orchestration system that decouples prover binaries from scheduling infrastructure. • push0 employs an event-driven dispatcher–collector architecture over persistent priority queues, enforcing block-sequential proving while exploiting intra-block parallelism. • We formalize requirements drawn from production ZK-rollup operations and the Ethereum real-time proving specification, then demonstrate via production Kubernetes cluster experiments that push0 achieves 5 ms median orchestration overhead with 99–100% scaling efficiency at 32 dispatchers for realistic workloads-

Article Summaries:

  • Summary

Researchers have released push0, a cloud‑native orchestration framework designed to meet the tight timing and reliability demands of zero‑knowledge proof (ZKP) generation in blockchain systems. The system decouples prover binaries from scheduling infrastructure, using an event‑driven dispatcher‑collector architecture with persistent priority queues to enforce block‑sequential proving while exploiting intra‑block parallelism. Experiments on a production Kubernetes cluster show median orchestration overhead of 5 ms and near‑perfect scaling efficiency up to 32 dispatchers, with overhead below 0.1 % of typical 7‑second proof runtimes. Deployment on the Zircuit zk‑rollup demonstrates practical viability, enabling fault‑tolerant task reassignment and prover‑agnostic workflow composition for both centralized operators and decentralized multi‑prover networks.

Sources: