mirror of
https://github.com/logos-blockchain/research.git
synced 2026-08-07 19:53:10 +00:00
§3.2 rested on 5 unpaired replicates while §3.2a used a paired design. Re-running the delta_max 4/8/16/32 grid with common random numbers and 20 replicates (configs/countable-vs-old-paired.yaml) changes the answer at the design end. The cost is resolved at EVERY delay and grows monotonically with load: delta_max=4 (rho 0.36) -0.0013 t= 4.0 (unpaired: not resolved) delta_max=8 (rho 0.56) -0.0034 t= 9.8 (unpaired: not resolved) delta_max=16 (rho 0.96) -0.0102 t=17.5 delta_max=32 (rho 1.76) -0.0228 t=22.4 So §3.2's claim that "at the operating loads (rho < 1) no difference between the models is detectable at all" was an artefact of the weak design, not a property of the system. There is a difference; it is just small — 0.13% and 0.34% at the two sub-unit loads. The new delta_max=4 figure (-0.0013 at 20 reps) independently reproduces §3.2a's (-0.0011 at 40 reps) from a separate sweep. 11 of 12 U>=1 cells resolve individually; max t = 29.0 against a Bonferroni threshold of 2.87 for twelve tests. The U=0 control is exact: 80/80 replicate pairs differ by 0.0. New finding at U=1 under overload: the sign FLIPS and the countable rule wins, +0.0127 (t = 7.6), positive in 19 of 20 pairs. Both models have collapsed at rho ~ 1.76 with a single uncle slot, but when capacity is the binding constraint the countable rule's occupied-slot exclusion means its one reference always recovers a NEW slot, while the unrestricted rule dedups by block id and can spend that reference on an orphan whose slot is already counted. Measured recovery agrees: q_u = 0.591 countable vs 0.579 unrestricted. The slot-vs-block distinction of §2.1 is worth most exactly where references are scarcest. Code: paired_gaps and pooled_by_delay move from scripts/plot_fine_delay into figures_pernode so both plot scripts share one implementation; plot_countable_vs_old now detects paired runs and uses the per-replicate difference, falling back to the unpaired two-sample test otherwise. Two hardcoded reporting values fixed — the Bonferroni threshold was pinned to 2.935 and printed nan for any grid that was not 15 cells, and a per-cell comparison line had a hardcoded /15 denominator; both now derive from the grid actually run. Figures 30-32 regenerated from the paired grid. Tests: 214 passed. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
260 lines
12 KiB
Python
260 lines
12 KiB
Python
"""High-precision figures for the LOW mixing-delay band (the design regime).
|
||
|
||
countable-vs-old.yaml samples delay at 4/8/16/32 with 5 replicates. That resolves the
|
||
overload regime but leaves the design regime under-measured: every countable-vs-unrestricted
|
||
gap at delay <= 8 sits inside the replicate noise there, so the only honest statement is
|
||
"no difference detected" — with no bound on how large an undetected difference could be.
|
||
|
||
fine-delay.yaml spends replicates instead of range (delay 1..5, 40 replicates) to turn that
|
||
into a real bound. Consumes:
|
||
|
||
tsi-sweep --config configs/fine-delay.yaml --label fine-countable
|
||
tsi-sweep --config configs/fine-delay.yaml --old --label fine-old
|
||
|
||
and renders (into --out):
|
||
|
||
fine_accuracy_vs_delay equilibrium D/D_true vs delay 1..5, countable (solid) vs
|
||
unrestricted (dashed) per U, replicate-SEM bars.
|
||
fine_gap_vs_delay THE precision figure: the countable - unrestricted gap with 95%
|
||
CIs, against the U=0 negative-control band. A CI straddling zero
|
||
means no difference at this power; the band shows the floor.
|
||
|
||
Usage:
|
||
python scripts/plot_fine_delay.py --countable RUNDIR --old RUNDIR \
|
||
--out figures/fine-delay
|
||
"""
|
||
|
||
from __future__ import annotations
|
||
|
||
import argparse
|
||
from pathlib import Path
|
||
from statistics import NormalDist
|
||
|
||
import matplotlib.pyplot as plt
|
||
import numpy as np
|
||
import pandas as pd
|
||
|
||
from tsi_sim.plotting import style
|
||
from tsi_sim.plotting.figures_pernode import (
|
||
Z95,
|
||
equilibrium,
|
||
paired_gaps,
|
||
pooled_by_delay,
|
||
rho_for,
|
||
sem,
|
||
)
|
||
|
||
DELAY = "blend_delay_max"
|
||
|
||
|
||
def _load(run_dir: str | Path) -> pd.DataFrame:
|
||
return pd.read_parquet(Path(run_dir) / "results.parquet")
|
||
|
||
|
||
def _cells(df: pd.DataFrame) -> pd.DataFrame:
|
||
"""Per (delay, U): replicate mean, SEM and count of the equilibrium accuracy."""
|
||
return equilibrium(df).groupby([DELAY, "max_uncles"], as_index=False).agg(
|
||
mean_ratio=("mean_ratio", "mean"),
|
||
sem_ratio=("mean_ratio", sem),
|
||
n_rep=("mean_ratio", "size"),
|
||
mean_q=("mean_q", "mean"),
|
||
mean_q_eff=("mean_q_eff", "mean"))
|
||
|
||
|
||
def vs_one(cells: pd.DataFrame) -> pd.DataFrame:
|
||
"""Test each U >= 1 cell against the exact target 1.0.
|
||
|
||
An independent read on the same question the gap test asks: the report's claim is that
|
||
uncle recovery restores the equilibrium to EXACTLY the true stake, so a systematic
|
||
shortfall across uncle caps is the first-fork cost seen from the absolute side rather
|
||
than differentially. 40 replicates give ~0.0005 resolution, enough to see 0.1%.
|
||
"""
|
||
u = cells[cells.max_uncles > 0].copy()
|
||
u["dev"] = u.mean_ratio - 1.0
|
||
u["t"] = u.dev / u.sem_ratio.replace(0, np.nan)
|
||
return u.sort_values(["max_uncles", DELAY])
|
||
|
||
|
||
def gaps(cnt: pd.DataFrame, old: pd.DataFrame) -> pd.DataFrame:
|
||
"""countable - unrestricted per cell, with the unpaired SE and 95% CI half-width."""
|
||
m = cnt.merge(old, on=[DELAY, "max_uncles"], suffixes=("_c", "_o"))
|
||
m["gap"] = m.mean_ratio_c - m.mean_ratio_o
|
||
m["se"] = np.hypot(m.sem_ratio_c, m.sem_ratio_o)
|
||
m["ci95"] = Z95 * m.se
|
||
m["t"] = np.where(m.se > 0, np.abs(m.gap) / m.se.replace(0, np.nan), np.inf)
|
||
return m.sort_values(["max_uncles", DELAY])
|
||
|
||
|
||
def fig_accuracy(cnt: pd.DataFrame, old: pd.DataFrame) -> plt.Figure:
|
||
fig, ax = plt.subplots(figsize=(6.4, 4.2))
|
||
for i, u in enumerate(sorted(cnt["max_uncles"].unique())):
|
||
c = style.color_for(i)
|
||
a = cnt[cnt.max_uncles == u].sort_values(DELAY)
|
||
b = old[old.max_uncles == u].sort_values(DELAY)
|
||
ctl = " (control)" if u == 0 else ""
|
||
ax.errorbar(a[DELAY], a.mean_ratio, yerr=a.sem_ratio, fmt="-o", color=c,
|
||
label=f"U={u} countable{ctl}", ms=4, capsize=2, lw=1.2)
|
||
ax.errorbar(b[DELAY], b.mean_ratio, yerr=b.sem_ratio, fmt="--s", color=c,
|
||
label=f"U={u} unrestricted{ctl}", ms=4, capsize=2, alpha=0.75, lw=1.2)
|
||
ax.axhline(1.0, color="0.4", lw=0.8, ls=":")
|
||
ax.set_xlabel("max per-relay mixing delay (slots)")
|
||
ax.set_ylabel(r"equilibrium $\hat{D}/D_{true}$")
|
||
ax.set_title("Design-regime accuracy: countable vs unrestricted referencing")
|
||
ax.legend(ncol=2, fontsize="x-small")
|
||
return fig
|
||
|
||
|
||
def fig_gap(g: pd.DataFrame) -> plt.Figure:
|
||
"""The countable − unrestricted gap with 95% CIs, zoomed to the U >= 1 scale.
|
||
|
||
The U=0 negative control is NOT plotted as a band here: with no uncles the models are
|
||
identical by construction, but the unrecovered regime is so noisy that its CI (±0.025)
|
||
is ~17x the entire range of the U >= 1 gaps and would fill the axes. Its magnitude is
|
||
annotated instead — the point being that the control's noise floor lives far outside
|
||
anything the uncle arms show, so those arms are measuring signal, not spread.
|
||
"""
|
||
fig, ax = plt.subplots(figsize=(6.6, 4.2))
|
||
pooled = pooled_by_delay(g)
|
||
for i, u in enumerate(sorted(g["max_uncles"].unique())):
|
||
if u == 0:
|
||
continue
|
||
a = g[g.max_uncles == u].sort_values(DELAY)
|
||
ax.errorbar(a[DELAY], a.gap, yerr=a.ci95, fmt="-o", color=style.color_for(i),
|
||
label=f"U={u}", ms=4, capsize=3, lw=1.0, alpha=0.75)
|
||
ax.errorbar(pooled[DELAY], pooled.gap, yerr=pooled.ci95, fmt="-D", color="0.15",
|
||
label="pooled over U≥1", ms=5, capsize=4, lw=1.8, zorder=5)
|
||
ax.axhline(0.0, color="0.3", lw=0.9, ls=":")
|
||
ax.set_xlabel("max per-relay mixing delay (slots)")
|
||
ax.set_ylabel(r"$\hat{D}/D$ gap: countable $-$ unrestricted")
|
||
ax.set_title("The first-fork cost across the design band (95% CI)")
|
||
ctl = g[g.max_uncles == 0]
|
||
if len(ctl):
|
||
band = float(ctl.ci95.max())
|
||
span = float(np.abs(np.r_[g[g.max_uncles > 0].gap + g[g.max_uncles > 0].ci95,
|
||
g[g.max_uncles > 0].gap - g[g.max_uncles > 0].ci95]).max())
|
||
ax.set_ylim(-1.35 * span, 1.35 * span)
|
||
# Under pairing the control is exactly 0 in every replicate pair (shared streams), so
|
||
# quoting a CI for it is meaningless; unpaired, the width of that CI is the point.
|
||
note = ("U=0 negative control: exactly 0.0 in all 200 replicate pairs "
|
||
"(shared streams — an identity check, not a noise check)"
|
||
if band == 0.0 else
|
||
f"U=0 negative control (true gap = 0): 95% CI ±{band:.4f}, "
|
||
f"{band / span:.0f}× outside this range")
|
||
ax.text(0.015, 0.03, note, transform=ax.transAxes, fontsize=6.5, alpha=0.75)
|
||
ax.legend(fontsize="x-small", ncol=2)
|
||
return fig
|
||
|
||
|
||
def main() -> None:
|
||
ap = argparse.ArgumentParser(description=__doc__.splitlines()[0])
|
||
ap.add_argument("--countable", required=True, help="run dir of fine-countable")
|
||
ap.add_argument("--old", required=True, help="run dir of fine-old")
|
||
ap.add_argument("--out", default="figures/fine-delay")
|
||
args = ap.parse_args()
|
||
style.apply_style()
|
||
out = Path(args.out)
|
||
out.mkdir(parents=True, exist_ok=True)
|
||
|
||
cnt_raw, old_raw = _load(args.countable), _load(args.old)
|
||
cnt, old = _cells(cnt_raw), _cells(old_raw)
|
||
unpaired = gaps(cnt, old)
|
||
pg = paired_gaps(cnt_raw, old_raw)
|
||
# The paired test supersedes the unpaired one when both arms share their streams: same
|
||
# estimand, far smaller standard error. Keep the unpaired numbers for the variance-
|
||
# reduction report below.
|
||
g = unpaired if pg is None else unpaired.drop(columns=["gap", "se", "ci95", "t"]).merge(
|
||
pg[[DELAY, "max_uncles", "gap", "se", "ci95", "t"]], on=[DELAY, "max_uncles"])
|
||
prov = ("tsi-sim-pernode fine-delay%s.yaml (+--old)"
|
||
% ("-paired" if pg is not None else ""))
|
||
|
||
# rho per delay, derived (never hand-substituted) — these are the report's axis labels.
|
||
delays = sorted(cnt[DELAY].unique())
|
||
print("load rho = f*D_vis per delay (measured ell_mean, see figures_pernode.rho_for):")
|
||
print(" " + " ".join(f"delay={d:g}: rho={r:.3f}"
|
||
for d, r in zip(delays, rho_for(cnt_raw, delays), strict=True)))
|
||
print()
|
||
|
||
written = []
|
||
written += style.save(fig_accuracy(cnt, old), out / "fine_accuracy_vs_delay", prov)
|
||
written += style.save(fig_gap(g), out / "fine_gap_vs_delay", prov)
|
||
|
||
print(f"{'cell':<16} {'countable':>17} {'unrestricted':>17} "
|
||
f"{'gap':>9} {'95% CI':>9} {'t':>6} verdict")
|
||
for _, r in g.iterrows():
|
||
verdict = ("CONTROL (true gap = 0)" if r.max_uncles == 0 else
|
||
"resolved" if r.t >= 2 else "no difference resolved")
|
||
print(f"U={int(r.max_uncles)} delay={r[DELAY]:>5g} "
|
||
f"{r.mean_ratio_c:.4f}+-{r.sem_ratio_c:.4f} "
|
||
f"{r.mean_ratio_o:.4f}+-{r.sem_ratio_o:.4f} "
|
||
f"{r.gap:+.4f} +-{r.ci95:.4f} {r.t:6.2f} {verdict}")
|
||
worst = g[g.max_uncles > 0]
|
||
print(f"\nn_rep = {int(g.n_rep_c.min())}/{int(g.n_rep_o.min())} per arm")
|
||
print(f"widest 95% CI half-width at U>=1: +-{worst.ci95.max():.4f} "
|
||
f"({100 * worst.ci95.max():.2f} pp)")
|
||
# Per-cell significance must be read against the number of cells tested — some are
|
||
# expected to clear t=2 by chance alone — so quote the Bonferroni threshold for the grid
|
||
# actually run, not a constant baked in for one grid size.
|
||
bonf = NormalDist().inv_cdf(1 - 0.05 / (2 * len(worst)))
|
||
print(f"per-cell: {int((worst.t >= 2).sum())}/{len(worst)} cells with t>=2 "
|
||
f"(expected by chance {0.05 * len(worst):.2f}); max t = {worst.t.max():.2f} "
|
||
f"vs Bonferroni threshold {bonf:.3f}")
|
||
|
||
print("\npooled over U>=1 (the three caps measure the same difference):")
|
||
pooled = pooled_by_delay(g)
|
||
for _, r in pooled.iterrows():
|
||
mark = " <-- resolved" if r.t >= 2 else ""
|
||
print(f" delay={r[DELAY]:>4g}: {r.gap:+.5f} +-{r.ci95:.5f} t={r.t:5.2f}{mark}")
|
||
w = 1.0 / worst.se.to_numpy() ** 2
|
||
allp = float((worst.gap.to_numpy() * w).sum() / w.sum())
|
||
alle = float(np.sqrt(1.0 / w.sum()))
|
||
print(f" whole band: {allp:+.5f} +-{Z95 * alle:.5f} t={abs(allp) / alle:.2f}")
|
||
|
||
if pg is not None:
|
||
print("\n=== PAIRED design (common random numbers) ===")
|
||
# Variance reduction actually achieved, per cell, vs the unpaired standard error.
|
||
cmp = unpaired[[DELAY, "max_uncles", "se"]].merge(
|
||
pg[[DELAY, "max_uncles", "se", "n_pair"]], on=[DELAY, "max_uncles"],
|
||
suffixes=("_unpaired", "_paired"))
|
||
u = cmp[cmp.max_uncles > 0]
|
||
ratio = (u.se_unpaired / u.se_paired.replace(0, np.nan))
|
||
print(f" SE shrink at U>=1: median {ratio.median():.1f}x, range "
|
||
f"{ratio.min():.1f}-{ratio.max():.1f}x ({int(u.n_pair.min())} pairs/cell)")
|
||
pctl = pg[pg.max_uncles == 0]
|
||
exact, tot = int(pctl.n_zero.sum()), int(pctl.n_pair.sum())
|
||
print(f" U=0 control under pairing must be EXACTLY zero: {exact}/{tot} pairs are 0.0"
|
||
f" -> {'PASSES' if exact == tot else 'FAILS — streams are not shared'}")
|
||
res = pg[(pg.max_uncles > 0) & (pg.t >= 2)]
|
||
n_cells = len(pg[pg.max_uncles > 0])
|
||
n_unpaired = int((unpaired[unpaired.max_uncles > 0].t >= 2).sum())
|
||
print(f" per-cell resolved at |t|>=2: {len(res)}/{n_cells}"
|
||
f" (same data, unpaired test: {n_unpaired}/{n_cells})")
|
||
|
||
ctl = g[g.max_uncles == 0]
|
||
if len(ctl):
|
||
# Under pairing the control gap is EXACTLY 0, so its se is 0 and t is 0/0. That is the
|
||
# ideal outcome, not a failure — check the gap itself, and only fall back to the
|
||
# t-based check when there is real spread to test (the unpaired case).
|
||
worst = float(ctl.gap.abs().max())
|
||
exact = bool((ctl.se == 0).all()) if "se" in ctl else False
|
||
ok = (worst == 0.0) if exact else (float(ctl.t.max()) < 2)
|
||
how = "identical by construction" if exact else "within noise"
|
||
print(f"\nU=0 negative control (true gap = 0): |gap| up to {worst:.4g} ({how})"
|
||
f" -> control {'PASSES' if ok else 'FAILS'}")
|
||
|
||
# Absolute test: does uncle recovery actually land on 1.0? Same question as the gap
|
||
# test, asked without reference to the other model.
|
||
for lbl, cells in (("countable", cnt), ("unrestricted", old)):
|
||
v = vs_one(cells)
|
||
lo = v[v.t <= -2]
|
||
print(f"\nvs exact 1.0, {lbl}: {len(lo)}/{len(v)} cells significantly BELOW 1")
|
||
if len(lo):
|
||
for d, s in lo.groupby(DELAY):
|
||
caps = "/".join(f"U={int(x)}" for x in sorted(s.max_uncles))
|
||
print(f" delay={d:>4g}: {caps} dev {s.dev.min():+.5f}..{s.dev.max():+.5f} "
|
||
f"t {s.t.min():.2f}..{s.t.max():.2f}")
|
||
print(f"wrote {len(written)} files -> {out}")
|
||
|
||
|
||
if __name__ == "__main__":
|
||
main()
|