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>
58 lines
2.6 KiB
Python
58 lines
2.6 KiB
Python
import numpy as np
|
|
import pytest
|
|
|
|
from blend.config import SimConfig
|
|
from blend.graph import build_graph, build_regular_edges
|
|
|
|
|
|
@pytest.mark.parametrize("n,degree", [(10, 1), (10, 2), (10, 3), (100, 4), (100, 7),
|
|
(1000, 8), (500, 16), (256, 15)])
|
|
def test_exactly_d_regular_simple_undirected(n, degree):
|
|
rng = np.random.default_rng(0)
|
|
edges = build_regular_edges(n, degree, rng)
|
|
deg = np.bincount(edges.ravel(), minlength=n)
|
|
assert np.all(deg == degree), "every node must have exactly `degree` peers"
|
|
assert np.all(edges[:, 0] < edges[:, 1]), "no self-loops; canonical u<v"
|
|
# no duplicate undirected edges
|
|
keys = edges[:, 0] * n + edges[:, 1]
|
|
assert len(np.unique(keys)) == len(keys), "graph must be simple"
|
|
assert edges.shape[0] == n * degree // 2
|
|
|
|
|
|
def test_graph_symmetric_and_connected():
|
|
g = build_graph(SimConfig(n_nodes=2000, degree=6))
|
|
assert np.all(np.diff(g.indptr) == g.degree)
|
|
csr = g.weighted_csr(np.ones_like(g.base))
|
|
assert (csr != csr.T).nnz == 0, "adjacency must be symmetric"
|
|
from scipy.sparse.csgraph import connected_components
|
|
ncomp, _ = connected_components(csr, directed=False)
|
|
assert ncomp == 1, "degree>=3 random d-regular should be connected"
|
|
|
|
|
|
def test_reconstructible_from_seed():
|
|
a = build_graph(SimConfig(n_nodes=1000, degree=8, graph_seed=7))
|
|
b = build_graph(SimConfig(n_nodes=1000, degree=8, graph_seed=7))
|
|
assert np.array_equal(a.indptr, b.indptr)
|
|
assert np.array_equal(a.indices, b.indices)
|
|
assert np.array_equal(a.base, b.base)
|
|
assert np.array_equal(a.p, b.p)
|
|
c = build_graph(SimConfig(n_nodes=1000, degree=8, graph_seed=8))
|
|
assert not np.array_equal(a.indices, c.indices), "different seed -> different topology"
|
|
|
|
|
|
def test_topology_invariant_to_adversary_and_blend_fields():
|
|
a = build_graph(SimConfig(n_nodes=800, degree=6, graph_seed=1, f_adv=0.0, blend_hops=2))
|
|
b = build_graph(SimConfig(n_nodes=800, degree=6, graph_seed=1, f_adv=0.4,
|
|
blend_hops=5, adversary_mode="worstcase_coverage"))
|
|
assert np.array_equal(a.indices, b.indices)
|
|
assert np.array_equal(a.p, b.p)
|
|
|
|
|
|
def test_processing_lags_follow_distribution():
|
|
g = build_graph(SimConfig(n_nodes=20000, degree=6,
|
|
processing_lags_ms=(10.0, 50.0, 100.0),
|
|
processing_lag_probs=(0.5, 0.4, 0.1)))
|
|
for lag, prob in zip((10.0, 50.0, 100.0), (0.5, 0.4, 0.1), strict=True):
|
|
frac = np.mean(g.p == lag)
|
|
assert abs(frac - prob) < 0.03, f"lag {lag}: {frac:.3f} vs {prob}"
|