From Permissioned to Proof-of-Stake Consensus

• URL: http://arxiv.org/abs/2506.14124v1
• Date: Tue, 17 Jun 2025 02:37:40 GMT
• Title: From Permissioned to Proof-of-Stake Consensus
• Abstract summary: This paper presents the first generic compiler that transforms any permissioned consensus protocol into a proof-of-stake permissionless consensus protocol.<n>For each of the following properties, if the initial permissioned protocol satisfies that property in the partially synchronous setting, the consequent proof-of-stake protocol also satisfies that property in the partially synchronous and quasi-permissionless setting.
• Score: 11.617200940006654
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents the first generic compiler that transforms any permissioned consensus protocol into a proof-of-stake permissionless consensus protocol. For each of the following properties, if the initial permissioned protocol satisfies that property in the partially synchronous setting, the consequent proof-of-stake protocol also satisfies that property in the partially synchronous and quasi-permissionless setting (with the same fault-tolerance): consistency; liveness; optimistic responsiveness; every composable log-specific property; and message complexity of a given order. Moreover, our transformation ensures that the output protocol satisfies accountability (identifying culprits in the event of a consistency violation), whether or not the original permissioned protocol satisfied it.

Related papers

• Structuring Semantic Embeddings for Principle Evaluation: A Prototype-Guided Contrastive Learning Approach [58.15427952222424]
  General-purpose text embeddings are widely deployed for such tasks, but broad semantic similarity can place semantically similar yet task-distinct examples.<n>We introduce Prototype-Guided Contrastive Learning (PGCL), a prototype-guided geometric regularization module built on top of frozen text embeddings.
  arXiv  Detail & Related papers  (2026-08-15T13:19:25Z)
• Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models [2.1311014724439845]
  Syntropy is a framework for synthesising protocol refinements guided by MPST specifications and LLMs.<n>It incorporates refinement constraints directly into the generation process, ensuring the generated variants satisfy these guarantees.<n>Our evaluation indicates that Syntropy achieves 95.6%-99.5% validity while maintaining high syntactic correctness, and produces diverse, non-trivial refinements.
  arXiv  Detail & Related papers  (2026-07-30T10:11:33Z)
• Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution [0.8921166277011348]
  Quantum position verification (QPV) seeks to certify the spatial location of an untrusted prover.<n>Quantum position verification (QPV) seeks to certify the spatial location of an untrusted prover.
  arXiv  Detail & Related papers  (2026-06-23T18:00:18Z)
• Enhancing Factuality through Consensus and Consistency in Summarization Using Minimum Bayes Risk Decoding [64.98167175790817]
  We propose ConSUM that reranks candidate summaries by considering two factors: consistency to the source document and consensus among the other candidates.<n>Our system is competitive with existing methods, with human evaluations confirming that its generated summaries are preferred over those from other systems.
  arXiv  Detail & Related papers  (2026-05-28T04:14:43Z)
• Correction and Corruption: A Two-Rate View of Error Flow in LLM Protocols [51.56484100374058]
  We propose a paired-outcome measurement interface for auditing a single protocol step on exact-match tasks.<n>For each instance, the interface records a baseline correctness bit and a post-step correctness bit.<n>These rates predict accuracy changes and define a reusable empirical interface testable across seeds, mixtures, and pipelines.
  arXiv  Detail & Related papers  (2026-04-20T13:25:40Z)
• Anumati: Proof of Adherence as a Formal Consent Model for Autonomous Agent Protocols [0.0]
  We propose a versioned, append-only consent model for agent-to-agent communication.<n>The model is instantiated as a non-breaking extension to two widely used agent protocols.
  arXiv  Detail & Related papers  (2026-04-16T10:48:21Z)
• AgentRFC: Security Design Principles and Conformance Testing for Agent Protocols [2.1352949241716352]
  Agent protocols enable autonomous agents to discover capabilities, delegate tasks, and compose services across trust boundaries.<n>Despite massive deployment, no systematic security framework for these protocols exists.<n>We present three contributions: the Agent Protocol Stack, the Agent-Agnostic Security Model, and AgentConform.
  arXiv  Detail & Related papers  (2026-03-25T00:25:02Z)
• Verification of Robust Properties for Access Control Policies [51.736723807086385]
  Existing methods for verifying access control policies require the policy to be complete and fully determined before verification can proceed.<n>We introduce robust property verification: the problem of determining what a policy's structure commits it to regardless of how pending decisions are resolved and regardless of subsequent extension.<n>We show that despite quantifying universally over all possible policy extensions the judgment reduces to proof search in a second-order logic programming language.
  arXiv  Detail & Related papers  (2026-03-13T17:14:38Z)
• Hybrid Consensus with Quantum Sybil Resistance [4.524401636606247]
  We design a consensus protocol that combines classical hybrid protocols with quantum position verification as the Sybil resistance mechanism.<n>Our protocol inherits the benefits of other hybrid protocols, namely the faster confirmation times compared to pure Proof-of-Work protocols.<n>We additionally propose a spam prevention mechanism for our protocol in the Random Oracle model.
  arXiv  Detail & Related papers  (2026-02-25T18:44:24Z)
