Rewrite the Ranking Protocol as the DRanking paper - #698
Conversation
Supersede the 2023 Ranking Protocol draft (whitepaper repo pos.pdf) with a standalone LaTeX paper under papers/, reframing every component around cost-anchored trust weight instead of per-identity honesty counting: - signed service receipts replace unsigned local counters - seed-anchored trust propagation with conservation/attenuation/revocation laws and a proved Sybil influence bound - VRF sortition replaces the random-oracle sampling and its statistical validation (which cannot detect Sybil density) - minimally trusted PoA admission ledger: validators order, content self-certifies; equivocation proofs are first-class slash objects - Nova-family IVC folding of the epoch transition, with the trust fixpoint unrolled into one power-iteration step per epoch for circuit-friendliness - soulbound rank / payable reward separation and a security-budget criterion for the PoA-to-PoS transition Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
Match the rings.tex house style: prose compressed to one or two sentences per section; definitions, assumptions, and laws stated as symbol arrays; every claim carried by a proved proposition or an explicit invariant/obligation/constraint. New formal content over the prose version: - Mass invariant proved (trust never inflates under substochastic rows) - Statistical undetectability proposition: position tests have zero advantage against uniform Sybil placement under a random-oracle DID map - Grinding closure and Chernoff committee-safety bounds for sortition - Epoch transition F given as pseudocode with O(nnz(W_k)) cost - Linearity proposition: BFT finality justifies linear IVC via quorum intersection - PoW/proof-of-traffic rejection formalized as a constraint - Payable-rank market-clearing argument written as a derivation Zero overfull boxes, zero bibtex warnings, 5 pages. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
|
8c36d7d recasts the paper in the rings.tex formal register per author direction: minimal prose, maximal math. Definitions/assumptions/laws are now symbol arrays; added proved content beyond the prose version — mass invariant, statistical-undetectability proposition (position tests have zero advantage against uniform Sybil placement), grinding closure, Chernoff committee-safety bound, epoch transition as pseudocode with cost, linearity-of-IVC proof via quorum intersection, payable-rank market-clearing derivation, and PoW/PoT rejection as a formal constraint. 5 pages, zero overfull boxes, zero bibtex warnings. |
- Farming price proposition: single-node instance of the Sybil bound yields the explicit farm() cost function used by the payable-rank argument (sustained endorsement (1-a)/a * w per epoch + slash risk) - Geometric convergence proposition: the trust update is an l1 contraction with modulus alpha (Banach), so the unrolled fixpoint is tracked at rate alpha^k - Time-varying damping unified: propositions restated under the dilution schedule with alpha := sup alpha_k - Threshold authority definition: seed operations gated by a 2/3 quorum over S, closing the seed-compromise row of the threat matrix - TLA-style State Relation section: Spec/Init/Next, slash-monotone, version-monotone, and unique-chain invariants, plus a checkable- instances obligation (Stateright finite models before merge) - Balance conservation invariant tied to the transition algorithm - Commitment granularity formalized (full/agg/blind with leakage profiles) replacing the prose privacy remark - Epoch-cycle dataflow figure; val() metering defined; notation collisions fixed (random oracle h vs honest region H, Vrfy vs node set V); linearity proof now cites the correct quorum assumption per phase (threshold authority in PoA, committee safety in PoS) 5 pages, zero overfull boxes, zero bibtex warnings. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
|
c105f9c extends the paper with new formal content: a farming-price proposition (single-node instance of the Sybil bound, making the farm() function of the payable-rank argument explicit), an l1-contraction convergence proof for the unrolled fixpoint, unification of the time-varying damping schedule with all propositions, a threshold-authority definition closing the seed-compromise threat row, a TLA-style State Relation section (Spec/Init/Next + slash-monotone, version-monotone, unique-chain invariants, with a finite-instance model-checking obligation), a balance-conservation invariant, formalized commitment granularity (full/agg/blind leakage profiles) replacing the prose privacy remark, and an epoch-cycle dataflow figure. Also fixes two notation collisions (random-oracle h vs honest region H; Vrfy vs node set V) and corrects the linearity proof to cite the per-phase quorum assumption. Still 5 pages, zero overfull boxes, zero bibtex warnings. |
1 participant
Summary
Rewrites the 2023
Ranking Protocoldraft (whitepaper repopos.pdf) as a standalone LaTeX paper,papers/dranking.tex, compiled topapers/dranking.pdf(6 pages,latexmk -xelatex, same toolchain asrings.tex). The 2023 draft's problem decomposition (local evidence, global aggregation, sampling, incentives, cold start, punishment) is kept; the adversarial assumption under every component is replaced: the paper prices honest weight instead of counting honest identities.What changed relative to the 2023 draft
Files
papers/dranking.tex— paper source (IEEEtran, theorem environments consistent withrings.texconventions, standalone document)papers/dranking.bib— dedicated bibliography (19 entries)papers/dranking.pdf— compiled output, committed likerings.pdfpapers/README.md— index and build instructions updated🤖 Generated with Claude Code