mirror of
https://github.com/logos-blockchain/research.git
synced 2026-08-07 11:43:20 +00:00
6ad63ce2f3
Static-graph simulator quantifying how a node's peering degree trades off propagation speed, adversary exposure, deanonymization, and reliability in the Blend network. Scales to 1e6 nodes (sparse CSR + sampled Dijkstra); the adversary and deanonymization metrics are exact at every N. Model (ms): seeded d-regular peer graph (matching-union), Blend cascade (sender -> blend_hops timed-release mix relays -> final flood), geographic link base + exponential transport jitter, per-node processing lag, free-running release-clock mixing. Metrics: - propagation: full-delay mean/p50/p90/p99, path/broadcast split, coverage times - reliability: message success-delivery-rate ~ (1-unresponsive_frac)^blend_hops and flood coverage, with unresponsive nodes modelled as routing holes - adversary (exact): observed/eclipsed fractions, random + worst-case placement - deanonymization (exact): P(whole blend path adversarial) ~ f_adv^blend_hops, and full deanonymization (path adversarial AND honest sender peered with an adversary) = deanon_rate * observed_frac Deterministic blake2b seed streams, three parquet tables, joblib parallelism, memguard, an analytic verify harness, 50 unit tests, and an auto-installing Makefile. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
15 lines
429 B
YAML
15 lines
429 B
YAML
# Internet-scale: N up to 1e6. Propagation is sampled (n_rounds); adversary metrics are exact.
|
|
# Worst-case placement is capped (worstcase_max_n) so only `random` runs at 1e6.
|
|
n_nodes: [100000, 1000000]
|
|
degree: [4, 6, 8, 12, 16]
|
|
blend_hops: [3]
|
|
max_blend_delay: [3]
|
|
unresponsive_frac: [0.0, 0.1, 0.2, 0.5]
|
|
f_adv: [0.1, 0.2, 0.33]
|
|
adversary_mode: [random]
|
|
seeds: 3
|
|
base:
|
|
n_rounds: 64
|
|
n_placements: 3
|
|
worstcase_max_n: 100000
|