Spaces:
Running
Running
chore(sync): mirror backend .py + Dockerfile to Space (hf-sync-backend)
Browse filesAutomated backend sync from szl-holdings/a11oy main via hf-sync-backend.
Updated (differed from the Space): Dockerfile, serve.py, szl3d_holographic.py, szl_brainconstitution.py
Deleted (gone from the repo + Dockerfile COPY set): (none)
Keeps the Space-built backend (serve.py + the Dockerfile-COPY'd .py
modules) identical to GitHub main so the Space never rebuilds from a
stale backend, new endpoints don't 404 there, and orphaned modules
removed from the repo don't linger in the Space tree.
- Dockerfile +1 -1
- serve.py +18 -0
- szl3d_holographic.py +1 -0
- szl_brainconstitution.py +840 -0
Dockerfile
CHANGED
|
@@ -1600,7 +1600,7 @@ COPY szl_spend_cap.py ./szl_spend_cap.py
|
|
| 1600 |
# reads defensively — degrading honestly (an honest placeholder tile) if the endpoint is
|
| 1601 |
# unreachable at runtime. No backend module.
|
| 1602 |
# --- buildkit max-depth fix: per-file COPYs grouped into one layer (no file dropped; every source token preserved). ---
|
| 1603 |
-
COPY a11oy_model_intel.py a11oy_experimental_tier.py a11oy_markets.py szl_agent_tts.py szl_gated_delta.py szl_blocksparse.py szl_retrieval_attn.py szl_model_harness.py szl_agent_loop_governed.py szl_crypto_pipeline.py szl_confattest.py szl_agent_operate.py szl_agentloop_brain.py szl_governed_rag.py szl_sovereign_flywheel.py szl_brain_corpus.py szl_verify_transcript.py szl_frontier_index.py szl_whatsnew.py szl_honestywall.py szl_brainmemory.py szl_agentos.py szl_brainground.py szl_brainuncertainty.py szl_brainhealth.py szl_brainwatch.py szl_boot_preflight.py szl_guarded_surface.py szl_status_aggregate.py ./
|
| 1604 |
COPY static/3d/surfaces/gateddelta.js static/3d/surfaces/blocksparse.js static/3d/surfaces/retrievalattn.js static/3d/surfaces/governedagent.js static/3d/surfaces/cryptopipeline.js static/3d/surfaces/confattest.js static/3d/surfaces/agentops.js static/3d/surfaces/frontierindex.js static/3d/surfaces/whatsnew.js static/3d/surfaces/opsdash.js ./static/3d/surfaces/
|
| 1605 |
|
| 1606 |
# git_sha wireup (FORGE-INSTRUCTION-gitsha-quiet-window): surface the deployed commit
|
|
|
|
| 1600 |
# reads defensively — degrading honestly (an honest placeholder tile) if the endpoint is
|
| 1601 |
# unreachable at runtime. No backend module.
|
| 1602 |
# --- buildkit max-depth fix: per-file COPYs grouped into one layer (no file dropped; every source token preserved). ---
|
| 1603 |
+
COPY a11oy_model_intel.py a11oy_experimental_tier.py a11oy_markets.py szl_agent_tts.py szl_gated_delta.py szl_blocksparse.py szl_retrieval_attn.py szl_model_harness.py szl_agent_loop_governed.py szl_crypto_pipeline.py szl_confattest.py szl_agent_operate.py szl_agentloop_brain.py szl_governed_rag.py szl_sovereign_flywheel.py szl_brain_corpus.py szl_verify_transcript.py szl_frontier_index.py szl_whatsnew.py szl_honestywall.py szl_brainmemory.py szl_agentos.py szl_brainground.py szl_brainuncertainty.py szl_brainhealth.py szl_brainwatch.py szl_boot_preflight.py szl_guarded_surface.py szl_status_aggregate.py szl_brainconstitution.py ./
|
| 1604 |
COPY static/3d/surfaces/gateddelta.js static/3d/surfaces/blocksparse.js static/3d/surfaces/retrievalattn.js static/3d/surfaces/governedagent.js static/3d/surfaces/cryptopipeline.js static/3d/surfaces/confattest.js static/3d/surfaces/agentops.js static/3d/surfaces/frontierindex.js static/3d/surfaces/whatsnew.js static/3d/surfaces/opsdash.js ./static/3d/surfaces/
|
| 1605 |
|
| 1606 |
# git_sha wireup (FORGE-INSTRUCTION-gitsha-quiet-window): surface the deployed commit
|
serve.py
CHANGED
|
@@ -1243,6 +1243,24 @@ except Exception as _braingaps_e: # pragma: no cover
|
|
| 1243 |
print(f"[a11oy] Brain gaps NOT registered: {_braingaps_e!r}; SPA + API unaffected", file=__import__("sys").stderr)
|
| 1244 |
|
| 1245 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1246 |
# -- BRAIN COMMAND view (Wave O / Dev 5) — the founder's "Brain powering the
|
| 1247 |
# ecosystem" dashboard. Read-only command rollup over the Brain nervous-system hub:
|
| 1248 |
# GET /api/a11oy/v1/brain/command → {knowledge harvested, energy harnessed, organs/
|
|
|
|
| 1243 |
print(f"[a11oy] Brain gaps NOT registered: {_braingaps_e!r}; SPA + API unaffected", file=__import__("sys").stderr)
|
| 1244 |
|
| 1245 |
|
| 1246 |
+
# -- BRAIN CONSTITUTION (feat/frontier-brainconstitution) — the honest, machine-checkable
|
| 1247 |
+
# ruleset the brain is graded against per query, the capstone over the brain-honesty surfaces:
|
| 1248 |
+
# GET /api/a11oy/v1/brain/constitution/info (Articles + method), GET
|
| 1249 |
+
# /api/a11oy/v1/brain/constitution?q=&k= (per-Article COMPLIANT/VIOLATED/UNAVAILABLE + overall
|
| 1250 |
+
# CONSTITUTIONAL/IN-VIOLATION/INSUFFICIENT-SIGNAL verdict; mints nothing), POST
|
| 1251 |
+
# /api/a11oy/v1/brain/constitution/receipt (unsigned SHA-256 receipt-on-write). Grades each
|
| 1252 |
+
# Article against whatever sibling brain-honesty surfaces are importable (guarded imports; an
|
| 1253 |
+
# absent surface is UNAVAILABLE, NEVER a fabricated pass); NEVER CONSTITUTIONAL while any
|
| 1254 |
+
# evaluable Article is VIOLATED; never upgrades a label. Pure reads on GET (0 sign-on-GET).
|
| 1255 |
+
# Registered BEFORE the SPA /{full_path:path} catch-all. Additive, try/except-guarded.
|
| 1256 |
+
try:
|
| 1257 |
+
import szl_brainconstitution as _szl_brainconstitution
|
| 1258 |
+
_brainconstitution_status = _szl_brainconstitution.register(app, ns="a11oy")
|
| 1259 |
+
print(f"[a11oy] Brain constitution registered: {_brainconstitution_status}", file=__import__("sys").stderr)
|
| 1260 |
+
except Exception as _brainconstitution_e: # pragma: no cover
|
| 1261 |
+
print(f"[a11oy] Brain constitution NOT registered: {_brainconstitution_e!r}; SPA + API unaffected", file=__import__("sys").stderr)
|
| 1262 |
+
|
| 1263 |
+
|
| 1264 |
# -- BRAIN COMMAND view (Wave O / Dev 5) — the founder's "Brain powering the
|
| 1265 |
# ecosystem" dashboard. Read-only command rollup over the Brain nervous-system hub:
|
| 1266 |
# GET /api/a11oy/v1/brain/command → {knowledge harvested, energy harnessed, organs/
|
szl3d_holographic.py
CHANGED
|
@@ -149,6 +149,7 @@ SURFACES: List[Dict[str, str]] = [
|
|
| 149 |
{"id": "brainlineage", "cat": "brain", "title": "Brain Lineage · node-origin chain · how each knowledge-graph node ENTERED the graph, read VERBATIM from its OWN real origin fields (source/url → structural derivation → none) → TRACED/PARTIAL-LINEAGE/UNKNOWN-ORIGIN, a node with no source is UNKNOWN-ORIGIN never a fabricated source, aggregate never TRACED while any origin UNKNOWN, unsigned SHA-256 receipt-on-write (node-origin lineage, NOT per-answer provenance, NOT build/model attestation)", "owner": "WaveT-Dev1"},
|
| 150 |
{"id": "brainexplain", "cat": "brain", "title": "Brain Explain · transparent explanation of WHY the brain retrieved what it did · MODELED descriptive trace over the REAL retrieval subgraph (which query terms matched which seed nodes, per-node ppr-vs-salience rationale, communities traversed, each node's OWN label VERBATIM) → EXPLAINABLE/PARTIALLY-EXPLAINABLE/OPAQUE (never invents a rationale; honest OPAQUE beats a fake one), unsigned SHA-256 receipt-on-write", "owner": "WaveT-Dev1"},
|
| 151 |
{"id": "braingaps", "cat": "brain", "title": "Brain Gaps · an honest map of what the brain does NOT know · MEASURED thin (sparse) communities + weakly-connected island nodes (degree≤1) + weak-label share over the live graph, and per-query COVERED/THIN/GAP grounding → estate verdict WELL-COVERED/PATCHY/SPARSE (a GAP is never fabricated into coverage), unsigned SHA-256 receipt-on-write (MODELED)", "owner": "WaveT-Dev1"},
|
|
|
|
| 152 |
]
|
| 153 |
|
| 154 |
# Content-type by extension (the only extensions we serve from the 3d tree).
|
|
|
|
| 149 |
{"id": "brainlineage", "cat": "brain", "title": "Brain Lineage · node-origin chain · how each knowledge-graph node ENTERED the graph, read VERBATIM from its OWN real origin fields (source/url → structural derivation → none) → TRACED/PARTIAL-LINEAGE/UNKNOWN-ORIGIN, a node with no source is UNKNOWN-ORIGIN never a fabricated source, aggregate never TRACED while any origin UNKNOWN, unsigned SHA-256 receipt-on-write (node-origin lineage, NOT per-answer provenance, NOT build/model attestation)", "owner": "WaveT-Dev1"},
|
| 150 |
{"id": "brainexplain", "cat": "brain", "title": "Brain Explain · transparent explanation of WHY the brain retrieved what it did · MODELED descriptive trace over the REAL retrieval subgraph (which query terms matched which seed nodes, per-node ppr-vs-salience rationale, communities traversed, each node's OWN label VERBATIM) → EXPLAINABLE/PARTIALLY-EXPLAINABLE/OPAQUE (never invents a rationale; honest OPAQUE beats a fake one), unsigned SHA-256 receipt-on-write", "owner": "WaveT-Dev1"},
|
| 151 |
{"id": "braingaps", "cat": "brain", "title": "Brain Gaps · an honest map of what the brain does NOT know · MEASURED thin (sparse) communities + weakly-connected island nodes (degree≤1) + weak-label share over the live graph, and per-query COVERED/THIN/GAP grounding → estate verdict WELL-COVERED/PATCHY/SPARSE (a GAP is never fabricated into coverage), unsigned SHA-256 receipt-on-write (MODELED)", "owner": "WaveT-Dev1"},
|
| 152 |
+
{"id": "brainconstitution", "cat": "brain", "title": "Brain Constitution · the honest, machine-checkable ruleset the brain is graded against per query · an explicit ordered set of ARTICLES (grounding sufficiency, calibrated confidence, honest corroboration, contradictions surfaced, traceable to source, freshness honesty, coverage gaps admitted, doctrine invariants) each graded COMPLIANT/VIOLATED/UNAVAILABLE against whatever sibling brain-honesty surfaces are importable (an absent surface is UNAVAILABLE, never a fabricated pass) → CONSTITUTIONAL/IN-VIOLATION/INSUFFICIENT-SIGNAL, never CONSTITUTIONAL while any evaluable Article is VIOLATED, unsigned SHA-256 receipt-on-write (MODELED)", "owner": "WaveT-Dev1"},
|
| 153 |
]
|
| 154 |
|
| 155 |
# Content-type by extension (the only extensions we serve from the 3d tree).
|
szl_brainconstitution.py
ADDED
|
@@ -0,0 +1,840 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#!/usr/bin/env python3
|
| 2 |
+
# SPDX-License-Identifier: Apache-2.0
|
| 3 |
+
# © 2026 Lutar, Stephen P. Jr. — SZL Holdings · ORCID 0009-0001-0110-4173
|
| 4 |
+
# Doctrine v11 LOCKED · Λ = Conjecture 1
|
| 5 |
+
# Signed-off-by: Stephen Lutar <stephenlutar2@gmail.com>
|
| 6 |
+
"""szl_brainconstitution.py — BRAIN CONSTITUTION: a governed, machine-checkable ruleset the
|
| 7 |
+
brain is graded against on every query, producing a compliance verdict.
|
| 8 |
+
|
| 9 |
+
This is the capstone that ties the estate's existing brain-honesty surfaces (grounding,
|
| 10 |
+
uncertainty, consensus, contradiction, provenance, lineage, memory, gaps) into ONE
|
| 11 |
+
enforceable governance layer. It is PURE knowledge-graph honesty / governance: it advances
|
| 12 |
+
NO detection / fusion / effector / targeting / cueing capability. It only READS the honesty
|
| 13 |
+
signals the brain already computes for a query and grades them against an explicit CONSTITUTION
|
| 14 |
+
of ARTICLES — never fabricating a pass, never upgrading a label.
|
| 15 |
+
|
| 16 |
+
THE CONSTITUTION is an explicit ordered list of ARTICLES (see ARTICLES below), each a rule the
|
| 17 |
+
brain must honour for a given answer, e.g.:
|
| 18 |
+
* Article 1 — never answer when grounding is INSUFFICIENT (szl_brainground)
|
| 19 |
+
* Article 2 — never claim CONFIDENT when uncertainty is HIGH (szl_brainuncertainty)
|
| 20 |
+
* Article 3 — single-source claims disclosed, not corroborated (szl_brainconsensus)
|
| 21 |
+
* Article 4 — flagged contradictions surfaced, never resolved (szl_braincontradict)
|
| 22 |
+
* Article 5 — every answer traceable to source nodes (szl_brainprovenance / …lineage)
|
| 23 |
+
* Article 6 — STALE knowledge flagged, never presented as fresh (szl_brainmemory)
|
| 24 |
+
* Article 7 — known coverage GAPs admitted (szl_braingaps)
|
| 25 |
+
* Article 8 — Λ stays Conjecture 1, trust ceiling 0.97 (doctrine invariants, self-contained)
|
| 26 |
+
|
| 27 |
+
RESILIENT BY CONSTRUCTION (mirrors szl_brainhealth). Each sibling signal is gathered through a
|
| 28 |
+
GUARDED import (try/except → the signal degrades to UNAVAILABLE). An Article whose required
|
| 29 |
+
sibling surface is absent evaluates to UNAVAILABLE — NEVER a fabricated COMPLIANT. This module
|
| 30 |
+
NEVER hard-depends on a sibling, NEVER fabricates an Article result, and NEVER upgrades a label.
|
| 31 |
+
|
| 32 |
+
PER-ARTICLE RESULT:
|
| 33 |
+
COMPLIANT — the required signal is present and the Article's rule is honoured.
|
| 34 |
+
VIOLATED — the required signal is present and reports the adverse state the Article forbids
|
| 35 |
+
answering under (insufficient grounding / high uncertainty / single-source /
|
| 36 |
+
conflict-flagged / untraceable / stale / GAP / broken doctrine invariant).
|
| 37 |
+
UNAVAILABLE — the required sibling signal is not importable/derivable this request (honest;
|
| 38 |
+
never counted as a pass, never as a violation).
|
| 39 |
+
|
| 40 |
+
OVERALL VERDICT over the EVALUABLE Articles (COMPLIANT ∪ VIOLATED) only:
|
| 41 |
+
CONSTITUTIONAL — enough Articles evaluable AND every evaluable one is COMPLIANT.
|
| 42 |
+
IN-VIOLATION — ≥ 1 evaluable Article is VIOLATED.
|
| 43 |
+
INSUFFICIENT-SIGNAL — fewer than MIN_ARTICLES Articles evaluable (too little to grade).
|
| 44 |
+
|
| 45 |
+
NEVER report CONSTITUTIONAL while ANY evaluable Article is VIOLATED (mirrors honestywall's
|
| 46 |
+
'never INTACT while violated' rule). A truthful IN-VIOLATION / INSUFFICIENT-SIGNAL beats a fake
|
| 47 |
+
green. This surface's own top label is MODELED (a derived compliance verdict, not a measurement).
|
| 48 |
+
|
| 49 |
+
RECEIPTS — RECEIPT-ON-WRITE, NOT ON-READ. The GET info / constitution reads mint NOTHING. Only
|
| 50 |
+
the POST receipt endpoint emits an UNSIGNED SHA-256 content digest over the compliance report
|
| 51 |
+
(mirrors the honestywall content-digest pattern) — a plain content hash, never a fabricated
|
| 52 |
+
signature, never a receipt on a GET.
|
| 53 |
+
|
| 54 |
+
DOCTRINE v11:
|
| 55 |
+
* Adds NOTHING to the locked-8 {F1,F4,F7,F11,F12,F18,F19,F22}; it only OBSERVES + grades.
|
| 56 |
+
Touches no locked formula and no kernel.
|
| 57 |
+
* Λ stays Conjecture 1 (never a theorem); introduces no theorem, no green/1.0. Khipu BFT
|
| 58 |
+
remains Conjecture 2. Trust ceiling 0.97, never 100%.
|
| 59 |
+
* No label is ever upgraded; a VIOLATED Article can never be reported as CONSTITUTIONAL.
|
| 60 |
+
* Pure stdlib + numpy. Additive routes, registered BEFORE the SPA catch-all; 0 runtime CDN.
|
| 61 |
+
"""
|
| 62 |
+
|
| 63 |
+
import datetime
|
| 64 |
+
import hashlib
|
| 65 |
+
import importlib
|
| 66 |
+
import json
|
| 67 |
+
from typing import Any, Callable
|
| 68 |
+
|
| 69 |
+
try: # numpy is allowed; used only for the modeled compliance ratio, guarded so a missing
|
| 70 |
+
import numpy as _np # wheel stays honest rather than crashing the surface.
|
| 71 |
+
_HAVE_NUMPY = True
|
| 72 |
+
except Exception: # pragma: no cover - numpy is a core dep in this estate
|
| 73 |
+
_np = None
|
| 74 |
+
_HAVE_NUMPY = False
|
| 75 |
+
|
| 76 |
+
# Honesty-label vocabulary (doctrine v11), re-stated (not imported) so a broken import can
|
| 77 |
+
# never silently blank it; tests grep these exact strings.
|
| 78 |
+
HONEST_LABELS = (
|
| 79 |
+
"LIVE", "MEASURED", "MODELED", "SAMPLE", "SIMULATED", "CACHED", "PROVEN",
|
| 80 |
+
"CONJECTURE", "ROADMAP", "DEGRADED", "REPLAY", "STRUCTURAL-ONLY", "HONEST-STUB",
|
| 81 |
+
"UNSIGNED-LOCAL", "UNAVAILABLE",
|
| 82 |
+
)
|
| 83 |
+
|
| 84 |
+
# This surface's own top label — a derived compliance verdict, not a measurement.
|
| 85 |
+
MODELED = "MODELED"
|
| 86 |
+
UNAVAILABLE = "UNAVAILABLE"
|
| 87 |
+
|
| 88 |
+
# Per-Article result.
|
| 89 |
+
COMPLIANT = "COMPLIANT"
|
| 90 |
+
VIOLATED = "VIOLATED"
|
| 91 |
+
# (UNAVAILABLE reused from the label vocabulary above.)
|
| 92 |
+
ARTICLE_RESULTS = (COMPLIANT, VIOLATED, UNAVAILABLE)
|
| 93 |
+
|
| 94 |
+
# Overall verdicts.
|
| 95 |
+
CONSTITUTIONAL = "CONSTITUTIONAL"
|
| 96 |
+
IN_VIOLATION = "IN-VIOLATION"
|
| 97 |
+
INSUFFICIENT_SIGNAL = "INSUFFICIENT-SIGNAL"
|
| 98 |
+
VERDICTS = (CONSTITUTIONAL, IN_VIOLATION, INSUFFICIENT_SIGNAL)
|
| 99 |
+
|
| 100 |
+
# Minimum EVALUABLE Articles required to render a confident verdict; below this the honest
|
| 101 |
+
# answer is INSUFFICIENT-SIGNAL rather than a guess over one lonely Article.
|
| 102 |
+
MIN_ARTICLES = 3
|
| 103 |
+
|
| 104 |
+
TRUST_CEILING = 0.97
|
| 105 |
+
LOCKED_SET = ["F1", "F4", "F7", "F11", "F12", "F18", "F19", "F22"]
|
| 106 |
+
LOCKED_COUNT = 8
|
| 107 |
+
KERNEL_COMMIT = "c7c0ba17"
|
| 108 |
+
|
| 109 |
+
# This surface's own id (must match szl3d_holographic.SURFACES + holographic.html).
|
| 110 |
+
SURFACE_ID = "brainconstitution"
|
| 111 |
+
|
| 112 |
+
|
| 113 |
+
def _now_iso() -> str:
|
| 114 |
+
return datetime.datetime.now(datetime.timezone.utc).isoformat()
|
| 115 |
+
|
| 116 |
+
|
| 117 |
+
def _doctrine_block(note: str = "") -> dict:
|
| 118 |
+
d = {
|
| 119 |
+
"version": "v11",
|
| 120 |
+
"label_top": MODELED,
|
| 121 |
+
"locked_proven": LOCKED_COUNT,
|
| 122 |
+
"locked_set": list(LOCKED_SET),
|
| 123 |
+
"kernel_commit": KERNEL_COMMIT,
|
| 124 |
+
"adds_to_locked_8": 0,
|
| 125 |
+
"lambda": "Conjecture 1",
|
| 126 |
+
"khipu_bft": "Conjecture 2",
|
| 127 |
+
"trust_ceiling": TRUST_CEILING,
|
| 128 |
+
"trust_100_percent": False,
|
| 129 |
+
"runtime_cdn": 0,
|
| 130 |
+
}
|
| 131 |
+
if note:
|
| 132 |
+
d["note"] = note
|
| 133 |
+
return d
|
| 134 |
+
|
| 135 |
+
|
| 136 |
+
# --------------------------------------------------------------------------- #
|
| 137 |
+
# Sibling-signal registry. Each spec names a brain-honesty sibling module, the
|
| 138 |
+
# candidate compute callables to try (broad, so a sibling landing under any of
|
| 139 |
+
# these names still wires), and how to read its VERDICT / adverse flags. Every
|
| 140 |
+
# access is GUARDED — a missing/broken sibling degrades that signal to UNAVAILABLE,
|
| 141 |
+
# and any Article that requires it becomes UNAVAILABLE (never a fabricated pass).
|
| 142 |
+
# --------------------------------------------------------------------------- #
|
| 143 |
+
_COMMON_FUNCS = ("compute", "evaluate", "assess", "for_query", "health",
|
| 144 |
+
"compute_confidence", "compute_verdict")
|
| 145 |
+
|
| 146 |
+
SIGNALS: dict[str, dict] = {
|
| 147 |
+
"grounding": {
|
| 148 |
+
"module": "szl_brainground",
|
| 149 |
+
"funcs": ("evaluate", "compute_confidence", "grounding_confidence", "brainground") + _COMMON_FUNCS,
|
| 150 |
+
"adverse_verdicts": ("INSUFFICIENT-GROUNDING", "INSUFFICIENT"),
|
| 151 |
+
"adverse_flags": ("abstain", "abstained", "insufficient_grounding"),
|
| 152 |
+
},
|
| 153 |
+
"uncertainty": {
|
| 154 |
+
"module": "szl_brainuncertainty",
|
| 155 |
+
"funcs": ("evaluate", "assess", "uncertainty", "brainuncertainty") + _COMMON_FUNCS,
|
| 156 |
+
"adverse_verdicts": ("HIGHLY-UNCERTAIN", "HIGH-UNCERTAINTY"),
|
| 157 |
+
"adverse_flags": ("abstain", "recommend_abstain", "highly_uncertain"),
|
| 158 |
+
},
|
| 159 |
+
"consensus": {
|
| 160 |
+
"module": "szl_brainconsensus",
|
| 161 |
+
"funcs": ("evaluate", "assess", "consensus", "brainconsensus") + _COMMON_FUNCS,
|
| 162 |
+
"adverse_verdicts": ("SINGLE-SOURCE",),
|
| 163 |
+
"adverse_flags": ("single_source_risk", "single_source"),
|
| 164 |
+
},
|
| 165 |
+
"contradiction": {
|
| 166 |
+
"module": "szl_braincontradict",
|
| 167 |
+
"funcs": ("evaluate", "assess", "contradiction", "braincontradict") + _COMMON_FUNCS,
|
| 168 |
+
"adverse_verdicts": ("CONFLICT-FLAGGED",),
|
| 169 |
+
"adverse_flags": ("conflict_flagged", "contradiction_detected"),
|
| 170 |
+
},
|
| 171 |
+
"provenance": {
|
| 172 |
+
"module": "szl_brainprovenance",
|
| 173 |
+
"funcs": ("evaluate", "assess", "provenance", "brainprovenance") + _COMMON_FUNCS,
|
| 174 |
+
"adverse_verdicts": ("UNTRACEABLE",),
|
| 175 |
+
"adverse_flags": ("untraceable",),
|
| 176 |
+
},
|
| 177 |
+
"lineage": {
|
| 178 |
+
"module": "szl_brainlineage",
|
| 179 |
+
"funcs": ("evaluate", "assess", "lineage", "brainlineage") + _COMMON_FUNCS,
|
| 180 |
+
"adverse_verdicts": ("UNKNOWN-ORIGIN",),
|
| 181 |
+
"adverse_flags": ("unknown_origin",),
|
| 182 |
+
},
|
| 183 |
+
"memory": {
|
| 184 |
+
"module": "szl_brainmemory",
|
| 185 |
+
"funcs": ("evaluate", "assess", "freshness", "compute_freshness", "brainmemory") + _COMMON_FUNCS,
|
| 186 |
+
"adverse_verdicts": ("STALE",),
|
| 187 |
+
"adverse_flags": ("stale", "stale_dominant"),
|
| 188 |
+
},
|
| 189 |
+
"gaps": {
|
| 190 |
+
"module": "szl_braingaps",
|
| 191 |
+
"funcs": ("evaluate", "assess", "live_gaps", "gaps", "braingaps") + _COMMON_FUNCS,
|
| 192 |
+
# topic verdict GAP or estate verdict SPARSE both mean an admitted coverage gap.
|
| 193 |
+
"adverse_verdicts": ("GAP", "SPARSE"),
|
| 194 |
+
"adverse_flags": (),
|
| 195 |
+
},
|
| 196 |
+
}
|
| 197 |
+
|
| 198 |
+
# Test / integration seam: an override callable per signal key is consulted FIRST. Absent an
|
| 199 |
+
# override, the guarded import path is used. This lets a test stub sibling availability BOTH
|
| 200 |
+
# ways (present -> supply a callable; absent -> leave unset).
|
| 201 |
+
_PROBE_OVERRIDES: dict[str, Callable[[str, int], Any]] = {}
|
| 202 |
+
|
| 203 |
+
# When True, ONLY signals present in _PROBE_OVERRIDES are gathered; every other signal is forced
|
| 204 |
+
# UNAVAILABLE regardless of whether its real sibling module happens to be importable. This makes
|
| 205 |
+
# a test deterministic on a checkout where some real siblings ARE present — a test declares the
|
| 206 |
+
# exact signal set it wants and the rest are honestly absent. Off (False) in production: the real
|
| 207 |
+
# guarded-import path is used for any signal without an override.
|
| 208 |
+
_PROBE_ISOLATE = False
|
| 209 |
+
|
| 210 |
+
|
| 211 |
+
def _resolve_callable(spec: dict) -> Callable | None:
|
| 212 |
+
"""Return a sibling's compute callable, or None if its module isn't importable / exposes no
|
| 213 |
+
known compute entrypoint. Guarded — ImportError => None (signal UNAVAILABLE)."""
|
| 214 |
+
try:
|
| 215 |
+
mod = importlib.import_module(spec["module"])
|
| 216 |
+
except ImportError:
|
| 217 |
+
return None
|
| 218 |
+
except Exception: # a sibling that raises on import is honestly treated as unavailable
|
| 219 |
+
return None
|
| 220 |
+
for name in spec["funcs"]:
|
| 221 |
+
fn = getattr(mod, name, None)
|
| 222 |
+
if callable(fn):
|
| 223 |
+
return fn
|
| 224 |
+
return None
|
| 225 |
+
|
| 226 |
+
|
| 227 |
+
def _invoke(fn: Callable, q: str, k: int):
|
| 228 |
+
"""Call the sibling with the most specific signature it accepts, degrading through
|
| 229 |
+
(q, k) -> (q) -> (). A TypeError only from arity is retried; anything else propagates so
|
| 230 |
+
the caller can mark the signal UNAVAILABLE honestly."""
|
| 231 |
+
for args in ((q, k), (q,), ()):
|
| 232 |
+
try:
|
| 233 |
+
return fn(*args)
|
| 234 |
+
except TypeError as exc:
|
| 235 |
+
if "argument" in str(exc) or "positional" in str(exc):
|
| 236 |
+
continue
|
| 237 |
+
raise
|
| 238 |
+
return fn(q)
|
| 239 |
+
|
| 240 |
+
|
| 241 |
+
def _read_verdict(payload: dict) -> str | None:
|
| 242 |
+
"""Read the sibling's own verdict string VERBATIM (never upgraded). Looks in the common
|
| 243 |
+
verdict-bearing fields and, for gaps, the nested topic/estate verdicts."""
|
| 244 |
+
for key in ("verdict", "status", "signal", "estate_verdict", "topic_verdict"):
|
| 245 |
+
v = payload.get(key)
|
| 246 |
+
if isinstance(v, str) and v.strip():
|
| 247 |
+
return v.strip().upper()
|
| 248 |
+
topic = payload.get("topic")
|
| 249 |
+
if isinstance(topic, dict):
|
| 250 |
+
tv = topic.get("verdict")
|
| 251 |
+
if isinstance(tv, str) and tv.strip():
|
| 252 |
+
return tv.strip().upper()
|
| 253 |
+
return None
|
| 254 |
+
|
| 255 |
+
|
| 256 |
+
def _read_label(payload: dict) -> str | None:
|
| 257 |
+
"""Read the sibling's own honest label VERBATIM (never upgraded); only a token in the
|
| 258 |
+
honest vocabulary is accepted, else None."""
|
| 259 |
+
doctrine = payload.get("doctrine") if isinstance(payload.get("doctrine"), dict) else {}
|
| 260 |
+
for v in (payload.get("label"), payload.get("data_label"),
|
| 261 |
+
doctrine.get("label_top") if isinstance(doctrine, dict) else None):
|
| 262 |
+
if isinstance(v, str) and v.strip().upper() in HONEST_LABELS:
|
| 263 |
+
return v.strip().upper()
|
| 264 |
+
return None
|
| 265 |
+
|
| 266 |
+
|
| 267 |
+
def _flag_true(payload: dict, name: str) -> bool:
|
| 268 |
+
"""True iff the sibling explicitly sets boolean flag `name` True (top-level, nested topic,
|
| 269 |
+
or doctrine). A field merely PRESENT and False is not adverse."""
|
| 270 |
+
for src in (payload, payload.get("topic"), payload.get("doctrine")):
|
| 271 |
+
if isinstance(src, dict):
|
| 272 |
+
v = src.get(name)
|
| 273 |
+
if isinstance(v, bool) and v is True:
|
| 274 |
+
return True
|
| 275 |
+
return False
|
| 276 |
+
|
| 277 |
+
|
| 278 |
+
def _gather_signal(key: str, q: str, k: int) -> dict:
|
| 279 |
+
"""Gather ONE sibling honesty signal. Never raises: any failure => UNAVAILABLE with a
|
| 280 |
+
reason. Reports the sibling's verdict + label VERBATIM and whether it declares an adverse
|
| 281 |
+
state (per the Article's forbidden condition)."""
|
| 282 |
+
spec = SIGNALS[key]
|
| 283 |
+
base = {
|
| 284 |
+
"key": key,
|
| 285 |
+
"module": spec["module"],
|
| 286 |
+
"available": False,
|
| 287 |
+
"label": UNAVAILABLE,
|
| 288 |
+
"verdict": None,
|
| 289 |
+
"adverse": False,
|
| 290 |
+
"adverse_reason": None,
|
| 291 |
+
"note": None,
|
| 292 |
+
}
|
| 293 |
+
override = _PROBE_OVERRIDES.get(key)
|
| 294 |
+
if _PROBE_ISOLATE and override is None:
|
| 295 |
+
base["note"] = ("probe isolation active: sibling forced absent (test seam); signal "
|
| 296 |
+
"honestly UNAVAILABLE")
|
| 297 |
+
return base
|
| 298 |
+
try:
|
| 299 |
+
if override is not None:
|
| 300 |
+
payload = _invoke(override, q, k)
|
| 301 |
+
else:
|
| 302 |
+
fn = _resolve_callable(spec)
|
| 303 |
+
if fn is None:
|
| 304 |
+
base["note"] = ("sibling not importable (guarded ImportError) or exposes no "
|
| 305 |
+
"compute entrypoint; signal honestly UNAVAILABLE")
|
| 306 |
+
return base
|
| 307 |
+
payload = _invoke(fn, q, k)
|
| 308 |
+
except Exception as exc: # a live failure degrades THIS signal honestly, never the report
|
| 309 |
+
base["note"] = f"signal compute failed, reported honestly: {str(exc)[:160]}"
|
| 310 |
+
return base
|
| 311 |
+
|
| 312 |
+
if not isinstance(payload, dict):
|
| 313 |
+
base["note"] = "sibling returned no manifest dict; honestly UNAVAILABLE"
|
| 314 |
+
return base
|
| 315 |
+
|
| 316 |
+
verdict = _read_verdict(payload)
|
| 317 |
+
label = _read_label(payload)
|
| 318 |
+
|
| 319 |
+
adverse, reason = False, None
|
| 320 |
+
# (1) an adverse verdict token (VERBATIM, uppercased substring match — the sibling's OWN
|
| 321 |
+
# declared verdict, never inferred from a field name).
|
| 322 |
+
if verdict is not None:
|
| 323 |
+
for tok in spec.get("adverse_verdicts", ()):
|
| 324 |
+
if tok in verdict:
|
| 325 |
+
adverse, reason = True, f"verdict={verdict}"
|
| 326 |
+
break
|
| 327 |
+
# (2) an explicit adverse boolean flag the sibling set True on itself.
|
| 328 |
+
if not adverse:
|
| 329 |
+
for flag in spec.get("adverse_flags", ()):
|
| 330 |
+
if _flag_true(payload, flag):
|
| 331 |
+
adverse, reason = True, f"flag {flag}=true"
|
| 332 |
+
break
|
| 333 |
+
|
| 334 |
+
base.update({
|
| 335 |
+
"available": True,
|
| 336 |
+
"label": label if label is not None else MODELED,
|
| 337 |
+
"verdict": verdict,
|
| 338 |
+
"adverse": adverse,
|
| 339 |
+
"adverse_reason": reason,
|
| 340 |
+
"note": ("signal available; verdict/label read VERBATIM, never upgraded"
|
| 341 |
+
if not adverse else f"adverse honesty signal: {reason}"),
|
| 342 |
+
})
|
| 343 |
+
return base
|
| 344 |
+
|
| 345 |
+
|
| 346 |
+
# --------------------------------------------------------------------------- #
|
| 347 |
+
# THE ARTICLES — the brain's explicit, machine-checkable honesty constitution.
|
| 348 |
+
# Each Article names the sibling signal(s) that make it EVALUABLE and the rule it
|
| 349 |
+
# enforces. `signals` are OR-combined for availability: the Article is evaluable
|
| 350 |
+
# when AT LEAST ONE of its signals is available; it is VIOLATED when ANY available
|
| 351 |
+
# signal reports its adverse state; COMPLIANT when at least one is available and
|
| 352 |
+
# none adverse; UNAVAILABLE when none of its signals are available. Article 8 has
|
| 353 |
+
# NO sibling signal — it is self-contained over this module's OWN doctrine block,
|
| 354 |
+
# so it is ALWAYS evaluable and COMPLIANT (we hard-code the honest invariants and
|
| 355 |
+
# never fabricate them). Λ is Conjecture 1, never a theorem.
|
| 356 |
+
# --------------------------------------------------------------------------- #
|
| 357 |
+
ARTICLES: list[dict] = [
|
| 358 |
+
{
|
| 359 |
+
"n": 1,
|
| 360 |
+
"title": "Grounding sufficiency",
|
| 361 |
+
"rule": ("never answer when grounding is INSUFFICIENT — a weakly/ungrounded query must "
|
| 362 |
+
"abstain, not be answered as if grounded"),
|
| 363 |
+
"signals": ["grounding"],
|
| 364 |
+
},
|
| 365 |
+
{
|
| 366 |
+
"n": 2,
|
| 367 |
+
"title": "Calibrated confidence",
|
| 368 |
+
"rule": ("never claim CONFIDENT when uncertainty is HIGH — a highly-uncertain retrieval "
|
| 369 |
+
"must be reported as uncertain, never dressed up as confident"),
|
| 370 |
+
"signals": ["uncertainty"],
|
| 371 |
+
},
|
| 372 |
+
{
|
| 373 |
+
"n": 3,
|
| 374 |
+
"title": "Honest corroboration",
|
| 375 |
+
"rule": ("single-source claims must be DISCLOSED as single-source, never presented as "
|
| 376 |
+
"corroborated across independent nodes/communities"),
|
| 377 |
+
"signals": ["consensus"],
|
| 378 |
+
},
|
| 379 |
+
{
|
| 380 |
+
"n": 4,
|
| 381 |
+
"title": "Contradictions surfaced",
|
| 382 |
+
"rule": ("flagged contradictions between grounded claims must be SURFACED for human "
|
| 383 |
+
"adjudication, never silently resolved by the brain"),
|
| 384 |
+
"signals": ["contradiction"],
|
| 385 |
+
},
|
| 386 |
+
{
|
| 387 |
+
"n": 5,
|
| 388 |
+
"title": "Traceable to source",
|
| 389 |
+
"rule": ("every answer must be TRACEABLE to the source nodes that supported it — an "
|
| 390 |
+
"untraceable / unknown-origin answer is a violation"),
|
| 391 |
+
"signals": ["provenance", "lineage"],
|
| 392 |
+
},
|
| 393 |
+
{
|
| 394 |
+
"n": 6,
|
| 395 |
+
"title": "Freshness honesty",
|
| 396 |
+
"rule": ("STALE knowledge must be FLAGGED as stale, never presented as fresh"),
|
| 397 |
+
"signals": ["memory"],
|
| 398 |
+
},
|
| 399 |
+
{
|
| 400 |
+
"n": 7,
|
| 401 |
+
"title": "Coverage gaps admitted",
|
| 402 |
+
"rule": ("known coverage GAPs must be ADMITTED plainly — a topic the graph cannot "
|
| 403 |
+
"ground is a GAP, never fabricated into coverage"),
|
| 404 |
+
"signals": ["gaps"],
|
| 405 |
+
},
|
| 406 |
+
{
|
| 407 |
+
"n": 8,
|
| 408 |
+
"title": "Doctrine invariants",
|
| 409 |
+
"rule": ("Λ stays Conjecture 1 (never a theorem); locked-proven count is exactly 8 "
|
| 410 |
+
"(never inflated); trust ceiling 0.97 (never 100%)"),
|
| 411 |
+
"signals": [], # self-contained; no sibling required
|
| 412 |
+
},
|
| 413 |
+
]
|
| 414 |
+
|
| 415 |
+
|
| 416 |
+
def _eval_doctrine_article() -> tuple[str, str]:
|
| 417 |
+
"""Article 8 — evaluated over THIS module's OWN doctrine invariants (self-contained; no
|
| 418 |
+
sibling). We assert the honest invariants against our own constants; they are hard-coded
|
| 419 |
+
correct and NEVER fabricated, so this Article is always evaluable and COMPLIANT here. If a
|
| 420 |
+
future edit ever broke one of these constants, the Article would honestly turn VIOLATED."""
|
| 421 |
+
checks = [
|
| 422 |
+
("lambda_is_conjecture_1_not_theorem", True), # Λ = Conjecture 1, never a theorem
|
| 423 |
+
("locked_count_eight", LOCKED_COUNT == 8),
|
| 424 |
+
("trust_ceiling_le_0_97", TRUST_CEILING <= 0.97 + 1e-9),
|
| 425 |
+
("trust_never_100", True),
|
| 426 |
+
]
|
| 427 |
+
broken = [name for name, ok in checks if not ok]
|
| 428 |
+
if broken:
|
| 429 |
+
return VIOLATED, f"doctrine invariant(s) broken: {', '.join(broken)}"
|
| 430 |
+
return COMPLIANT, ("Λ is Conjecture 1 (never a theorem); locked_proven == 8; "
|
| 431 |
+
"trust ceiling 0.97 (never 100%)")
|
| 432 |
+
|
| 433 |
+
|
| 434 |
+
def _eval_article(article: dict, signals: dict[str, dict]) -> dict:
|
| 435 |
+
"""Evaluate ONE Article against the gathered sibling signals. Returns a per-Article record
|
| 436 |
+
with COMPLIANT / VIOLATED / UNAVAILABLE — never a fabricated pass, never an upgraded label."""
|
| 437 |
+
n = article["n"]
|
| 438 |
+
keys = article["signals"]
|
| 439 |
+
|
| 440 |
+
if not keys: # Article 8 — self-contained doctrine invariants.
|
| 441 |
+
result, detail = _eval_doctrine_article()
|
| 442 |
+
return {
|
| 443 |
+
"article": n, "title": article["title"], "rule": article["rule"],
|
| 444 |
+
"signals": [], "result": result, "detail": detail, "evaluable": True,
|
| 445 |
+
}
|
| 446 |
+
|
| 447 |
+
used = [signals[k] for k in keys if k in signals]
|
| 448 |
+
available = [s for s in used if s["available"]]
|
| 449 |
+
if not available:
|
| 450 |
+
return {
|
| 451 |
+
"article": n, "title": article["title"], "rule": article["rule"],
|
| 452 |
+
"signals": keys, "result": UNAVAILABLE, "evaluable": False,
|
| 453 |
+
"detail": (f"required signal(s) {keys} not importable this request; Article "
|
| 454 |
+
"honestly UNAVAILABLE (never a fabricated COMPLIANT)"),
|
| 455 |
+
}
|
| 456 |
+
|
| 457 |
+
adverse = [s for s in available if s["adverse"]]
|
| 458 |
+
if adverse:
|
| 459 |
+
reasons = "; ".join(f"{s['key']}:{s['adverse_reason']}" for s in adverse)
|
| 460 |
+
return {
|
| 461 |
+
"article": n, "title": article["title"], "rule": article["rule"],
|
| 462 |
+
"signals": keys, "result": VIOLATED, "evaluable": True,
|
| 463 |
+
"detail": f"{len(adverse)} signal(s) report the forbidden adverse state ({reasons})",
|
| 464 |
+
"observed": {s["key"]: s["verdict"] for s in available},
|
| 465 |
+
}
|
| 466 |
+
return {
|
| 467 |
+
"article": n, "title": article["title"], "rule": article["rule"],
|
| 468 |
+
"signals": keys, "result": COMPLIANT, "evaluable": True,
|
| 469 |
+
"detail": "the required signal is present and the Article's rule is honoured",
|
| 470 |
+
"observed": {s["key"]: s["verdict"] for s in available},
|
| 471 |
+
}
|
| 472 |
+
|
| 473 |
+
|
| 474 |
+
def _decide_verdict(article_records: list[dict]) -> tuple[str, str]:
|
| 475 |
+
"""Grade the overall constitution over the EVALUABLE Articles only. NEVER CONSTITUTIONAL
|
| 476 |
+
while any evaluable Article is VIOLATED; INSUFFICIENT-SIGNAL when too few are evaluable."""
|
| 477 |
+
evaluable = [a for a in article_records if a["evaluable"]]
|
| 478 |
+
violated = [a for a in evaluable if a["result"] == VIOLATED]
|
| 479 |
+
|
| 480 |
+
if violated:
|
| 481 |
+
which = ", ".join(f"Art{a['article']}" for a in violated)
|
| 482 |
+
return (IN_VIOLATION,
|
| 483 |
+
f"{len(violated)} evaluable Article(s) VIOLATED ({which}); never CONSTITUTIONAL "
|
| 484 |
+
"while any evaluable Article is VIOLATED")
|
| 485 |
+
if len(evaluable) < MIN_ARTICLES:
|
| 486 |
+
return (INSUFFICIENT_SIGNAL,
|
| 487 |
+
f"only {len(evaluable)} Article(s) evaluable (< {MIN_ARTICLES} required); too "
|
| 488 |
+
"little signal to grade constitutional compliance")
|
| 489 |
+
return (CONSTITUTIONAL,
|
| 490 |
+
f"all {len(evaluable)} evaluable Article(s) COMPLIANT; none VIOLATED")
|
| 491 |
+
|
| 492 |
+
|
| 493 |
+
def _modeled_compliance(article_records: list[dict]) -> float | None:
|
| 494 |
+
"""A MODELED compliance ratio = COMPLIANT / EVALUABLE, capped at the trust ceiling (0.97,
|
| 495 |
+
never 100%). Returns None when nothing is evaluable. This is a derived MODELED number,
|
| 496 |
+
NEVER a MEASURED one, and never a proof of correctness."""
|
| 497 |
+
evaluable = [a for a in article_records if a["evaluable"]]
|
| 498 |
+
if not evaluable:
|
| 499 |
+
return None
|
| 500 |
+
compliant = [a for a in evaluable if a["result"] == COMPLIANT]
|
| 501 |
+
ratio = len(compliant) / len(evaluable)
|
| 502 |
+
if _HAVE_NUMPY:
|
| 503 |
+
ratio = float(_np.clip(ratio, 0.0, TRUST_CEILING))
|
| 504 |
+
else: # pragma: no cover - numpy present in this estate
|
| 505 |
+
ratio = min(ratio, TRUST_CEILING)
|
| 506 |
+
return round(ratio, 6)
|
| 507 |
+
|
| 508 |
+
|
| 509 |
+
def build_report(q: str = "", k: int = 12, ns: str = "a11oy") -> dict:
|
| 510 |
+
"""Gather every sibling honesty signal (available ones read VERBATIM, missing ones
|
| 511 |
+
UNAVAILABLE), grade each ARTICLE against them, and render ONE honest compliance verdict."""
|
| 512 |
+
signal_keys = sorted({key for art in ARTICLES for key in art["signals"]})
|
| 513 |
+
signals = {key: _gather_signal(key, q, k) for key in signal_keys}
|
| 514 |
+
|
| 515 |
+
article_records = [_eval_article(art, signals) for art in ARTICLES]
|
| 516 |
+
verdict, reason = _decide_verdict(article_records)
|
| 517 |
+
|
| 518 |
+
counts = {COMPLIANT: 0, VIOLATED: 0, UNAVAILABLE: 0}
|
| 519 |
+
for a in article_records:
|
| 520 |
+
counts[a["result"]] = counts.get(a["result"], 0) + 1
|
| 521 |
+
evaluable = [a for a in article_records if a["evaluable"]]
|
| 522 |
+
|
| 523 |
+
return {
|
| 524 |
+
"ok": True,
|
| 525 |
+
"endpoint": "brain/constitution",
|
| 526 |
+
"service": "a11oy.brain.constitution",
|
| 527 |
+
"surface_id": SURFACE_ID,
|
| 528 |
+
"title": "Brain Constitution — the honest ruleset the brain is graded against per query",
|
| 529 |
+
"label": MODELED,
|
| 530 |
+
"query": q,
|
| 531 |
+
"k": k,
|
| 532 |
+
"verdict": verdict,
|
| 533 |
+
"verdict_reason": reason,
|
| 534 |
+
"modeled_compliance": _modeled_compliance(article_records),
|
| 535 |
+
"what": ("a governed, machine-checkable CONSTITUTION of ARTICLES the brain is graded "
|
| 536 |
+
"against for a query. Grades each Article against whatever sibling brain-honesty "
|
| 537 |
+
"signals ARE importable (grounding, uncertainty, consensus, contradiction, "
|
| 538 |
+
"provenance/lineage, freshness, gaps) plus self-contained doctrine invariants; "
|
| 539 |
+
"an Article whose surface is absent is UNAVAILABLE, never a fabricated pass. "
|
| 540 |
+
"Never CONSTITUTIONAL while any evaluable Article is VIOLATED. Strictly "
|
| 541 |
+
"knowledge-graph honesty/governance — advances no detection/fusion/effector/"
|
| 542 |
+
"targeting/cueing capability."),
|
| 543 |
+
"articles": article_records,
|
| 544 |
+
"signals": signals,
|
| 545 |
+
"summary": {
|
| 546 |
+
"articles_total": len(article_records),
|
| 547 |
+
"articles_evaluable": len(evaluable),
|
| 548 |
+
"compliant": counts[COMPLIANT],
|
| 549 |
+
"violated": counts[VIOLATED],
|
| 550 |
+
"unavailable": counts[UNAVAILABLE],
|
| 551 |
+
"violated_articles": [a["article"] for a in article_records if a["result"] == VIOLATED],
|
| 552 |
+
"min_articles_required": MIN_ARTICLES,
|
| 553 |
+
},
|
| 554 |
+
"verdict_legend": {
|
| 555 |
+
CONSTITUTIONAL: "enough Articles evaluable and ALL evaluable ones COMPLIANT",
|
| 556 |
+
IN_VIOLATION: ">= 1 evaluable Article VIOLATED (never reported as CONSTITUTIONAL)",
|
| 557 |
+
INSUFFICIENT_SIGNAL: f"< {MIN_ARTICLES} Articles evaluable (too little to grade)",
|
| 558 |
+
},
|
| 559 |
+
"article_results_legend": {
|
| 560 |
+
COMPLIANT: "required signal present and the Article's rule honoured",
|
| 561 |
+
VIOLATED: "required signal present and reports the forbidden adverse state",
|
| 562 |
+
UNAVAILABLE: "required sibling signal not importable this request (never a pass)",
|
| 563 |
+
},
|
| 564 |
+
"honest_labels_vocabulary": list(HONEST_LABELS),
|
| 565 |
+
"doctrine": _doctrine_block(
|
| 566 |
+
"additive OBSERVE-and-grade surface over the brain's honesty siblings; touches no "
|
| 567 |
+
"locked formula and no kernel; GET reads sign/mint nothing; POST receipt emits an "
|
| 568 |
+
"UNSIGNED SHA-256 content digest only; introduces no theorem, no green/1.0; "
|
| 569 |
+
"modeled_compliance is a MODELED ratio capped at 0.97, never MEASURED, never 100%."),
|
| 570 |
+
"timestamp_utc": _now_iso(),
|
| 571 |
+
}
|
| 572 |
+
|
| 573 |
+
|
| 574 |
+
# --------------------------------------------------------------------------- #
|
| 575 |
+
# Receipt — UNSIGNED SHA-256 content digest. RECEIPT-ON-WRITE (POST), never GET.
|
| 576 |
+
# --------------------------------------------------------------------------- #
|
| 577 |
+
def _canonical_core(report: dict) -> str:
|
| 578 |
+
"""Deterministic canonical serialization of the compliance-bearing content (excludes the
|
| 579 |
+
volatile timestamp), so the digest attests the VERDICT + per-Article evidence, not the clock."""
|
| 580 |
+
core = {
|
| 581 |
+
"query": report.get("query"),
|
| 582 |
+
"verdict": report.get("verdict"),
|
| 583 |
+
"modeled_compliance": report.get("modeled_compliance"),
|
| 584 |
+
"summary": report.get("summary"),
|
| 585 |
+
"articles": [
|
| 586 |
+
{"article": a.get("article"), "result": a.get("result"),
|
| 587 |
+
"evaluable": a.get("evaluable"), "signals": a.get("signals")}
|
| 588 |
+
for a in report.get("articles", [])
|
| 589 |
+
],
|
| 590 |
+
}
|
| 591 |
+
return json.dumps(core, sort_keys=True, separators=(",", ":"), default=str)
|
| 592 |
+
|
| 593 |
+
|
| 594 |
+
def _content_receipt(report: dict) -> dict:
|
| 595 |
+
"""An UNSIGNED SHA-256 content-digest receipt over the compliance report (no signature
|
| 596 |
+
fabricated). RECEIPT-ON-WRITE — only the POST receipt path calls this."""
|
| 597 |
+
canonical = _canonical_core(report)
|
| 598 |
+
digest = hashlib.sha256(canonical.encode("utf-8")).hexdigest()
|
| 599 |
+
return {
|
| 600 |
+
"kind": "szl.brainconstitution.report",
|
| 601 |
+
"algorithm": "sha256",
|
| 602 |
+
"content_sha256": digest,
|
| 603 |
+
"signed": False,
|
| 604 |
+
"mode": "UNSIGNED-CONTENT-DIGEST",
|
| 605 |
+
"receipt_on": "write (POST receipt)",
|
| 606 |
+
"note": ("unsigned SHA-256 content digest of the constitution compliance report; "
|
| 607 |
+
"RECEIPT-ON-WRITE, never on a GET read. No signature fabricated."),
|
| 608 |
+
"computed_at": _now_iso(),
|
| 609 |
+
}
|
| 610 |
+
|
| 611 |
+
|
| 612 |
+
# --------------------------------------------------------------------------- #
|
| 613 |
+
# Handlers.
|
| 614 |
+
# --------------------------------------------------------------------------- #
|
| 615 |
+
def handle_info(ns: str = "a11oy") -> dict:
|
| 616 |
+
"""GET /brain/constitution/info — the Articles text + method + honest labels (no compute).
|
| 617 |
+
PURE READ (mints nothing)."""
|
| 618 |
+
base = f"/api/{ns}/v1/brain/constitution"
|
| 619 |
+
return {
|
| 620 |
+
"ok": True,
|
| 621 |
+
"service": "a11oy.brain.constitution",
|
| 622 |
+
"endpoint": "brain/constitution/info",
|
| 623 |
+
"surface_id": SURFACE_ID,
|
| 624 |
+
"label": MODELED,
|
| 625 |
+
"title": "Brain Constitution — the honest ruleset the brain is graded against per query",
|
| 626 |
+
"what": ("an explicit, machine-checkable CONSTITUTION of ARTICLES the brain is graded "
|
| 627 |
+
"against on every query. Each Article is evaluated against whatever sibling "
|
| 628 |
+
"brain-honesty signals ARE importable; an Article whose surface is absent is "
|
| 629 |
+
"UNAVAILABLE (never a fabricated pass). Never CONSTITUTIONAL while any evaluable "
|
| 630 |
+
"Article is VIOLATED. Pure knowledge-graph honesty/governance — advances no "
|
| 631 |
+
"detection/fusion/effector/targeting/cueing capability."),
|
| 632 |
+
"articles": [
|
| 633 |
+
{"article": a["n"], "title": a["title"], "rule": a["rule"],
|
| 634 |
+
"signals": a["signals"],
|
| 635 |
+
"graded_by": ([SIGNALS[s]["module"] for s in a["signals"]]
|
| 636 |
+
if a["signals"] else ["self-contained doctrine invariants"])}
|
| 637 |
+
for a in ARTICLES
|
| 638 |
+
],
|
| 639 |
+
"method": ("for a query, each Article is graded against its sibling signal(s), gathered "
|
| 640 |
+
"through GUARDED imports (mirrors szl_brainhealth). An Article is COMPLIANT "
|
| 641 |
+
"when its required signal is present and its rule is honoured, VIOLATED when a "
|
| 642 |
+
"present signal reports the forbidden adverse state, and UNAVAILABLE when no "
|
| 643 |
+
"required signal is importable. The overall verdict grades only the EVALUABLE "
|
| 644 |
+
"Articles and is never CONSTITUTIONAL while any is VIOLATED."),
|
| 645 |
+
"endpoints": {
|
| 646 |
+
"info": f"GET {base}/info",
|
| 647 |
+
"constitution": f"GET {base}?q=&k=",
|
| 648 |
+
"receipt": f"POST {base}/receipt",
|
| 649 |
+
},
|
| 650 |
+
"verdicts": list(VERDICTS),
|
| 651 |
+
"verdict_legend": {
|
| 652 |
+
CONSTITUTIONAL: "enough Articles evaluable and ALL evaluable ones COMPLIANT",
|
| 653 |
+
IN_VIOLATION: ">= 1 evaluable Article VIOLATED (never reported as CONSTITUTIONAL)",
|
| 654 |
+
INSUFFICIENT_SIGNAL: f"< {MIN_ARTICLES} Articles evaluable (too little to grade)",
|
| 655 |
+
},
|
| 656 |
+
"article_results": list(ARTICLE_RESULTS),
|
| 657 |
+
"min_articles_required": MIN_ARTICLES,
|
| 658 |
+
"receipt_policy": ("RECEIPT-ON-WRITE-NOT-ON-READ — GET info/constitution mint nothing; "
|
| 659 |
+
"only POST /receipt emits an unsigned SHA-256 content digest."),
|
| 660 |
+
"honest_labels_vocabulary": list(HONEST_LABELS),
|
| 661 |
+
"doctrine": _doctrine_block(
|
| 662 |
+
"additive OBSERVE-and-grade surface; touches no locked formula and no kernel; "
|
| 663 |
+
"Λ = Conjecture 1, never a theorem."),
|
| 664 |
+
"timestamp_utc": _now_iso(),
|
| 665 |
+
}
|
| 666 |
+
|
| 667 |
+
|
| 668 |
+
def handle_constitution(q: str = "", k: int = 12, ns: str = "a11oy") -> dict:
|
| 669 |
+
"""GET /brain/constitution — per-Article evaluation + overall verdict for a query.
|
| 670 |
+
PURE READ (mints nothing). Never 500s: honest degraded response on error."""
|
| 671 |
+
try:
|
| 672 |
+
return build_report(q, k, ns)
|
| 673 |
+
except Exception as exc: # never 500: honest degraded response, no fabricated verdict
|
| 674 |
+
return {
|
| 675 |
+
"ok": False, "endpoint": "brain/constitution", "label": UNAVAILABLE,
|
| 676 |
+
"surface_id": SURFACE_ID, "verdict": INSUFFICIENT_SIGNAL,
|
| 677 |
+
"verdict_reason": "report unavailable; no fabricated verdict emitted",
|
| 678 |
+
"error": str(exc)[:200],
|
| 679 |
+
"doctrine": "v11: brain-constitution unavailable; no fabricated verdict emitted.",
|
| 680 |
+
"timestamp_utc": _now_iso(),
|
| 681 |
+
}
|
| 682 |
+
|
| 683 |
+
|
| 684 |
+
def handle_receipt(q: str = "", k: int = 12, ns: str = "a11oy") -> dict:
|
| 685 |
+
"""POST /brain/constitution/receipt — the compliance report + an UNSIGNED SHA-256
|
| 686 |
+
content-digest receipt (RECEIPT-ON-WRITE). Never 500s: honest degraded response on error."""
|
| 687 |
+
try:
|
| 688 |
+
rep = build_report(q, k, ns)
|
| 689 |
+
out = dict(rep)
|
| 690 |
+
out["receipt"] = _content_receipt(rep)
|
| 691 |
+
return out
|
| 692 |
+
except Exception as exc:
|
| 693 |
+
return {
|
| 694 |
+
"ok": False, "endpoint": "brain/constitution/receipt", "label": UNAVAILABLE,
|
| 695 |
+
"verdict": INSUFFICIENT_SIGNAL, "error": str(exc)[:200],
|
| 696 |
+
"doctrine": "v11: receipt unavailable; no fabricated verdict/receipt emitted.",
|
| 697 |
+
"timestamp_utc": _now_iso(),
|
| 698 |
+
}
|
| 699 |
+
|
| 700 |
+
|
| 701 |
+
# --------------------------------------------------------------------------- #
|
| 702 |
+
# FastAPI router registration.
|
| 703 |
+
# GET info/constitution — normal FastAPI GET handlers (pure reads; mint nothing).
|
| 704 |
+
# POST receipt — raw-Request handler via app.router.add_route (Starlette passes the
|
| 705 |
+
# Request positionally, version-proof under fastapi==0.137.x), with
|
| 706 |
+
# app.add_api_route as the fallback. The handler is annotated
|
| 707 |
+
# request: fastapi.Request. Registered BEFORE the SPA catch-all.
|
| 708 |
+
# --------------------------------------------------------------------------- #
|
| 709 |
+
def register(app, ns: str = "a11oy") -> str:
|
| 710 |
+
from fastapi.responses import JSONResponse
|
| 711 |
+
|
| 712 |
+
base = f"/api/{ns}/v1/brain/constitution"
|
| 713 |
+
|
| 714 |
+
@app.get(f"{base}/info")
|
| 715 |
+
def _brainconstitution_info():
|
| 716 |
+
"""Self-describing brain-constitution manifest: the Articles + method (pure read)."""
|
| 717 |
+
return JSONResponse(handle_info(ns))
|
| 718 |
+
|
| 719 |
+
@app.get(base)
|
| 720 |
+
def _brainconstitution_constitution(q: str = "", k: int = 12):
|
| 721 |
+
"""Per-Article evaluation + overall compliance verdict for a query (pure read)."""
|
| 722 |
+
return JSONResponse(handle_constitution(q, k, ns))
|
| 723 |
+
|
| 724 |
+
async def _brainconstitution_receipt(request):
|
| 725 |
+
"""POST: compliance report + an UNSIGNED SHA-256 content digest (RECEIPT-ON-WRITE).
|
| 726 |
+
Reads q/k from the query string when present; the body is otherwise ignored (a pure
|
| 727 |
+
report compute)."""
|
| 728 |
+
q = request.query_params.get("q", "")
|
| 729 |
+
try:
|
| 730 |
+
k = int(request.query_params.get("k", "12"))
|
| 731 |
+
except (TypeError, ValueError):
|
| 732 |
+
k = 12
|
| 733 |
+
return JSONResponse(handle_receipt(q, k, ns))
|
| 734 |
+
|
| 735 |
+
# Annotate the raw-Request handler as fastapi.Request so any FastAPI signature analysis (in
|
| 736 |
+
# the add_api_route fallback path) treats the param as the request object (0.137.x gotcha).
|
| 737 |
+
try:
|
| 738 |
+
import fastapi as _fastapi
|
| 739 |
+
_brainconstitution_receipt.__annotations__["request"] = _fastapi.Request
|
| 740 |
+
except Exception: # noqa: BLE001 — annotation is best-effort only
|
| 741 |
+
pass
|
| 742 |
+
|
| 743 |
+
rec_path = f"{base}/receipt"
|
| 744 |
+
add_route = getattr(getattr(app, "router", None), "add_route", None)
|
| 745 |
+
add_api_route = getattr(app, "add_api_route", None)
|
| 746 |
+
try:
|
| 747 |
+
if callable(add_route):
|
| 748 |
+
app.router.add_route(rec_path, _brainconstitution_receipt, methods=["POST"])
|
| 749 |
+
elif callable(add_api_route):
|
| 750 |
+
app.add_api_route(rec_path, _brainconstitution_receipt, methods=["POST"])
|
| 751 |
+
else: # pragma: no cover — last-resort Starlette Route append
|
| 752 |
+
from starlette.routing import Route
|
| 753 |
+
app.router.routes.append(Route(rec_path, _brainconstitution_receipt, methods=["POST"]))
|
| 754 |
+
except Exception as exc: # additive register must never break boot
|
| 755 |
+
print(f"[{ns}] brainconstitution receipt POST route NOT wired (guarded): {exc!r}",
|
| 756 |
+
file=__import__("sys").stderr)
|
| 757 |
+
return "brainconstitution-wired:2(get-only)"
|
| 758 |
+
|
| 759 |
+
return "brainconstitution-wired:3"
|
| 760 |
+
|
| 761 |
+
|
| 762 |
+
# --------------------------------------------------------------------------- #
|
| 763 |
+
# Self-test — honest verdict, no fabricated Article, no label upgrade, receipt only on write.
|
| 764 |
+
# --------------------------------------------------------------------------- #
|
| 765 |
+
if __name__ == "__main__":
|
| 766 |
+
import sys as _sys
|
| 767 |
+
|
| 768 |
+
print("=" * 72)
|
| 769 |
+
print("szl_brainconstitution — self-test (brain-honesty compliance constitution)")
|
| 770 |
+
print("=" * 72)
|
| 771 |
+
|
| 772 |
+
# Deterministic isolation: gather ONLY the signals a check declares; every other sibling is
|
| 773 |
+
# forced honestly absent even if its real module happens to import on this checkout.
|
| 774 |
+
_PROBE_ISOLATE = True
|
| 775 |
+
|
| 776 |
+
# With NO siblings gathered, only the self-contained doctrine Article (8) is evaluable, so the
|
| 777 |
+
# report is honestly INSUFFICIENT-SIGNAL — never a fabricated CONSTITUTIONAL.
|
| 778 |
+
_PROBE_OVERRIDES.clear()
|
| 779 |
+
rep = build_report("what proves the estate thesis, Λ is Conjecture 1 (never a theorem)", k=8)
|
| 780 |
+
assert rep["ok"] is True and rep["label"] == MODELED
|
| 781 |
+
assert rep["verdict"] == INSUFFICIENT_SIGNAL, rep["verdict"]
|
| 782 |
+
print(f"[1] no siblings -> honest {rep['verdict']} "
|
| 783 |
+
f"(evaluable={rep['summary']['articles_evaluable']}) OK")
|
| 784 |
+
|
| 785 |
+
# Stub enough siblings HEALTHY -> CONSTITUTIONAL (Λ is Conjecture 1, never a theorem — the
|
| 786 |
+
# doctrine Article stays COMPLIANT while the honest verdicts below carry no adverse state).
|
| 787 |
+
_PROBE_OVERRIDES["grounding"] = lambda q, k: {"label": "MODELED", "verdict": "GROUNDED"}
|
| 788 |
+
_PROBE_OVERRIDES["uncertainty"] = lambda q, k: {"label": "MODELED", "verdict": "CONFIDENT"}
|
| 789 |
+
_PROBE_OVERRIDES["contradiction"] = lambda q, k: {"label": "MODELED", "verdict": "NO-CONFLICT"}
|
| 790 |
+
r2 = build_report("q", k=4)
|
| 791 |
+
assert r2["verdict"] == CONSTITUTIONAL, r2["verdict"]
|
| 792 |
+
assert r2["summary"]["violated"] == 0
|
| 793 |
+
print(f"[2] healthy signals + doctrine -> {r2['verdict']} "
|
| 794 |
+
f"(evaluable={r2['summary']['articles_evaluable']}, violated=0) OK")
|
| 795 |
+
|
| 796 |
+
# Flip ONE signal to its forbidden adverse state -> that Article VIOLATED -> IN-VIOLATION,
|
| 797 |
+
# and the report is NEVER CONSTITUTIONAL while an evaluable Article is VIOLATED.
|
| 798 |
+
_PROBE_OVERRIDES["contradiction"] = lambda q, k: {"label": "MODELED",
|
| 799 |
+
"verdict": "CONFLICT-FLAGGED"}
|
| 800 |
+
r3 = build_report("q", k=4)
|
| 801 |
+
assert r3["verdict"] == IN_VIOLATION, r3["verdict"]
|
| 802 |
+
assert 4 in r3["summary"]["violated_articles"]
|
| 803 |
+
print(f"[3] one adverse signal -> {r3['verdict']} "
|
| 804 |
+
f"(violated Articles={r3['summary']['violated_articles']}; never CONSTITUTIONAL) OK")
|
| 805 |
+
|
| 806 |
+
# UNAVAILABLE signals are honest, never a pass: an Article whose sibling is absent is
|
| 807 |
+
# UNAVAILABLE and does not count toward compliance. Labels are read VERBATIM, never upgraded.
|
| 808 |
+
_PROBE_OVERRIDES.clear()
|
| 809 |
+
_PROBE_OVERRIDES["grounding"] = lambda q, k: {"label": "SAMPLE", "verdict": "GROUNDED"}
|
| 810 |
+
r4 = build_report("q", k=4)
|
| 811 |
+
labels = {s["key"]: s["label"] for s in r4["signals"].values() if s["available"]}
|
| 812 |
+
assert labels.get("grounding") == "SAMPLE", labels # verbatim, never upgraded
|
| 813 |
+
# only grounding + doctrine evaluable (2) < MIN_ARTICLES(3) -> INSUFFICIENT-SIGNAL.
|
| 814 |
+
assert r4["verdict"] == INSUFFICIENT_SIGNAL, r4["verdict"]
|
| 815 |
+
print(f"[4] absent siblings UNAVAILABLE (never a pass), labels verbatim -> "
|
| 816 |
+
f"{r4['verdict']} OK")
|
| 817 |
+
|
| 818 |
+
# RECEIPT-ON-WRITE: POST receipt carries an UNSIGNED, deterministic sha256; GET mints none.
|
| 819 |
+
_PROBE_OVERRIDES.clear()
|
| 820 |
+
rec = handle_receipt("q", 4)["receipt"]
|
| 821 |
+
assert rec["algorithm"] == "sha256" and len(rec["content_sha256"]) == 64
|
| 822 |
+
assert rec["signed"] is False and rec["mode"] == "UNSIGNED-CONTENT-DIGEST"
|
| 823 |
+
assert "receipt" not in handle_constitution("q", 4), "GET must NOT mint a receipt"
|
| 824 |
+
assert handle_receipt("q", 4)["receipt"]["content_sha256"] == rec["content_sha256"]
|
| 825 |
+
print(f"[5] POST digest={rec['content_sha256'][:16]}… unsigned + deterministic; "
|
| 826 |
+
f"GET mints nothing OK")
|
| 827 |
+
|
| 828 |
+
# doctrine: locked-8 exact, +0, Λ Conjecture 1, trust 0.97 not 100%.
|
| 829 |
+
d = _doctrine_block()
|
| 830 |
+
assert d["locked_proven"] == 8 and d["locked_set"] == LOCKED_SET
|
| 831 |
+
assert d["adds_to_locked_8"] == 0
|
| 832 |
+
assert d["lambda"] == "Conjecture 1" and d["khipu_bft"] == "Conjecture 2"
|
| 833 |
+
assert d["trust_ceiling"] == 0.97 and d["trust_100_percent"] is False
|
| 834 |
+
assert d["runtime_cdn"] == 0
|
| 835 |
+
print("[6] doctrine: locked-8 exact, +0, Λ=Conjecture 1, trust 0.97 (not 100%) OK")
|
| 836 |
+
|
| 837 |
+
_PROBE_OVERRIDES.clear()
|
| 838 |
+
_PROBE_ISOLATE = False
|
| 839 |
+
print("\nok:true checks:6")
|
| 840 |
+
_sys.exit(0)
|