mirror of
https://github.com/logos-blockchain/research.git
synced 2026-08-07 11:43:20 +00:00
f51630e509
The study started as a peering-degree question and grew well past it: propagation, adversary exposure, deanonymization and time-to-link, reliability under uniform and correlated churn, messaging redundancy, and cover traffic. The pd name no longer describes it. tools/simulators/blend/pd/ -> tools/simulators/blend/, package src/pd -> src/blend, and reports/blend/pd/ -> reports/blend/. Moved with git mv so history follows. The text substitutions are deliberately narrow. pd is also the conventional pandas alias, and pandas genuinely has a pd.plotting submodule, so a blanket pd. -> blend. rewrite would have corrupted four files. Only package-unambiguous forms were changed: from pd.X, -m pd.X, pd.<our module>, PD_BYTES_BUDGET, src/pd, and the pyproject name. All four import pandas as pd lines are untouched and verified. Both READMEs reframed: peering degree is now presented as the primary axis that ties the others together rather than as the subject, and the relative links, which lost a directory level in the move, are corrected. Verified after the move: ruff clean, 101 tests, 45 verify anchors, make targets, the script shims, an end-to-end smoke run, and data/report_numbers.py still reproducing the report tables from the checked-in evidence. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
37 lines
1.9 KiB
YAML
37 lines
1.9 KiB
YAML
# Cover traffic: the anonymity set it buys, and the stake concentration it tolerates.
|
|
#
|
|
# Every node emits on its own uniformly-chosen slots at rate cover_rate_mult/N, so the default of
|
|
# 1.0 puts one emission per second on the whole network. Winning the block lottery consumes the
|
|
# next scheduled cover, which is what keeps every node's emission COUNT identical whether or not it
|
|
# produces blocks -- the property cover traffic exists to buy.
|
|
#
|
|
# Two things are measured. On a timeline: blending, the broadcasts a relay saw between consecutive
|
|
# releases (the anonymity set, since an observer cannot tell which one it forwarded), against
|
|
# mixing, the messages it held at once. At the baseline rate mixing is essentially nil, so the rate
|
|
# is swept over three decades to find where per-relay mixing actually begins. Over an epoch: which
|
|
# nodes win more proposals than their emission quota and so cannot stay uniform.
|
|
#
|
|
# max_blend_delay is swept alongside the rate because delay is the cheaper lever -- blending is
|
|
# rate*(2M+1)/3, so a longer release interval multiplies the anonymity set without adding a single
|
|
# message to the wire. The cost of that delay is priced in section 3.1.
|
|
n_nodes: [20000]
|
|
degree: [8]
|
|
blend_hops: [3]
|
|
max_blend_delay: [3, 10, 30]
|
|
unresponsive_frac: [0.0]
|
|
cover_rate_mult: [1.0, 4.0, 16.0, 64.0, 256.0]
|
|
f_adv: [0.2]
|
|
adversary_mode: [random]
|
|
seeds: 4
|
|
base:
|
|
# heavy-tailed stake is what makes the quota ceiling bite: the head sits orders of magnitude
|
|
# above it while the tail sits far below, so the breakpoint is measurable rather than assumed.
|
|
stake_dist: zipf
|
|
stake_zipf_a: 1.0
|
|
stake_inference_ratio: 1.0 # D_hat/D from the consensus study; 1.0 = an accurate estimator
|
|
block_interval_slots: 30
|
|
slots_per_epoch: 648000
|
|
traffic_window_slots: 900
|
|
n_rounds: 20 # propagation is not the subject here; keep it cheap
|
|
n_placements: 1
|