ChonkyBFT: Consensus Protocol of ZKsync
- URL: http://arxiv.org/abs/2503.15380v1
- Date: Wed, 19 Mar 2025 16:17:54 GMT
- Title: ChonkyBFT: Consensus Protocol of ZKsync
- Authors: Bruno França, Denis Kolegov, Igor Konnov, Grzegorz Prusak,
- Abstract summary: ChonkyBFT is a partially-synchronous Byzantine fault-tolerant consensus protocol used in the ZKsync system.<n>It is a committee-based protocol with only one round of voting, single slot finality, quadratic communication, and n >= 5f + 1 fault tolerance.
- Score: 0.0
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: We present ChonkyBFT, a partially-synchronous Byzantine fault-tolerant (BFT) consensus protocol used in the ZKsync system. The proposed protocol is a hybrid protocol inspired by FAB Paxos, Fast-HotStuff, and HotStuff-2. It is a committee-based protocol with only one round of voting, single slot finality, quadratic communication, and n >= 5f + 1 fault tolerance. This design enables its effective application within the context of the ZKsync rollup, achieving its most critical goals: simplicity, low transaction latency, and reduced system complexity. The target audience for this paper is the ZKsync community and others worldwide who seek assurance in the safety and security of the ZKsync protocols. The described consensus protocol has been implemented, analyzed, and tested using formal methods.
Related papers
- Recipe: Hardware-Accelerated Replication Protocols [0.4900774081652471]
This paper introduces Recipe, a novel approach to transforming CFT protocols to operate securely in Byzantine settings.
Recipe rethinks CFT protocols in the context of modern cloud hardware, including many-core servers, RDMA-capable networks, and Trusted Execution Environments (TEEs)
The results demonstrate up to 24x higher throughput compared to PBFT and 5.9x better performance than state-of-the-art BFT protocols.
arXiv Detail & Related papers (2025-02-13T12:04:53Z) - Experimental Simulation of Two Pulses and Three Pulses Coherent One Way Quantum Key Distribution Protocol in Noisy/Noiseless and Wired/Wireless Environment [1.8638865257327277]
Coherent One Way (COW) protocol is one of the most famous protocol because of its ease of hardware deployment.
We demonstrate the encoding as well as decoding portions of the protocols under both noisy and noiseless scenario.
arXiv Detail & Related papers (2024-09-23T11:02:52Z) - Validated Strong Consensus Protocol for Asynchronous Vote-based Blockchains [4.79997217554732]
Vote-based blockchains use Byzantine Fault Tolerance consensus protocols to transition from one state to another.<n>This paper proposes a emphvalidated strong BFT consensus model that allows leader-based coordination in asynchronous settings.<n>Our protocol greatly reduces message complexity and is the first one to achieve linear view changes without relying on threshold signatures.
arXiv Detail & Related papers (2024-09-12T15:54:40Z) - The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - Reusable Formal Verification of DAG-based Consensus Protocols [8.277981465630377]
This paper presents safety-verified specifications for five DAG-based consensus protocols.<n>Four of these protocols -- DAG-Rider, Cordial Miners, Hashgraph, and Eventualous BullShark -- are well-established in the literature.<n>We employ TLA+ for specifying the protocols and writing their proofs, and the TLAPS proof system to automatically check the proofs.
arXiv Detail & Related papers (2024-07-02T11:19:12Z) - Rethinking Human Evaluation Protocol for Text-to-Video Models: Enhancing Reliability,Reproducibility, and Practicality [58.87422943009375]
This paper introduces the Text-to-Video Human Evaluation (T2VHE) protocol, a comprehensive and standardized protocol for T2V models.
The protocol includes well-defined metrics, thorough annotator training, and an effective dynamic evaluation module.
We will open-source the entire setup of the T2VHE protocol, including the complete protocol workflow, the dynamic evaluation component details, and the annotation interface code.
arXiv Detail & Related papers (2024-06-13T06:09:22Z) - Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents [0.6990493129893112]
We present a game-based framework for the study of fairness protocols.
It is based on the notion of strong secure equilibria, and leverages the conceptual and algorithmic toolbox of game theory.
arXiv Detail & Related papers (2024-05-29T10:15:36Z) - Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement [33.2699333323263]
We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs.<n>The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol.<n>We present the results of implementing the protocol in a computer simulation based on the NetSquid framework.
arXiv Detail & Related papers (2023-09-06T08:48:07Z) - Byzantine-Robust Federated Learning with Optimal Statistical Rates and
Privacy Guarantees [123.0401978870009]
We propose Byzantine-robust federated learning protocols with nearly optimal statistical rates.
We benchmark against competing protocols and show the empirical superiority of the proposed protocols.
Our protocols with bucketing can be naturally combined with privacy-guaranteeing procedures to introduce security against a semi-honest server.
arXiv Detail & Related papers (2022-05-24T04:03:07Z) - Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback [46.30924494799245]
We develop Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the happy path and progress guarantee under asynchrony and DDoS attacks.
Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon.
We implement and experimentally evaluate all our systems. Notably, Jolteon's commit latency outperforms HotStuff by 200-300ms with varying system size.
arXiv Detail & Related papers (2021-06-18T21:34:17Z) - Round-robin differential phase-time-shifting protocol for quantum key
distribution: theory and experiment [58.03659958248968]
Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties.
Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments.
We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario.
Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
arXiv Detail & Related papers (2021-03-15T15:20:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.