Spaces:
Running
Running
sync: heal HF Space module-drift — push canonical GitHub bytes
Browse fileskillinchu's live HF Space was stale on 5 COPY'd served files vs its
GitHub HEAD 8d62089e (pre-existing since 2026-06-22, not from today's
a11oy nav work). The 2 shared modules (szl_holo3d.js, szl_label_engine.js)
are byte-identical to the a11oy sibling on GitHub, confirming GitHub is
canonical. Pushing GitHub bytes to HF byte-identical (pure sync heal, no
content edit) so github-blob-sha == hf-raw-git-sha1.
Doctrine v11 LOCKED. Lambda = Conjecture 1.
Signed-off-by: Stephen Lutar <stephenlutar2@gmail.com>
corpus/doctrine/szl-doctrine__README.md
CHANGED
|
@@ -55,7 +55,7 @@ auditable, and machine-enforced.
|
|
| 55 |
|
| 56 |
> The *locked* numbers are a contract and do not move. The **experimental `main` corpus**
|
| 57 |
> (≈1323 decls / 23 axioms / CI-green) is reported **separately** and is **never folded into
|
| 58 |
-
> the
|
| 59 |
|
| 60 |
## What it automates (org-wide)
|
| 61 |
|
|
|
|
| 55 |
|
| 56 |
> The *locked* numbers are a contract and do not move. The **experimental `main` corpus**
|
| 57 |
> (≈1323 decls / 23 axioms / CI-green) is reported **separately** and is **never folded into
|
| 58 |
+
> the 8 locked-proven formulas** {F1, F4, F7, F11, F12, F18, F19, F22}.
|
| 59 |
|
| 60 |
## What it automates (org-wide)
|
| 61 |
|
corpus/formulas/a11oy__gates_manifest.json
CHANGED
|
@@ -88,7 +88,7 @@
|
|
| 88 |
"description": "a11oy policy gate for CertifiedRobustnessRadius (G39)",
|
| 89 |
"lean_theorem": "certifiedRobustnessRadiusBound",
|
| 90 |
"lean_file": "Lutar/Robustness/CertifiedRadius.lean",
|
| 91 |
-
"lean_commit_sha": "
|
| 92 |
"formula": "certifiedRobustness",
|
| 93 |
"rationale": "A gate decision is certifiably robust at input x if the \u2113\u2082 radius R computed from randomized smoothing parameters satisfies R \u2265 R_min_safety. Formula (Cohen-Rosenfeld-Kolter 2019, Theorem 1): R = (\u03c3/2) \u00b7 (\u03a6\u207b\u00b9(p\u0304_A) \u2212 \u03a6\u207b\u00b9(p\u0304_B)) where p\u0304_A is the Monte Carlo lower bound on the top-class probability and p\u0304_B is the upper bound on the runner-up probability.",
|
| 94 |
"lean_status": "real"
|
|
@@ -230,7 +230,7 @@
|
|
| 230 |
"description": "a11oy policy gate for GaussianMechanismDP (G36)",
|
| 231 |
"lean_theorem": "gaussianNoiseSufficiency",
|
| 232 |
"lean_file": "Lutar/DP/GaussianMechanism.lean",
|
| 233 |
-
"lean_commit_sha": "
|
| 234 |
"formula": "gaussianMechanismDP",
|
| 235 |
"rationale": "A DSSE receipt asserting differential privacy via the Gaussian mechanism is accepted only if the declared noise scale \u03c3_claimed satisfies the calibration formula: \u03c3_claimed \u2265 \u0394\u2082f \u00b7 \u221a(2 ln(1.25/\u03b4)) / \u03b5 for the declared (\u03b5, \u03b4, \u0394\u2082f) in the receipt header. If \u03c3_claimed is too small, the DP guarantee is void and the receipt is denied.",
|
| 236 |
"lean_status": "real"
|
|
@@ -395,7 +395,7 @@
|
|
| 395 |
"description": "a11oy policy gate for RDPSequentialComposition (G38)",
|
| 396 |
"lean_theorem": "rdpSequentialCompositionAdditivity",
|
| 397 |
"lean_file": "Lutar/DP/RDPComposition.lean",
|
| 398 |
-
"lean_commit_sha": "
|
| 399 |
"formula": "rdpComposition",
|
| 400 |
"rationale": "For a pipeline of k steps each satisfying (\u03b1, \u03b5\u1d62)-RDP, the sequential composition is (\u03b1, \u03a3\u03b5\u1d62)-RDP (Mironov 2017, Proposition 1). Converting to (\u03b5_dp, \u03b4)-DP: \u03b5_dp = \u03a3\u03b5\u1d62 + ln(1/\u03b4)/(\u03b1-1). The gate accepts a chained receipt only if \u03b5_dp \u2264 declared budget ceiling.",
|
| 401 |
"lean_status": "real"
|
|
@@ -418,7 +418,7 @@
|
|
| 418 |
"description": "a11oy policy gate for ReedSolomonSingletonBound (G40)",
|
| 419 |
"lean_theorem": "reedSolomonMDSProperty",
|
| 420 |
"lean_file": "Lutar/CodingTheory/ReedSolomonSingleton.lean",
|
| 421 |
-
"lean_commit_sha": "
|
| 422 |
"formula": "reedSolomonSingleton",
|
| 423 |
"rationale": "A receipt chain that claims to use Reed-Solomon erasure coding for shard resilience must declare valid RS parameters [n, k, d, q] that satisfy: (1) n \u2264 q (valid parameter range over field GF(q)) (2) 1 \u2264 k \u2264 n (3) d = n - k + 1 (MDS condition \u2014 Singleton bound achieved with equality) (4) claimed_erasure_capacity \u2264 n - k If any condition fails, the resilience claim is unsubstantiated and the gate de",
|
| 424 |
"lean_status": "real"
|
|
|
|
| 88 |
"description": "a11oy policy gate for CertifiedRobustnessRadius (G39)",
|
| 89 |
"lean_theorem": "certifiedRobustnessRadiusBound",
|
| 90 |
"lean_file": "Lutar/Robustness/CertifiedRadius.lean",
|
| 91 |
+
"lean_commit_sha": "b675cd84caa17080671570c153484c817f8769ac",
|
| 92 |
"formula": "certifiedRobustness",
|
| 93 |
"rationale": "A gate decision is certifiably robust at input x if the \u2113\u2082 radius R computed from randomized smoothing parameters satisfies R \u2265 R_min_safety. Formula (Cohen-Rosenfeld-Kolter 2019, Theorem 1): R = (\u03c3/2) \u00b7 (\u03a6\u207b\u00b9(p\u0304_A) \u2212 \u03a6\u207b\u00b9(p\u0304_B)) where p\u0304_A is the Monte Carlo lower bound on the top-class probability and p\u0304_B is the upper bound on the runner-up probability.",
|
| 94 |
"lean_status": "real"
|
|
|
|
| 230 |
"description": "a11oy policy gate for GaussianMechanismDP (G36)",
|
| 231 |
"lean_theorem": "gaussianNoiseSufficiency",
|
| 232 |
"lean_file": "Lutar/DP/GaussianMechanism.lean",
|
| 233 |
+
"lean_commit_sha": "b675cd84caa17080671570c153484c817f8769ac",
|
| 234 |
"formula": "gaussianMechanismDP",
|
| 235 |
"rationale": "A DSSE receipt asserting differential privacy via the Gaussian mechanism is accepted only if the declared noise scale \u03c3_claimed satisfies the calibration formula: \u03c3_claimed \u2265 \u0394\u2082f \u00b7 \u221a(2 ln(1.25/\u03b4)) / \u03b5 for the declared (\u03b5, \u03b4, \u0394\u2082f) in the receipt header. If \u03c3_claimed is too small, the DP guarantee is void and the receipt is denied.",
|
| 236 |
"lean_status": "real"
|
|
|
|
| 395 |
"description": "a11oy policy gate for RDPSequentialComposition (G38)",
|
| 396 |
"lean_theorem": "rdpSequentialCompositionAdditivity",
|
| 397 |
"lean_file": "Lutar/DP/RDPComposition.lean",
|
| 398 |
+
"lean_commit_sha": "b675cd84caa17080671570c153484c817f8769ac",
|
| 399 |
"formula": "rdpComposition",
|
| 400 |
"rationale": "For a pipeline of k steps each satisfying (\u03b1, \u03b5\u1d62)-RDP, the sequential composition is (\u03b1, \u03a3\u03b5\u1d62)-RDP (Mironov 2017, Proposition 1). Converting to (\u03b5_dp, \u03b4)-DP: \u03b5_dp = \u03a3\u03b5\u1d62 + ln(1/\u03b4)/(\u03b1-1). The gate accepts a chained receipt only if \u03b5_dp \u2264 declared budget ceiling.",
|
| 401 |
"lean_status": "real"
|
|
|
|
| 418 |
"description": "a11oy policy gate for ReedSolomonSingletonBound (G40)",
|
| 419 |
"lean_theorem": "reedSolomonMDSProperty",
|
| 420 |
"lean_file": "Lutar/CodingTheory/ReedSolomonSingleton.lean",
|
| 421 |
+
"lean_commit_sha": "b675cd84caa17080671570c153484c817f8769ac",
|
| 422 |
"formula": "reedSolomonSingleton",
|
| 423 |
"rationale": "A receipt chain that claims to use Reed-Solomon erasure coding for shard resilience must declare valid RS parameters [n, k, d, q] that satisfy: (1) n \u2264 q (valid parameter range over field GF(q)) (2) 1 \u2264 k \u2264 n (3) d = n - k + 1 (MDS condition \u2014 Singleton bound achieved with equality) (4) claimed_erasure_capacity \u2264 n - k If any condition fails, the resilience claim is unsubstantiated and the gate de",
|
| 424 |
"lean_status": "real"
|
live_wires.html
CHANGED
|
@@ -90,7 +90,7 @@
|
|
| 90 |
var FLAG = "__FLAGSHIP__";
|
| 91 |
var STREAM = "/api/"+NS+"/v1/wires/stream";
|
| 92 |
var BOE = "/api/"+NS+"/v1/wires/boe";
|
| 93 |
-
var CONSTELLATION = "https://
|
| 94 |
document.getElementById("flag").textContent = FLAG;
|
| 95 |
|
| 96 |
// legend from catalog
|
|
@@ -180,7 +180,7 @@
|
|
| 180 |
document.getElementById("khipu-link").onclick=function(){
|
| 181 |
window.open(CONSTELLATION+"#receipt="+encodeURIComponent(curHash),"_blank");
|
| 182 |
};
|
| 183 |
-
function esc(s){ return String(s==null?"":s).replace(/[<>
|
| 184 |
})();
|
| 185 |
</script>
|
| 186 |
</body></html>
|
|
|
|
| 90 |
var FLAG = "__FLAGSHIP__";
|
| 91 |
var STREAM = "/api/"+NS+"/v1/wires/stream";
|
| 92 |
var BOE = "/api/"+NS+"/v1/wires/boe";
|
| 93 |
+
var CONSTELLATION = "https://a11oy.net/holographic"; // LIVE 3D estate/constellation (frontier-viz static space was 401/404-dead)
|
| 94 |
document.getElementById("flag").textContent = FLAG;
|
| 95 |
|
| 96 |
// legend from catalog
|
|
|
|
| 180 |
document.getElementById("khipu-link").onclick=function(){
|
| 181 |
window.open(CONSTELLATION+"#receipt="+encodeURIComponent(curHash),"_blank");
|
| 182 |
};
|
| 183 |
+
function esc(s){ return String(s==null?"":s).replace(/[&<>"']/g,function(c){return({'&':'&','<':'<','>':'>','"':'"',"'":'''}[c]||c);}); }
|
| 184 |
})();
|
| 185 |
</script>
|
| 186 |
</body></html>
|
static/shared/szl_holo3d.js
CHANGED
|
@@ -122,7 +122,7 @@
|
|
| 122 |
}
|
| 123 |
function esc(s) {
|
| 124 |
return String(s == null ? "" : s)
|
| 125 |
-
.replace(/&/g,
|
| 126 |
.replace(/"/g, """).replace(/'/g, "'");
|
| 127 |
}
|
| 128 |
|
|
|
|
| 122 |
}
|
| 123 |
function esc(s) {
|
| 124 |
return String(s == null ? "" : s)
|
| 125 |
+
.replace(/&/g,'&').replace(/</g,'<').replace(/>/g,'>').replace(/"/g,'"').replace(/'/g,''')
|
| 126 |
.replace(/"/g, """).replace(/'/g, "'");
|
| 127 |
}
|
| 128 |
|
static/shared/szl_label_engine.js
CHANGED
|
@@ -78,7 +78,7 @@
|
|
| 78 |
|
| 79 |
function esc(s) {
|
| 80 |
return String(s == null ? "" : s)
|
| 81 |
-
.replace(/&/g,
|
| 82 |
.replace(/"/g, """).replace(/'/g, "'");
|
| 83 |
}
|
| 84 |
|
|
|
|
| 78 |
|
| 79 |
function esc(s) {
|
| 80 |
return String(s == null ? "" : s)
|
| 81 |
+
.replace(/&/g,'&').replace(/</g,'<').replace(/>/g,'>').replace(/"/g,'"').replace(/'/g,''')
|
| 82 |
.replace(/"/g, """).replace(/'/g, "'");
|
| 83 |
}
|
| 84 |
|