Spaces:
Running
Running
docs(slsa): sync Space card with GitHub README (SLSA L1 honest; L2 roadmap, not yet claimed)
Browse filesAutomated README sync from szl-holdings/a11oy main via hf-sync.
Signed-off-by: Yachay <yachay@szlholdings.ai>
Co-Authored-By: Perplexity Computer Agent <agent@perplexity.ai>
README.md
CHANGED
|
@@ -73,9 +73,9 @@ Key capabilities:
|
|
| 73 |
|
| 74 |
Five pillars, each mapped to a component SZL runs in production with an honest proof artifact:
|
| 75 |
|
| 76 |
-
- **Protocol-
|
| 77 |
-
- **Verifiable
|
| 78 |
-
- **
|
| 79 |
- **Semantic Quorum Assurance** — Khipu BFT quorum + Wave23 conditional safety theorem (`khipu_quorum_safety_conditional`, agreement under non-equivocation). *Conditional theorem; unconditional Byzantine safety = Conjecture 2 (open).*
|
| 80 |
- **Epistemic State Replication** — YAWAR append-only receipt bus + deterministic replay + Verifiable Semantic Rollback. *Receipts/replay live; full ESR semantics = open R&D (roadmap).*
|
| 81 |
|
|
|
|
| 73 |
|
| 74 |
Five pillars, each mapped to a component SZL runs in production with an honest proof artifact:
|
| 75 |
|
| 76 |
+
- **Protocol-Bounded Execution** — governed-decision loop + YUYAY 13-axis conjunctive gate (deny-by-default). *Gate soundness proven over the locked F-set.*
|
| 77 |
+
- **Verifiable Intent-to-Execution** — DSSE-signed receipt chain + Lean-theorem trace. *ECDSA-P256 signed, SHA-256 hash-chained, tamper-evident.*
|
| 78 |
+
- **Bounded-Recursion Control Plane** — Ouroboros bounded-recursion loop (P1–P6). *Loop invariants proven.*
|
| 79 |
- **Semantic Quorum Assurance** — Khipu BFT quorum + Wave23 conditional safety theorem (`khipu_quorum_safety_conditional`, agreement under non-equivocation). *Conditional theorem; unconditional Byzantine safety = Conjecture 2 (open).*
|
| 80 |
- **Epistemic State Replication** — YAWAR append-only receipt bus + deterministic replay + Verifiable Semantic Rollback. *Receipts/replay live; full ESR semantics = open R&D (roadmap).*
|
| 81 |
|