Freeze formal trust
Treat the validator’s quorum set as immutable during overlay optimization.
← All researchMF-PRISM-DLT-2026-06 / interactive guide
THE IDEA, MADE VISIBLE
Change the route. Not the trust.
Add transport links while the formal validator trust predicate stays exactly the same.
Research reportAQR-O: Quorum-Aware Overlay Optimization Without Quorum-Set Mutation
Freeze the trust plane
For each comparison at a fixed message threshold, the accepted validator set and threshold remain unchanged. Transport changes do not rewrite the trust predicate.
- Added links
- 1
- Fixed trust predicate
- 4 of V1–V5
- Threshold delivery time
- 70 ms
With 1 additional links, the 4th remote message arrives after 70 synthetic milliseconds. Adding a link did not change the 4-of-5 trust predicate.
Threshold arrival = kth smallest trusted-message arrival time.
TRY THIS
Keep the message threshold at 4 and add links. Delivery time changes, but the trust predicate displayed below does not.
What this experiment represents. Deterministic weighted-graph routing example. Delay numbers are invented teaching inputs, not network measurements or a production ledger-close benchmark. The threshold control starts a separate fixed-trust comparison.
Distributed Systems · Research Paper
AQR-O: Quorum-Aware Overlay Optimization Without Quorum-Set Mutation
Trust-plane invariance, timely-quorum covers, and fault-domain-constrained peer selection
Research reportMF-PRISM-DLT-2026-06 / v0.2
Optimize how quorum messages reach a validator while keeping the formal trust predicate fixed. The study uses timely-quorum coverage, diversity constraints and bounded transport changes in a synthetic dissemination emulator.
- Identifier
- MF-PRISM-DLT-2026-06
- Series
- Distributed Systems
- Edition
- Version 0.2
- Length
- 24 pages
- Reserved DOI
- 10.5281/zenodo.22728324 (record reserved)
01
Plain-language guide
3 minute explanation
What this paper is really saying.
The paper optimizes which peers carry consensus messages while freezing the validator’s formal trust rule, separating transport improvements from quorum-set mutation.
overlay networksfederated consensuspeer selection
A validator may trust the right nodes yet hear from them too slowly because its network connections are poorly chosen. Changing the quorum set to fix transport can silently change the safety assumptions.
AQR-O holds the trust plane fixed and optimizes only the overlay: which peers are connected, how messages are relayed, and whether a timely set of messages can satisfy the unchanged quorum formula.
02
How it works
The argument, without the notation.
The paper’s technical details matter, but the basic route can be understood in three moves.
Model timely delivery
Use arrival-time abstractions to determine which connected peers can deliver enough quorum support before a deadline.
Choose a diverse overlay
Optimize timely-quorum coverage subject to peer limits, churn bounds, and fault-domain diversity.
03
What it adds
The useful takeaways.
Transport and trust are treated as separate control planes.
Peer selection is optimized for timely quorum coverage without rewriting the quorum predicate.
Diversity constraints reduce the chance that one transport or infrastructure failure defeats the overlay.
04
Scope & limits
What this does—and does not—establish.
Current status
Fixed-trust overlay methods and a deterministic dissemination emulator. No compiled hot-overlay Gravity patch, complete SCP simulation, or production performance claim is included.
This report develops a conditional method and evaluates it within the stated evidence. It does not establish production performance, operational safety, or calibrated real-world predictive skill beyond that evidence.
No production hot-overlay Gravity patch is included.
The emulator is not a complete SCP or adversarial network simulation.
Fixed formal trust does not eliminate eclipse or availability risk in the transport layer.
05
Why it matters
Why anyone should care.
Separating the transport plane from the trust plane creates room to improve timeliness while avoiding silent quorum-set changes that would alter safety assumptions.
06
Key terms
The vocabulary, decoded.
These are the terms needed to understand the claim. The full paper uses them more precisely.
Overlay network
The chosen peer-to-peer connections used to move protocol messages.
Trust plane
The formal quorum or authorization rules defining whose agreement counts.
Transport plane
The network paths and peers used to deliver messages.
Timely quorum
Enough quorum-supporting messages arriving before a chosen deadline.
07
Independent review
Where scrutiny should concentrate.
The strongest review is not a general reaction. It tests the steps most capable of changing the conclusion.
- 01Fixed trust versus transport availability and eclipse exposure.
- 02Arrival-time abstraction and hierarchical quorum formula.
- 03Synthetic routing, churn and unimplemented production hot updates.
Publication record
Go from explanation to evidence.
This page is a reading guide, not a substitute for the manuscript. The public record links the explanation to the paper, source package, review materials, and persistent identifier.
- Document
- Research Paper
- Review status
- Open for independent review
- Published
- 2026-09-12
- DOI status
- Reserved · 10.5281/zenodo.22728324
- Canonical record
- MF-PRISM-DLT-2026-06
Metriq PRISM Laboratory, AQR-O: Quorum-Aware Overlay Optimization Without Quorum-Set Mutation, Metriq PRISM Laboratory Research Paper MF-PRISM-DLT-2026-06, Version 0.2, 2026. Corresponding contributor: Daniel H. Jeffery, ORCID 0009-0001-1200-6042. DOI: 10.5281/zenodo.22728324.