Datasets:
Publish curated, controls-verified results
Browse files- README.md +27 -11
- bounded_null.parquet +2 -2
- build_dataset.py +5 -1
- source/bfl-ml-tierA/indistinguishability.json +8 -8
README.md
CHANGED
|
@@ -94,10 +94,13 @@ Four small Parquet tables, **83 rows total**:
|
|
| 94 |
by ~50×. It is reported, not hidden: `learnable` is a per-point
|
| 95 |
`ci_lo > 0.5` flag precisely so this is queryable.
|
| 96 |
|
| 97 |
-
2. **Full SHA-256 is indistinguishable from random — bounded.**
|
| 98 |
-
n=800k
|
| 99 |
0.499–0.501; the 95% CI brackets 0.5 in every seed; `controls_ok`.
|
| 100 |
-
|
|
|
|
|
|
|
|
|
|
| 101 |
This is a **bounded null at this budget**, explicitly **not** a
|
| 102 |
claim that SHA-256 is random.
|
| 103 |
|
|
@@ -164,8 +167,20 @@ matter:
|
|
| 164 |
excludes chance at that eval-set size
|
| 165 |
(`floor = z·√(p(1−p)/n_val)`). "No structure" means *none above this
|
| 166 |
floor at this budget* — it is **not** a statement that the effect is
|
| 167 |
-
zero, and **not** a power calculation. `
|
| 168 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 169 |
|
| 170 |
- **The permuted-label control is the dynamics analog of
|
| 171 |
random-vs-random.** Train on shuffled labels; if the shuffled model
|
|
@@ -189,7 +204,7 @@ variant, per-hash feature, TinyCNN. 5 seeds across 2 tiers.
|
|
| 189 |
|---|---|---|
|
| 190 |
| `tier` | str | `A` (n_train=200k) or `B` (n_train=500k, finer round grid) |
|
| 191 |
| `n_train` | int | Training examples |
|
| 192 |
-
| `n_val` | int |
|
| 193 |
| `seed` | int | RNG seed (0–2 for A, 0–1 for B) |
|
| 194 |
| `rounds` | int | SHA-256 compression rounds (1–64) |
|
| 195 |
| `accuracy` | float | Validation accuracy (chance = 0.5) |
|
|
@@ -200,9 +215,10 @@ variant, per-hash feature, TinyCNN. 5 seeds across 2 tiers.
|
|
| 200 |
|
| 201 |
### `bounded_null` (7 rows)
|
| 202 |
|
| 203 |
-
Full 64-round SHA-256 vs random.
|
| 204 |
-
|
| 205 |
-
|
|
|
|
| 206 |
|
| 207 |
| Column | Type | Description |
|
| 208 |
|---|---|---|
|
|
@@ -210,10 +226,10 @@ harness.
|
|
| 210 |
| `seed` | int | RNG seed |
|
| 211 |
| `model` | str | `tiny_cnn` or `linear_probe` |
|
| 212 |
| `rounds` | int | 64 (full SHA-256) |
|
| 213 |
-
| `n_train`, `n_val` | int |
|
| 214 |
| `accuracy`, `advantage` | float | Validation accuracy and `2·acc−1` |
|
| 215 |
| `ci_lo`, `ci_hi` | float | 95% Clopper–Pearson CI |
|
| 216 |
-
| `ci_resolution_floor` | float | CI-resolution floor (≈ 0.0049) |
|
| 217 |
| `is_best_model` | bool | Best-accuracy model for this seed |
|
| 218 |
| `controls_ok` | bool | Positive **and** negative control passed |
|
| 219 |
| `positive_ok`, `negative_ok` | bool | Individual control outcomes |
|
|
|
|
| 94 |
by ~50×. It is reported, not hidden: `learnable` is a per-point
|
| 95 |
`ci_lo > 0.5` flag precisely so this is queryable.
|
| 96 |
|
| 97 |
+
2. **Full SHA-256 is indistinguishable from random — bounded.** Across
|
| 98 |
+
3 seeds at n=800k, best-of-{TinyCNN, linear probe} accuracy is
|
| 99 |
0.499–0.501; the 95% CI brackets 0.5 in every seed; `controls_ok`.
|
| 100 |
+
A dedicated indistinguishability probe then **tightens the bound at
|
| 101 |
+
n=4,000,000**: accuracy 0.50006, 95% CI [0.4990, 0.5012] (brackets
|
| 102 |
+
0.5), controls passed — pushing the CI-resolution floor down from
|
| 103 |
+
≈ 0.49% to **≈ 0.22%**. Verdict: *no structure above ≈ 0.22%*.
|
| 104 |
This is a **bounded null at this budget**, explicitly **not** a
|
| 105 |
claim that SHA-256 is random.
|
| 106 |
|
|
|
|
| 167 |
excludes chance at that eval-set size
|
| 168 |
(`floor = z·√(p(1−p)/n_val)`). "No structure" means *none above this
|
| 169 |
floor at this budget* — it is **not** a statement that the effect is
|
| 170 |
+
zero, and **not** a power calculation. The `ci_resolution_floor`
|
| 171 |
+
value is taken **verbatim from the run** — every "no structure above
|
| 172 |
+
X" claim rests on it directly, not on any inversion.
|
| 173 |
+
|
| 174 |
+
- **`n_val` caveat (distinguisher configs).** For the distinguisher
|
| 175 |
+
configs (`learnability_sweep`, `bounded_null`) the harness reports
|
| 176 |
+
the floor in *advantage* units (`2·acc−1`), i.e.
|
| 177 |
+
`floor = 2z·√(0.25/n_val)`. The `n_val` column is the exact inversion
|
| 178 |
+
of the *accuracy-unit* form above, so for these configs it runs ≈ 4×
|
| 179 |
+
below the literal eval-set count (e.g. the n=4,000,000
|
| 180 |
+
indistinguishability probe's true eval split is ≈ 800k while the
|
| 181 |
+
column shows ≈ 200k). It is a self-consistent, documented derived
|
| 182 |
+
quantity for transparency — read `n_train` (the run's dataset size)
|
| 183 |
+
and `ci_resolution_floor` (verbatim) as the load-bearing numbers.
|
| 184 |
|
| 185 |
- **The permuted-label control is the dynamics analog of
|
| 186 |
random-vs-random.** Train on shuffled labels; if the shuffled model
|
|
|
|
| 204 |
|---|---|---|
|
| 205 |
| `tier` | str | `A` (n_train=200k) or `B` (n_train=500k, finer round grid) |
|
| 206 |
| `n_train` | int | Training examples |
|
| 207 |
+
| `n_val` | int | Inversion of the accuracy-unit CI floor (≈ ¼ of the literal eval count — see the `n_val` caveat above) |
|
| 208 |
| `seed` | int | RNG seed (0–2 for A, 0–1 for B) |
|
| 209 |
| `rounds` | int | SHA-256 compression rounds (1–64) |
|
| 210 |
| `accuracy` | float | Validation accuracy (chance = 0.5) |
|
|
|
|
| 215 |
|
| 216 |
### `bounded_null` (7 rows)
|
| 217 |
|
| 218 |
+
Full 64-round SHA-256 vs random. Six rows: one per (seed, model) for
|
| 219 |
+
the n=800k full-structure sweep, plus the standalone n=4,000,000
|
| 220 |
+
indistinguishability probe that tightens the CI-resolution floor to
|
| 221 |
+
≈ 0.22%. `conclusion` is verbatim from the harness.
|
| 222 |
|
| 223 |
| Column | Type | Description |
|
| 224 |
|---|---|---|
|
|
|
|
| 226 |
| `seed` | int | RNG seed |
|
| 227 |
| `model` | str | `tiny_cnn` or `linear_probe` |
|
| 228 |
| `rounds` | int | 64 (full SHA-256) |
|
| 229 |
+
| `n_train`, `n_val` | int | Dataset size n / eval examples. full_structure: 800k. indistinguishability: 4,000,000 |
|
| 230 |
| `accuracy`, `advantage` | float | Validation accuracy and `2·acc−1` |
|
| 231 |
| `ci_lo`, `ci_hi` | float | 95% Clopper–Pearson CI |
|
| 232 |
+
| `ci_resolution_floor` | float | CI-resolution floor (full_structure ≈ 0.0049; indistinguishability ≈ 0.0022) |
|
| 233 |
| `is_best_model` | bool | Best-accuracy model for this seed |
|
| 234 |
| `controls_ok` | bool | Positive **and** negative control passed |
|
| 235 |
| `positive_ok`, `negative_ok` | bool | Individual control outcomes |
|
bounded_null.parquet
CHANGED
|
@@ -1,3 +1,3 @@
|
|
| 1 |
version https://git-lfs.github.com/spec/v1
|
| 2 |
-
oid sha256:
|
| 3 |
-
size
|
|
|
|
| 1 |
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:f8cfcd1eef715785bf0561a140c17dbbf4fcfee28e77379927fd09c7d33d03f9
|
| 3 |
+
size 10280
|
build_dataset.py
CHANGED
|
@@ -128,9 +128,13 @@ def build_bounded_null() -> pd.DataFrame:
|
|
| 128 |
{
|
| 129 |
"experiment": "indistinguishability",
|
| 130 |
"seed": 0,
|
|
|
|
|
|
|
|
|
|
|
|
|
| 131 |
"model": ind["model"],
|
| 132 |
"rounds": 64,
|
| 133 |
-
"n_train":
|
| 134 |
"n_val": _n_val(floor, 0.5),
|
| 135 |
"accuracy": p["accuracy"],
|
| 136 |
"advantage": p["advantage"],
|
|
|
|
| 128 |
{
|
| 129 |
"experiment": "indistinguishability",
|
| 130 |
"seed": 0,
|
| 131 |
+
# Dedicated tightening probe: run_sweep([64], seed=0,
|
| 132 |
+
# n=4_000_000, epochs=30, tiny_cnn) on HF cpu-xl. Drives the
|
| 133 |
+
# CI-resolution floor down to ~0.22% (from ~0.49% at the
|
| 134 |
+
# full_structure n=800k budget).
|
| 135 |
"model": ind["model"],
|
| 136 |
"rounds": 64,
|
| 137 |
+
"n_train": 4_000_000,
|
| 138 |
"n_val": _n_val(floor, 0.5),
|
| 139 |
"accuracy": p["accuracy"],
|
| 140 |
"advantage": p["advantage"],
|
source/bfl-ml-tierA/indistinguishability.json
CHANGED
|
@@ -1,27 +1,27 @@
|
|
| 1 |
{
|
| 2 |
-
"timestamp": "2026-05-
|
| 3 |
"experiment": "indistinguishability",
|
| 4 |
"feature": "per-hash",
|
| 5 |
"model": "tiny_cnn",
|
| 6 |
"points": [
|
| 7 |
{
|
| 8 |
"rounds": 64,
|
| 9 |
-
"accuracy": 0.
|
| 10 |
-
"advantage": 0.
|
| 11 |
"auc": null,
|
| 12 |
"accuracy_ci": [
|
| 13 |
-
0.
|
| 14 |
-
0.
|
| 15 |
],
|
| 16 |
-
"min_detectable_advantage": 0.
|
| 17 |
}
|
| 18 |
],
|
| 19 |
"controls": {
|
| 20 |
"positive_accuracy": 1.0,
|
| 21 |
"positive_ok": true,
|
| 22 |
"negative_ci": [
|
| 23 |
-
0.
|
| 24 |
-
0.
|
| 25 |
],
|
| 26 |
"negative_ok": true
|
| 27 |
},
|
|
|
|
| 1 |
{
|
| 2 |
+
"timestamp": "2026-05-17T00:13:06.570169+00:00",
|
| 3 |
"experiment": "indistinguishability",
|
| 4 |
"feature": "per-hash",
|
| 5 |
"model": "tiny_cnn",
|
| 6 |
"points": [
|
| 7 |
{
|
| 8 |
"rounds": 64,
|
| 9 |
+
"accuracy": 0.500065,
|
| 10 |
+
"advantage": 0.00012999999999996348,
|
| 11 |
"auc": null,
|
| 12 |
"accuracy_ci": [
|
| 13 |
+
0.4989687232581321,
|
| 14 |
+
0.5011612762711881
|
| 15 |
],
|
| 16 |
+
"min_detectable_advantage": 0.002191306351441454
|
| 17 |
}
|
| 18 |
],
|
| 19 |
"controls": {
|
| 20 |
"positive_accuracy": 1.0,
|
| 21 |
"positive_ok": true,
|
| 22 |
"negative_ci": [
|
| 23 |
+
0.4989687232581321,
|
| 24 |
+
0.5011612762711881
|
| 25 |
],
|
| 26 |
"negative_ok": true
|
| 27 |
},
|