Proof of Trusted Execution: A Consensus Paradigm for Deterministic Blockchain Finality

• URL: http://arxiv.org/abs/2512.09409v1
• Date: Wed, 10 Dec 2025 08:04:38 GMT
• Title: Proof of Trusted Execution: A Consensus Paradigm for Deterministic Blockchain Finality
• Authors: Kyle Habib, Vladislav Kapitsyn, Giovanni Mazzeo, Faisal Mehrban,
• Abstract summary: We propose Proof of Trusted Execution (PoTE), a consensus paradigm where agreement emerges from verifiable execution rather than replicated re-execution.<n>Because the execution is deterministic and the proposer is uniquely derived from public randomness, PoTE avoids forks, eliminates slot.time bottlenecks, and commits blocks in a single round of verification.
• Score: 0.391985484065646
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Current blockchain consensus protocols -- notably, Proof of Work (PoW) and Proof of Stake (PoS) -- deliver global agreement but exhibit structural constraints. PoW anchors security in heavy computation, inflating energy use and imposing high confirmation latency. PoS improves efficiency but introduces stake concentration, long-range and "nothing-at-stake" vulnerabilities, and a hard performance ceiling shaped by slot times and multi-round committee voting. In this paper, we propose Proof of Trusted Execution (PoTE), a consensus paradigm where agreement emerges from verifiable execution rather than replicated re-execution. Validators operate inside heterogeneous VM-based TEEs, each running the same canonical program whose measurement is publicly recorded, and each producing vendor-backed attestations that bind the enclave code hash to the block contents. Because the execution is deterministic and the proposer is uniquely derived from public randomness, PoTE avoids forks, eliminates slot.time bottlenecks, and commits blocks in a single round of verification. We present the design of a PoTE consensus client, describe our reference implementation, and evaluate its performance against the stringent throughput requirements of the Trillion decentralized exchange.

Related papers

• Overcoming Joint Intractability with Lossless Hierarchical Speculative Decoding [58.92526489742584]
  We propose provably lossless.<n> verification method that significantly boosts the expected number of accepted tokens.<n>We show that HSD yields consistent improvements in acceptance rates across diverse model families and benchmarks.
  arXiv  Detail & Related papers  (2026-01-09T11:10:29Z)
• Homomorphic Encryption-based Vaults for Anonymous Balances on VM-enabled Blockchains [0.0]
  We present homomorphic encryption-based vaults (Haults) for VM-enabled blockchains.<n>Haults keeps users' balances confidential, as well as the amounts transacted to other parties.
  arXiv  Detail & Related papers  (2025-11-21T23:34:30Z)
• Cross-Chain Sealed-Bid Auctions Using Confidential Compute Blockchains [12.944520640892316]
  Sealed-bid auctions ensure fair competition and efficient allocation but are often deployed on centralized infrastructure.<n>Public blockchains eliminate central control, yet their inherent transparency conflicts with the confidentiality required for sealed bidding.<n>We present a sealed-bid auction protocol that executes sensitive bidding logic on a confidential compute blockchain.
  arXiv  Detail & Related papers  (2025-10-22T11:35:51Z)
• Zk-SNARK Marketplace with Proof of Useful Work [0.3849857432787595]
  We propose a Proof of Useful Work consensus protocol that computes client-outsourced zk-SNARKs as a byproduct proof.<n>We further leverage this mechanism to design a decentralized marketplace for outsourcing zk-SNARK proof generation.
  arXiv  Detail & Related papers  (2025-10-10T10:38:42Z)
• SIM-CoT: Supervised Implicit Chain-of-Thought [108.30049193668083]
  Implicit Chain-of-Thought (CoT) methods offer a token-efficient alternative to explicit CoT reasoning in Large Language Models.<n>We identify a core latent instability issue when scaling the computational budget of implicit CoT.<n>We propose SIM-CoT, a plug-and-play training module that introduces step-level supervision to stabilize and enrich the latent reasoning space.
  arXiv  Detail & Related papers  (2025-09-24T17:01:32Z)
• 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)
• Theorem-Carrying Transactions: Runtime Verification to Ensure Interface Specifications for Smart Contract Safety [8.906268052552582]
  1.45-million contracts form a single "gigantic program"<n>Can programmers be assured that this gigantic program conforms to high-level safety specifications?<n> Static code verification cannot be faithful to this gigantic program due to its scale and high polymorphism.<n>Our technology, called Theorem-Carrying Transactions (TCT), combines the benefits of concrete execution and symbolic proofs.
  arXiv  Detail & Related papers  (2024-08-12T20:27:41Z)
• 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.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Scalable Zero-Knowledge Proofs for Verifying Cryptographic Hashing in Blockchain Applications [16.72979347045808]
  Zero-knowledge proofs (ZKPs) have emerged as a promising solution to address the scalability challenges in modern blockchain systems. This study proposes a methodology for generating and verifying ZKPs to ensure the computational integrity of cryptographic hashing.
  arXiv  Detail & Related papers  (2024-07-03T21:19:01Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• 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)
• Post-Quantum VRF and its Applications in Future-Proof Blockchain System [13.386254282693335]
  A verifiable random function (VRF) is a powerful pseudo-random function that provides a non-interactively public verifiable proof for the correctness of its output. We propose a generic compiler to obtain the post-quantum VRF from the simple VRF solution using symmetric-key primitives. We show potential applications of a quantum-secure VRF, such as quantum-secure decentralized random beacon and lottery-based proof of stake consensus blockchain protocol.
  arXiv  Detail & Related papers  (2021-09-05T07:10:41Z)

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.