mirror of
https://github.com/logos-blockchain/research.git
synced 2026-08-07 19:53:10 +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>
25 lines
1.1 KiB
YAML
25 lines
1.1 KiB
YAML
# Churn-percolation study: where does the responsive sub-graph shatter?
|
|
#
|
|
# Unresponsive nodes relay nothing, so the network that actually carries a flood is the sub-graph
|
|
# induced on the responsive nodes. That is site percolation on a random d-regular graph, which has
|
|
# a giant component only while the responsive fraction exceeds 1/(degree-1) -- i.e. the network
|
|
# survives churn up to u_c = 1 - 1/(degree-1). This config walks u across that threshold for every
|
|
# degree to locate the collapse (degree 3 breaks at 0.5, degree 6 at 0.8, degree 16 at 0.93).
|
|
#
|
|
# blend_hops=1 isolates the flood (one relay, no extra path fragility) and keeps the cost low;
|
|
# 800 rounds x 8 seeds = 6400 rounds per cell. Coverage right AT the threshold is genuinely
|
|
# bimodal across topologies (critical behaviour), so seed spread there is physics, not noise.
|
|
n_nodes: [100000]
|
|
degree: [3, 4, 6, 8, 12, 16]
|
|
blend_hops: [1]
|
|
max_blend_delay: [0]
|
|
unresponsive_frac: [0.0, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9]
|
|
redundancy: [1]
|
|
f_adv: [0.1]
|
|
adversary_mode: [random]
|
|
seeds: 8
|
|
base:
|
|
n_rounds: 800
|
|
n_placements: 1
|
|
worstcase_max_n: 100000
|