Proto-CHIP: Rotating Priority Relay Set for Bitcoin Cash
Title: Rotating Priority Relay Set for Bitcoin Cash
Short Name: RPRS
Type: Technical / Peer Services
Layers: P2P Networking, Transaction Relay, Block Relay
Status: Draft / Research
Author: Paulo + Contributors
Consensus Dependency: Preferably none in the initial version
Compatibility: Nodes that do not implement RPRS must continue to operate normally.
1. Abstract
This Proto-CHIP proposes an optional, distributed, and rotating priority relay layer for Bitcoin Cash called the Rotating Priority Relay Set (RPRS).
Periodically, the protocol would select a temporary set of participating nodes that demonstrate adequate processing capacity, connectivity, and availability.
These nodes would temporarily operate as Priority Relay Nodes (PRNs).
Their purpose would not be to decide which transactions are valid, produce consensus, replace miners, or modify the blockchain.
Their sole purpose would be to accelerate:
- transaction propagation;
- block propagation;
- Compact Block dissemination;
- propagation of information relevant to mempool synchronization;
- communication between geographically or topologically distant regions of the network.
The priority set would have a limited term.
An initial value proposed for research purposes is:
6 hours per term (epoch).
At the end of each epoch, another set would be automatically selected.
No PRN would have authority over Bitcoin Cash consensus.
The fundamental property of this proposal is:
If all Priority Relay Nodes disappear simultaneously, Bitcoin Cash must continue to operate normally.
Therefore, RPRS is an optimization of the P2P communication layer, not a new consensus authority.
2. Motivation
Bitcoin Cash aims to provide fast peer-to-peer electronic cash while preserving decentralization and Proof of Work.
Proposals such as Faster Blocks investigate reducing the target block interval from approximately 10 minutes to approximately 1 minute.
As the block interval decreases, however, propagation latency becomes proportionally more important.
Consider:
10-minute blocks
A 2-second propagation delay represents approximately:
2 / 600 = 0.33% of the target interval.
1-minute blocks
The same 2 seconds represent:
2 / 60 = 3.33% of the target interval.
Therefore, reducing the block interval increases the relative importance of:
- latency;
- peer quality;
- network topology;
- relay efficiency;
- mempool synchronization;
- validation speed.
RPRS proposes addressing this problem at the communication layer rather than introducing a central authority.
3. Fundamental Principle
RPRS must preserve the following property:
Priority ≠ Authority
A Priority Relay Node has communication priority.
It does not have consensus priority.
A PRN MUST NOT be able to:
- approve an invalid transaction;
- globally reject an otherwise valid transaction;
- modify consensus rules;
- provide transaction finality;
- replace Proof of Work;
- determine which chain is valid;
- modify difficulty;
- modify block rewards;
- prevent ordinary nodes from communicating directly;
- prevent miners from completely ignoring RPRS.
Every node continues to independently validate all information it receives.
4. Architecture
The network would maintain two simultaneous communication paths.
Conventional P2P Network
Node → Node → Node → Node → Miner
This path continues to operate normally.
RPRS Fast Relay
Node
↓
Regional PRN
↓
RPRS
↓
PRN close to miner
↓
Miner
Both routes operate simultaneously.
Conceptually:
TRANSACTION
|
+---------+---------+
| |
v v
Conventional P2P RPRS
| |
| Priority Relay
| |
+---------+---------+
|
v
MINER
Whichever path delivers the information first wins.
5. Priority Relay Nodes
A node may voluntarily announce its availability to participate in RPRS.
Participation does not guarantee selection.
To become eligible, a node may be required to demonstrate minimum characteristics.
Examples include:
- minimum uptime;
- up-to-date BCH protocol support;
- low error rate;
- sufficient processing capacity;
- sufficient bandwidth;
- minimum connectivity;
- relay performance history;
- peer diversity.
These characteristics should be measurable by the network itself whenever possible.
6. Avoiding a Server Aristocracy
The main danger of this concept is that only large data centers could become selected.
This could produce:
RPRS
↓
professional servers
↓
large infrastructure providers
↓
centralization
Therefore, absolute performance must not be the sole selection criterion.
Selection should consider multiple factors through an Eligibility Score, potentially combining:
- availability;
- connectivity;
- correct behavior;
- geographic and/or topological diversity;
- capacity;
- randomness.
Capacity should determine whether a node is eligible.
It should not directly determine its probability of dominating the system.
7. Deterministic Election
All nodes must be able to independently determine the members of the next RPRS.
There must be no:
- administrator;
- election server;
- foundation;
- human voting;
- centralized API;
- centralized database of selected nodes.
The election should be reproducible using information already known to the blockchain and network.
Conceptually:
ElectionSeed =
HASH(
previous_chain_state
|| epoch_number
|| eligibility_data
)
Each candidate calculates:
ElectionScore =
HASH(
ElectionSeed
|| NodeIdentity
)
Eligible candidates whose scores satisfy the defined selection rules become PRNs.
8. Unpredictability
The selection should not be known too far in advance.
If attackers can determine weeks in advance which nodes will become PRNs, they could prepare targeted DDoS attacks.
Ideally:
Epoch N
↓
Current PRNs operate
↓
Near the end of Epoch N
↓
Sufficient cryptographic information becomes available
↓
Epoch N+1 PRNs become determinable
This minimizes the window available for preparing targeted attacks.
9. Identity
This is one of the most difficult aspects of the proposal.
An attacker could create:
10,000 virtual nodes
and artificially increase the probability of election.
This is a Sybil attack.
RPRS therefore requires some form of Sybil resistance.
Possible approaches to investigate include:
A. Identity Proof of Work
A candidate demonstrates computational work to register its candidacy.
B. Operational History
Nodes must build a verifiable reputation over time.
C. Economic Bond
A participant temporarily locks BCH.
D. Combined Criteria
A more robust solution may combine several independent signals.
None of these mechanisms should grant consensus authority.
10. Term Duration
As an initial research value, this proposal suggests:
Epoch = 6 hours
rather than 24 hours.
The reason is straightforward:
24 hours may be a relatively long period if a selected set experiences operational or security problems.
With six-hour epochs:
4 sets/day
With one-hour epochs:
24 sets/day
The optimal duration should be determined experimentally.
11. Consecutive-Term Restriction
A PRN should not remain continuously within the priority set.
For example:
If a node participates in Epoch N:
it cannot participate in Epoch N+1.
Optionally:
it may be excluded from the following K epochs.
This enforces rotation.
For example:
Epoch 100
A B C D E
Epoch 101
F G H I J
Epoch 102
K L M N O
Node A may become eligible again later.
12. A Committee, Not a Master
RPRS must never select only one server.
It must select a set.
For example:
64 global PRNs
The selection process should seek network diversity and avoid excessive concentration within a single ASN, provider, or network region.
The exact number must be experimentally determined.
A larger set provides:
- greater redundancy;
- greater attack resistance;
- less influence per individual participant.
However, it also produces:
- greater overhead;
- greater complexity;
- more connections.
13. Network Diversity
A serious design failure would be selecting:
64 servers
of which:
50 are hosted by the same cloud provider.
That would provide only nominal decentralization.
The selection mechanism should seek diversity across characteristics such as:
- ASN;
- network prefixes;
- observable latency;
- P2P topology;
- jurisdiction or geographic region, when such information can be inferred without introducing a centralized authority.
Exact geographic location should not be required.
14. PRN Privacy
The original idea of keeping PRN addresses completely secret is difficult to achieve in an open P2P network.
If other participants must connect to a PRN, its address will eventually become observable.
Therefore, the realistic objective should not be:
Secret PRNs.
Instead, it should be:
PRNs that are difficult to predict before election and that can be rapidly replaced.
This distinction is important.
15. Transaction Relay
When a node receives a new valid transaction:
- it performs normal local validation;
- it sends the transaction to conventional P2P peers;
- it may simultaneously send it to known PRNs;
- PRNs rapidly propagate it to other PRNs;
- PRNs close to miners relay the transaction onward.
No confirmation is created by this process.
It is only relay acceleration.
16. Block Relay
When a miner discovers a block:
Miner
|
+→ conventional peers
|
+→ PRNs
|
+→ global PRNs
|
+→ miners
+→ full nodes
The primary objective is to reduce:
Time To Mining Majority (TTMM)
That is, the time between discovery of a block and the point at which a majority of relevant hashpower can begin mining on top of that block.
For Faster Blocks, this metric may be more relevant than simply measuring when 50% of all full nodes have received the block.
17. Compact Block Relay
RPRS should primarily operate with Compact Block Relay.
Rather than retransmitting all transactions:
BLOCK
TX1
TX2
TX3
...
TX10000
the system can transmit substantially smaller block reconstruction information:
HEADER
TX-ID
TX-ID
TX-ID
...
If mempools are sufficiently synchronized, the receiver already possesses most transactions required to reconstruct the block.
This can dramatically reduce the amount of data required for propagation.
18. Mempool Synchronization
RPRS could optionally improve synchronization between mempools.
This is particularly relevant to Compact Block Relay.
The larger the intersection:
Mempool A ∩ Mempool B
the fewer missing transactions need to be requested during block reconstruction.
Therefore:
better synchronization
↓
fewer missing transactions
↓
fewer network round trips
↓
faster block propagation
19. Relationship to Faster Blocks
RPRS does not depend on Faster Blocks.
It can be implemented and tested while Bitcoin Cash still uses a 10-minute target interval.
This property is important.
A safe development sequence could be:
PHASE 1
Experimental RPRS
10-minute blocks
PHASE 2
Measure propagation
PHASE 3
Optimize RPRS
PHASE 4
Faster Blocks on test network
PHASE 5
Compare:
60-second blocks without RPRS
vs.
60-second blocks with RPRS
Only after these experiments should consensus changes be considered.
20. Metrics
The project should publish objective measurements.
Transaction Relay
Block Relay
- time to 50% of PRNs;
- time to 90%;
- time to 95%;
- time to relevant hashpower.
Compact Blocks
- missing transaction rate;
- reconstruction time;
- fallback rate.
Resilience
Simulate simultaneous loss of:
10% of PRNs
25%
50%
75%
100%
The final test is mandatory.
With:
100% OF RPRS OFFLINE
the Bitcoin Cash blockchain must continue operating.
21. Attacks
Sybil Attack
An attacker creates thousands of candidate nodes.
Possible mitigation:
eligibility requirements combined with a Sybil-resistance mechanism.
DDoS
An attacker identifies PRNs and attempts to disable them.
Possible mitigations:
- multiple PRNs;
- low predictability of future elections;
- short epochs;
- automatic failover;
- continued operation of the conventional P2P network.
Eclipse Attack
An attacker attempts to control the peers of a PRN.
Possible mitigations:
- peer diversity;
- ASN diversity;
- independent outbound connections;
- limits per network origin.
Collusion
Several PRNs cooperate maliciously.
Their impact remains limited because PRNs have no consensus authority.
Full nodes continue validating everything independently.
Censorship
PRNs refuse to relay a particular transaction.
The transaction can still propagate through the conventional P2P network.
Therefore:
RPRS censors TX
|
X
|
Conventional P2P
|
v
Miner
RPRS cannot guarantee censorship.
Invalid Transaction Relay
A PRN relays an invalid transaction.
Every receiving node independently validates the transaction.
Result:
normal rejection.
22. Incentives
Initially, RPRS should not introduce a new token, block reward, or protocol-level payment.
Participation should be voluntary.
Possible motivations include:
- mining pools seeking faster propagation;
- exchanges seeking better connectivity;
- BCH businesses seeking stronger infrastructure;
- node operators wishing to contribute to the network;
- commercial services operating PRNs.
Only if voluntary participation proves insufficient should protocol-level economic incentives be investigated.
23. Compatibility
Legacy nodes:
continue to operate normally.
RPRS-capable nodes may enable:
RPRS_ENABLED=1
and use the additional relay layer.
If a node does not recognize RPRS messages, it simply ignores them.
No rule governing transaction or block validity should depend on RPRS.
24. Mandatory Architectural Property
The following expression must remain true:
Consensus(BCH | RPRS=OFF)
=
Consensus(BCH | RPRS=ON)
In other words:
the valid final state of the blockchain must be independent of the existence of RPRS.
RPRS changes only:
latency
not:
truth.
25. Conceptual Comparison With PIX
Brazil’s PIX payment system achieves very low latency through coordinated and centralized financial infrastructure.
RPRS attempts to obtain some of the communication advantages of coordinated infrastructure without transferring monetary or consensus authority to priority relay servers.
Conceptually:
PIX
Central institution
|
Coordinated infrastructure
|
Settlement / authoritative system
|
Transaction
RPRS:
Bitcoin Cash
|
+------+------+
| |
P2P RPRS
| |
+------+------+
|
Nakamoto
Consensus
|
PoW
The fast layer helps transport information.
It does not determine which information constitutes consensus.
26. Difference From Proof of Stake
RPRS is not Proof of Stake.
PRNs:
- do not produce blocks because of their privileged status;
- do not determine the chain tip;
- have no consensus vote;
- do not finalize transactions;
- do not replace miners.
Even if an economic mechanism is eventually used for Sybil resistance, this does not convert Bitcoin Cash consensus into Proof of Stake.
Consensus remains Proof of Work.
27. Security Objective
RPRS should follow this principle:
Optimization must fail open.
If the optimization fails, the network automatically falls back to conventional P2P operation.
Never:
RPRS unavailable
↓
BCH unavailable
Always:
RPRS unavailable
↓
BCH loses only the acceleration
↓
normal P2P operation continues
28. Experimental Plan
Stage A — Simulation
Create a simulator with, for example:
1,000 virtual nodes
Vary:
- latency;
- bandwidth;
- packet loss;
- number of PRNs;
- topological distribution.
Stage B — Private Test Network
For example:
100 nodes
distributed across multiple regions and infrastructure providers.
Measure conventional relay against RPRS.
Stage C — BCH Testnet / Chipnet
Implement RPRS as an optional protocol.
No consensus changes.
Stage D — Stress Testing
Simulate:
- DDoS;
- Sybil attacks;
- malicious PRNs;
- 50% of PRNs offline;
- 100% of PRNs offline;
- intercontinental connectivity loss;
- unsynchronized mempools.
Stage E — Faster Blocks Testing
Experiment with target intervals such as:
600 s
300 s
120 s
90 s
60 s
30 s
Measure stale rate and propagation performance both with and without RPRS.
29. Success Criteria
RPRS should advance only if it simultaneously demonstrates:
-
significant reduction in propagation time;
-
no additional consensus authority;
-
no mandatory dependency on RPRS;
-
reasonable Sybil resistance;
-
sufficient participant diversity;
-
automatic failover;
-
measurable benefit to Faster Blocks;
-
no permanent structural advantage for specific participants.
30. Open Questions
Before a final specification can be proposed, the following questions must be answered:
-
How can a Sybil-resistant identity mechanism be built without introducing an authority?
-
How many PRNs should exist?
-
What should the epoch duration be?
-
How can node capacity be measured without allowing manipulation?
-
How can concentration within a single ASN or cloud provider be prevented?
-
How can non-manipulable election randomness be generated?
-
How far in advance should the next PRN set become known?
-
How can malicious behavior be discouraged without creating a governance authority?
-
Should there be an economic incentive?
-
How should the system measure its actual effect on relevant mining hashpower?
-
What level of propagation improvement would justify the additional complexity?
31. Primary Hypothesis
This Proto-CHIP proposes testing the following hypothesis:
An optional P2P layer composed of rotating, automatically selected, non-authoritative, high-performance relay nodes can significantly reduce Bitcoin Cash propagation latency without modifying its consensus model or creating permanently privileged network participants.
32. Final Principle
This proposal is not intended to create rulers within Bitcoin Cash.
Using the analogy of temporary “thrones,” these participants do not govern.
They are better understood as:
Temporary messengers positioned on the fastest roads of the network.
Proof of Work continues to determine the chain.
Full nodes continue to independently determine what they consider valid under the consensus rules.
Any participant must remain able to use Bitcoin Cash without RPRS.
RPRS accelerates communication; it does not alter authority over the money.