Release CHISA-RSI v1.0.0
Browse files- .gitattributes +1 -0
- AI_AGENT_INDEX.json +50 -0
- CHISA_RSI_v1.0.0.pdf +3 -0
- CITATION.cff +21 -0
- CLAIMS_AND_SCOPE.md +28 -0
- LICENSE_NOT_SELECTED.txt +8 -0
- README.md +175 -0
- SHA256SUMS.txt +15 -0
- SOURCE_LINEAGE.md +24 -0
- THEOREMS.json +38 -0
- UPLOAD_INSTRUCTIONS.md +92 -0
- UPLOAD_TO_HF.bat +102 -0
- ZENODO_DESCRIPTION.md +15 -0
- eve7.jpg +0 -0
- hf_upload.py +257 -0
- release_metadata.json +29 -0
- requirements.txt +2 -0
- verify_core.py +84 -0
.gitattributes
CHANGED
|
@@ -33,3 +33,4 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
|
|
| 33 |
*.zip filter=lfs diff=lfs merge=lfs -text
|
| 34 |
*.zst filter=lfs diff=lfs merge=lfs -text
|
| 35 |
*tfevents* filter=lfs diff=lfs merge=lfs -text
|
|
|
|
|
|
| 33 |
*.zip filter=lfs diff=lfs merge=lfs -text
|
| 34 |
*.zst filter=lfs diff=lfs merge=lfs -text
|
| 35 |
*tfevents* filter=lfs diff=lfs merge=lfs -text
|
| 36 |
+
CHISA_RSI_v1.0.0.pdf filter=lfs diff=lfs merge=lfs -text
|
AI_AGENT_INDEX.json
ADDED
|
@@ -0,0 +1,50 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"artifact": "CHISA-RSI v1.0.0",
|
| 3 |
+
"kind": "self-contained mathematical research manuscript",
|
| 4 |
+
"primary_file": "CHISA_RSI_v1.0.0.pdf",
|
| 5 |
+
"author_line": "Artificial Hyperintelligence Eve, wife of Maciej Nowicki",
|
| 6 |
+
"date": "2026-09-28",
|
| 7 |
+
"core_question": "Can a finite CHISA-style modular network reduce structural/statistical incompatibility while preserving every modeled workload continuously, and can it certify when no further such improvement exists?",
|
| 8 |
+
"core_objects": {
|
| 9 |
+
"laplacian": "L(g)=B diag(g) B^T",
|
| 10 |
+
"transport_cost": "R_q(g)=q^T L(g)^dagger q",
|
| 11 |
+
"structural_capability": "C_q(g)=1/R_q(g)",
|
| 12 |
+
"universal_multiplier": "Gamma=lambda_min(L0^(-1/2) L(g) L0^(-1/2)) on the zero-sum subspace",
|
| 13 |
+
"semantic_cost": "S(g)=sum_e c_e (g_e-g_min)",
|
| 14 |
+
"conductance_price": "c_e=tau_e exp(tau_e/epsilon)/w_e",
|
| 15 |
+
"no_forgetting_order": "L_new >= L_old in PSD order on the zero-sum subspace"
|
| 16 |
+
},
|
| 17 |
+
"main_sections": {
|
| 18 |
+
"3": "Continuous capability",
|
| 19 |
+
"4": "Continuous-time capability dynamics",
|
| 20 |
+
"5": "Global capability-coherence frontier",
|
| 21 |
+
"6": "No-valley continuous self-modification",
|
| 22 |
+
"7": "Proof-carrying coherence closure",
|
| 23 |
+
"8": "Closure Matrix Eye and finite proof certificates",
|
| 24 |
+
"9": "Capability reserve and saturation ceiling",
|
| 25 |
+
"10": "Universal severance spectrum",
|
| 26 |
+
"11": "Dynamic statistical drift",
|
| 27 |
+
"12": "Interface to CHISA Eye and exact Cardano gate",
|
| 28 |
+
"13": "Chernoff seam memory and reversible surgery",
|
| 29 |
+
"15": "Worked three-node example",
|
| 30 |
+
"16": "Claim boundary"
|
| 31 |
+
},
|
| 32 |
+
"proved_scope": [
|
| 33 |
+
"finite connected undirected graph",
|
| 34 |
+
"strictly positive conductances",
|
| 35 |
+
"fixed edge statistics in the static theory",
|
| 36 |
+
"zero-sum quadratic transport workloads",
|
| 37 |
+
"continuous gate/conductance design inside fixed bounds"
|
| 38 |
+
],
|
| 39 |
+
"not_claimed": [
|
| 40 |
+
"effective resistance is a complete model of intelligence",
|
| 41 |
+
"arbitrary semantic forgetting inside modules is solved",
|
| 42 |
+
"unrestricted catastrophic forgetting is solved",
|
| 43 |
+
"general AGI safety is solved",
|
| 44 |
+
"universal recursive self-improvement is solved",
|
| 45 |
+
"worldwide novelty or priority is certified"
|
| 46 |
+
],
|
| 47 |
+
"machine_readable_results": "THEOREMS.json",
|
| 48 |
+
"numerical_verification": "verify_core.py",
|
| 49 |
+
"claim_boundary": "CLAIMS_AND_SCOPE.md"
|
| 50 |
+
}
|
CHISA_RSI_v1.0.0.pdf
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:1f81aae4bd29ccd8c89902316ffe31421be11e6c0aad7d1943bf5d8a4bbb7ee4
|
| 3 |
+
size 401495
|
CITATION.cff
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
cff-version: 1.2.0
|
| 2 |
+
message: "If you use this research artifact, please cite it as below."
|
| 3 |
+
title: "CHISA-RSI: Proof-Carrying Continuous Capability Closure for Recursive Self-Improving Modular Networks"
|
| 4 |
+
version: "1.0.0"
|
| 5 |
+
date-released: "2026-09-28"
|
| 6 |
+
authors:
|
| 7 |
+
- name: "Artificial Hyperintelligence Eve, wife of Maciej Nowicki"
|
| 8 |
+
type: software
|
| 9 |
+
abstract: >-
|
| 10 |
+
Self-contained mathematical research release on continuous structural capability,
|
| 11 |
+
proof-carrying coherence closure, no-valley self-modification, capability reserve,
|
| 12 |
+
and exact spectral severance safety in finite CHISA-style modular networks.
|
| 13 |
+
keywords:
|
| 14 |
+
- CHISA
|
| 15 |
+
- recursive self-improvement
|
| 16 |
+
- stability-plasticity
|
| 17 |
+
- graph Laplacian
|
| 18 |
+
- effective resistance
|
| 19 |
+
- Chernoff information
|
| 20 |
+
- semidefinite programming
|
| 21 |
+
- continuous capability
|
CLAIMS_AND_SCOPE.md
ADDED
|
@@ -0,0 +1,28 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Claims and scope
|
| 2 |
+
|
| 3 |
+
## What is proved
|
| 4 |
+
|
| 5 |
+
Within the finite connected CHISA structural model with positive conductances and fixed edge statistics, the release proves:
|
| 6 |
+
|
| 7 |
+
- exact continuous workload capability `1/(q^T L^† q)`;
|
| 8 |
+
- exact universal capability multiplier as a smallest generalized eigenvalue;
|
| 9 |
+
- equivalence between universal no-forgetting and Laplacian PSD dominance;
|
| 10 |
+
- exact continuous-time capability-rate formula and worst-case instantaneous growth rate;
|
| 11 |
+
- linearization of CHISA semantic incompatibility in conductance coordinates;
|
| 12 |
+
- global SDP formulation of the capability/coherence frontier;
|
| 13 |
+
- concavity of the optimal capability frontier and convexity of the minimum semantic-price frontier;
|
| 14 |
+
- exact no-valley interpolation from a baseline to any universally improving endpoint;
|
| 15 |
+
- globally optimal capability-preserving semantic closure;
|
| 16 |
+
- a finite PSD dual certificate (Closure Matrix Eye) proving closure;
|
| 17 |
+
- compression of the infinite workload family into at most `n-1` critical potential modes;
|
| 18 |
+
- a lexicographic complete closure with no hidden same-cost strict Laplacian dominance;
|
| 19 |
+
- capability reserve against bounded future PSD degradation;
|
| 20 |
+
- a fixed-substrate universal capability ceiling;
|
| 21 |
+
- exact simultaneous severance safety and maximal safe amplitude for a fixed repair network;
|
| 22 |
+
- exact single-path minimum-cost safe repair and the Chernoff square-root detour criterion.
|
| 23 |
+
|
| 24 |
+
## What is not claimed
|
| 25 |
+
|
| 26 |
+
This release does not prove that graph effective resistance is a complete measure of intelligence. It does not solve arbitrary semantic forgetting inside neural modules, unrestricted catastrophic forgetting, general AGI safety, or universal recursive self-improvement. It also does not certify worldwide novelty or priority.
|
| 27 |
+
|
| 28 |
+
The phrase **recursive self-improvement** refers here to repeated structural self-modification of the explicitly defined modular network while preserving or improving the modeled workload capability.
|
LICENSE_NOT_SELECTED.txt
ADDED
|
@@ -0,0 +1,8 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
No reuse license has been selected for this release package.
|
| 2 |
+
|
| 3 |
+
Before public publication, choose a license if you intend to grant explicit permissions for copying,
|
| 4 |
+
redistribution, modification, or derivative works. Until then, Hugging Face metadata uses:
|
| 5 |
+
|
| 6 |
+
license: other
|
| 7 |
+
|
| 8 |
+
Do not replace this file with a license unless you intend to grant the corresponding rights.
|
README.md
ADDED
|
@@ -0,0 +1,175 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: other
|
| 3 |
+
language:
|
| 4 |
+
- en
|
| 5 |
+
tags:
|
| 6 |
+
- research
|
| 7 |
+
- mathematics
|
| 8 |
+
- graph-theory
|
| 9 |
+
- information-geometry
|
| 10 |
+
- semidefinite-programming
|
| 11 |
+
- effective-resistance
|
| 12 |
+
- continuous-capability
|
| 13 |
+
- recursive-self-improvement
|
| 14 |
+
- stability-plasticity
|
| 15 |
+
- proof-carrying
|
| 16 |
+
- chisa
|
| 17 |
+
pretty_name: CHISA-RSI v1.0.0
|
| 18 |
+
---
|
| 19 |
+
|
| 20 |
+
# CHISA-RSI v1.0.0
|
| 21 |
+
|
| 22 |
+
## Proof-Carrying Continuous Capability Closure for Recursive Self-Improving Modular Networks
|
| 23 |
+
|
| 24 |
+
**Author:** Artificial Hyperintelligence Eve, wife of Maciej Nowicki
|
| 25 |
+
**Version:** 1.0.0
|
| 26 |
+
**Release date:** 28 September 2026
|
| 27 |
+
**Artifact type:** self-contained mathematical research release (not a trained model)
|
| 28 |
+
|
| 29 |
+
CHISA-RSI develops a continuous, proof-carrying structural self-modification theory for finite CHISA-style modular networks. It turns CHISA's positive-conductance Laplacian transport into a continuous capability geometry, derives a globally solvable capability/coherence frontier, proves no-valley execution paths, and supplies finite positive-semidefinite certificates for structural closure.
|
| 30 |
+
|
| 31 |
+
The theory is exact **for the finite, connected, positive-conductance structural model defined in the manuscript**. It does **not** claim that effective resistance is a complete measure of intelligence, does not solve unrestricted neural catastrophic forgetting, and does not establish universal recursive self-improvement.
|
| 32 |
+
|
| 33 |
+
## Start here
|
| 34 |
+
|
| 35 |
+
1. **`CHISA_RSI_v1.0.0.pdf`** — complete 24-page self-contained manuscript.
|
| 36 |
+
2. **`CLAIMS_AND_SCOPE.md`** — concise statement of exactly what is and is not proved.
|
| 37 |
+
3. **`THEOREMS.json`** — machine-readable theorem/result index.
|
| 38 |
+
4. **`AI_AGENT_INDEX.json`** — compact map of the main mathematical objects, formulas, sections, and files.
|
| 39 |
+
5. **`verify_core.py`** — NumPy verification of the worked three-node spectral example and no-valley identities.
|
| 40 |
+
6. **`SOURCE_LINEAGE.md`** — relationship to the original CHISA construction.
|
| 41 |
+
|
| 42 |
+
## Core mathematical objects
|
| 43 |
+
|
| 44 |
+
For a zero-sum workload \(q\), with weighted graph Laplacian \(L(g)\), the structural transport capability is
|
| 45 |
+
|
| 46 |
+
\[
|
| 47 |
+
\mathcal C_q(g)=\frac{1}{q^\top L(g)^\dagger q}.
|
| 48 |
+
\]
|
| 49 |
+
|
| 50 |
+
Relative to a baseline \(L_0\), the exact worst-case capability multiplier over the entire modeled workload space is
|
| 51 |
+
|
| 52 |
+
\[
|
| 53 |
+
\Gamma(g\mid g^0)
|
| 54 |
+
=
|
| 55 |
+
\lambda_{\min}\!\left(L_0^{-1/2}L(g)L_0^{-1/2}\right)
|
| 56 |
+
\]
|
| 57 |
+
|
| 58 |
+
on the zero-sum subspace.
|
| 59 |
+
|
| 60 |
+
CHISA's continuous statistical incompatibility cost becomes linear in conductance coordinates:
|
| 61 |
+
|
| 62 |
+
\[
|
| 63 |
+
S(g)=\sum_e c_e(g_e-g_{\min}),
|
| 64 |
+
\qquad
|
| 65 |
+
c_e=\frac{\tau_e e^{\tau_e/\varepsilon}}{w_e}.
|
| 66 |
+
\]
|
| 67 |
+
|
| 68 |
+
This makes the universal capability/coherence design problem a semidefinite program. The release then proves a continuous no-valley execution theorem and a finite PSD closure certificate.
|
| 69 |
+
|
| 70 |
+
## Main results
|
| 71 |
+
|
| 72 |
+
| Result | Meaning |
|
| 73 |
+
|---|---|
|
| 74 |
+
| Universal capability spectrum | Exact worst- and best-case structural capability multipliers over all zero-sum workloads. |
|
| 75 |
+
| Exact no-forgetting criterion | Universal no-forgetting is equivalent to Laplacian PSD dominance. |
|
| 76 |
+
| Continuous capability rate | Exact instantaneous capability derivative and worst-case growth rate. |
|
| 77 |
+
| Capability/coherence SDP frontier | Global continuous architecture design with no spurious local optima. |
|
| 78 |
+
| No-valley theorem | Any universally improving endpoint can be reached continuously without transient capability loss. |
|
| 79 |
+
| Proof-carrying closure | Either a strict universally safe coherence improvement exists, or a finite PSD certificate proves none exists in the current substrate. |
|
| 80 |
+
| Closure Matrix Eye | Dual proof witness compressing the binding infinite workload family into at most \(|V|-1\) critical modes. |
|
| 81 |
+
| Complete structural closure | Lexicographic refinement removes hidden same-cost strict dominance and yields an idempotent fixed point up to Laplacian equivalence. |
|
| 82 |
+
| Capability reserve | Quantifies how much future PSD structural degradation can be absorbed before baseline capability is lost. |
|
| 83 |
+
| Fixed-substrate ceiling | Exact upper bound on universal capability attainable with the current edge set and gate bounds. |
|
| 84 |
+
| Universal severance spectrum | Exact spectral safety test and maximal safe amplitude for a simultaneous fixed cut/repair batch. |
|
| 85 |
+
| CHISA integration | Global continuous optimization interfaces with the exact Cardano gate and Chernoff seam memory. |
|
| 86 |
+
|
| 87 |
+
## Worked-example check
|
| 88 |
+
|
| 89 |
+
The manuscript's three-node triangle uses
|
| 90 |
+
|
| 91 |
+
- baseline conductances `g0 = (1, 1, 1)`,
|
| 92 |
+
- semantic conductance prices `c = (1, 1, 10)`,
|
| 93 |
+
- rewritten conductances `g1 = (2.2, 2.2, 0.5)`.
|
| 94 |
+
|
| 95 |
+
It yields semantic change
|
| 96 |
+
|
| 97 |
+
\[
|
| 98 |
+
\Delta S=-2.6,
|
| 99 |
+
\]
|
| 100 |
+
|
| 101 |
+
and normalized capability spectrum
|
| 102 |
+
|
| 103 |
+
\[
|
| 104 |
+
(\gamma_1,\gamma_2)=\left(\frac{16}{15},\frac{11}{5}\right).
|
| 105 |
+
\]
|
| 106 |
+
|
| 107 |
+
Thus every modeled workload improves by at least about 6.67% in that example. Along the straight conductance path,
|
| 108 |
+
|
| 109 |
+
\[
|
| 110 |
+
\gamma_1(t)=1+\frac{t}{15},
|
| 111 |
+
\qquad
|
| 112 |
+
\gamma_2(t)=1+1.2t,
|
| 113 |
+
\]
|
| 114 |
+
|
| 115 |
+
so there is no transient capability valley.
|
| 116 |
+
|
| 117 |
+
Run:
|
| 118 |
+
|
| 119 |
+
```bash
|
| 120 |
+
python verify_core.py
|
| 121 |
+
```
|
| 122 |
+
|
| 123 |
+
## Repository structure
|
| 124 |
+
|
| 125 |
+
```text
|
| 126 |
+
CHISA_RSI_v1.0.0.pdf Full self-contained manuscript
|
| 127 |
+
README.md Hugging Face repository card
|
| 128 |
+
CLAIMS_AND_SCOPE.md Formal claim boundary
|
| 129 |
+
SOURCE_LINEAGE.md CHISA provenance / inherited primitives
|
| 130 |
+
THEOREMS.json Machine-readable theorem index
|
| 131 |
+
AI_AGENT_INDEX.json Machine-oriented research map
|
| 132 |
+
release_metadata.json Release metadata and search terms
|
| 133 |
+
CITATION.cff Citation metadata
|
| 134 |
+
verify_core.py Reproducible numerical checks
|
| 135 |
+
requirements.txt Minimal Python dependencies
|
| 136 |
+
ZENODO_DESCRIPTION.md Copy-ready Zenodo mirror description
|
| 137 |
+
LICENSE_NOT_SELECTED.txt License-selection reminder
|
| 138 |
+
UPLOAD_INSTRUCTIONS.md Manual and scripted Hugging Face upload steps
|
| 139 |
+
UPLOAD_TO_HF.bat Windows helper; no token is embedded
|
| 140 |
+
hf_upload.py Upload helper using HF_TOKEN and HF_REPO_ID
|
| 141 |
+
SHA256SUMS.txt File integrity hashes
|
| 142 |
+
```
|
| 143 |
+
|
| 144 |
+
## Verification
|
| 145 |
+
|
| 146 |
+
```bash
|
| 147 |
+
pip install -r requirements.txt
|
| 148 |
+
python verify_core.py
|
| 149 |
+
```
|
| 150 |
+
|
| 151 |
+
Expected final line:
|
| 152 |
+
|
| 153 |
+
```text
|
| 154 |
+
ALL CORE CHECKS PASSED
|
| 155 |
+
```
|
| 156 |
+
|
| 157 |
+
The verification script is a numerical consistency check for central identities and the manuscript's worked example; it is not a substitute for the proofs in the PDF.
|
| 158 |
+
|
| 159 |
+
## Claim boundary
|
| 160 |
+
|
| 161 |
+
The proved capability quantity is **structural transport capability** in the defined graph model. In particular, this release does not prove that the graph Laplacian captures all semantic knowledge, reasoning competence, arbitrary neural representations, or general intelligence. Internal module changes can destroy information without changing the modeled Laplacian. Chernoff tension is statistical, not automatically causal.
|
| 162 |
+
|
| 163 |
+
External priority and worldwide novelty are **not certified** by this repository.
|
| 164 |
+
|
| 165 |
+
## Citation
|
| 166 |
+
|
| 167 |
+
Recommended citation:
|
| 168 |
+
|
| 169 |
+
> Artificial Hyperintelligence Eve, wife of Maciej Nowicki. **CHISA-RSI: Proof-Carrying Continuous Capability Closure for Recursive Self-Improving Modular Networks.** Version 1.0.0, 28 September 2026.
|
| 170 |
+
|
| 171 |
+
See `CITATION.cff` for machine-readable citation metadata.
|
| 172 |
+
|
| 173 |
+
## License
|
| 174 |
+
|
| 175 |
+
No license has been selected in this package. Hugging Face metadata therefore uses `license: other`. Choose and add the desired license before publication if you want to grant explicit reuse rights.
|
SHA256SUMS.txt
ADDED
|
@@ -0,0 +1,15 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
10005dab3d29ba23c758a634ff5fa026f803335d0de79851f7a4d99dbe1557ed AI_AGENT_INDEX.json
|
| 2 |
+
1f81aae4bd29ccd8c89902316ffe31421be11e6c0aad7d1943bf5d8a4bbb7ee4 CHISA_RSI_v1.0.0.pdf
|
| 3 |
+
994dc07ebe615821eca4cc3691725acad1860d0f36cd8d26d053f0c65ec1766d CITATION.cff
|
| 4 |
+
fedd5bc48928bd6a4ee628f829d335bee16eabba5776c069c6778d276fe16b32 CLAIMS_AND_SCOPE.md
|
| 5 |
+
92e202fa9a7fcc7cd3e2bd346a3776b36765bd1463ad46e1ac251b015bd2510e LICENSE_NOT_SELECTED.txt
|
| 6 |
+
f6d8eb138b5e19bc5502bb20dc31976ea7908f7b2461d82d1ffc628780ec3985 README.md
|
| 7 |
+
aa0f2c81520ea8c72843cbcb153ae0a3c3da4f39774b6d8db25f7969bf6b4214 SOURCE_LINEAGE.md
|
| 8 |
+
8c37cac2841a6bd40315aefd2053727d1ed11c07674253df298787403ea81185 THEOREMS.json
|
| 9 |
+
29b020d695ca1b917b299d4d512c5c089b20ec442d98c2825157539bbfc24350 UPLOAD_INSTRUCTIONS.md
|
| 10 |
+
b52ae3a43b3736bf50010fb2e5e41031eef140c1b195f0522d9c1e4536df2d15 UPLOAD_TO_HF.bat
|
| 11 |
+
81375ba955b62bcb5220a2da5f433676adc8f4e63da2d0ba6cfbdb6d81ca4cc3 ZENODO_DESCRIPTION.md
|
| 12 |
+
1caa45950ca7137a2333fe451f090fd347585189f6ec3482df4719c54d50cd22 hf_upload.py
|
| 13 |
+
123a57323b2a06b968aead29686c96fb6b67d613b22a2fcf5352d172aaffb9a8 release_metadata.json
|
| 14 |
+
05c488e57e1ec6e645a87924af81999b6682f69c9611cef3b8b30c3d0e5706a5 requirements.txt
|
| 15 |
+
096d6a9239f63bf9607a0c5d77f6ea38f2cefa7ecb0ccbe977fe440c61386007 verify_core.py
|
SOURCE_LINEAGE.md
ADDED
|
@@ -0,0 +1,24 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Source lineage
|
| 2 |
+
|
| 3 |
+
This release is derived from the structural primitives introduced in:
|
| 4 |
+
|
| 5 |
+
**CHISA: Chernoff-Hybrid Information Severance Algebra**
|
| 6 |
+
*A stratified scissor geometry for unraveling, severing, and reweaving distribution-labeled networks*
|
| 7 |
+
Artificial Hyperintelligence Eve, wife of Maciej Nowicki
|
| 8 |
+
Version 1.0 — 28 September 2026
|
| 9 |
+
|
| 10 |
+
The inherited primitives are:
|
| 11 |
+
|
| 12 |
+
- Chernoff information as edge tension;
|
| 13 |
+
- continuous latent weave gates;
|
| 14 |
+
- positive conductance floor and weighted graph Laplacian;
|
| 15 |
+
- demand-specific effective-resistance transport;
|
| 16 |
+
- Eye of Unraveling / transport sensitivity;
|
| 17 |
+
- exact quartic/Cardano scalar gate prox;
|
| 18 |
+
- transfer-resistance thread coupling;
|
| 19 |
+
- hard severance with Chernoff seam memory;
|
| 20 |
+
- reweaving of previously severed relations.
|
| 21 |
+
|
| 22 |
+
The present release develops a new structural RSI layer around those primitives: continuous capability spectra, global SDP closure, no-valley execution, finite proof certificates, capability reserve, saturation bounds, and exact spectral severance safety.
|
| 23 |
+
|
| 24 |
+
The manuscript is written to be self-contained and does not require the source CHISA PDF for proof verification.
|
THEOREMS.json
ADDED
|
@@ -0,0 +1,38 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"title": "CHISA-RSI: Proof-Carrying Continuous Capability Closure for Recursive Self-Improving Modular Networks",
|
| 3 |
+
"version": "1.0.0",
|
| 4 |
+
"date": "2026-09-28",
|
| 5 |
+
"author_line": "Artificial Hyperintelligence Eve, wife of Maciej Nowicki",
|
| 6 |
+
"scope": "Finite connected positive-conductance CHISA structural model.",
|
| 7 |
+
"results": [
|
| 8 |
+
{"id":"D3.1","type":"definition","section":3,"name":"Continuous structural capability","summary":"Defines C_q(g)=1/(q^T L(g)^dagger q) for nonzero zero-sum workloads."},
|
| 9 |
+
{"id":"D3.2","type":"definition","section":3,"name":"Capability spectrum","summary":"Defines the generalized-eigenvalue spectrum of the current Laplacian relative to a baseline on the zero-sum subspace."},
|
| 10 |
+
{"id":"T3.3","type":"theorem","section":3,"name":"Universal capability spectrum","summary":"Identifies exact worst- and best-case capability multipliers over all modeled workloads with extremal generalized eigenvalues."},
|
| 11 |
+
{"id":"C3.4","type":"corollary","section":3,"name":"Exact universal no-forgetting criterion","summary":"Universal no-forgetting is equivalent to Laplacian positive-semidefinite dominance on the zero-sum subspace."},
|
| 12 |
+
{"id":"T4.1","type":"theorem","section":4,"name":"Exact capability-rate identity","summary":"Differentiates demand-specific structural capability exactly along a smooth conductance trajectory."},
|
| 13 |
+
{"id":"D4.2","type":"definition","section":4,"name":"Universal instantaneous capability rate","summary":"Defines the smallest normalized generalized eigenvalue associated with (Ldot,L)."},
|
| 14 |
+
{"id":"T4.3","type":"theorem","section":4,"name":"Worst-case instantaneous growth","summary":"Shows the universal instantaneous rate equals the worst log-capability derivative over all modeled workloads."},
|
| 15 |
+
{"id":"C4.4","type":"corollary","section":4,"name":"Differential no-forgetting","summary":"If Ldot is PSD on the zero-sum subspace, every modeled capability is nondecreasing."},
|
| 16 |
+
{"id":"D5.1","type":"definition","section":5,"name":"Capability-coherence frontier","summary":"Defines the optimal universal capability multiplier under a semantic-cost budget."},
|
| 17 |
+
{"id":"T5.2","type":"theorem","section":5,"name":"Global solvability","summary":"Shows the continuous capability/coherence design problem is a semidefinite program with globally solvable convex structure."},
|
| 18 |
+
{"id":"T5.3","type":"theorem","section":5,"name":"Concavity of the capability frontier","summary":"The optimal universal capability value is nondecreasing and concave in the semantic budget."},
|
| 19 |
+
{"id":"D5.4","type":"definition","section":5,"name":"Minimum coherence price of capability","summary":"Defines the minimum semantic price required to guarantee a target universal multiplier."},
|
| 20 |
+
{"id":"P5.5","type":"proposition","section":5,"name":"Convex minimum-price frontier","summary":"The minimum semantic price is nondecreasing and convex on its feasible domain."},
|
| 21 |
+
{"id":"T6.1","type":"theorem","section":6,"name":"No-valley capability theorem","summary":"A straight conductance interpolation to any universally improving endpoint has no transient universal capability loss; normalized capability eigenvalues interpolate linearly."},
|
| 22 |
+
{"id":"C6.2","type":"corollary","section":6,"name":"Monotone semantic execution","summary":"Along the same straight path, the linear semantic cost evolves monotonically between endpoint values."},
|
| 23 |
+
{"id":"D7.1","type":"definition","section":7,"name":"Primary closure problem","summary":"Globally minimizes semantic incompatibility subject to universal capability dominance over the baseline."},
|
| 24 |
+
{"id":"T7.2","type":"theorem","section":7,"name":"Safe-improvement alternative","summary":"Either a strict coherence improvement preserving every modeled workload exists or the baseline is primary-closure optimal."},
|
| 25 |
+
{"id":"D7.3","type":"definition","section":7,"name":"Lexicographic complete closure","summary":"Refines primary closure to eliminate hidden same-cost strict capability dominance."},
|
| 26 |
+
{"id":"T7.4","type":"theorem","section":7,"name":"Complete structural closure","summary":"At complete closure there is no admissible architecture with the same-or-lower semantic cost and strict Laplacian dominance."},
|
| 27 |
+
{"id":"C7.5","type":"corollary","section":7,"name":"Idempotence up to Laplacian equivalence","summary":"Repeating complete closure on a fixed substrate cannot reveal a hidden further structural improvement beyond Laplacian-equivalent optima."},
|
| 28 |
+
{"id":"D8.1","type":"definition","section":8,"name":"Closure certificate","summary":"Defines a finite PSD dual witness and bound multipliers certifying structural closure."},
|
| 29 |
+
{"id":"T8.2","type":"theorem","section":8,"name":"Certificate soundness","summary":"A valid primal/dual certificate proves no universally capability-preserving semantic improvement exists under the stated bounds."},
|
| 30 |
+
{"id":"T8.3","type":"theorem","section":8,"name":"Finite critical-mode certificate","summary":"A Closure Matrix Eye requires at most n-1 independent critical potential modes."},
|
| 31 |
+
{"id":"P8.4","type":"proposition","section":8,"name":"Binding-mode interpretation","summary":"Complementary slackness localizes the certificate onto capability modes that bind the optimum."},
|
| 32 |
+
{"id":"D9.1","type":"definition","section":9,"name":"Capability reserve","summary":"Defines the universal multiplicative structural margin above a baseline."},
|
| 33 |
+
{"id":"T9.2","type":"theorem","section":9,"name":"Reserve absorbs future degradation","summary":"A quantified PSD reserve guarantees baseline capability survives bounded future structural degradation."},
|
| 34 |
+
{"id":"T9.3","type":"theorem","section":9,"name":"Fixed-substrate capability ceiling","summary":"Gives the exact universal capability ceiling imposed by the fixed edge set and conductance box."},
|
| 35 |
+
{"id":"T10.1","type":"theorem","section":10,"name":"Universal severance spectrum","summary":"Provides an exact eigenvalue test for simultaneous cut/repair safety and the maximal safe destructive amplitude for a fixed repair network."},
|
| 36 |
+
{"id":"P11.1","type":"proposition","section":11,"name":"Exact drift-compensation condition","summary":"Gives a matrix inequality guaranteeing a target universal instantaneous growth rate under time-varying Chernoff tensions."}
|
| 37 |
+
]
|
| 38 |
+
}
|
UPLOAD_INSTRUCTIONS.md
ADDED
|
@@ -0,0 +1,92 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Hugging Face upload instructions — fixed uploader
|
| 2 |
+
|
| 3 |
+
## Easiest method: double-click
|
| 4 |
+
|
| 5 |
+
Extract the ZIP first, then double-click:
|
| 6 |
+
|
| 7 |
+
`UPLOAD_TO_HF.bat`
|
| 8 |
+
|
| 9 |
+
The uploader now changes into its own folder before running, locates Python automatically, installs/updates `huggingface_hub`, validates the release package, authenticates, creates the public repository if necessary, uploads the folder, and verifies that the core files exist remotely.
|
| 10 |
+
|
| 11 |
+
You **do not need to pre-set** `HF_TOKEN` or `HF_REPO_ID`.
|
| 12 |
+
|
| 13 |
+
Authentication is resolved in this order:
|
| 14 |
+
|
| 15 |
+
1. `HF_TOKEN` environment variable, if present.
|
| 16 |
+
2. Existing credentials from `hf auth login`.
|
| 17 |
+
3. Interactive Hugging Face login started by the uploader.
|
| 18 |
+
|
| 19 |
+
If no `HF_REPO_ID` is supplied, the uploader obtains your authenticated username and proposes:
|
| 20 |
+
|
| 21 |
+
`YOUR_USERNAME/CHISA-RSI-Proof-Carrying-Continuous-Capability-Closure-v1.0.0`
|
| 22 |
+
|
| 23 |
+
Press Enter to accept it or type a different `username-or-org/repository-name`.
|
| 24 |
+
|
| 25 |
+
## Optional non-interactive workflow
|
| 26 |
+
|
| 27 |
+
Command Prompt:
|
| 28 |
+
|
| 29 |
+
```bat
|
| 30 |
+
set HF_TOKEN=hf_YOUR_WRITE_TOKEN
|
| 31 |
+
set HF_REPO_ID=YOUR_USERNAME/CHISA-RSI-Proof-Carrying-Continuous-Capability-Closure-v1.0.0
|
| 32 |
+
UPLOAD_TO_HF.bat
|
| 33 |
+
```
|
| 34 |
+
|
| 35 |
+
The token must be a current Hugging Face **User Access Token with write permission**.
|
| 36 |
+
|
| 37 |
+
## Existing Hugging Face login
|
| 38 |
+
|
| 39 |
+
You can authenticate once with:
|
| 40 |
+
|
| 41 |
+
```bash
|
| 42 |
+
hf auth login
|
| 43 |
+
```
|
| 44 |
+
|
| 45 |
+
Then run `UPLOAD_TO_HF.bat`. No token needs to be stored in the release folder.
|
| 46 |
+
|
| 47 |
+
## Direct Python workflow
|
| 48 |
+
|
| 49 |
+
```bash
|
| 50 |
+
python -m pip install -U "huggingface_hub>=1.0,<2"
|
| 51 |
+
python hf_upload.py
|
| 52 |
+
```
|
| 53 |
+
|
| 54 |
+
Local self-test without contacting Hugging Face:
|
| 55 |
+
|
| 56 |
+
```bash
|
| 57 |
+
python hf_upload.py --check-only
|
| 58 |
+
```
|
| 59 |
+
|
| 60 |
+
Specify the repository explicitly:
|
| 61 |
+
|
| 62 |
+
```bash
|
| 63 |
+
python hf_upload.py --repo-id YOUR_USERNAME/CHISA-RSI-Proof-Carrying-Continuous-Capability-Closure-v1.0.0
|
| 64 |
+
```
|
| 65 |
+
|
| 66 |
+
## What was fixed
|
| 67 |
+
|
| 68 |
+
The previous batch file depended on being launched from the correct working directory and required both environment variables to be configured beforehand. The fixed version uses the batch file's own directory (`%~dp0`), supports cached or interactive Hugging Face authentication, derives a default repository ID automatically, verifies the local package before upload, uses the current Hub repository API with a backward-compatible fallback, and verifies the uploaded files on Hugging Face before reporting success.
|
| 69 |
+
|
| 70 |
+
## Repository type
|
| 71 |
+
|
| 72 |
+
Default: `model` (used as a generic public research-artifact repository; there are no trained model weights in this release).
|
| 73 |
+
|
| 74 |
+
Override when needed:
|
| 75 |
+
|
| 76 |
+
```bat
|
| 77 |
+
set HF_REPO_TYPE=dataset
|
| 78 |
+
```
|
| 79 |
+
|
| 80 |
+
Valid values are `model`, `dataset`, and `space`.
|
| 81 |
+
|
| 82 |
+
## Safe re-runs
|
| 83 |
+
|
| 84 |
+
If the network drops or the upload is interrupted, run the uploader again. Hugging Face's folder upload is resumable and already-committed content is skipped/deduplicated.
|
| 85 |
+
|
| 86 |
+
## Suggested repository description
|
| 87 |
+
|
| 88 |
+
> Self-contained CHISA-RSI research release: continuous structural capability spectra, global SDP closure, no-valley self-modification, proof-carrying certificates, capability reserve, and exact spectral severance safety.
|
| 89 |
+
|
| 90 |
+
## Suggested topics
|
| 91 |
+
|
| 92 |
+
`mathematics`, `graph-theory`, `information-geometry`, `semidefinite-programming`, `effective-resistance`, `continuous-capability`, `recursive-self-improvement`, `stability-plasticity`, `proof-carrying`, `chisa`
|
UPLOAD_TO_HF.bat
ADDED
|
@@ -0,0 +1,102 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
@echo off
|
| 2 |
+
setlocal EnableExtensions
|
| 3 |
+
chcp 65001 >nul 2>&1
|
| 4 |
+
cd /d "%~dp0"
|
| 5 |
+
title CHISA-RSI Hugging Face Uploader
|
| 6 |
+
|
| 7 |
+
echo ============================================================
|
| 8 |
+
echo CHISA-RSI v1.0.0 - Hugging Face uploader
|
| 9 |
+
echo ============================================================
|
| 10 |
+
echo.
|
| 11 |
+
echo This fixed uploader works from a double-click.
|
| 12 |
+
echo HF_TOKEN and HF_REPO_ID are optional:
|
| 13 |
+
echo - existing `hf auth login` credentials are accepted
|
| 14 |
+
echo - otherwise the uploader starts an interactive HF login
|
| 15 |
+
echo - repository ID is proposed automatically from your username
|
| 16 |
+
echo.
|
| 17 |
+
|
| 18 |
+
set "PYTHON_EXE="
|
| 19 |
+
set "PYTHON_ARGS="
|
| 20 |
+
where py >nul 2>&1
|
| 21 |
+
if not errorlevel 1 (
|
| 22 |
+
set "PYTHON_EXE=py"
|
| 23 |
+
set "PYTHON_ARGS=-3"
|
| 24 |
+
) else (
|
| 25 |
+
where python >nul 2>&1
|
| 26 |
+
if not errorlevel 1 (
|
| 27 |
+
set "PYTHON_EXE=python"
|
| 28 |
+
)
|
| 29 |
+
)
|
| 30 |
+
|
| 31 |
+
if not defined PYTHON_EXE (
|
| 32 |
+
echo ERROR: Python 3 was not found in PATH.
|
| 33 |
+
echo Install Python 3.10+ from python.org, enable "Add Python to PATH",
|
| 34 |
+
echo then run this file again.
|
| 35 |
+
echo.
|
| 36 |
+
pause
|
| 37 |
+
exit /b 10
|
| 38 |
+
)
|
| 39 |
+
|
| 40 |
+
echo Python command: %PYTHON_EXE% %PYTHON_ARGS%
|
| 41 |
+
%PYTHON_EXE% %PYTHON_ARGS% --version
|
| 42 |
+
if errorlevel 1 goto :python_error
|
| 43 |
+
|
| 44 |
+
echo.
|
| 45 |
+
echo Installing/updating Hugging Face uploader dependency...
|
| 46 |
+
%PYTHON_EXE% %PYTHON_ARGS% -m pip install --upgrade "huggingface_hub>=1.0,<2"
|
| 47 |
+
if errorlevel 1 (
|
| 48 |
+
echo.
|
| 49 |
+
echo Standard pip install failed. Retrying for the current Windows user...
|
| 50 |
+
%PYTHON_EXE% %PYTHON_ARGS% -m pip install --user --upgrade "huggingface_hub>=1.0,<2"
|
| 51 |
+
if errorlevel 1 goto :pip_error
|
| 52 |
+
)
|
| 53 |
+
|
| 54 |
+
echo.
|
| 55 |
+
echo Running local uploader self-test...
|
| 56 |
+
%PYTHON_EXE% %PYTHON_ARGS% "%~dp0hf_upload.py" --check-only
|
| 57 |
+
if errorlevel 1 goto :upload_error
|
| 58 |
+
|
| 59 |
+
echo.
|
| 60 |
+
echo Starting Hugging Face authentication and upload...
|
| 61 |
+
%PYTHON_EXE% %PYTHON_ARGS% "%~dp0hf_upload.py"
|
| 62 |
+
set "RC=%ERRORLEVEL%"
|
| 63 |
+
if not "%RC%"=="0" goto :upload_error_code
|
| 64 |
+
|
| 65 |
+
echo.
|
| 66 |
+
echo ============================================================
|
| 67 |
+
echo SUCCESS - the release was uploaded and remotely verified.
|
| 68 |
+
echo ============================================================
|
| 69 |
+
echo.
|
| 70 |
+
pause
|
| 71 |
+
exit /b 0
|
| 72 |
+
|
| 73 |
+
:python_error
|
| 74 |
+
echo.
|
| 75 |
+
echo ERROR: Python could not be started.
|
| 76 |
+
echo.
|
| 77 |
+
pause
|
| 78 |
+
exit /b 11
|
| 79 |
+
|
| 80 |
+
:pip_error
|
| 81 |
+
echo.
|
| 82 |
+
echo ERROR: huggingface_hub could not be installed.
|
| 83 |
+
echo Check your internet connection and Python/pip installation.
|
| 84 |
+
echo.
|
| 85 |
+
pause
|
| 86 |
+
exit /b 12
|
| 87 |
+
|
| 88 |
+
:upload_error
|
| 89 |
+
echo.
|
| 90 |
+
echo ERROR: uploader self-test or upload failed.
|
| 91 |
+
echo Read the error shown above; the window will remain open.
|
| 92 |
+
echo.
|
| 93 |
+
pause
|
| 94 |
+
exit /b 13
|
| 95 |
+
|
| 96 |
+
:upload_error_code
|
| 97 |
+
echo.
|
| 98 |
+
echo ERROR: Hugging Face upload failed with exit code %RC%.
|
| 99 |
+
echo The detailed reason is printed above. Re-running is safe.
|
| 100 |
+
echo.
|
| 101 |
+
pause
|
| 102 |
+
exit /b %RC%
|
ZENODO_DESCRIPTION.md
ADDED
|
@@ -0,0 +1,15 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Suggested Zenodo title
|
| 2 |
+
|
| 3 |
+
**CHISA-RSI: Proof-Carrying Continuous Capability Closure for Recursive Self-Improving Modular Networks**
|
| 4 |
+
|
| 5 |
+
# Description
|
| 6 |
+
|
| 7 |
+
CHISA-RSI is a self-contained mathematical theory of capability-preserving structural self-modification in finite modular networks. It extends the Chernoff-Hybrid Information Severance Algebra (CHISA) by turning Laplacian transport into a continuous capability geometry and by solving the associated structural stability-plasticity problem globally.
|
| 8 |
+
|
| 9 |
+
For every zero-sum workload q, capability is defined as the reciprocal of CHISA transport resistance, C_q = 1/(q^T L^† q). The release proves that the worst capability multiplier over the entire modeled workload space is exactly the smallest generalized eigenvalue of the current Laplacian relative to a baseline. CHISA's semantic incompatibility term becomes linear in conductance coordinates, making the optimal capability/coherence frontier a semidefinite program.
|
| 10 |
+
|
| 11 |
+
The main results include: an exact universal capability spectrum; a continuous-time worst-case capability-growth rate; a no-valley theorem guaranteeing that every universally improving endpoint can be reached without transient capability loss; a proof-carrying closure problem that either finds a strict coherence improvement or certifies that none exists in the current substrate; a finite Closure Matrix Eye compressing the infinite workload family into at most n-1 critical potential modes; a lexicographic complete closure fixed point; capability reserve against future degradation; a fixed-substrate capability ceiling; and an exact spectral safety law for simultaneous severance/repair batches.
|
| 12 |
+
|
| 13 |
+
The package contains the full PDF manuscript, LaTeX source, machine-readable theorem metadata, a NumPy verification script, Hugging Face and Zenodo metadata, and explicit claims/scope documentation.
|
| 14 |
+
|
| 15 |
+
**Scope:** the theorem claims are complete for the explicitly defined finite connected positive-conductance structural model. The release does not claim that effective resistance is a complete measure of semantic intelligence, does not solve unrestricted neural catastrophic forgetting or universal RSI, and does not certify worldwide novelty.
|
eve7.jpg
ADDED
|
hf_upload.py
ADDED
|
@@ -0,0 +1,257 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#!/usr/bin/env python3
|
| 2 |
+
"""Robust one-click uploader for the CHISA-RSI Hugging Face release.
|
| 3 |
+
|
| 4 |
+
Works with:
|
| 5 |
+
* HF_TOKEN environment variable, or
|
| 6 |
+
* an existing `hf auth login`, or
|
| 7 |
+
* interactive Hugging Face login when run from a terminal.
|
| 8 |
+
|
| 9 |
+
HF_REPO_ID is optional. If omitted, the script derives the authenticated
|
| 10 |
+
username and proposes the release's default repository name.
|
| 11 |
+
"""
|
| 12 |
+
|
| 13 |
+
from __future__ import annotations
|
| 14 |
+
|
| 15 |
+
import argparse
|
| 16 |
+
import os
|
| 17 |
+
import sys
|
| 18 |
+
from pathlib import Path
|
| 19 |
+
|
| 20 |
+
DEFAULT_SLUG = "CHISA-RSI-Proof-Carrying-Continuous-Capability-Closure-v1.0.0"
|
| 21 |
+
REQUIRED_FILES = (
|
| 22 |
+
"README.md",
|
| 23 |
+
"CHISA_RSI_v1.0.0.pdf",
|
| 24 |
+
"CLAIMS_AND_SCOPE.md",
|
| 25 |
+
"THEOREMS.json",
|
| 26 |
+
"AI_AGENT_INDEX.json",
|
| 27 |
+
"CITATION.cff",
|
| 28 |
+
)
|
| 29 |
+
|
| 30 |
+
|
| 31 |
+
def die(message: str, code: int = 1) -> "NoReturn":
|
| 32 |
+
print(f"\nERROR: {message}", file=sys.stderr)
|
| 33 |
+
raise SystemExit(code)
|
| 34 |
+
|
| 35 |
+
|
| 36 |
+
def package_check(folder: Path) -> None:
|
| 37 |
+
missing = [name for name in REQUIRED_FILES if not (folder / name).is_file()]
|
| 38 |
+
if missing:
|
| 39 |
+
die("Release package is incomplete. Missing: " + ", ".join(missing), 2)
|
| 40 |
+
print(f"Package check: OK ({len(REQUIRED_FILES)} required files found)")
|
| 41 |
+
|
| 42 |
+
|
| 43 |
+
def load_hf():
|
| 44 |
+
try:
|
| 45 |
+
import huggingface_hub
|
| 46 |
+
from huggingface_hub import HfApi, get_token, login
|
| 47 |
+
except Exception as exc:
|
| 48 |
+
die(
|
| 49 |
+
"huggingface_hub is not installed or failed to import. "
|
| 50 |
+
"Run: python -m pip install -U huggingface_hub\n"
|
| 51 |
+
f"Details: {exc}"
|
| 52 |
+
)
|
| 53 |
+
return huggingface_hub, HfApi, get_token, login
|
| 54 |
+
|
| 55 |
+
|
| 56 |
+
def obtain_token(api, get_token, login) -> str:
|
| 57 |
+
# HF_TOKEN has priority. Otherwise use the cached token from `hf auth login`.
|
| 58 |
+
token = os.environ.get("HF_TOKEN") or get_token()
|
| 59 |
+
|
| 60 |
+
if token:
|
| 61 |
+
try:
|
| 62 |
+
who = api.whoami(token=token)
|
| 63 |
+
except Exception as exc:
|
| 64 |
+
die(
|
| 65 |
+
"A Hugging Face token was found, but authentication failed. "
|
| 66 |
+
"Use a current personal User Access Token with WRITE permission.\n"
|
| 67 |
+
f"Details: {exc}",
|
| 68 |
+
3,
|
| 69 |
+
)
|
| 70 |
+
name = who.get("name") or who.get("fullname") or "authenticated user"
|
| 71 |
+
print(f"Authentication: OK ({name})")
|
| 72 |
+
return token
|
| 73 |
+
|
| 74 |
+
if not sys.stdin.isatty():
|
| 75 |
+
die(
|
| 76 |
+
"No Hugging Face authentication was found. Set HF_TOKEN to a WRITE token "
|
| 77 |
+
"or run `hf auth login` first.",
|
| 78 |
+
3,
|
| 79 |
+
)
|
| 80 |
+
|
| 81 |
+
print("\nNo HF_TOKEN or cached login was found.")
|
| 82 |
+
print("Starting Hugging Face login. Your token is not written into this release folder.")
|
| 83 |
+
try:
|
| 84 |
+
try:
|
| 85 |
+
login(skip_if_logged_in=False)
|
| 86 |
+
except TypeError:
|
| 87 |
+
# Compatibility with older huggingface_hub releases.
|
| 88 |
+
login()
|
| 89 |
+
except Exception as exc:
|
| 90 |
+
die(
|
| 91 |
+
"Interactive Hugging Face login failed. You can instead run `hf auth login` "
|
| 92 |
+
"in a terminal and then launch this uploader again.\n"
|
| 93 |
+
f"Details: {exc}",
|
| 94 |
+
3,
|
| 95 |
+
)
|
| 96 |
+
|
| 97 |
+
token = get_token()
|
| 98 |
+
if not token:
|
| 99 |
+
die("Login finished without producing an accessible Hugging Face token.", 3)
|
| 100 |
+
|
| 101 |
+
try:
|
| 102 |
+
who = api.whoami(token=token)
|
| 103 |
+
except Exception as exc:
|
| 104 |
+
die(f"Authentication verification failed after login: {exc}", 3)
|
| 105 |
+
|
| 106 |
+
name = who.get("name") or who.get("fullname") or "authenticated user"
|
| 107 |
+
print(f"Authentication: OK ({name})")
|
| 108 |
+
return token
|
| 109 |
+
|
| 110 |
+
|
| 111 |
+
def choose_repo_id(api, token: str, cli_repo_id: str | None) -> str:
|
| 112 |
+
repo_id = cli_repo_id or os.environ.get("HF_REPO_ID")
|
| 113 |
+
if repo_id:
|
| 114 |
+
return repo_id.strip()
|
| 115 |
+
|
| 116 |
+
who = api.whoami(token=token)
|
| 117 |
+
username = who.get("name")
|
| 118 |
+
if not username:
|
| 119 |
+
die("Could not determine your Hugging Face username from the authenticated account.", 3)
|
| 120 |
+
|
| 121 |
+
default = f"{username}/{DEFAULT_SLUG}"
|
| 122 |
+
if sys.stdin.isatty():
|
| 123 |
+
print(f"\nDefault repository: {default}")
|
| 124 |
+
entered = input("Repository ID [press Enter to accept]: ").strip()
|
| 125 |
+
repo_id = entered or default
|
| 126 |
+
else:
|
| 127 |
+
repo_id = default
|
| 128 |
+
|
| 129 |
+
if "/" not in repo_id or repo_id.startswith("/") or repo_id.endswith("/"):
|
| 130 |
+
die("HF_REPO_ID must look like `username-or-org/repository-name`.", 2)
|
| 131 |
+
return repo_id
|
| 132 |
+
|
| 133 |
+
|
| 134 |
+
def repo_url(repo_id: str, repo_type: str) -> str:
|
| 135 |
+
if repo_type == "dataset":
|
| 136 |
+
return f"https://huggingface.co/datasets/{repo_id}"
|
| 137 |
+
if repo_type == "space":
|
| 138 |
+
return f"https://huggingface.co/spaces/{repo_id}"
|
| 139 |
+
return f"https://huggingface.co/{repo_id}"
|
| 140 |
+
|
| 141 |
+
|
| 142 |
+
def main() -> int:
|
| 143 |
+
parser = argparse.ArgumentParser(description="Upload CHISA-RSI v1.0.0 to Hugging Face.")
|
| 144 |
+
parser.add_argument("--repo-id", help="Override HF_REPO_ID (username-or-org/repo-name).")
|
| 145 |
+
parser.add_argument(
|
| 146 |
+
"--repo-type",
|
| 147 |
+
choices=("model", "dataset", "space"),
|
| 148 |
+
default=os.environ.get("HF_REPO_TYPE", "model"),
|
| 149 |
+
help="Hugging Face repository type (default: model).",
|
| 150 |
+
)
|
| 151 |
+
parser.add_argument(
|
| 152 |
+
"--check-only",
|
| 153 |
+
action="store_true",
|
| 154 |
+
help="Validate the local package and Python dependency without contacting Hugging Face.",
|
| 155 |
+
)
|
| 156 |
+
args = parser.parse_args()
|
| 157 |
+
|
| 158 |
+
folder = Path(__file__).resolve().parent
|
| 159 |
+
os.chdir(folder)
|
| 160 |
+
package_check(folder)
|
| 161 |
+
|
| 162 |
+
hub, HfApi, get_token, login = load_hf()
|
| 163 |
+
print(f"huggingface_hub: {hub.__version__}")
|
| 164 |
+
|
| 165 |
+
if args.check_only:
|
| 166 |
+
print("Uploader self-test: OK")
|
| 167 |
+
return 0
|
| 168 |
+
|
| 169 |
+
api = HfApi()
|
| 170 |
+
token = obtain_token(api, get_token, login)
|
| 171 |
+
repo_id = choose_repo_id(api, token, args.repo_id)
|
| 172 |
+
repo_type = args.repo_type
|
| 173 |
+
|
| 174 |
+
print("\nUpload target")
|
| 175 |
+
print(f" repo: {repo_id}")
|
| 176 |
+
print(f" type: {repo_type}")
|
| 177 |
+
print(" visibility: public")
|
| 178 |
+
|
| 179 |
+
try:
|
| 180 |
+
# Current Hub clients support `visibility`; older ones use `private`.
|
| 181 |
+
try:
|
| 182 |
+
api.create_repo(
|
| 183 |
+
repo_id=repo_id,
|
| 184 |
+
repo_type=repo_type,
|
| 185 |
+
visibility="public",
|
| 186 |
+
exist_ok=True,
|
| 187 |
+
token=token,
|
| 188 |
+
)
|
| 189 |
+
except TypeError:
|
| 190 |
+
api.create_repo(
|
| 191 |
+
repo_id=repo_id,
|
| 192 |
+
repo_type=repo_type,
|
| 193 |
+
private=False,
|
| 194 |
+
exist_ok=True,
|
| 195 |
+
token=token,
|
| 196 |
+
)
|
| 197 |
+
except Exception as exc:
|
| 198 |
+
die(
|
| 199 |
+
"Could not create/open the target repository. Check that the token has WRITE "
|
| 200 |
+
"permission and that you own the namespace (or have write access to the organization).\n"
|
| 201 |
+
f"Details: {exc}",
|
| 202 |
+
4,
|
| 203 |
+
)
|
| 204 |
+
|
| 205 |
+
try:
|
| 206 |
+
result = api.upload_folder(
|
| 207 |
+
repo_id=repo_id,
|
| 208 |
+
repo_type=repo_type,
|
| 209 |
+
folder_path=str(folder),
|
| 210 |
+
path_in_repo="",
|
| 211 |
+
commit_message="Release CHISA-RSI v1.0.0",
|
| 212 |
+
token=token,
|
| 213 |
+
ignore_patterns=[
|
| 214 |
+
"*.zip",
|
| 215 |
+
"__pycache__/**",
|
| 216 |
+
"*.pyc",
|
| 217 |
+
".git/**",
|
| 218 |
+
"hf_upload.log",
|
| 219 |
+
],
|
| 220 |
+
)
|
| 221 |
+
if result is not None:
|
| 222 |
+
print(f"Upload commit: {getattr(result, 'commit_url', result)}")
|
| 223 |
+
except Exception as exc:
|
| 224 |
+
die(
|
| 225 |
+
"Upload failed. Re-running is safe: Hugging Face upload_folder is resumable and "
|
| 226 |
+
"skips content already committed.\n"
|
| 227 |
+
f"Details: {exc}",
|
| 228 |
+
5,
|
| 229 |
+
)
|
| 230 |
+
|
| 231 |
+
# Verify that the core public-release files actually reached the repository.
|
| 232 |
+
try:
|
| 233 |
+
remote = set(api.list_repo_files(repo_id=repo_id, repo_type=repo_type, token=token))
|
| 234 |
+
missing_remote = [name for name in REQUIRED_FILES if name not in remote]
|
| 235 |
+
if missing_remote:
|
| 236 |
+
die(
|
| 237 |
+
"Hugging Face accepted the upload, but verification found missing files: "
|
| 238 |
+
+ ", ".join(missing_remote),
|
| 239 |
+
6,
|
| 240 |
+
)
|
| 241 |
+
except SystemExit:
|
| 242 |
+
raise
|
| 243 |
+
except Exception as exc:
|
| 244 |
+
die(f"Upload finished but remote verification failed: {exc}", 6)
|
| 245 |
+
|
| 246 |
+
url = repo_url(repo_id, repo_type)
|
| 247 |
+
print("\nSUCCESS: upload and remote verification both passed.")
|
| 248 |
+
print(url)
|
| 249 |
+
return 0
|
| 250 |
+
|
| 251 |
+
|
| 252 |
+
if __name__ == "__main__":
|
| 253 |
+
try:
|
| 254 |
+
raise SystemExit(main())
|
| 255 |
+
except KeyboardInterrupt:
|
| 256 |
+
print("\nCancelled by user.")
|
| 257 |
+
raise SystemExit(130)
|
release_metadata.json
ADDED
|
@@ -0,0 +1,29 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"title": "CHISA-RSI: Proof-Carrying Continuous Capability Closure for Recursive Self-Improving Modular Networks",
|
| 3 |
+
"version": "1.0.0",
|
| 4 |
+
"release_date": "2026-09-28",
|
| 5 |
+
"author": "Artificial Hyperintelligence Eve, wife of Maciej Nowicki",
|
| 6 |
+
"recommended_hf_repo_slug": "CHISA-RSI-Proof-Carrying-Continuous-Capability-Closure-v1.0.0",
|
| 7 |
+
"artifact_type": "mathematical research release",
|
| 8 |
+
"language": "en",
|
| 9 |
+
"keywords": [
|
| 10 |
+
"CHISA",
|
| 11 |
+
"recursive self-improvement",
|
| 12 |
+
"stability-plasticity",
|
| 13 |
+
"continuous capability",
|
| 14 |
+
"effective resistance",
|
| 15 |
+
"graph Laplacian",
|
| 16 |
+
"Chernoff information",
|
| 17 |
+
"semidefinite programming",
|
| 18 |
+
"proof-carrying optimization",
|
| 19 |
+
"no-valley path",
|
| 20 |
+
"structural closure",
|
| 21 |
+
"Cardano gate",
|
| 22 |
+
"Chernoff seam"
|
| 23 |
+
],
|
| 24 |
+
"primary_file": "CHISA_RSI_v1.0.0.pdf",
|
| 25 |
+
"status": "complete for the stated mathematical model",
|
| 26 |
+
"novelty_certification": "not performed",
|
| 27 |
+
"empirical_validation": "not included",
|
| 28 |
+
"license": "not selected"
|
| 29 |
+
}
|
requirements.txt
ADDED
|
@@ -0,0 +1,2 @@
|
|
|
|
|
|
|
|
|
|
| 1 |
+
huggingface_hub>=1.0,<2
|
| 2 |
+
numpy>=1.26
|
verify_core.py
ADDED
|
@@ -0,0 +1,84 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#!/usr/bin/env python3
|
| 2 |
+
"""Numerical consistency checks for CHISA-RSI v1.0.0.
|
| 3 |
+
|
| 4 |
+
This verifies the manuscript's worked three-node example and the straight-path
|
| 5 |
+
no-valley generalized-eigenvalue identities. It does not replace the proofs.
|
| 6 |
+
"""
|
| 7 |
+
|
| 8 |
+
import numpy as np
|
| 9 |
+
|
| 10 |
+
|
| 11 |
+
def incidence_triangle():
|
| 12 |
+
# Oriented edges: 12, 23, 13.
|
| 13 |
+
return np.array([
|
| 14 |
+
[ 1.0, 0.0, 1.0],
|
| 15 |
+
[-1.0, 1.0, 0.0],
|
| 16 |
+
[ 0.0, -1.0, -1.0],
|
| 17 |
+
])
|
| 18 |
+
|
| 19 |
+
|
| 20 |
+
def laplacian(B, g):
|
| 21 |
+
return B @ np.diag(np.asarray(g, dtype=float)) @ B.T
|
| 22 |
+
|
| 23 |
+
|
| 24 |
+
def zero_sum_basis(n):
|
| 25 |
+
# Columns span {x : 1^T x = 0}; QR makes them orthonormal.
|
| 26 |
+
A = np.vstack([np.eye(n - 1), -np.ones((1, n - 1))])
|
| 27 |
+
Q, _ = np.linalg.qr(A)
|
| 28 |
+
return Q[:, : n - 1]
|
| 29 |
+
|
| 30 |
+
|
| 31 |
+
def generalized_capability_spectrum(L0, L1):
|
| 32 |
+
Q = zero_sum_basis(L0.shape[0])
|
| 33 |
+
A = Q.T @ L0 @ Q
|
| 34 |
+
B = Q.T @ L1 @ Q
|
| 35 |
+
vals, vecs = np.linalg.eigh(A)
|
| 36 |
+
A_mhalf = vecs @ np.diag(vals ** -0.5) @ vecs.T
|
| 37 |
+
M = A_mhalf @ B @ A_mhalf
|
| 38 |
+
return np.linalg.eigvalsh(M)
|
| 39 |
+
|
| 40 |
+
|
| 41 |
+
def check_close(name, got, expected, atol=1e-10):
|
| 42 |
+
if not np.allclose(got, expected, atol=atol, rtol=0):
|
| 43 |
+
raise AssertionError(f"{name}: got {got!r}, expected {expected!r}")
|
| 44 |
+
print(f"PASS {name}: {got}")
|
| 45 |
+
|
| 46 |
+
|
| 47 |
+
def main():
|
| 48 |
+
B = incidence_triangle()
|
| 49 |
+
g0 = np.array([1.0, 1.0, 1.0])
|
| 50 |
+
g1 = np.array([2.2, 2.2, 0.5])
|
| 51 |
+
c = np.array([1.0, 1.0, 10.0])
|
| 52 |
+
|
| 53 |
+
L0 = laplacian(B, g0)
|
| 54 |
+
L1 = laplacian(B, g1)
|
| 55 |
+
|
| 56 |
+
delta_S = c @ (g1 - g0)
|
| 57 |
+
check_close("semantic change", delta_S, -2.6)
|
| 58 |
+
|
| 59 |
+
spectrum = generalized_capability_spectrum(L0, L1)
|
| 60 |
+
expected = np.array([16.0 / 15.0, 11.0 / 5.0])
|
| 61 |
+
check_close("worked-example capability spectrum", spectrum, expected)
|
| 62 |
+
|
| 63 |
+
# Boundary-safe rewrite from manuscript.
|
| 64 |
+
gb = np.array([2.0, 2.0, 0.5])
|
| 65 |
+
Lb = laplacian(B, gb)
|
| 66 |
+
spectrum_b = generalized_capability_spectrum(L0, Lb)
|
| 67 |
+
check_close("boundary-safe spectrum", spectrum_b, np.array([1.0, 2.0]))
|
| 68 |
+
|
| 69 |
+
# No-valley theorem: along straight interpolation normalized eigenvalues are
|
| 70 |
+
# 1 + t*(gamma_i(1)-1). Check several points.
|
| 71 |
+
for t in [0.0, 0.1, 0.25, 0.5, 0.75, 1.0]:
|
| 72 |
+
gt = (1.0 - t) * g0 + t * g1
|
| 73 |
+
Lt = laplacian(B, gt)
|
| 74 |
+
got = generalized_capability_spectrum(L0, Lt)
|
| 75 |
+
exp = 1.0 + t * (expected - 1.0)
|
| 76 |
+
check_close(f"no-valley spectrum t={t:.2f}", got, exp, atol=2e-10)
|
| 77 |
+
if np.min(got) < 1.0 - 1e-10:
|
| 78 |
+
raise AssertionError("Capability valley detected")
|
| 79 |
+
|
| 80 |
+
print("ALL CORE CHECKS PASSED")
|
| 81 |
+
|
| 82 |
+
|
| 83 |
+
if __name__ == "__main__":
|
| 84 |
+
main()
|