Expand description
Tunable parameters for the replication subsystem.
All values below are a reference profile used for logic validation. Parameter safety constraints (Section 4):
1 <= QUORUM_THRESHOLD <= CLOSE_GROUP_SIZE- Effective paid-list threshold is per-key dynamic:
ConfirmNeeded(K) = floor(PaidGroupSize(K)/2)+1 - If constraints are violated at runtime reconfiguration, node MUST reject the config.
Structs§
- Replication
Config - Runtime-configurable replication parameters.
Constants§
- AUDIT_
FAILURE_ TRUST_ WEIGHT - Trust event weight for confirmed audit failures.
- AUDIT_
ON_ GOSSIP_ COOLDOWN_ SECS - Per-peer cooldown between gossip-triggered subtree audits (ADR-0002), in seconds. Bounds how often any one peer is audited regardless of gossip rate.
- AUDIT_
ON_ GOSSIP_ PROBABILITY - Probability of launching a subtree audit when a peer’s changed commitment is ingested via gossip (ADR-0002). Keeps audits occasional surprise exams.
- AUDIT_
SPOTCHECK_ COUNT - Number of subtree leaves spot-checked against real chunk bytes per audit (ADR-0002 real-bytes layer).
- AUDIT_
TICK_ INTERVAL_ MAX - Audit scheduler cadence range (max).
- AUDIT_
TICK_ INTERVAL_ MIN - Audit scheduler cadence range (min).
- BOOTSTRAP_
CLAIM_ GRACE_ PERIOD - Maximum duration a peer may claim bootstrap status before penalties apply.
- FETCH_
REQUEST_ TIMEOUT - Fetch request timeout.
- FRESH_
REPLICATION_ DELIVERY_ MAX_ RETRIES - Best-effort delivery retries for a fresh-replication push, per peer.
- K_
BUCKET_ SIZE - Maximum number of peers per k-bucket in the Kademlia routing table.
- MAX_
AUDIT_ RESPONSES_ PER_ PEER - Maximum concurrent in-flight audit-responder tasks from any SINGLE peer.
- MAX_
BYTE_ CHALLENGE_ KEYS - Maximum keys per round-2
SubtreeByteChallenge(per-batch cap). - MAX_
CONCURRENT_ AUDIT_ RESPONSES - Maximum number of concurrent in-flight audit-responder tasks.
- MAX_
CONCURRENT_ REPLICATION_ SENDS - Maximum number of concurrent outbound replication sends.
- MAX_
PRUNE_ AUDIT_ CHALLENGES_ PER_ PASS - Maximum number of prune-confirmation audit challenges sent per prune pass.
- MAX_
REPLICATION_ MESSAGE_ SIZE - Maximum replication wire message size.
- NEIGHBOR_
SYNC_ COOLDOWN - Per-peer minimum spacing between successive syncs with the same peer.
- NEIGHBOR_
SYNC_ INTERVAL_ MAX - Neighbor sync cadence range (max).
- NEIGHBOR_
SYNC_ INTERVAL_ MIN - Neighbor sync cadence range (min).
- NEIGHBOR_
SYNC_ PEER_ COUNT - Number of close-neighbor peers synced concurrently per round-robin repair round.
- NEIGHBOR_
SYNC_ SCOPE - Number of closest peers to self eligible for neighbor sync.
- PAID_
LIST_ CLOSE_ GROUP_ SIZE - Maximum number of closest nodes tracking paid status for a key.
- PENDING_
VERIFY_ MAX_ AGE - Maximum age for pending-verification entries before stale eviction.
- POSSESSION_
CHECK_ DELAY_ MAX - Upper bound of the possession-check delay (ADR-0003).
- POSSESSION_
CHECK_ DELAY_ MIN - Lower bound of the delay before a fresh-replication possession check runs (ADR-0003).
- PRUNE_
HYSTERESIS_ DURATION - Minimum continuous out-of-range duration before pruning a key.
- QUORUM_
THRESHOLD - Full-network target for required positive presence votes.
- REPAIR_
HINT_ MIN_ AGE - Minimum age for a replica repair hint before the hinted peer can be audited for that key.
- REPLICATION_
PROTOCOL_ ID - Protocol identifier for replication operations.
- SELF_
LOOKUP_ INTERVAL_ MAX - Periodic self-lookup cadence range (max).
- SELF_
LOOKUP_ INTERVAL_ MIN - Periodic self-lookup cadence range (min) to keep close neighborhood current.
- STORAGE_
ADMISSION_ MARGIN - Extra local-routing-table positions accepted for local chunk storage admission and stored-record pruning.
- SUBTREE_
AUDIT_ TIMEOUT_ LEAF_ HINT - Conservative leaf-count hint for sizing the subtree-audit response deadline.
- VERIFICATION_
REQUEST_ TIMEOUT - Verification request timeout (per-batch).
Functions§
- max_
parallel_ fetch - Returns the number of hardware threads available, used as the fetch concurrency limit.
- storage_
admission_ width - Width used when deciding whether this node may locally store or retain a chunk.