Hashgraph-like Consensus
A lightweight Rust library for making binary decisions in peer-to-peer or gossipsub networks. Perfect for group governance, voting systems, or any scenario where you need distributed agreement.
Features
- Fast - Reaches consensus in O(log n) rounds
- Byzantine fault tolerant - Correct even if up to 1/3 of peers are malicious
- Pluggable storage - In-memory by default; implement
ConsensusStoragefor persistence - Pluggable signing - Default ECDSA-secp256k1 via
EthereumConsensusSigner; implementConsensusSignatureSchemefor Ed25519, HSMs, or any custom scheme - Network-agnostic - Works with both Gossipsub (fixed 2-round) and P2P (dynamic rounds) topologies
- Event-driven - Subscribe to consensus outcomes via a broadcast event bus
- Cryptographic integrity - Votes are signed and chained in a hashgraph structure
Based on the Hashgraph-like Consensus Protocol RFC.
Installation
Add to your Cargo.toml:
[]
= { = "https://github.com/vacp2p/hashgraph-like-consensus" }
Quick Start
use ;
use PrivateKeySigner;
async
Core Concepts
Scopes and Proposals
A scope groups related proposals together and carries default configuration (network type, threshold, timeout). Proposals inherit scope defaults unless overridden individually.
Scope (group / channel)
+-- ScopeConfig (defaults for all proposals)
+-- Proposals
+-- Proposal 1 -> Session (inherits scope config)
+-- Proposal 2 -> Session (inherits scope config)
+-- Proposal 3 -> Session (overrides scope config)
Network Types
| Type | Rounds | Behavior |
|---|---|---|
| Gossipsub (default) | Fixed 2 rounds | Round 1 = proposal broadcast, Round 2 = all votes |
| P2P | Dynamic ceil(2n/3) |
Each vote advances the round by one |
Architecture
ConsensusService is the single entry point. All consensus business logic
lives there. It is generic over three pluggable backends:
ConsensusStorage— where sessions and votes are persisted (in-memory, database, etc.)ConsensusEventBus— how consensus events are delivered (broadcast channel, message queue, etc.)ConsensusSignatureScheme— how votes are signed and verified (ECDSA-secp256k1 by default, or your own scheme)
Use service.storage() for reads, queries, and cleanup.
Use service.event_bus() for event subscription.
Service shape: one service vs. per-scope services
The default pattern is one ConsensusService, many scopes — the service
multiplexes proposals across independent decision streams. All scopes share
one storage backend and one event bus; subscribers see (Scope, ConsensusEvent)
pairs from every scope.
For per-scope concerns (per-conversation in de-mls, per-channel in chat apps,
per-room in collaboration tools) you can construct one service per scope.
Storage backends are Clone and Arc-backed internally, so multiple services
can share the same backing data while each owns an independent event bus:
use ;
use PrivateKeySigner;
// Shared storage across all conversations.
let storage = new;
// This peer's signer — built once and cloned into each conversation's service.
let signer = new;
// One service per conversation, each with its own event bus.
let conv_a: =
new_with_components;
let conv_b: =
new_with_components;
// Each conversation's subscribers only see its own events — no filtering needed.
let mut events_a = conv_a.event_bus.subscribe;
let mut events_b = conv_b.event_bus.subscribe;
The same shape works for DB-backed storage: build one Pool/connection-bearing
storage value, clone it for each per-scope service.
Cost of scope indexing. Scope is the partition key in storage; the overhead is negligible.
- In-memory: the outer
HashMap<Scope, _>adds roughly 50 bytes per scope plus a small inner allocation. At 1000 scopes that's tens of kilobytes total. - Database: the
scope_idcolumn you'd want anyway for any multi-tenant table becomes a partition key. Point lookups (get_session) are identical speed to a flat namespace;list_scope_sessionsanddelete_scopebecome indexed range scans instead of full-table filters.
What the Library Does vs. What You Do
This library handles consensus calculation — vote validation, hashgraph chain verification, threshold math, and liveness rules. It does not handle orchestration. Your application is responsible for:
| Responsibility | Why |
|---|---|
| Network propagation | The library performs no I/O. When you create a proposal or cast a vote, you must gossip it to peers yourself. When a message arrives from the network, call process_incoming_proposal or process_incoming_vote. |
| Timeout scheduling | The library does not spawn timers. You must schedule a timer for each proposal (using consensus_timeout() from the config) and call handle_consensus_timeout when it fires. Without this, proposals with offline voters stay Active forever. |
expected_voters_count accuracy |
This value drives all threshold math (ceil(2n/3) quorum, silent peer counting). If it doesn't match the actual group size, consensus results will be wrong. |
| Signer management | You construct each ConsensusService with the peer's ConsensusSignatureScheme value (e.g. EthereumConsensusSigner::new(private_key)). cast_vote uses that held signer. Each identity may vote at most once per proposal. |
| Proposal ID tracking | The library generates a proposal_id on creation. You must store it and pass it to every subsequent call (cast_vote, handle_consensus_timeout, etc.). |
| Session eviction awareness | The default service keeps at most 10 sessions per scope (configurable via new_with_max_sessions). Older sessions are silently dropped when the limit is exceeded. Archive results before they are evicted. |
API Reference
Creating a Service
use ;
use PrivateKeySigner;
let signer = new;
// In-memory storage + broadcast events + this peer's signer. 10 sessions per scope.
let service = new;
// Custom session limit (still the Ethereum default scheme).
let service = new_with_max_sessions;
// Fully custom: plug in your own storage, event bus, signer, and signature scheme.
let service: =
new_with_components;
signer is held inside the service and used for every outgoing vote — see
Casting and Processing Votes. Access via
service.signer() if you need its identity bytes (e.g. for proposal owner
fields).
Configuring a Scope
use ;
use Duration;
let service = default;
let scope = from;
// Initialize with the builder
service
.scope
.await?
.with_network_type
.with_threshold
.with_timeout
.with_liveness_criteria
.initialize
.await?;
// Update later (single field)
service
.scope
.await?
.with_threshold
.update
.await?;
Built-in presets are also available:
// High confidence (threshold = 0.9)
service.scope.await?.strict_consensus.initialize.await?;
// Low latency (threshold = 0.6, timeout = 30 s)
service.scope.await?.fast_consensus.initialize.await?;
Working with Proposals
// Create a proposal
let proposal = service
.create_proposal
.await?;
// Process a proposal received from the network
service.process_incoming_proposal.await?;
Casting and Processing Votes
// Cast your vote (yes = true, no = false) using the service's held signer.
let vote = service.cast_vote.await?;
// Cast a vote and get the updated proposal (useful for gossiping).
let proposal = service
.cast_vote_and_get_proposal
.await?;
// Process a vote received from the network (uses the service's scheme to verify).
service.process_incoming_vote.await?;
Reading State (via Storage)
All reads go through service.storage():
use ConsensusStorage;
// Get the consensus result for a proposal (Ok(true) = YES, Ok(false) = NO)
let result: bool = service.storage.get_consensus_result.await?;
// Get a proposal by ID
let proposal = service.storage.get_proposal.await?;
// List active proposals (empty Vec if none)
let active: = service.storage.get_active_proposals.await?;
// List finalized proposals (proposal_id -> result)
let reached: = service.storage.get_reached_proposals.await?;
// Delete all state for a scope (e.g. when a user leaves a group)
service.storage.delete_scope.await?;
Handling Timeouts
The library does not schedule timeouts automatically. Your application must set up a timer for each proposal and call
handle_consensus_timeoutwhen it fires. Without this, proposals with offline voters will stayActiveforever and the silent-peer liveness logic will never run.
When handle_consensus_timeout is called, silent peers (those who never voted)
are counted toward quorum so that the liveness_criteria_yes flag can take effect:
liveness_criteria_yes = true— silent peers are counted as YES votes. A proposal passes unless there are enough explicit NO votes to block it.liveness_criteria_yes = false— silent peers are counted as NO votes. A proposal fails unless there are enough explicit YES votes to carry it.
The only case where timeout produces no result is a tie (equal YES and NO weight after counting silent peers), which marks the session as failed.
// Schedule a timeout (typically via tokio::time::sleep)
sleep.await;
match service.handle_consensus_timeout.await
During normal voting (before timeout), the quorum gate still requires ceil(2n/3)
actual votes — silent peers are not counted until timeout.
Subscribing to Events
use ConsensusEventBus;
use ConsensusEvent;
let mut rx = service.event_bus.subscribe;
spawn;
Statistics
let stats = service.get_scope_stats.await;
println!;
Advanced Usage
Custom Storage
Implement the ConsensusStorage trait to persist proposals to a database.
You only need to implement the primitive methods — query helpers like
get_consensus_result, get_active_proposals, and get_reached_proposals
are provided as default implementations for free.
use ConsensusStorage;
// Required primitives (you implement these):
// save_session, get_session, remove_session,
// list_scope_sessions, replace_scope_sessions,
// update_session, update_scope_sessions,
// stream_scope_sessions, list_scopes,
// get_scope_config, set_scope_config, update_scope_config,
// delete_scope
//
// Free query helpers (default implementations):
// get_consensus_result, get_proposal, get_proposal_config,
// get_active_proposals, get_reached_proposals
Custom Event Bus
Implement ConsensusEventBus for alternative event delivery:
use ConsensusEventBus;
Custom Signature Scheme
The default EthereumConsensusSigner uses ECDSA-secp256k1 with 20-byte
Ethereum addresses, matching the historical behavior of the crate. To
integrate Ed25519, an HSM, or any other scheme, implement
ConsensusSignatureScheme:
use ;
The same type plays both roles: a value carries private state for signing, and the type itself is used statically by the service for verification. All peers on a network must agree on the scheme type. Pick it at service construction:
use ;
type MyService = ;
See tests/custom_scheme_tests.rs for a working non-Ethereum example.
Utility Functions
The utils module provides low-level helpers for advanced use cases:
| Function | Description |
|---|---|
build_vote::<Signer>() |
Create a signed vote linked into the hashgraph chain |
compute_vote_hash() |
Compute the deterministic hash of a vote |
validate_proposal::<Signer>() |
Validate a proposal and all its votes against a signature scheme |
calculate_consensus_result() |
Determine result from collected votes using threshold and liveness rules |
has_sufficient_votes() |
Quick threshold check (count-based) |
The generic Signer parameter on build_vote / validate_proposal /
validate_vote selects which ConsensusSignatureScheme to use; pick it via
turbofish or inference at the call site.
Building
# Build
# Run tests
# Generate docs
Note: Requires a working
protoc(Protocol Buffers compiler) since the library generates code from.protofiles at build time.