AtHeartEngineer/rfc-index
1
0
Fork 0
mirror of https://github.com/vacp2p/rfc-index.git synced 2026-01-08 23:28:15 -05:00
Code Issues Packages Projects Releases Wiki Activity

Apply specs_practices.md style rules: remove RFC 2119 from refs, remove duplicate intro, add Filip as contributor, move refs before copyright

Browse Source
This commit is contained in:
Cofson
2025-12-23 18:34:57 +01:00
parent 7e9551ef22
commit aec7036e1d
1 changed files with 5 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
nomos/raw/cryptarchia-proof-of-leadership.md
View File

@@ -11,6 +11,7 @@ contributors:
- Daniel Sanchez Quiros <daniel@status.im> - Daniel Sanchez Quiros <daniel@status.im>
- Álvaro Castro-Castilla <alvaro@status.im> - Álvaro Castro-Castilla <alvaro@status.im>
- David Rusu <david@status.im> - David Rusu <david@status.im>
- Filip Dimitrijevic <filip@status.im>
--- ---
## Abstract ## Abstract
@@ -31,21 +32,6 @@ The keywords "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD",
"SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be
interpreted as described in RFC 2119. interpreted as described in RFC 2119.
## Introduction
The Proof of Leadership enables a leader to produce a zero-knowledge proof
attesting to the fact that they have an eligible note
that has won the leadership lottery.
This proof MUST be as lightweight as possible to generate and verify,
due to the following reasons:
- Impose minimal restrictions on access to the role of leader
and thus maximize the decentralization of that role.
- Similarly, the proof and its context MUST be efficiently verifiable for validators.
This document extends the work presented in the Ouroboros Crypsinous paper
with recent cryptographic developments.
## Overview ## Overview
### Overview of the Protocol ### Overview of the Protocol
@@ -531,16 +517,10 @@ The material used for the benchmarks is the following:
![Average proving time vs number of threads (100 Runs)](assets/pol-benchmark-proving-time.webp) ![Average proving time vs number of threads (100 Runs)](assets/pol-benchmark-proving-time.webp)
## Copyright
Copyright and related rights waived via [CC0](https://creativecommons.org/publicdomain/zero/1.0/).
## References ## References
### Normative ### Normative
- [RFC 2119](https://www.ietf.org/rfc/rfc2119.txt)
\- Key words for use in RFCs to Indicate Requirement Levels
- [Cryptarchia v1 Protocol Specification](https://nomos-tech.notion.site/Cryptarchia-v1-Protocol-Specification-21c261aa09df810cb85eff1c76e5798c) - [Cryptarchia v1 Protocol Specification](https://nomos-tech.notion.site/Cryptarchia-v1-Protocol-Specification-21c261aa09df810cb85eff1c76e5798c)
\- Parent protocol specification \- Parent protocol specification
@@ -550,3 +530,7 @@ Copyright and related rights waived via [CC0](https://creativecommons.org/public
\- Original Proof of Leadership documentation \- Original Proof of Leadership documentation
- [Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake](https://eprint.iacr.org/2018/1132.pdf) - [Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake](https://eprint.iacr.org/2018/1132.pdf)
\- Foundation for the PoL design \- Foundation for the PoL design
## Copyright
Copyright and related rights waived via [CC0](https://creativecommons.org/publicdomain/zero/1.0/).