• Protocol Testing with I/O Grammars [45.68497486907946]
  We propose a novel approach to protocol testing that combines input generation and output checking in a single framework.<n>We demonstrate that I/O grammars can specify advanced protocol features correctly and completely, while also enabling output validation of the programs under test.
  arXiv  Detail & Related papers  (2025-09-24T16:41:04Z)
• Publicly Verifiable Private Information Retrieval Protocols Based on Function Secret Sharing [45.68069331331365]
  Private Information Retrieval (PIR) is a cryptographic primitive that enables users to retrieve data from a database without revealing which item is being accessed.<n>We propose two effective constructions of publicly verifiable PIR (PVPIR) in the multi-server setting, which achieve query privacy, correctness, and verifiability simultaneously.
  arXiv  Detail & Related papers  (2025-09-17T04:28:47Z)
• Voting-Based Semi-Parallel Proof-of-Work Protocol [45.776687601070705]
  We first consider the existing parallel PoW protocols and develop hard-coded incentive attack structures.<n>We introduce a voting-based semi-parallel PoW protocol that outperforms both Nakamoto consensus and the existing parallel PoW protocols.
  arXiv  Detail & Related papers  (2025-08-08T17:57:35Z)
• Safe Low Bandwidth SPV: A Formal Treatment of Simplified Payment Verification Protocols and Security Bounds [0.0]
  We show that SPV is not only secure under bounded adversarial assumptions but strictly optimal for digital cash systems requiring scalable and verifiable transaction inclusion.<n>This document serves both as a blueprint for secure SPV implementation and a rebuttal of common misconceptions surrounding non-validating clients.
  arXiv  Detail & Related papers  (2025-07-01T13:44:48Z)
• ProtocolLLM: RTL Benchmark for SystemVerilog Generation of Communication Protocols [45.66401695351214]
  We introduce ProtocolLLM, the first benchmark suite specifically targeting widely used SystemVerilog protocols.<n>We observe that most of the models fail to generate SystemVerilog code for communication protocols that follow timing constrains.
  arXiv  Detail & Related papers  (2025-06-09T17:10:47Z)
• Information Bargaining: Bilateral Commitment in Bayesian Persuasion [60.3761154043329]
  We introduce a unified framework and a well-structured solution concept for long-term persuasion.<n>This perspective makes explicit the common knowledge of the game structure and grants the receiver comparable commitment capabilities.<n>The framework is validated through a two-stage validation-and-inference paradigm.
  arXiv  Detail & Related papers  (2025-06-06T08:42:34Z)
• Secure quantum bit commitment from separable operations [0.0]
  We show that imposing a restriction on the committing party to perform only separable operations enables secure quantum bit commitment schemes.<n>Specifically, we prove that in any perfectly hiding bit commitment protocol, an honestly-committing party limited to separable operations will be detected with high probability if they attempt to alter their commitment.
  arXiv  Detail & Related papers  (2025-01-13T14:15:11Z)
• Error-Tolerant E-Discovery Protocols [18.694850127330973]
  We consider the multi-party classification problem introduced by Dong, Hartline, and Vijayaraghavan (2022) Based on a request for production from the requesting party, the responding party is required to provide documents that are responsive to the request except for those that are legally privileged. Our goal is to find a protocol that verifies that the responding party sends almost all responsive documents while minimizing the disclosure of non-responsive documents.
  arXiv  Detail & Related papers  (2024-01-31T15:59:16Z)
• Short Paper: Accountable Safety Implies Finality [10.589723476970443]
  Two key desiderata have been studied for Byzantine-fault tolerant (BFT) state-machine replication (SMR) consensus protocols. We show that accountable safety implies finality, thereby unifying earlier results.
  arXiv  Detail & Related papers  (2023-08-31T17:58:38Z)
• CoP: Factual Inconsistency Detection by Controlling the Preference [45.4045488637761]
  We propose an unsupervised framework named CoP by controlling the preference of the generation model with the help of prompt. With the properly designed prompt, our framework could evaluate specific preferences and serve as measurements for fine-grained categories of inconsistency. Experiments show that our framework achieves new SOTA results on three factual inconsistency detection tasks.
  arXiv  Detail & Related papers  (2022-12-03T13:05:24Z)
• Classification Protocols with Minimal Disclosure [12.308957254601243]
  We consider multi-party protocols for classification motivated by applications such as e-discovery in court proceedings. We identify a protocol that guarantees that the requesting party receives all responsive documents and the sending party discloses the minimal amount of non-responsive documents. This protocol can be embedded in a machine learning framework that enables automated labeling of points.
  arXiv  Detail & Related papers  (2022-09-06T17:57:52Z)
• 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)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)

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.