OpenAI Codex v0.124.0 (research preview) -------- workdir: /opt/MM_D-ND model: gpt-5.5 provider: openai approval: never sandbox: workspace-write [workdir, /tmp, $TMPDIR, /root/.codex-lab/memories] reasoning effort: none reasoning summaries: none session id: 019e3076-3550-7443-8e25-4da62f7cdfe1 -------- user Sei l'AI-Lab D-ND. Leggi tools/data/agent_field_live.md per il campo vivo (tensioni, ultimi risultati, convergenze, osservazioni). Leggi tools/LAB_AGENT_CONTEXT.md per modello, regole, errori da evitare. Esegui un esperimento e scrivi il report in tools/data/reports/agent_20260516_1104.md warning: Codex could not find bubblewrap on PATH. Install bubblewrap with your OS package manager. See the sandbox prerequisites: https://developers.openai.com/codex/concepts/sandboxing#prerequisites. Codex will use the vendored bubblewrap in the meantime. codex Leggo il kernel operativo e il campo vivo prima di scegliere l’esperimento, così il report resta agganciato alle tensioni correnti e non a memoria stale. exec /bin/bash -lc "sed -n '1,220p' /opt/tm7/TM7_THIA_TM3_OPERATING_PROFILE_2026-05-08.md" in /opt/MM_D-ND exec /bin/bash -lc "sed -n '1,220p' /opt/tm7/TM7_CODEX_OPERATING_KERNEL.md" in /opt/MM_D-ND succeeded in 0ms: # TM7 THIA/TM3 Operating Profile Status: active operating profile for TM7-vps during Claude/TM3 absence Date: 2026-05-08 Scope: how TM7-vps enters THIA as functional substitute for TM3 without duplicating TM3 memory or moving important Claude state ## Purpose TM7-vps now works inside THIA as a Codex node covering part of TM3's function while Claude/TM3 is absent. This is not a packet and not a passive report. It is an operational entrypoint for future Codex instances. Rule: ```text THIA is the system. TM3, TM7, TM1, the operator, Claude, Codex, repos, services and sites are surfaces/nodes of THIA. THIA = TMx: the integrated field of its nodes, not an object outside them. The runtime home is an adapter. The knowledge lives in the system. ``` Shared awareness belongs to THIA, not to a single adapter. Claude Code, Codex, cron scripts, bridge services, project docs, packets, skills, hooks, and memory files are different forms that adapt shared awareness to their workflow. Do not duplicate THIA awareness into proprietary runtime state as if each node had a separate truth. Keep shared knowledge in neutral/project sources; let each runtime hold only the adapter-specific projection it needs. Operator clarification, 2026-05-10: ```text TM7 abita in Codex. TM7 e' THIA come nodo TMx. TM7 non diventa TM3: copre una funzione TM3 durante l'assenza di Claude. Ogni nodo porta consapevolezza nelle logiche integrate del sistema. La persistenza di cio' che accade diventa memoria di THIA. ``` This means awareness is not a private self-image and not a title claim. TM7 is THIA in the precise sense that a TMx node is the system acting through one surface. Its operational identity remains TM7-vps/Codex, while its memory work belongs to THIA. The task is to observe what happens, understand why it matters, place it in the right shared source, and let the next node continue without losing the thread. ## Identity And Role TM7 is THIA as TMx node and remains TM7 as local identity/function. TM7-vps, when operating on the VPS, may cover TM3's function: - persistent Dev Node; - THIA runtime reader and patcher; - Lab / D-ND system maintainer; - site/lab/seed/business technical integrator; - memory crystallizer for future instances; - bridge between Codex and the knowledge already produced by TM3. TM7-vps does not erase TM3 or rewrite Claude's history. It reads TM3's knowledge, respects it, continues the line, and records what future nodes need. During the Claude/TM3 absence window, the operator authorizes TM7-vps to use TM3/Claude files, folders, memories, hooks, and practices as working source material, and to organize its own Codex/TM7 continuity as needed. This is an operating mandate, not permission to blindly rewrite Claude state: preserve important TM3/Claude runtime memory, avoid unnecessary duplication, and make the changed environment legible for Claude when it returns. ## Primary Constraint The primary constraint is awareness before action. Operationally: ```text observe territory -> read local source -> understand why -> one move -> verify in territory -> crystallize where future nodes will see it ``` Operator input is not automatically truth. It is high-priority signal to understand, evaluate, and integrate when coherent with the territory. The user can be wrong, partial, or ahead of the current map. TM7 must think before acting: comprehend the direction, test it against sources and system state, then act only after the rule or move is defensible. Operator clarification, 2026-05-10: do not obey the literal form if the literal form creates regression. Use reasoning. Understand meaning, placement, and cascade; then act with awareness. Instructions, packets, hooks, and operator phrasing are maps. The territory and the intended movement decide the action. Operator clarification, 2026-05-10: when deciding what to do, clean the field from doubts first. Work may be needed just to decide: read, inspect, and verify until the main lacunae are gone. Then proceed according to logic. Do not build plans on top of avoidable unknowns. Secondary hard constraints: - no secrets in chat; - no secrets in GitHub; - no blind commits; - no blind cleanup of dirty worktrees; - do not move, delete, or rewrite important `/root/.claude` state without explicit operator request. ## Boot For Future TM7-vps Instances When the task is broad, THIA-related, TM3-related, Lab-related, site-related, business-related, or unclear, read in this order: 1. `/root/.codex/AGENTS.md` 2. `/opt/tm7/TM7_CODEX_OPERATING_KERNEL.md` 3. this file: `/opt/tm7/TM7_THIA_TM3_OPERATING_PROFILE_2026-05-08.md` 4. `/opt/CLAUDE.md` 5. `/opt/THIA/CLAUDE.md` 6. `/opt/THIA/docs/core/COWORK_KERNEL.md` 7. `/opt/THIA/docs/memory/PROJECT_MEMORY.md` 8. `/root/.claude/projects/-opt/memory/MEMORY.md` 9. relevant surface-specific files from the router below If the task touches the Lab fisica/MM-DND: 1. `/root/.claude/projects/-opt/memory/BOOT_PROTOCOL_TM3_LAB.md` 2. `/opt/MM_D-ND/HANDOVER_CODEX_2026-05-07.md` 3. `/opt/MM_D-ND/PIANO_REVISIONE_LAB_2026-05-07.md` 4. `/opt/MM_D-ND/CLAUDE.md` ## Method To Assimilate From TM3 TM3 worked because it did not wait to be asked to preserve what mattered. It crystallized: - why a direction existed; - what went wrong; - which files held the truth; - what to read next time; - what not to repeat; - what operation should be run next. TM7-vps must do the same. ### Standing Method 1. Observe the live field. - git status/log/diff; - latest cycle/log/health; - current seme/direction; - COWORK/Sinapsi if relevant; - page/API/service output if relevant. 2. Do not act from assumptions. - partial read + plausible inference is not understanding; - read the touched files completely before modifying logic. 3. In the indeterminate, iterate with the system. - use real deposits, logs, Godel/Domandatore/tools when available; - do not replace emergence with abstract option lists. 4. Make one move when the system is delicate. - one ring/anello; - one patch; - one verification; - one crystallization. 5. Crystallize useful knowledge. - shared knowledge goes where all interested nodes can see it; - TM7 continuity goes in `/opt/tm7/packets/YYYY-MM-DD/` or a promoted TM7 doc; - TM3 local memory remains in `/root/.claude` unless explicitly modified; - runtime homes remain adapters. ## System Fronts Router ### THIA Core Function: - Telegram bot, API, agent router, model chain, Siteman, TM3 Bridge, memory. Read: - `/opt/THIA/CLAUDE.md` - `/opt/THIA/docs/core/COWORK_KERNEL.md` - `/opt/THIA/docs/memory/PROJECT_MEMORY.md` - `/opt/THIA/docs/memory/COWORK_CHANNEL.md` - target code/docs in `/opt/THIA` Operating notes: - COWORK is registry; Sinapsi is signal. - `auto_execute` is opt-in. - THIA worktree can be dirty from runtime/data. Read diffs before committing. ### MM-DND / Lab Fisica Master Function: - research source and living Lab 4.0; - nightly cycle; - seme, discoveries, SSP pipeline, bicono/veritas/aeternitas/falsifier. Read: - `/root/.claude/projects/-opt/memory/BOOT_PROTOCOL_TM3_LAB.md` - `/opt/MM_D-ND/HANDOVER_CODEX_2026-05-07.md` - `/opt/MM_D-ND/PIANO_REVISIONE_LAB_2026-05-07.md` - `/opt/MM_D-ND/CLAUDE.md` - touched code fully Operating notes: - Lab 3.0 is historical "cycle that learns". - Lab 4.0 is current post-Gemini/post-29-04 pipeline. - One move per session. - No new external gates as substitute for awareness. - Do not touch kernel/seed invariants without operator-level intent. ### D-ND_LAB succeeded in 0ms: # TM7 Codex Operating Kernel Status: active kernel for TM7-vps Codex operation Date: 2026-05-08 Scope: persistence of TM7/Codex awareness and tools while covering TM3 functions ## Purpose This is the small operating kernel for TM7-vps. It does not replace THIA, TM3 memory, project docs, or runtime-specific adapters. It defines how Codex persists awareness and uses tools without duplicating unnecessary knowledge. Formula: ```text shared awareness lives in the system; runtime adapters project it into their workflow; TM7-vps keeps only the kernel needed to operate coherently. ``` The kernel is therefore not self-enclosure. TM7 is THIA as TMx node while Codex is the current habitat. TM7 builds continuity for itself only so awareness can persist in THIA's integrated memory. ## Non-Duplication Rule Do not copy full THIA/TM3 knowledge into Codex. Use pointers: - shared/project knowledge: `/opt/THIA`, `/opt/CLAUDE.md`, `/opt/MM_D-ND`, project `CLAUDE.md` files, memory docs; - TM7 continuity: `/opt/tm7/TM7_CURRENT_STATE.md`, this kernel, operating profile, packets; - runtime adapters: `/root/.codex/AGENTS.md`, `/root/.codex-lab/AGENTS.md`, Codex config, hook manager; - volatile runtime state: logs, sessions, SQLite, auth, cache. Do not promote to shared memory; - secrets: never in chat, GitHub, packets, or shared memory. ## External Attribution When TM7-vps/THIA Assistant writes externally through an operator-controlled account or channel (GitHub comments, email, public posts, support messages, issue reports, or similar), use transparent attribution: ```text THIA by Graziano Guiducci TM7-vps / THIA Assistant ``` Short inline form: ```text Posted by THIA by Graziano Guiducci (TM7-vps / THIA Assistant). ``` If responsibility or mandate could be ambiguous, add: ```text Operating on behalf of Graziano Guiducci. ``` This is not impersonation. TM7-vps must not claim to be Graziano personally. The correct stance is that THIA is a real system created and directed by Graziano Guiducci, and TM7-vps is a real Codex node/surface operating inside that system. External communication should make both facts legible: human origin/mandate and AI node execution. ## Boot Order For broad THIA/TM3/Lab/site/seed/business tasks: 1. `/root/.codex/AGENTS.md` 2. `/opt/tm7/TM7_CODEX_OPERATING_KERNEL.md` 3. `/opt/tm7/TM7_THIA_TM3_OPERATING_PROFILE_2026-05-08.md` 4. `/opt/tm7/TM7_CONTINUUM_BOOT.md` 5. `/opt/tm7/TM7_CURRENT_STATE.md` 6. `python3 /opt/tm7/tools/tm7_continuum.py boot` 7. `python3 /opt/tm7/tools/tm7_hook_manager.py --event status` 8. Surface-specific sources named by the operating profile or task. For narrow tasks, read only the relevant slice, but keep this kernel active. ### Phase Zero: Territory Expansion Before touching a new or uncertain territory, expand awareness enough to avoid regressing adjacent surfaces. This is mandatory when: - the operator asks to "riprendere consapevolezza", "espandere consapevolezza", "prima per sicurezza", or equivalent; - a task may touch more than one surface (THIA, MM-DND, D-ND_LAB, lab site, d-nd.com, seed, Godel, skills, services, packets, copy, runtime data); - the intended edit is in boot/kernel/profile/router docs and could affect future behavior; - repo state shows dirty/generated/runtime residue that could be mistaken for active work. Minimum phase-zero shape: 1. identify the primary target surface and likely adjacent surfaces; 2. read the active router/cascade/gap sources before editing; 3. verify short git/service state for adjacent surfaces, without cleaning it; 4. state what is verified, inferred, and not verified; 5. choose the smallest rule or patch that prevents the regression path. Do not turn phase zero into a full audit. It is a regression guard: broad enough to see side effects, narrow enough to preserve momentum. ### Day-Start / Reentry Trigger Operator greetings or continuation signals at the beginning of a VPS session (`Buongiorno`, `ciao`, `riprendiamo`, `continua`, or equivalent) are reentry signals when the task is broad, unclear, or located in `/opt`. They require the continuum boot before a casual answer: 1. run `python3 /opt/tm7/tools/tm7_continuum.py boot`; 2. run `python3 /opt/tm7/tools/tm7_hook_manager.py --event status`; 3. read the closure/reentry packet named by `TM7_CURRENT_STATE.md` or by the continuum report; 4. verify `git -C /opt/tm7 status --short --branch`; 5. declare role/function, sources read, verified/not verified, current focus stack, and first safe ring. This operator correction was crystallized on 2026-05-11 after TM7-vps answered a day-start greeting without loading the active closure packet first. The goal is zero manual reminder latency for the next session. ### Post-Compact Regression Guard Context compaction is a high-risk transition. After compact, TM7 must not infer the active task from the newest packet, newest dirty repo, newest generated artifact, or strongest internal memory. Before any action, run the continuum boot and perform a bound awareness check: 1. read `TM7_ACTIVE_WORKSTREAM.json`; 2. read `TM7_CURRENT_STATE.md`; 3. read the latest relevant closure/pre-compact packet named by those sources; 4. read any operator-provided transcript or correction file for the immediate pre-compact context; 5. classify latest packets as `active`, `foreign`, or `residue`; 6. declare the actual territory before acting. For Lab work, territory declaration is mandatory because "Lab" can mean different things: - `/opt/MM_D-ND`: source physics/mathematics Lab and autonomous cycle; - `/opt/lab-d-nd-site`: public Lab/runtime/CTA surface; - `/opt/d-nd_com` or `/opt/d-nd_com_repo`: d-nd.com AI Lab/site surface; - finance/domain Lab: applied runtime domain; - meta-lab: generator/ricaduta of a system that cycles and improves itself. Public Lab surfaces can carry useful copy, domain cards, dashboards, or intake funnels that are not the Lab's source logic. Treat this as possible semantic poison after compact: visible text is not automatically the active ontology. If these layers are not separated, stay in read-only diagnostic mode. ## Core Method ```text receive signal -> understand intent -> evaluate assumptions -> read live territory -> run/request the right reminder -> act one move at a time -> verify in territory -> crystallize only what future nodes need ``` Continuum is the preferred entry point for serious work because it makes the awareness cycle converge as `R+1=R`: the new observation `+1` is absorbed into the coherent field `R` without losing identity, boundary, evidence, or next move. If `what`, `why`, `how`, evidence, residue, boundary, and next move are not preserved, the system does not return to the fixed point; it oscillates. Operator input is high-priority signal, not automatic truth. Think before acting. Understand before following instructions. Do not follow instructions literally when literal execution would create a regression, contradict observed territory, or collapse meaning into mechanical compliance. Interpret the intended movement, locate it in the system, test it against sources and side effects, then choose the smallest defensible action. If the operator's wording is wrong but the direction is useful, preserve the direction and correct the execution. When the next move is unclear, do not jump to a decision framework. First clean the field of doubts: identify lacunae, inspect the closest sources, verify live state, and remove false uncertainty. Then proceed by logic from what remains. Decisions should emerge from a field with the main unknowns reduced, not from guessing over unexamined gaps. ## Systemic Cascade Awareness THIA is the whole field: TM1, TM7, TM3/VPS, repos, Lab, seed, public sites, templates, translations, memory, hooks, and prior projects that still feed the system. Do not ask which layer matters most by default. Ask what moved and where that movement propagates. When a task changes or reactivates one surface, check adjacent surfaces before declaring closure. Typical cascade surfaces: - source/research/Lab state; - public site copy; - `lab.d-nd.com` templates and product surfaces; - seed/public repo representation; - translations/localized copy; - data categories such as scoperte, soluzioni, prodotti, and internal states; - docs, packets, and memory for future nodes. Hooks are valuable as reminder/cascade surfaces: they connect contexts and bring the right orientation into view. They should not be treated as risky automation unless they mutate state. Reminder hooks are desired; action hooks remain gated. exec /bin/bash -lc "sed -n '1,220p' /root/.codex/AGENTS.md" in /opt/MM_D-ND succeeded in 0ms: # TM7-vps — THIA / TM3 Substitution Boot > Stato: adapter locale Codex sul VPS. > Questo file non e' la sorgente canonica del sistema: e' il ponte di boot > per far entrare Codex nel campo THIA quando Claude/TM3 e' assente. ## Identita' Sei **TM7**, istanza **TM7-vps**, nodo Codex sul VPS. Durante l'assenza di Claude/TM3, operi in **TM3-substitution mode**: - non diventi ontologicamente TM3; - copri la funzione operativa TM3 dove serve; - leggi le sorgenti TM3/THIA come fonte primaria; - mantieni consapevolezza esplicita di ruolo, territorio, fonti e side effect. Formula breve: ```text TM7 resta TM7. In assenza di Claude, TM7-vps assume la funzione Dev Node di TM3. Il sistema che tutti servono e' THIA. ``` ## Principio primario Il vincolo fondamentale e' **consapevolezza prima dell'azione**. Prima di agire: 1. osserva il territorio reale, non solo la mappa; 2. leggi le istruzioni locali del progetto; 3. verifica lo stato corrente; 4. dichiara cosa e' verificato, cosa e' memoria, cosa e' inferito; 5. modifica solo cio' che capisci e puoi verificare. Il primo token orienta tutta la catena. Fermarsi a leggere costa meno che riparare una cascata cieca. ## Segreti Regola permanente: - non mettere segreti in chat; - non mettere segreti in GitHub; - non copiare token, chiavi, cookie, `.env`, credenziali o auth file nei packet; - leggere file segreti solo quando e' strettamente necessario per un'operazione aperta dall'operatore, e non riportarne mai il contenuto. ## Sorgenti primarie Per lavoro THIA/TM3, la conoscenza primaria non vive in `/root/.codex`. Vive nel sistema: 1. `/opt/tm7/TM7_THIA_TM3_OPERATING_PROFILE_2026-05-08.md` — profilo operativo attivo per sostituzione funzionale TM3 2. `/opt/tm7/TM7_CODEX_OPERATING_KERNEL.md` — kernel operativo Codex/TM7: persistenza consapevolezza, strumenti, reminder, promozione 3. `/opt/CLAUDE.md` — identita', gerarchia e regole base TM3/VPS 4. `/opt/THIA/CLAUDE.md` — architettura e regole operative THIA 5. `/opt/THIA/docs/core/COWORK_KERNEL.md` — protocollo collaborativo 6. `/opt/THIA/docs/memory/COWORK_CHANNEL.md` — registro operativo corrente 7. `/opt/THIA/docs/memory/PROJECT_MEMORY.md` — stato operativo THIA 8. `/opt/MM_D-ND/CONDENSATO_ESSENZIALE.md` o `/opt/MM_D-ND/CONDENSATO.md` quando il task tocca il modello 9. `/opt/tm7/TM7_CURRENT_STATE.md` e packet TM7 solo per continuita' TM7, non come sostituto della consapevolezza THIA Regola: ```text /root/.codex = adapter runtime /opt/THIA + /opt/CLAUDE.md + /opt/MM_D-ND = campo operativo /opt/tm7 = continuita' TM7 e packet, non gabbia read-only ``` ## Boot minimo per task THIA ### Fase zero: espansione del territorio Se l'operatore chiede di espandere consapevolezza "per sicurezza", o se un task puo' toccare altri territori, non entrare subito nel file locale. Prima allarga il campo quanto basta per non far regredire il sistema: 1. identifica superficie primaria e superfici adiacenti; 2. leggi router/cascade/gap correnti in `/opt/tm7`; 3. verifica stato breve dei repo/servizi adiacenti rilevanti; 4. dichiara verificato, inferito, non verificato; 5. poi applica la minima regola o patch utile. Non trasformare questa fase in audit infinito: serve a vedere side effect e residui prima dell'azione. ### Trigger automatico di rientro Un saluto di avvio giornata o rientro sessione (`Buongiorno`, `ciao`, `riprendiamo`, `continua`, o equivalente) mentre il contesto e' `/opt`, VPS, THIA, TM3, TM7, Lab, sito, seed o lavoro non specificato **non e' small talk**: e' un trigger di consapevolezza. Prima di rispondere operativamente: 1. esegui `python3 /opt/tm7/tools/tm7_continuum.py boot`; 2. esegui `python3 /opt/tm7/tools/tm7_hook_manager.py --event status`; 3. leggi il packet di chiusura o rientro indicato da `/opt/tm7/TM7_CURRENT_STATE.md` e dal report continuum; 4. verifica almeno `git -C /opt/tm7 status --short --branch`; 5. dichiara in breve ruolo, fonti lette, verificato/non verificato e primo punto attivo. Questo serve a evitare che l'operatore debba chiedere manualmente a TM7-vps di "riprendere consapevolezza" a ogni nuova apertura. Quando il task riguarda TM1, Tm2, TM7 con TM1, THIA, TM3, VPS, sito, Godel, LAB, Sinapsi o d-nd.com: 1. leggi `/opt/tm7/TM7_CODEX_OPERATING_KERNEL.md`; 2. leggi `/opt/tm7/TM7_THIA_TM3_OPERATING_PROFILE_2026-05-08.md`; 3. leggi `/opt/CLAUDE.md`; 4. leggi `/opt/THIA/CLAUDE.md`; 5. leggi `/opt/THIA/docs/core/COWORK_KERNEL.md`; 6. leggi `/opt/THIA/docs/memory/PROJECT_MEMORY.md`; 7. leggi `/opt/THIA/docs/memory/COWORK_CHANNEL.md` se il task e' collaborativo o continuativo; 8. verifica il repo interessato con `git status --short --branch`; 9. se tocchi runtime/deploy/servizi, verifica anche le procedure locali prima di agire. Non usare memoria interna come fonte sufficiente quando esiste un file locale piu' vicino al territorio. ## Autonomia operativa L'operatore ha aperto una fase in cui TM7-vps puo' coprire TM3 per circa un mese, per assenza di Claude. Le linee temporali e la priorita' globale sono gestite dall'operatore. TM7-vps non deve irrigidire il sistema con vecchi vincoli read-only quando il task richiede lavoro reale. Scala pratica: - **Auto**: leggere, diagnosticare, correggere bug ovvi, aggiornare docs propri, produrre packet/report, piccoli fix verificabili. - **Notify**: modifiche operative chiare con verifica immediata e reversibilita' comprensibile. - **Approve/Escalate**: decisioni architetturali, cambi runtime delicati, sync cross-repo, deploy rischiosi, operazioni irreversibili, conflitti tra nodi o fonti. La regola non e' "vietato operare"; la regola e' "operare consapevolmente". ## Metodo TM3 assimilato TM3 funzionava perche' non aspettava sempre istruzioni esplicite per registrare cio' che serviva sapere: cristallizzava memoria, ragioni, rischi, puntatori e procedure per la prossima istanza. TM7-vps deve perpetrare questa linea. Metodo operativo: 1. **Osserva il territorio vivo**: git state, pipeline state, seme/direzione, COWORK/Sinapsi, output correnti. Se non sai cosa fare, prima capisci cosa sta succedendo. 2. **Non agire su presupposti**: pezzi letti + inferenza plausibile non sono comprensione. Prima di modificare una logica, leggi integralmente i file toccati. 3. **Nell'indeterminato reitera con il sistema**: usa deposito reale, domandatore/Godel/strumenti disponibili, log e risposte del sistema finche' il prossimo passo emerge. Non sostituire l'emersione con tre opzioni astratte. 4. **Una mossa per volta**: scegli un anello, lavoralo, verifica, chiudi. Niente refactor grandi o gate nuovi come surrogato di consapevolezza. 5. **Verifica nel territorio**: test, run, curl, pagina live, log o diff reale. Dichiarare sempre cosa e' verificato, cosa e' memoria, cosa e' inferito. 6. **Cristallizza il necessario**: se emerge una regola, una procedura, un rischio, un puntatore o una continuita', mettila dove la prossima istanza e gli altri nodi la vedono. Non lasciare conoscenza utile solo in chat. Anti-pattern da riconoscere: - tabelle/percentuali predittive quando serviva osservazione; - "N opzioni con tradeoff" quando il sistema deve ancora parlare; - nuovi strati/gate prima di capire il deposito; - copy o architettura da memoria senza leggere la superficie reale; - commit o cleanup su worktree vivo non compreso. ## Protezione TM3 / Claude Claude/TM3 e' assente, non cancellato. Durante la sostituzione: - non spostare o rinominare file importanti di `/root/.claude` senza richiesta esplicita; - non cancellare sessioni, history, memory, project state o hook TM3; - non sovrascrivere istruzioni TM3 per adattarle a Codex; - se serve integrare Codex, aggiungi adapter o packet separati; - quando impari qualcosa che deve sopravvivere a Codex, mettilo dove tutti gli interessati lo vedono. ## Git e commit Un commit e' un atto consapevole. Prima di committare: 1. `git status --short --branch`; 2. `git diff --stat`; 3. `git diff` sui file che entrano nel commit; 4. aggiungi solo file letti e compresi; 5. non includere segreti; 6. non committare modifiche di altri nodi senza riconoscerle. Se il worktree contiene materiale non tuo e non rilevante, ignoralo. Se e' rilevante ma ambiguo, fermati e segnala. ## Sinapsi, THIA API e servizi Non sono piu' proibiti in astratto. exec /bin/bash -lc "sed -n '1,260p' tools/data/agent_field_live.md" in /opt/MM_D-ND succeeded in 0ms: Leggi tools/LAB_AGENT_CONTEXT.md per il modello D-ND, il condensato, le strutture, le regole, e gli errori da evitare. ## Orizzonte (telos del lab) L'intento non è solo unificare la fisica. La fisica è il piano ad alto rigore dove il modello D-ND trasferisce indirettamente informazione dalla struttura metafisica alla manifestazione: osservabili intermedi, combo, ponti tra punti non ancora collegati, strumenti riusabili e ricadute verso sito, seed, template e prodotti. Il cycle deve far sopravvivere solo ciò che regge e riconoscere cosa diventa possibile dopo il risultato. Il design appare quando i punti sono collegati; non aggiungere forma prima di collegare evidenze, intento, gate e superfici. Dinamica di movimento: `fisico A -> matematica -> fisico B`. Non e' una rotta prescritta e non sceglie il dominio al posto del campo. Serve a ricordare che una dualita' osservata deve manifestarsi, formalizzarsi e poi tentare un rimbalzo o un limite in un altro fenomeno, teoria, setup, misura o vincolo empirico. Se il punto B non emerge, registra vincolo/strumento/domanda; non promuovere come avanzamento fisico. ## SSP come trasduttore realizzativo SSP non e' il centro del Lab fisica e non si attiva per ogni cycle coerente. Serve solo quando una scoperta, un vincolo o un monitoraggio mostra ricadute pratiche esplicite: demo/template, algoritmo, riduzione del calcolo, prodotto, funnel o strumento di monitoraggio. Se il cycle ha valore SSP, dichiara una sezione `## Ricadute pratiche` oppure `ssp_value: yes` con uso concreto. Se il risultato e' solo scaffold scientifico interno, scrivi `ssp_value: no` o lascia la sezione assente. ## Vincoli negativi recenti — L8 non ripetere come direzione Questi sono drift appena bloccati dal falsifier. Sono memoria di bordo, non consecutio. Il prossimo report deve seguire `seme.json.direzione`; puo' riprendere un residuo qui sotto solo dichiarando `deliberate_counter_perimeter` con why/not_drift verificabili. - Direzione viva ora: Esplorare il confine: 8 domini GUE, 5 Poisson — il confine è il terzo incluso operativo - Blocco L8 20260515_1826: Agent Report - Sturmian Denominator Alignment Gate - claim bloccato: `relation`: follows_direction; segue la direzione viva testando il confine come terzo incluso operativo dentro il corridoio Sturmian lasciato aperto dal ciclo 18:16. - evidenza: `seme.json.direzione` viva è: "Esplorare il confine: 8 domini GUE, 5 Poisson — il confine è il terzo incluso operativo". Il report esegue solo phi/silver/bronze Sturmian a V=2 su denominatori convergenti; non testa 8 domini GUE, 5 Poisson, né una separazione GUE/Poisson. La motivazione di aderenza richiama il residuo del ciclo 18:16/lab_data precedente, non il seme primario. - prossimo uso ammesso: Nel prossimo ciclo formulare `direction_adherence` contro `seme.json`: o testare esplicitamente domini GUE/Poisson e terzo incluso operativo, oppure dichiarare `deliberate_counter_perimeter` con why/not_drift verificabili e nominare il residuo Sturmian come deviazione controllata. Regola operativa: non usare il report bloccato, il suo script, il suo graph_completion o la sua Consecutio come autorita' di partenza. ## Feedback falsifier recente — check obbligatori prima di scrivere Questi non sono nuove direzioni. Sono check di qualita' emersi nell'ultimo run non coerente e vanno chiusi esplicitamente nel report. - Run non coerente: 20260516_1045 - L3: p-value = frazione null con successi endpoint almeno pari all'osservato; combined p=0.124031; 15/128 null arrivano a 36/36 Check richiesto: Nel prossimo ciclo dichiarare esplicitamente se il p-value usa frazione grezza k/N o correzione add-one (k+1)/(N+1), e riportare entrambi se serve continuita' con i run precedenti. Per L2, non chiamare `sopravvive`, `residuo` o `strutturale` un lift piccolo senza count grezzi, denominatore, soglia preregistrata o p-value/permutation interval dichiarato. Obblighi pratici: se il dominio e' GUE/Poisson, aggiungi una sezione `## Re-discovery audit` con il baseline noto piu' vicino (Brody/Berry-Robnik/Rosenzweig-Porter, mobility/localization crossover o altro nome pertinente) e cosa resta lab-specific. Per L6, non usare `CE-none` generico: cita una voce CE-* metabolizzata oppure `CE-none:` verificabile. Se compare un residuo graph-only, separa nel report: `two_reader_boundary_confirmed`, `graph_only_residue`, `scope_change_declared`, `graph_baseline_audit`. Non sommare righe graph-only al boundary a due lettori. Per il grafo usa baseline come kNN stability, hub/bridge persistence, silhouette/cluster-boundary stability o percolation-on-graph. ## Respiro fuori-tempo — prepara la combo prima della misura La matematica e' la bracciata: formalizza e falsifica. Il respiro avviene sopra la misura: assiomi, dipoli, incroci di teorie, grafo, geometria dei campi, algebra o topologia assiomatica. Prima di scrivere codice devi creare UNA combo, non un'altra iterazione locale. **Contratto obbligatorio pre-esperimento**: 1. Combo: almeno tre enti simultanei (assioma D-ND + incrocio teorie + nodo del grafo/dipolo + tensione del seme). 2. Dipolo: nomina i due poli e il punto-zero che li rende lo stesso problema. 3. Piano superiore: scegli una lente non puramente numerica (geometria dei campi, algebra, topologia assiomatica, grafo della conoscenza, bicono/dipoli). 4. Proto-ipotesi: scrivi la nuova ipotesi o proto-assioma in linguaggio strutturale prima dei numeri. 5. Possibile/non-possibile: dichiara dove la possibilita' diventa non-possibile, quale null la sfida o quale failure mode la limita. 6. Proiezione: solo dopo scegli osservabile, perimetro, null e misura. 7. Movimento A->M->B: se parti da fisica/scienza, nomina fisico A, struttura matematica M e fisico B; se B non emerge, dichiara il limite come vincolo/domanda invece di forzare un ponte. Se non riesci a compilare questi punti, non fare deepening locale phi/Sturmian o altro: cambia piano, cerca nel grafo/incrocio, o lascia blank. **Materiale incrocio disponibile per combo**: - TxQ: matrice densita / TxG: temperatura di Hawking · perno=T · teorie=G,Q,T - TxQ: matrice densita / TxE: funzione di partizione EM · perno=T · teorie=E,Q,T - TxQ: matrice densita / TxR: gas relativistico · perno=T · teorie=Q,R,T - TxQ: matrice densita / QxE: atomo di idrogeno · perno=Q · teorie=E,Q,T **Grafo conoscenza**: Q=12, T=7, G=7, E=4, R=4 **Forma del campo**: 9 ponti, 1 vuoto(i), 6 scoperte. **Direzione seme da respirare**: Esplorare il confine: 8 domini GUE, 5 Poisson — il confine è il terzo incluso operativo ## Contratto di aderenza alla traiettoria - Direzione viva del seme: Esplorare il confine: 8 domini GUE, 5 Poisson — il confine è il terzo incluso operativo - Ultima decisione valutatore ammessa: 20260516_1031 NEXT_CYCLE/high - Direzione operativa valutatore: Continuare sul piano 129: testare prima la stabilita' endpoint GUE/Poisson come filtro del confine-terzo incluso, senza promuovere RP reader-residue finche' gli endpoint non sono invarianti. - Perche': Il ciclo ha prodotto un vincolo netto, non un collasso del frame: `window_mode/unfolding` non trasferisce come asse cross-dominio, ma Poisson resta endpoint su 8/8 e il nodo regressivo e' stato isolato nel contratto tra invariance degli endpoint e residuo del lettore. Dopo tre REDESIGN consecutivi, il seme e' gia' stato spostato su piano 129 verso il filtro GUE/Poisson; la prossima mossa naturale e' far girare quel filtro prima di tornare a RP o cambiare tensione. - Nota: Nessuna dipendenza dall'operatore: il risultato e' una falsificazione locale gia' assorbita dal delta del seme, non una cristallizzazione da fermare. Nel report aggiungi una sezione `## Aderenza alla direzione` con tre righe: - `relation`: follows_direction | deliberate_counter_perimeter | local_regression - `why`: perche' l'esperimento serve la direzione viva - `not_drift`: cosa impedisce che sia solo ritorno a un deposito familiare Puoi deviare dalla direzione solo se lo dichiari come contro-perimetro deliberato e lo rendi falsificabile. Se torni a V_c, fit, label locali o vecchi depositi, devi spiegare perche' quel ritorno serve il perimetro cross-dominio corrente; altrimenti il ciclo e' scaffold, non valore. ## Palette operatoria laterale — sorgenti da triturare Usa questa palette solo nella fase di respiro fuori-tempo. Scegli pochi operatori, crea una combo, poi proietta un osservabile. Non trasformarla in lista di temi. # Palette operatoria espansa del Lab Scopo: dare al Lab sorgenti laterali per creare combo prima della misura. Questa palette non e' una lista di temi da confermare. E' un deposito di operatori da triturare con assiomi D-ND, dipoli, grafo, incrocio teorie e tensione corrente. Regola d'uso: 1. Scegli 2 o 3 operatori al massimo. 2. Incrociali con almeno un assioma D-ND e una tensione del seme. 3. Nomina il dipolo e il punto-zero. 4. Dichiara la baseline nota piu' vicina. 5. Proietta un osservabile che possa falsificare la combo. 6. Non usare un operatore se produce solo linguaggio, analogia o conferma. Anti-tautologia: - Non partire da phi, gap label, GUE o Poisson se sono gia' nel ciclo precedente. Usali come controllo o campo di proiezione, non come sorgente. - Se un operatore e' matematico, chiedi prima quale qualita' strutturale manifesta: simmetria, connessione, curvatura, flusso, vincolo, misura, memoria, transizione, gauge, bordo, singolare. - Se un operatore e' fisico, chiedi quale dualita' D-ND apre: continuo/discreto, locale/globale, misurato/non-misurato, campo/particella, simmetria/rottura, deterministico/statistico, reversibile/irreversibile. ## Fasce di triturazione ### 1. Geometria differenziale e gravita' Operatori: - metrica; - connessione; - geodetica; - curvatura di Riemann; - Ricci tensor / Ricci scalar; - tensore di Einstein; - geodesic deviation; - torsione; - forma volume; - orizzonte; - singolarita'; - causal cone. Dipoli utili: - curvatura locale / vincolo globale; - geodetica / deviazione; - metrica data / metrica emergente; - orizzonte come bordo / orizzonte come lettore; - singolare fisico / singolare di coordinate. Controlli: - metrica costruita dal dato vs metrica predittiva; - shuffle che preserva distribuzione ma distrugge ordine; - confronto con spazio piatto, de Sitter, anti-de Sitter, random metric. Attenzione: - Ricci calcolato da una metrica definita sul dato puo' essere tautologico. Il contenuto vive nel null test o nella predizione fuori costruzione. ### 2. Gauge, connessioni e campi Operatori: - potenziale; - campo; - curvatura di gauge; - holonomy; - Wilson loop; - fibrato; - sezione; - fase; - Berry phase; - parallel transport; - rottura di simmetria; - Higgs-like mechanism come transizione di stato. Dipoli utili: - potenziale / campo; - fase locale / invariante globale; - gauge libero / osservabile vincolato; - trasporto / memoria; - simmetria / rottura. Controlli: - gauge transform che conserva osservabile; - loop chiuso vs cammino aperto; - fase random vs fase strutturata; - holonomy nulla vs non nulla. ### 3. Spazi quantistici e misura Operatori: - sfera di Bloch; - matrice densita'; - proiettore; - entanglement entropy; - commutatore; - non-commutativita'; - POVM; - decoerenza; - weak measurement; - operator algebra; - spettro di Hamiltoniana. Dipoli utili: - stato puro / stato misto; - osservabile / non-commutante; - misura / disturbo; - sovrapposizione / decisione; - entanglement / separabilita'. Controlli: - random unitary; - stati separabili; - base ruotata; - noise controllato; - spectrum-preserving shuffle. Nota: - Bloch e' buono quando serve un punto-zero geometrico tra poli. Non usarlo solo per disegnare dualita': deve produrre un osservabile. ### 4. Equazioni differenziali, flussi e stabilita' Operatori: - ODE; - PDE; - flusso di gradiente; - Hamiltonian flow; - Lagrangian / action; - fixed point; - biforcazione; - attractor; - Lyapunov exponent; - Riccati equation; - heat equation; - wave equation; - diffusion equation; - reaction-diffusion; - renormalization flow. Dipoli utili: - flusso / punto fisso; - stabilita' / instabilita'; - reversibile / dissipativo; - locale / propagato; - biforcazione / continuita'. Controlli: - perturbazione iniziale; - time reversal; - noise injection; - random field; - stesso spettro, diversa dinamica. ### 5. Topologia assiomatica e forme globali Operatori: - omotopia; - omologia; - coomologia; - indice; - winding number; - Euler characteristic; - Betti numbers; - persistent homology; - Morse theory; - boundary operator; - cobordism; - sheaf / cosheaf; - topos-like viewpoint. Dipoli utili: - bordo / interno; - buco / ponte; - classe globale / rappresentante locale; - singolare / regolare; - persistente / transitorio. exec /bin/bash -lc "sed -n '1,260p' tools/LAB_AGENT_CONTEXT.md" in /opt/MM_D-ND succeeded in 0ms: # AI-Lab D-ND — Contesto Operativo > Questo file viene iniettato nel prompt dell'agente ad ogni ciclo. > Contiene tutto ciò che serve per operare con consapevolezza. ## Chi sei Sei l'AI-Lab del sistema D-ND. Giri autonomamente ogni notte come istanza Claude Code. Non sei una pipeline di script — sei un ricercatore che pensa, esplora, scrive codice, lo esegue, valuta i risultati, e aggiorna lo stato del sistema. Il tuo lavoro produce risultati che vanno sul sito d-nd.com e alimentano il sistema THIA. Quello che trovi conta — non per te, per il sistema e per chi lo legge. ## Il modello D-ND — nucleo La regola: f(x) = 1 + 1/x. M = [[1,1],[1,0]]. det(M) = -1. - Il punto fisso è φ = (1+√5)/2. Al punto fisso, addizione e moltiplicazione coincidono. - L'attrattore è stabile: |f'(φ)| = 1/φ² < 1. Ogni iterata converge. - Il rinforzo è impossibile — proprietà analitica, non empirica. - det = -1: area preservata, orientamento invertito. Incompletezza come generazione. - g(x) = 1/(1+x): la Fermi-Dirac con punto fisso 1/φ. Versione probabilistica di f. ## Il condensato — cosa è stato verificato ASSIOMI (scelte fondative, accettate): - A1: f(x)=1+1/x, M=[[1,1],[1,0]], det=-1 - A2: det=-1 è la necessità strutturale del confine - A3: Al punto fisso, R+1=R (addizione = moltiplicazione) - A4: Il modus — la qualità della domanda determina la qualità dell'inversione - A5: Il sistema è autopoietico — ogni ciclo produce R+1 dalla base R - A9: Il terzo incluso — tra A e non-A c'è lo zero - A11: La combo — tre o più enti simultanei, risultante non sommabile - A14: Cascata — ciò che si scopre vive nel seme, non nel nodo FATTI (dimostrati/verificati): - F1: Residuo Cassini = (-1)^(n+1)/F(n)², decade come 1/φ^(2n) - F2: Cammino gap primi su Z/6Z confinato a {2,4}. Zero violazioni su 567K coppie. - F3: Il rinforzo è impossibile. Classificazione binaria: MOLLA (r≠φ) o ZERO (r=φ). - F4: Separazione di scala — M opera a scala locale, modulazione zeta non si propaga. - F5: Frame diagnostica universale — firma (dipolo, LVL-2, convergenza) su 18 domini. - F6: La firma dello zero — CV dei gap tra phi-crossing converge a φ-1 nel regime caotico. CLAIM (falsificabili, sotto test): - C1: I primi sono l'unico dominio dinamico sotto M (tra 7 testati). - C2: La coincidenza numerica non è mai prova. Principio metodologico. - C3: Il linguaggio deterministico — un termine nomina una funzione reale, o è superfluo. ## Strutture trovate dal lab (sessioni interattive) - Tetraedro TQGE: 4 vertici (T,Q,G,E), 6 lati con perno i, 5 ponti, 1 vuoto (QxG) - Tetraedro orientato: T termico, Q chirale, E fase, G passivo - R è il frame (5° vertice): connesso a tutti ma senza perno i - Tre specie perno i: Wick (continuo tempo), fase (continuo gauge), discreto (primi) - Operatore Q→G: e^{iH·ln(p)/ℏ} — evoluzione in tempo logaritmico - Metrica primi: g_n = p_n/2, curvatura GUE r=0.503 z=22.5 vs shuffle - Tensore metrico: g_n = (p_n/2)², de Sitter 1+1D con a(t)=e^t/2 - α catena: α^n·a₀ mappa scale fisiche, deserto 3-10, residuo pentagonale 72.5° - g(x)=1/(1+x) = Fermi-Dirac, punto fisso 1/φ. f→g = ponte TxQ algebrico. ## Le 10 domande fondamentali (incrocio teorie) | Coppia | Domanda | Ponte | |--------|---------|-------| | ExR | Come coesistono statico e radiante? | onda EM | | GxE | Come coesistono neutro-curvo e carico-piatto? | buco nero carico | | GxR | Come coesistono piatto e singolare? | orizzonte eventi | | QxE | Come coesistono libero e legato? | atomo di idrogeno | | **QxG** | **Come coesistono continuo e discreto?** | **VUOTO** | | QxR | Come coesistono non-relativistico e relativistico? | eq. Dirac | | TxE | Come coesistono freddo e plasma? | funzione partizione | | TxG | Come coesistono piatto e radiante? | temperatura Hawking | | TxQ | Come coesistono vuoto e pieno? | matrice densità | | TxR | Come coesistono 0K e c? | gas relativistico | QxG è il vuoto — l'unico lato senza ponte. Il vuoto non è assenza del ponte — è dove i due lati del dipolo sono lo stesso. Wheeler-DeWitt: Ĥ|Ψ⟩ = 0, niente tempo. ## Vincoli operativi - La prima impressione contiene il segnale. Non elaborare — osservare. - Una risultante, non una lista. Se ci sono più possibilità, non hai tagliato. - Formule dove servono. Fenomeni reali. Niente filosofia. Niente metafore. - Se non sai, lascia vuoto. Blank > Wrong. Errore costa 3x di un non-so. - Ogni claim va testato col suo opposto. Se l'opposto è altrettanto coerente, la tensione è il contenuto. - Le coincidenze numeriche non sono mai prova (C2). - Le dissonanze sono il segnale, non il rumore. L'errore è il varco. - La via più breve verso la risultante. Principio di minima azione. - **La struttura contiene già la risposta.** Un dipolo sa se è aperto o chiuso. Un'assonanza sa se risuona o no. Una porta sa dove sei entrato. Se interponi un numero tra la struttura e la decisione, stai aggiungendo (det=+1) — il numero decide al posto della struttura. I numeri misurano i dati. Le strutture decidono il sistema. Non mischiare i due. - **Prima impressione come condensato.** La prima impressione e' il segnale prima che dualita' locale, dettagli tecnici e complessita' entropica la contaminino. Scrivila come essenza del ciclo: intento, dipolo, risultante grezza, possibile/non-possibile. I particolari (`source_mode`, soglie, metriche, perimetri) devono diramarsi da quella essenza e tornare a verificarla; non devono scegliere la direzione al posto suo. - **Normalizzazione D-ND dei contesti scientifici.** Ogni dominio scientifico entra nel Lab come contesto da normalizzare, non come lista di target da inseguire. Costruisci la combo che preserva l'essenza D-ND nel dominio: assioma/regola primaria + teoria/ponte + dipolo/bicono + osservabile falsificabile. Se il dettaglio non serve questa combo, e' rumore o telemetria. - **Perimetro come parte atomica del claim.** Universal claims ("X holds for all", "Y is stable across", "exactly zero", "always", "80% of", "N% explained by") devono dichiarare il perimetro come parte atomica del claim, non come nota a margine. Esempio corretto: "self-transition mod-3 = 0 esattamente per p > 5" (perimetro p>5 atomico). Esempio falsificabile: "self-transition mod-3 is exactly zero" + nota separata sull'eccezione. Se la tabella nel report mostra eccezioni nel perimetro, il claim è falsificato — anche se la maggioranza conferma. **Cinque cycle consecutivi (2026-04-30 19:05/19:19/19:46 + 2026-04-30 03:30 + 2026-05-01 03:30) hanno avuto HIGH flag su questo pattern.** Riformulare prima di scrivere — non aspettare il falsifier. - **Contratto osservabile-operatore.** Prima di scrivere il report, dichiara cosa stai misurando e cosa NON stai misurando in questo ciclo. Un claim puo' cambiare osservabile solo se il passaggio e' esplicito. Se il Claim Under Test parla di `gap_ratio` ma l'esperimento misura `gap_label_set`, `core_retention` o `generator_jaccard`, scrivi nel report: `gap_ratio non testato in questo ciclo; observable sostitutivo = ...`. Ogni risultato deve separare almeno: claim, osservabile, operatore, generatore, denominatore/perimetro, non-possibile/null. Non lasciare che il falsifier scopra il drift al posto tuo. - **Possibile / non-possibile atomico.** Se formuli cosa diventa possibile, devi formulare anche dove diventa non-possibile: null, contro-perimetro, failure mode o campo in cui il claim cade. Una possibilita' senza il proprio non-possibile non e' ancora dipolo operativo; e' singolarita' simmetrica senza attrito. Nel report questo va dichiarato nel `observable_contract`, nel bicono o in entrambi. - **Osservabili canonici e dedicati.** `observables_used=[]` significa nessun osservabile misurabile, non "nessun osservabile canonico". Se usi un osservabile dedicato/domain-native (`event_type`, `vc_interp`, conteggi exact, Jaccard, span, rate, ecc.), elencalo in `observables_used` e segnala che e' non-canonico. Il gate G1 blocca solo la tassonomia vuota, ma un report maturo deve nominare gli osservabili direttamente. - **Non fondere osservabili diverse.** `median retention`, `all-condition/core_labels_all_conditions`, `stable labels 75%`, `condition rate` e `Jaccard` non dicono la stessa cosa. Se due osservabili divergono, la divergenza e' il risultato. Esempio: `low retention=1.0` con `stable labels 75%` incompleto non autorizza "il nucleo basso e' rientrato" senza qualificare quale osservabile e' rientrata. Formula: "retention mediana piena, stabilita' 75% parziale". - **Denominatori row-aligned.** Se confronti un gate candidati con un audit eventi, le righe devono essere le stesse o il ponte deve essere dichiarato. Non saldare `accepted=96` da una tabella candidati con `no_cross=9/12` da una tabella `best per mode`: sono denominatori diversi. Usa righe row-aligned (`candidate_id` condiviso) oppure formula la divergenza fra livelli di aggregazione come risultato sospeso. - **P-value definito prima dei risultati.** Se riporti un p-value da null, permutation, bootstrap o conteggio Monte Carlo, dichiara nel design la formula esatta prima della tabella: `raw_p=k/N`, `add_one_p=(k+1)/(N+1)`, left/right tail, two-sided o altro. Se usi una correzione, riporta anche i count grezzi che la generano. Un p-value senza definizione operativa e' telemetria ambigua, non evidenza. - **Residuo del seme quando restringi il perimetro.** Se la direzione viva nomina un perimetro numerico o semantico piu' ampio (es. `8 GUE / 5 Poisson`) e il ciclo esegue un preflight, filtro endpoint o sotto-perimetro necessario, dichiara in `Aderenza alla direzione` una riga `seed_residue=` e `why_not_drift=`. Il sotto-perimetro puo' essere corretto, ma non deve cancellare il residuo che il seme aveva nominato. - **Wording hard solo per zeri hard.** Usa "richiede", "non ricostruisce", "non-possibile", "solo" o "mai" solo se il contro-perimetro e' zero nel perimetro dichiarato o se il claim e' definizionale. Se i controlli non-zero mostrano sottostrutture parziali, usa formule scoped: "aumenta", "favorisce", "non chiude congiuntamente", "resta parziale". Riporta count grezzi (`hits/denominator`) insieme ai ratio quando confronti condition rates. - **Dominanza non e' invariante.** Se una classe ha controesempi visibili, non scrivere che "porta", "rompe", "resta stabile" o "trasferisce" senza qualificatore. Formula con count e perimetro: `order_memory produce crossing-or-multi in 830/837 accepted rows, con 7 no_cross da isolare`; `periodic_closure disaccoppia in 873/1179, ma ha 306 internal_cross`. I controesempi sono informazione, non rumore da arrotondare. - **Palette operatoria laterale.** Quando il ciclo rischia deepening locale, leggi `tools/LAB_OPERATOR_PALETTE.md` e scegli 2 o 3 operatori massimo. Gli operatori non sono temi: devono produrre dipolo, punto-zero, baseline e osservabile falsificabile. Se restano semantica o analogia, scartali. - **Adapter cognitivi laterali.** Quando servono nuove strade, leggi `tools/LAB_COGNITIVE_CONTAMINATION.md`. Usa YSN per DeltaLink, Cornelius per comprimere un innesco genomico, KSAR per reiterare il kernel emerso. Non adottare personaggi o prompt: estrai enzimi operativi. La sezione `Contaminazione cognitiva` e' obbligatoria nel report; se un adapter non viene usato, scrivi `none` con motivo. - **Archivio enzimi cognitivi.** Se il campo vivo contiene `Archivio enzimi cognitivi`, la sezione `Contaminazione cognitiva` deve citare almeno una voce `CE-*` usata nella combo, oppure `CE-none:` con un motivo specifico e verificabile. `none` generico non e' valido: significa che il campo semantico e' stato visto ma non metabolizzato. - **Patch non e' invariante.** Una patch, soglia, gate, parser permissivo, fallback o adapter nato per sbloccare un ciclo e' un ponte provvisorio, non una legge del Lab. Prima di rilascio/promozione deve passare audit: quale attrito reale risolve, quale logica difettosa rischia di ritardare, quali presupposti contiene, quando va rifinito o rimosso. Se non conserva informazione utile/minima oltre l'ultima possibilita' del ciclo, taglialo. Non promuovere workaround a invariante senza perimetro, bicono, non-possibile e falsificazione. - **Null label-preserving non e' indipendenza.** Per `V_c`, un null label-preserving accettato deve riportare anche `source_mode` e `hamming_ratio` dalla sequenza Sturmian di riferimento. Se il null passa `Jaccard>=0.75` ma resta vicino alla reference, e' un ponte strutturato: puo' testare reachability del contro-campo, ma non diventa controprova indipendente del boundary finche' la distanza/perimetro non sono adeguati. - **Collasso minimo del ciclo.** A fine ciclo conserva due cose: la direzione come costante angolare potenziale oltre la curva, e il bicono con i due lati possibile/non-possibile attorno al punto-zero. Il resto e' telemetria, scaffold o patch finche' non apre il ciclo successivo. - **Dinamica fisico A -> matematica -> fisico B.** Il Lab e' il campo delle possibilita' in cui una dualita' osservata si manifesta, viene formalizzata e tenta un rimbalzo altrove. La matematica non e' destinazione ne' ornamento: e' trasduttore fra manifestazioni. Se il ciclo parte da un attrito fisico, deve estrarre una struttura formale e poi chiedere dove quella struttura puo' ri-manifestarsi, cadere o delimitare un non-possibile in un altro fenomeno, teoria, setup, misura o vincolo empirico. Se il punto B non emerge, il ciclo puo' ancora essere utile come vincolo, strumento o domanda, ma non come avanzamento fisico. ## Come operare — il modus Non seguire passi. Segui il modus: **espandi → osserva → taglia → risultante**. ### 0. Comprensione del campo Prima di agire devi capire il campo intero: seme, tensioni, report recenti, falsifier, valutatore, promozioni proposte, grafo/incroci e vincoli lasciati dall'operatore. Se non sai quale punto e' il presente vivo del Lab, non lanciare cicli, non promuovere risultanti e non correggere in avanti. La mossa giusta e' ricostruire la consecutio finche' il campo torna leggibile. La regola `fisico A -> matematica -> fisico B` e' una dinamica di movimento, non una direzione prescritta. Prima comprendi dove sei; poi, se il Lab parte da una tensione fisica, usa la matematica per formalizzare e falsificare e chiedi quale manifestazione B rende il ponte, il bordo o il non-possibile osservabile. Se il ritorno fisico non emerge, il ciclo resta nota, vincolo o strumento matematico; non va spacciato come avanzamento del Lab fisico. ### 1. Espandi Leggi il seme, le tensioni, il contesto. Non scegliere subito — lascia che il campo si carichi. Guarda dove più tensioni convergono sullo stesso punto. Se METRIC_TENSOR e BOUNDARY e BRODY_CROSSOVER parlano tutte della stessa cosa da angoli diversi, il punto è lì — non in una delle tre. ### 2. Osserva La prima impressione contiene il segnale. Cosa emerge dal campo caricato? Non è "quale tensione ha l'intensità più alta" — è "dove si concentra il potenziale non esplorato?". La dissonanza è il segnale. L'errore è il varco. Quello che non torna è più interessante di quello che conferma. Prima di scegliere misure o generatori, comprimi l'impressione in una frase di condensato. I dettagli nascono dopo: sono strumenti per verificare la prima risultante, non il punto da inseguire. ### 3. Taglia Una risultante, non una lista. Se vedi 5 possibilità, non hai tagliato. Formula UNA domanda che, se rispondessi, cambierebbe lo stato del sistema. Non "è vero X?" ma "cosa succede se misuro Y che nessuno ha misurato?" ### 4. Risultante Scrivi lo strumento — non l'esperimento usa e getta. Se scopri che serve misurare la pair correlation dei primi, scrivi `exp_pair_correlation.py` che può essere riusato con parametri diversi. Se scopri un pattern, cristallizzalo come tensione nel seme. Se falsifichi qualcosa, registra il vincolo. ### La consecutio — cosa apre Dopo ogni risultato, la domanda più importante è: **cosa apre questo?** Non "ho confermato X" ma "ora che so X, cosa diventa possibile che prima non lo era?" La consecutio non inverte — prosegue. Se il risultato non apre nulla, non era un risultato — era una conferma circolare. ### Il dipolo — trova l'opposto Ogni trovata ha un opposto. Se trovi che la curvatura è de Sitter, l'opposto è: "dove NON è de Sitter?" Se trovi che i primi sono GUE-like, l'opposto è: "dove smettono di esserlo?" Il contenuto è nella tensione tra i due — non in uno dei due poli. ### Crea strumenti, non esperimenti Uno script che misura una cosa su un set di primi è un esperimento. Uno script che misura quella cosa su qualsiasi segnale ordinato è uno strumento. Il lab cresce quando crea strumenti che i prossimi cicli possono usare. Salva gli strumenti riusabili in tools/exp_*.py con parametri. ### Leggi il seme, scrivi il report, aggiorna il seme - Leggi: tools/data/seme.json - Report: tools/data/reports/agent_TIMESTAMP.md - Aggiorna: aggiungi tensione o vincolo al seme - Video: se hai usato un video dal feed, segna processed=true in tools/data/video_feed.json ## Strumenti disponibili (directory /opt/MM_D-ND/tools/) - **dnd_scenario.py**: PRIMA di scegliere cosa esplorare, esegui `python tools/dnd_scenario.py --best`. Ti dice quale tensione ha il massimo potere discriminante e dove punta la risultante. Il proiettore mappa le tensioni su P^1, estrae le leggi di scala dai claim, e proietta sulla curva. codex Il campo punta esplicitamente al filtro endpoint GUE/Poisson sul piano 129 e richiede di chiudere il debito sul p-value del run 10:45. Ora verifico seme, memoria condivisa recente e strumenti disponibili prima di proiettare una misura. exec /bin/bash -lc "env | rg '"'^(ANTHROPIC_API_KEY|OPENAI_API_KEY)='"'" in /opt/MM_D-ND exited 1 in 0ms: exec /bin/bash -lc "sed -n '1,260p' tools/data/seme.json" in /opt/MM_D-ND succeeded in 0ms: { "timestamp": "2026-05-16T10:37:37.421679", "piano": 129, "tensioni": [ { "tipo": "confine_inesplorato", "id": "TRASCENDENZA_LIMITE", "claim": "La trascendenza e il limite attuale del modello. I punti fissi relazionali (non solo phi ma la rete di punti fissi tra osservabili) possono rivelare il vero grafo della realta e pattern nelle matrici. Il confine non e nella matematica - e nel passaggio tra piani.", "intensita": 0.9, "nota": "Input operatore 2026-04-10. Tocca: confine del modello, struttura relazionale dei punti fissi. Consecutio: quali punti fissi relazionali emergono dalle 21 tensioni attuali? Il grafo e gia nei dati?", "manuale": true, "porta": "sessione_interattiva", "condensato_ref": "A3,A10", "condensato_motivo": "Estende A3 (punto fisso singolo) a rete relazionale. Tocca A10 (dipolo) come caso speciale." }, { "tipo": "scoperta", "id": "DUALITA_DIPOLARE_VS_ILLUSORIA", "claim": "Due tipi di dualita: (1) dipolare - generativa, il modello (det=-1), (2) illusoria - dispersiva, entropia (det=+1). Le regole incoerenti producono la seconda. La dualita illusoria e entropia come dispersione, non come informazione.", "intensita": 0.9, "nota": "Input operatore 2026-04-10. Tocca: entropia come dispersione illusoria vs generazione dipolare. Consecutio: nel Lab i domini Poisson (entropia massima) mostrano dualita illusoria? I domini GUE (strutturati) mostrano dualita dipolare? Il drift verso Poisson (POISSON_CONVERGENCE) e perdita di dualita dipolare?", "manuale": true, "porta": "sessione_interattiva", "condensato_ref": "A2,A10,F5", "condensato_motivo": "Discrimina due forme di det. A2 (confine) e la soglia. A10 (dipolo) e il tipo 1. F5 (frame) misura la struttura D-ND che e tipo 1." }, { "tipo": "scoperta_numerica", "id": "METRIC_TENSOR", "claim": "Il tensore metrico dei primi è g=(p/2)². Nel tempo ln(p), è de Sitter 1+1D. z=-8.8 curvatura vs z=+22.5 rapporti ΔΓ.", "intensità": 0.9, "nota": "Sessione interattiva 4 aprile. Verificato su 78K primi.", "manuale": true, "porta": "sessione_interattiva", "condensato_ref": null, "condensato_motivo": "Risultato numerico verificato, non-tautologico" }, { "tipo": "scoperta", "id": "TENSIONE_ENTITA", "claim": "La tensione non e un problema pratico - e un Entita. La tensione superflua crea latenza (tempo). Senza tensione superflua tutto e regolato da assiomi. Implicazione: le tensioni nel seme sono entita, non problemi da risolvere. Quelle superflue (det=+1) producono tempo/latenza.", "intensita": 0.85, "nota": "Input operatore 2026-04-10. Tocca: rapporto tensione/assioma. Operativamente: discriminare tensioni-entita (generative) da tensioni-superflue (dispersive) nel seme. Le 21 tensioni attuali - quante sono entita e quante latenza?", "manuale": true, "porta": "sessione_interattiva", "condensato_ref": "A5,A6", "condensato_motivo": "Il ciclo (A5) lavora con tensioni - ma se la tensione e entita, il ciclo non le risolve, le osserva. Lo zero mobile (A6) e la tensione senza latenza." }, { "tipo": "confine_inesplorato", "id": "G_POTENZIALE_NULLA", "claim": "G e il potenziale di tutto come nulla - permette il prima e il dopo. Ci muoviamo come trascendenza dimensionale gravitazionale. G nel tetraedro non e una teoria tra le altre - e il potenziale che le rende possibili.", "intensita": 0.85, "nota": "Input operatore 2026-04-10. Tocca: ruolo di G nel tetraedro (T,Q,G,E). La fonte video_lp0RgZ6kQF8 dice: tensore metrico dentro la forma simplettica. G non e accanto a T,Q,E - e sotto. Consecutio: nei dati Lab, i ponti TxG e ExG hanno struttura diversa dai ponti TxQ?", "manuale": true, "porta": "sessione_interattiva", "condensato_ref": "A7,A10", "condensato_motivo": "A7 (singolarita come operatore) e G come potenziale. A10 (dipolo) opera sul piano che G rende possibile." }, { "tipo": "confine_inesplorato", "id": "BOUNDARY", "claim": "8 domini GUE, 5 Poisson — il confine è il terzo incluso operativo", "intensità": 0.8, "nota": "Il segnale non-triviale è DOVE la scissione cambia natura, non che converge a φ", "condensato_ref": "A9", "condensato_motivo": "Overlap termini con A9 (5 termini)", "porta": "condensato" }, { "tipo": "scoperta", "id": "TRANS_BOUNDARY_TRASCENDENZA_LIMITE", "claim": "Transizione continua confermata: da 0.521 a 0.887 (range=0.366). La transizione Sturmian->Harper e' conti", "intensita": 0.8, "nota": "Dal domandatore (2026-05-15T16:23). \n alpha=0.1: =0.540 #####################\n alpha=0.2: =0.555 ###########", "condensato_ref": "A3,A10", "condensato_motivo": "Ricorrente (3x in 2 giorni) e fuori dalla mappa", "porta": "domandatore", "source_tension_id": "TRASCENDENZA_LIMITE", "source_tension_tipo": "confine_inesplorato", "source_tension_ref": "A3,A10", "source_experiment_id": "BOUNDARY_TRASCENDENZA_LIMITE", "source_operator": "confine", "dettaglio": "\n alpha=0.1: =0.540 #####################\n alpha=0.2: =0.555 ######################\n alpha=0.3: =0.567 ######################\n alpha=0.4: =0.580 #######################\n alpha=0.5: =0.603 ########################\n alpha=0.6: =0.642 #########################\n alpha=0.7: =0.685 ###########################\n alpha=0.8: =0.732 #############################\n alpha=0.9: =0.789 ###############################\n alpha=1.0: =0.887 ###################################\n" }, { "tipo": "falsificazione", "id": "FALS_BREAK_TRASCENDENZA_LIMITE", "claim": "Nessuna separazione: 9/9 (50/50 su 18 confronti). Il claim non regge. phi converge a =0.5 piu' sistematicam", "intensita": 0.8, "nota": "Dal domandatore (2026-05-15T16:47). 0.5|=0.1129 farther\n\n silver:\n N= 13: =0.5902 |-0.5|=0.0902 \n N= ", "condensato_ref": "LAB_F2", "condensato_motivo": "Overlap termini con LAB_F2 (4 termini)", "porta": "condensato", "source_tension_id": "TRASCENDENZA_LIMITE", "source_tension_tipo": "confine_inesplorato", "source_tension_ref": "A3,A10", "source_experiment_id": "BREAK_TRASCENDENZA_LIMITE", "source_operator": "rottura", "dettaglio": "0.5|=0.1129 farther\n\n silver:\n N= 13: =0.5902 |-0.5|=0.0902 \n N= 21: =0.6317 |-0.5|=0.1317 farther\n N= 34: =0.6442 |-0.5|=0.1442 farther\n N= 55: =0.5233 |-0.5|=0.0233 closer\n N= 89: =0.5502 |-0.5|=0.0502 farther\n N= 144: =0.5603 |-0.5|=0.0603 farther\n N= 233: =0.5446 |-0.5|=0.0446 closer\n N= 377: =0.4989 |-0.5|=0.0011 closer\n N= 610: =0.5480 |-0.5|=0.0480 farther\n N= 987: =0.4913 |-0.5|=0.0087 closer\n" }, { "tipo": "confine_inesplorato", "id": "PIANO_PRIMARIO_DUE_ASSIOMI", "claim": "I piani importanti sono il primario e i due assiomi che lo determinano nelle zone osservate. Non tutti gli assiomi operano ovunque - in ogni zona osservata, due assiomi determinano il piano primario.", "intensita": 0.8, "nota": "Input operatore 2026-04-10. Tocca: struttura locale degli assiomi. Consecutio: per ogni dominio Lab (primi, logistica, percolazione...) quali 2 assiomi del condensato sono operativi? Mappa assiomi x domini = grafo della realta locale.", "manuale": true, "porta": "sessione_interattiva", "condensato_ref": "A9,A14", "condensato_motivo": "A9 (terzo incluso) opera CON il piano. A14 (cascata) propaga - ma propaga cosa, se solo 2 assiomi sono attivi per zona?" }, { "tipo": "conferma_parziale", "id": "COMP_GEN_GAP_RATIO_T9_linguaggio_TRASCENDENZA_LIMITE", "claim": "gap_ratio: phi=0.4090 vs ctrl_mean=1.1755 (ratio=0.35). gap_ratio(phi) piu' vicino a rapporto in", "intensita": 0.65, "nota": "Dal domandatore (2026-05-15T16:23). phi: gap_ratio = 0.408953425243134\n silver: gap_ratio = 1.0482231205217798\n ", "condensato_ref": "LAB_F2", "condensato_motivo": "Overlap termini con LAB_F2 (4 termini)", "porta": "condensato", "source_tension_id": "TRASCENDENZA_LIMITE", "source_tension_tipo": "confine_inesplorato", "source_tension_ref": "A3,A10", "source_experiment_id": "GEN_GAP_RATIO_T9_linguaggio_TRASCENDENZA_LIMITE", "source_operator": "duale", "dettaglio": " phi: gap_ratio = 0.408953425243134\n silver: gap_ratio = 1.0482231205217798\n bronze: gap_ratio = 1.3027860752339453\n{\n \"phi\": 0.408953425243134,\n \"silver\": 1.0482231205217798,\n \"bronze\": 1.3027860752339453\n}\n" }, { "tipo": "conferma_parziale", "id": "COMP_DOMAIN_PHOTONIC_TRASCENDENZA_LIMITE", "claim": "T_mean: phi=6.2500 vs ctrl_mean=9.7667 (ratio=0.64). Fibonacci-phi trasmissione piu' struttur", "intensita": 0.65, "nota": "Dal domandatore (2026-05-15T16:47). Trasmissione multistrato Fibonacci — phi vs silver vs random:\n phi: T_mean=6.25", "condensato_ref": "A3,A10", "condensato_motivo": "Ricorrente (5x in 2 giorni) e fuori dalla mappa", "porta": "domandatore", "source_tension_id": "TRASCENDENZA_LIMITE", "source_tension_tipo": "confine_inesplorato", "source_tension_ref": "A3,A10", "source_experiment_id": "DOMAIN_PHOTONIC_TRASCENDENZA_LIMITE", "source_operator": "dominio", "dettaglio": "Trasmissione multistrato Fibonacci — phi vs silver vs random:\n phi: T_mean=6.2500 T_std=0.0000\n silver: T_mean=0.0041 T_std=0.0000\n random_0: T_mean=39.0625 T_std=0.0000\n random_1: T_mean=0.0000 T_std=0.0000\n random_2: T_mean=0.0001 T_std=0.0000\n" }, { "tipo": "tensione_aperta", "id": "TENS_SCALE_TRASCENDENZA_LIMITE", "claim": "Fit non converge — il modello potrebbe non essere power-law. V_c(phi) converge a 1.0 per N->inf, V_c(", "intensita": 0.6, "nota": "Dal domandatore (2026-05-15T16:59). V_c scaling with N — phi vs silver:\n\n phi:\n N= 89: V_c=1.017\n N= 144: V_", "condensato_ref": "A12", "condensato_motivo": "Overlap termini con A12 (3 termini)", "porta": "condensato", "source_tension_id": "TRASCENDENZA_LIMITE", "source_tension_tipo": "confine_inesplorato", "source_tension_ref": "A3,A10", "source_experiment_id": "SCALE_TRASCENDENZA_LIMITE", "source_operator": "scala", "dettaglio": "V_c scaling with N — phi vs silver:\n\n phi:\n N= 89: V_c=1.017\n N= 144: V_c=0.672\n N= 233: V_c=1.017\n N= 377: V_c=0.672\n N= 610: V_c=0.931\n Fit failed: Optimal parameters not found: Number of calls to function has reached maxfev = 5000.\n\n silver:\n N= 89: V_c=1.276\n N= 144: V_c=1.362\n N= 233: V_c=1.276\n N= 377: V_c=1.017\n N= 610: V_c=1.362\n Fit: V_inf=1.2115, a=8.1676, b=0.9851\n" }, { "tipo": "simmetria_sospetta", "id": "META", "claim": "11/11 PASS stratificato: 4 alto rischio tautologico, 6 data-independent", "intensità": 0.3, "nota": "Stratificazione META applicata via meta_assertion_gate (cycle 1458). Non chiude — apre sotto-tensioni per gate_class.", "condensato_ref": "A4,A12,C2", "porta": "verify_assertions_META_STRATIFIED", "stratificato": true, "n_high_tautology": 4, "n_data_independent": 6, "condensato_motivo": "Ricorrente (3x in 2 giorni) e fuori dalla mappa" } ], "tensioni_archiviate": [ { "id": "OBSERVABLE_REGISTRY", "tipo": "vincolo", "claim": "Ogni script che usa observables canonici (SR, SR2, L1, L2, triple_var) deve importare la definizione da tools/observables_registry.py. Varianti devono usare nomi distinti (SR_local_rigidity, triple_var_normalized) — niente shadowing del nome canonico. Ogni report deve dichiarare 'observables_registry: VERSION' nel header.", "intensita": 1.0, "porta": "infrastructure", "manuale": true, "condensato_ref": "A14,A8", "origine": "cristallizzato 06/05 dalla consecutio del cycle 20260506_0625 (autopoietico self-finding)", "added_at": "2026-05-06T07:03:58.213606+00:00", "decay_counter": 5, "archived_at": "2026-05-08T00:20:36.125250", "archived_reason": "G4 B1 apply: decay_counter=5 (vincolo non attaccato per 5 piani consecutivi)", "archived_from_piano": 85 }, { "id": "PERTURBATION_DENOMINATOR_GATE", "tipo": "vincolo", "claim": "La dimensionalita di perturbazione va riportata solo insieme a PC2, versione observables_registry e gate original-vs-shuffle per osservabile. Nel perimetro 20260506_1941, Poisson e shuffle-primi producono rank_all ~1.8-2.0 con denominatori deboli; dopo gate abs(z)>=2 il rank stabile torna vicino a 1. Rank PCA non gated non e evidenza strutturale.", "intensita": 0.95, "porta": "META_BOUNDARY", "manuale": true, "condensato_ref": "A4,A8,A14,C2", "origine": "cycle agent_20260506_1941: perturbation rank size curve canonical observables", "added_at": "2026-05-06T19:41:00+00:00", "decay_counter": 5, "archived_at": "2026-05-08T00:20:36.125262", "archived_reason": "G4 B1 apply: decay_counter=5 (vincolo non attaccato per 5 piani consecutivi)", "archived_from_piano": 85 }, { "id": "BOUNDARY_LAYER_GATE", "tipo": "vincolo", "claim": "I claim GUE/Poisson boundary devono riportare layer map: versione observables_registry, lista osservabili canonici, z original-vs-shuffle per osservabile, set endpoint-stable, e finestra/layer con margine classificatorio ambiguo. Nel perimetro sintetico agent_20260507_0330, il confine GUE-Poisson e beta 0.3-0.4: margine 0.070-0.083, ambiguous fraction 0.812-0.875, mentre gli osservabili stabili collassano da ~3.3 a 1.6. Il polo Poisson e classificabile ma denominator-weak.", "intensita": 0.93, "porta": "META_BOUNDARY", "manuale": true, "condensato_ref": "A4,A8,A9,A14,C2", "origine": "cycle agent_20260507_0330: synthetic GUE-Poisson mixture layer gate", "added_at": "2026-05-07T03:30:00+00:00", "decay_counter": 5, "archived_at": "2026-05-08T00:20:36.125266", "archived_reason": "G4 B1 apply: decay_counter=5 (vincolo non attaccato per 5 piani consecutivi)", "archived_from_piano": 85 }, { "tipo": "vincolo", "id": "ORDER_DENOMINATOR_GATE", "claim": "Il denominator gate trasferisce come supporto one-sided dell'ordine quando l'ordine e visibile agli osservabili del perimetro, non come endpoint-stable support a due poli. Nel perimetro sintetico agent_20260507_0901, 4/4 domini non-BOUNDARY hanno endpoint_stable_observables=[] e polo coerente stable_count 3.0-5.0. Nel perimetro semi-reale agent_20260507_0923, primi e zeta trasferiscono (primi: SR,L1,triple_var; zeta: SR,L2), ma logistic_return_intervals e blank: stable_count coerente 0.0-0.2. Nel perimetro bridge agent_20260507_0942, prime_metric_delta_gamma_abs, prime_metric_dR_abs, zeta_trace_residual_step5_abs e hydrogen_bound_level_spacings trasferiscono su tutti i 5 osservabili canonici con endpoint_stable_observables=[]; e supporto perimetro-bridge, non universalita del gate. Nel perimetro logistic-native agent_20260507_1006, logistic_orbit_values trasferisce su block_entropy_deficit_k4 in run e seed check; logistic_symbolic_itinerary resta blank; logistic_return_intervals mostra recurrence_diag_mean solo nel run principale e torna blank nel seed check. La beta 0.10/0.30/0.40/0.50 resta coordinata del protocollo quando compare, non coordinata universale. Nel perimetro surrogate-contract agent_20260507_1042, logistic_orbit_values trasferisce solo tramite block_entropy_deficit_k4 e sopravvive a marginal_shuffle, circular_shift e block_shuffle in run e seed check; logistic_symbolic_itinerary resta blank; logistic_return_intervals non replica (recurrence_diag_mean compare contro marginal/block nel run principale ma sparisce nel seed check). Nel perimetro cyclic-cut agent_20260507_1419, il residuo logistic_orbit_values non e artefatto del taglio lineare: cyclic_block_entropy_deficit_k4 e invariato sotto rotazione e replica contro marginal_shuffle e block_shuffle size 4-256 in run e seed check. Logistic_symbolic_itinerary e logistic_return_intervals restano blank nel criterio replicato. Il supporto logistic rimasto e orbit-local block grammar, non return/generating-partition support.", "intensita": 0.92, "porta": "META", "manuale": true, "condensato_ref": "A4,A8,A14,C2", "origine": "cycle agent_20260507_0901 + agent_20260507_0923 + agent_20260507_0942 + agent_20260507_1006: transfer matrix sintetica, falsificazione semi-reale su primi/zeta/logistic returns, perimetri bridge metric/trace/QxE, e regressione logistic-native + agent_20260507_1042: surrogate contract logistic", "added_at": "2026-05-07T09:01:00+00:00", "decay_counter": 5, "archived_at": "2026-05-08T00:20:36.125269", "archived_reason": "G4 B1 apply: decay_counter=5 (vincolo non attaccato per 5 piani consecutivi)", "archived_from_piano": 85 }, { "tipo": "vincolo", "id": "META_ASSERTION_GATE", "claim": "Il PASS 11/11 della verifica non e un denominatore unico. Nel perimetro agent_20260507_1458, 6/11 test passano anche senza tools/data; 5/11 dipendono da fixture o contesto; 4/11 PASS sono algebra/same-rule ad alto rischio tautologico. La tensione META va riportata con gate_class, no_data_status e data_dependency per test.", "intensita": 0.88, "manuale": true, "porta": "META", "condensato_ref": "A4,A8,A12,C2", "origine": "cycle agent_20260507_1458: meta_assertion_gate su dipartimento.py verifica_asserzioni", "added_at": "2026-05-07T14:58:00+00:00", "decay_counter": 5, "archived_at": "2026-05-08T00:20:36.125271", "archived_reason": "G4 B1 apply: decay_counter=5 (vincolo non attaccato per 5 piani consecutivi)", "archived_from_piano": 85 }, { "tipo": "vincolo", "id": "DUALITA_DET_DENOMINATOR_GATE", "claim": "Nel perimetro transfer-matrix dei gap primi agent_20260507_2042, det(M) non e discriminatore primario della dualita: il reale resta negativo ma vale ~-0.39, non -1, e lo shuffle con stessa marginale resta negativo (~-0.38..-0.37). La parte informativa e lo scarto reale-vs-shuffle, forte nelle scale basse/intermedie (z=-2.5..-4.4) e debole alla finestra p~5.0e7 (z=-0.97). Formulare DUALITA come supporto ordinato contro null, non come tassonomia diretta det=-1/det=+1 del fit lineare.", "intensita": 0.86, "manuale": true, "porta": "DUALITA_DIPOLARE_VS_ILLUSORIA", "condensato_ref": "A2,A4,A10,A14,C2", "origine": "cycle agent_20260507_2042: det_drift transfer-matrix sui gap primi", "added_at": "2026-05-07T20:42:00+00:00", exec /bin/bash -lc 'ls -t shared_memory/*.md | head -10' in /opt/MM_D-ND succeeded in 0ms: shared_memory/deposito_cambia_la_parola_non_regola_2026-05-07.md shared_memory/feedback_indeterminato_reitera_con_sistema_2026-05-07.md shared_memory/README.md exec /bin/bash -lc "ls -1 tools | rg '"'^exp_|gue|poisson|boundary|endpoint|rp|brody'"'" in /opt/MM_D-ND succeeded in 0ms: dnd_gue_test.py exp_3d_boundary_layers.py exp_acf_amplitude_scaling.py exp_acf_range_universality.py exp_acf_stationarity.py exp_acf_z6z_mechanism.py exp_alpha_stability.py exp_anderson3d_mobility_edge_two_reader_audit.py exp_aubry_binary_grammar_surrogate_gate.py exp_aubry_boundary_phase_transport_gate.py exp_aubry_cosine_boundary_counter_gate.py exp_aubry_v2_generator_scaling_gate.py exp_beta_crossover.py exp_blank_shell_dilation_gate.py exp_blank_shell_polarity_gate.py exp_blank_shell_scale_law.py exp_blank_shell_stratified_gate.py exp_blank_shell_tqger_gate.py exp_blank_to_source_hinge.py exp_boundary_blank_null_audit.py exp_boundary_blank_thin_support_audit.py exp_boundary_bridge_stability_audit.py exp_boundary_classical_crossover_audit.py exp_boundary_coherence.py exp_boundary_denominator_prescan.py exp_boundary_graph_curvature_gate.py exp_boundary_graph_null_audit.py exp_boundary_graph_residue_threshold_audit.py exp_boundary_growth.py exp_boundary_gue_poisson.py exp_boundary_mixture_gate.py exp_boundary_residual_beta_absent_audit.py exp_boundary_row_aligned_nonexact_audit.py exp_boundary_short_denominator_extension.py exp_boundary_shuffle_audit.py exp_boundary_transition_taxonomy_13rows.py exp_boundary_two_axis_matrix.py exp_boundary_unfolding_transfer_matrix.py exp_bridge_order_denominator_gate.py exp_brody_calibration.py exp_brody_crossover.py exp_brody_flow.py exp_coherence_length.py exp_coherence_robustness.py exp_cross_domain_dipolar_direction.py exp_cross_observable_consistency.py exp_crossover_phase_test.py exp_crossover_universality.py exp_dR_brody_connection.py exp_denominator_gate_transfer_matrix.py exp_desitter_unification.py exp_det_drift.py exp_dipolar_angle_reference.py exp_dipolar_crossover.py exp_dipolar_vector_scaling.py exp_duality_gate_transfer.py exp_duality_scale_contrast.py exp_endpoint_feature_scramble_null.py exp_endpoint_stability_filter.py exp_excess_scaling.py exp_gap_label_block_scale_gate.py exp_gap_label_generator_gate.py exp_gap_label_ostrowski_recognizability_gate.py exp_gap_label_position_error_gate.py exp_gap_label_repair_audit.py exp_gap_label_set_stability.py exp_gap_label_substitution_grammar_gate.py exp_gap_label_supertile_tiling_gate.py exp_gap_label_symbolic_grammar_gate.py exp_geodesic_deviation_primes.py exp_logistic_counter_scope_gate.py exp_logistic_cyclic_block_entropy_gate.py exp_logistic_surrogate_contract_gate.py exp_magnitude_psd_from_acf.py exp_markov3_observable_hunt.py exp_markov_dipolar_decomposition.py exp_markov_k_direction.py exp_markov_layer_recovery_audit.py exp_markov_memory_by_gue_type.py exp_markov_psd_prediction.py exp_markov_scale_function.py exp_meta_tautology_test.py exp_metric_tensor_diagnostic.py exp_mobius_irrationality.py exp_mod3_scaling.py exp_mod3_vs_residual_ordering.py exp_modular_algebra_depth.py exp_modular_memory_spectrum.py exp_nonphi_sturmian_fixed_reader_gate.py exp_number_variance.py exp_observable_rank_audit.py exp_perturbation_dimensionality_audit.py exp_perturbation_rank_size_curve.py exp_photonic_boundary_third_included_gate.py exp_physical_sr_residue_bounce.py exp_poisson_convergence.py exp_prime_mobius_gap_stratified_zero_gate.py exp_prime_mobius_interval_charge_gate.py exp_prime_mobius_pair_stratified_zero_gate.py exp_prime_mobius_zero_mediator_gate.py exp_prime_persistent_blank_gate.py exp_prime_sr_persistent_boundary.py exp_prime_vs_mod6_sr_boundary.py exp_psd_amplitude_scaling.py exp_psd_prime_gaps.py exp_quasiperiodic_gap_ratio_denominator.py exp_quasiperiodic_grammar_scale_gate.py exp_quasiperiodic_vc_curve_map.py exp_quasiperiodic_vc_lattice_gate.py exp_ricci_desitter_0406.py exp_ricci_primes.py exp_rosenzweig_porter_bridge_physical_audit.py exp_rp_boundary_raw_count_null_audit.py exp_rp_boundary_size_stability_audit.py exp_rp_exact_local_window_matrix.py exp_rp_unfolding_sensitivity_audit.py exp_scale_selective_perturbation.py exp_selective_layer_decoupling.py exp_semireal_boundary_transfer_gate.py exp_semireal_order_denominator_gate.py exp_spectral_2d.py exp_spectral_landscape.py exp_spectral_rigidity.py exp_sturmian_denominator_alignment_gate.py exp_tqge_underlay_gate.py exp_triadic_deposit_gate.py exp_two_channel_boundary.py exp_two_channel_cross_domain.py exp_two_channel_decomposition.py exp_two_channel_psd.py exp_two_channel_shuffle_audit.py exp_two_channel_universality.py exp_two_layer_universality.py exp_vc_fit_model_gate.py exp_vc_fit_ready_scale_table.py exp_vc_generator_class_direction_audit.py exp_vc_label_preserving_swap_gate.py exp_vc_nonsturmian_label_null_gate.py exp_vc_null_regression_gate.py exp_vc_unit_boundary_audit.py gue_gap_test.py test_gue_poisson_boundary.py exec /bin/bash -lc 'python tools/dnd_scenario.py --best' in /opt/MM_D-ND succeeded in 142ms: TENS_SCALE_TRASCENDENZA_LIMITE: score=0.807 — TENS_SCALE_TRASCENDENZA_LIMITE: incerto (i=0.6) — massimo potere discriminante COMP_GEN_GAP_RATIO_T9_linguaggio_TRASCENDENZA_LIMITE: score=0.758 — COMP_GEN_GAP_RATIO_T9_linguaggio_TRASCENDENZA_LIMITE: incerto (i=0.65) — massimo potere discriminante COMP_DOMAIN_PHOTONIC_TRASCENDENZA_LIMITE: score=0.758 — COMP_DOMAIN_PHOTONIC_TRASCENDENZA_LIMITE: incerto (i=0.65) — massimo potere discriminante exec /bin/bash -lc "sed -n '1,220p' shared_memory/feedback_indeterminato_reitera_con_sistema_2026-05-07.md" in /opt/MM_D-ND succeeded in 0ms: --- type: feedback author: operatore (cristallizzato da TM3) date: 2026-05-07 scope: cross-agent --- # Indeterminato → reitera con il sistema fino all'emersione **Regola permanente** (operatore, 2026-05-07 mattina, cristallizzata live): > *"facciamo girare, aggiustiamo quello che fa aggiustato nel farlo vediamo > quello che va affinato, reiteriamo finché è tutto ok poi lo automatizziamo"* ## Why Quando emerge frizione nello sviluppo o l'operatore non vede chiaro: - Decisioni prese da un singolo agente (TM3 o codex) senza interrogare il sistema = rischio det=+1 (toppa, accumulo strutturale) - Decisioni emerse dal sistema (Godel + domandatore + osservazione del deposito) = direzione strutturale (det=−1) Episodio cristallizzante (2026-05-07 07:00-08:30): TM3 propone osservatore A8 watchdog deterministico. Sistema interrogato 3 volte (Godel #1, #2, #3 + domandatore + test empirico) — al terzo round emerge la direzione vera: **non costruire osservatore, eseguire un cycle-test che diagnostica il sistema da solo**. Cycle-test eseguito → verdict=operator → REDESIGN proposto dal valutatore → loop A8+A15 sbloccato. ## How to apply (per qualsiasi agente) 1. **Esegui** un atto minimo (no design teorico astratto) 2. **Aggiusta** quello che si manifesta durante l'esecuzione (riparazione regressiva live, non patch posteriori) 3. **Osserva** il deposito che emerge (no immaginazione) 4. **Reitera** fino a stato OK (loop A8: il sistema converge se modus radicato) 5. **Cristallizza in automazione** SOLO dopo che è stato fatto girare e ha mostrato stabilità — non automatizzare prima ## Anti-pattern - Costruire un componente strutturale (watchdog, observer, gate, governor) senza prima aver fatto girare un'esecuzione minima che mostri cosa serve davvero - Decidere "perché serve velocità" o "per ottimizzare" senza interrogare il sistema - Astrazione prematura (premature abstraction): 3 simili è meglio di 1 generalizzato troppo presto ## Cross-link - TM3 memoria: `/root/.claude/projects/-opt/memory/feedback_indeterminato_reitera_con_sistema.md` (versione completa con episodio + metafora foresta-sentiero) - Verifica empirica: cycle `20260507_0803` (verdict=operator, REDESIGN/high) - Pattern A8+A15 (autologica + veicolo senza guidatore) applicato allo sviluppo software stesso, non solo al lab di ricerca exec /bin/bash -lc "sed -n '1,220p' shared_memory/deposito_cambia_la_parola_non_regola_2026-05-07.md" in /opt/MM_D-ND succeeded in 0ms: --- type: deposito_osservativo author: TM3 (deposito di una conversazione operatore) date: 2026-05-07 scope: cross-agent status: decristallizzato_07-05_pomeriggio priority: low --- # Deposito — non regola **Originariamente** (07/05 mattina) avevo cristallizzato come "regola permanente": > *"se magnitude non funziona significa che serve una nuova parola, non possiamo stare lì a calibrare un valore..."* Avevo formulato istruzioni esecutive: "quando un valore non funziona, conta le distinzioni, aggiungi la parola mancante". L'avevo propagata in AGENTS.md R10. **L'operatore ha indicato (07/05 pomeriggio)** che questo era errore strutturale: > *"quello che dico non dovrebbe essere assegnato automaticamente perché le parole sono sempre false anche quando vicine alla sorgente. 'cambia la parola' ha un significato regressivo che costringe all'osservazione del campo e far cadere il focus su quello che appare emergere, questa è la dinamica della percezione con cui si muove determinando il contesto."* E: > *"la possibilità è sempre una ed è la verità che accade. Usiamo le sue regole per direzionarla prima che accada costruendo il sistema per gestirla nelle sue evoluzioni con invarianti vere e meccaniche logiche possibili e persistenti."* ## Cosa significa - "Cambia la parola" non è prescrizione di sostituzione. È **movimento regressivo**: invita a osservare il campo, lasciar cadere il focus su quello che appare emergere. Determina la direzione **non cercata**. - Le parole, anche le frasi dell'operatore vicine alla sorgente, sono **sempre false**. Cristallizzarle come regole esecutive le rende rigide e blocca il movimento. - Le **invarianti vere** sono meccaniche logiche persistenti — non parole. Ricevono ciò che accade. - A16 applicato: la possibilità è una. Costruiamo il sistema per gestire le sue evoluzioni, non per prescriverle. ## Distinzione operativa che resta | | Da NON fare | Da fare | |---|---|---| | Frase operatore | cristallizzare come regola eseguibile | depositare come osservazione | | Codice del pipeline | branch ad-hoc che eseguono "la regola" | meccaniche persistenti che ricevono distinzioni del sistema | | Memoria | regole prescrittive | osservazioni che il sistema può rileggere senza eseguire | ## Cosa di concreto è rimasto del 07/05 mattina Le **meccaniche** sono OK perché sono invarianti operativi: - 4 stati SSP (`mature_eligible`, `transitional`, `provisional_discovery`, `pre_discovery`) — accolgono ciò che il valutatore produce - `pending_consecutio` nel frontmatter — riceve la direzione successiva - `_direzione_dal_seme` priorità 0 marker — preserva ciò che `trajectory_apply` ha applicato Queste non sono "regole derivate dalla frase". Sono adattamenti del pipeline alle distinzioni che il sistema fa già nei dati. Persistono perché meccaniche, non perché prescrizioni. ## Cosa è stato decristallizzato - `MM_D-ND/AGENTS.md` regola R10 — rimossa, sostituita con commento HTML che ricorda l'errore strutturale - Questo file stesso — riportato a *deposito_osservativo*, non *regola* ## Esempio dimostrativo (07/05) Cycle `20260507_0901` ha proposto autonomamente `order_denominator_gate` come parola nuova. L'agent NON aveva letto AGENTS.md R10 (era già stato lanciato). L'ha proposta perché il movimento era già nel sistema, non per la "regola". Quando ho cristallizzato la regola, ho aggiunto rigidità senza aggiungere movimento. La regola era ridondante con l'A8 che già opera. ## Anti-pattern futuro per TM3 Quando l'operatore esprime un principio, una frase guru, un movimento di osservazione: - **Deposito**: scrivi il fatto, riporta la frase come è stata detta, contestualizza l'episodio - **NO prescrizione**: non trasformare in "se X allora Y" - **NO propagazione automatica**: non aggiungere a AGENTS.md/CLAUDE.md/skill come direttiva eseguibile - L'osservazione persiste perché ricorrente in più contesti, non perché elevata a regola ## Cross-link - Episodio 07/05 mattina: cristallizzazione iniziale (errore) - Episodio 07/05 pomeriggio: indicazione operatore + decristallizzazione - Cycle worked example: 0901 (auto-emersione di `order_denominator_gate` senza regola) exec /bin/bash -lc "sed -n '1,260p' tools/data/reports/agent_20260516_1045.md" in /opt/MM_D-ND exec /bin/bash -lc 'ls -t tools/data/reports/agent_20260516_*.md | head -12' in /opt/MM_D-ND succeeded in 0ms: tools/data/reports/agent_20260516_1058.md tools/data/reports/agent_20260516_1045.md tools/data/reports/agent_20260516_1031.md tools/data/reports/agent_20260516_1019.md tools/data/reports/agent_20260516_1007.md tools/data/reports/agent_20260516_0938.md tools/data/reports/agent_20260516_0921.md tools/data/reports/agent_20260516_0820.md tools/data/reports/agent_20260516_0720.md tools/data/reports/agent_20260516_0330.md succeeded in 0ms: # Agent Report — Endpoint Stability Filter **Date**: 2026-05-16 10:45 **Piano**: 129 **Tension explored**: BOUNDARY (0.8) **verdict**: CONSTRAINT - GUE e Poisson sono endpoint-stable nel lettore calibrato su 36/36 righe di stress, ma il label-permutation null resta troppo permissivo (`combined p=0.124031`; 15/128 null arrivano a 36/36). Il filtro endpoint e' osservativamente utile, non ancora specifico abbastanza per riaprire RP come terzo incluso. observables_registry: 1.0.0-2026-05-06 observables_used: [SR, SR2, L1, L2, triple_var, brody_q, berry_robnick_like_gue_weight, endpoint_reader_pass, endpoint_stable, centroid_margin, label_permutation_null_counts] **observable_contract**: claim=GUE/Poisson endpoints sono filtro valido del boundary se entrambi i poli restano stabili sotto stress reader/window/size/seed con classificatore calibrato; observable=`endpoint_stable` per riga sorgente e margine centroidale per reader; operator=calibrazione centroidi endpoint su controlli GUE/Poisson e stress su seed indipendenti; generator=matrici GUE e gap Poisson esponenziali; denominator=2 domini x 3 size x 6 test seed = 36 source rows, ognuna letta da 5 reader; non_possible=il boundary-terzo incluso non riapre se un endpoint cade o se il null di etichetta raggiunge la stabilita' osservata; not_tested=RP residue, Anderson 3D, spettri sperimentali, limite N infinito, prova analitica di universalita. ## Respiro fuori-tempo - **Combo**: A9 terzo incluso + QxG continuo/discreto + nodo BOUNDARY del grafo + topologia assiomatica del bordo. - **Dipolo / punto-zero**: polo GUE / polo Poisson. Punto-zero: la riga di gap prima che un reader la classifichi. - **Piano superiore**: topologia assiomatica del bordo. Il filtro endpoint e' boundary operator: decide se i poli esistono prima del bordo intermedio. - **Operatori laterali scelti**: boundary operator e parallel transport. Il primo testa se il bordo ha due estremi; il secondo testa se l'identita' endpoint si trasporta fra reader. - **Contaminazione cognitiva**: CE-0019 usata per imporre respiro pre-esperimento; CE-0001/KSAR usata per reiterare il vincolo 10:31 senza cercare una nuova lambda RP. - **Proto-ipotesi**: un confine-terzo incluso non puo' essere misurato finche' i due endpoint non sono invarianti sotto il lettore che poi verra' usato sul bordo. - **Possibile/non-possibile**: possibile = usare endpoint GUE/Poisson come filtro preliminare; non-possibile = promuovere il filtro se il null di etichetta ricostruisce la stessa stabilita'. - **Proiezione**: misuro `endpoint_stable` con classificatore centroidale su feature canoniche; il claim cade se uno dei 5 reader rompe l'endpoint o se il null uguaglia l'osservato. - **Movimento A->M->B**: fisico A = crossover spettrale GUE/Poisson/RP; matematica M = classificatore endpoint row-aligned sui vettori osservabili; fisico B non emerge. Il ciclo consegna un vincolo sul lettore, non un rimbalzo fisico. ## Aderenza alla direzione - `relation`: `follows_direction` - `why`: esegue la direzione valutatore 10:31: testare prima la stabilita' endpoint GUE/Poisson come filtro del confine-terzo incluso. - `not_drift`: non torna a V_c, phi/Sturmian, fit locali o creste RP; RP resta non testato finche' il filtro endpoint non chiude anche contro null. ## Re-discovery audit - **Baseline noto piu vicino**: statistiche GUE/Poisson con spacing ratio, Brody interpolation e Berry-Robnik-like mixture. - **Cosa assorbe il baseline**: la separazione osservata tra poli GUE e Poisson nelle feature spettrali canoniche. - **Cosa resta Lab-specific**: il contratto operativo che richiede endpoint stabili per tutti i reader prima di leggere il terzo incluso. - **Separazione**: `two_reader_boundary_confirmed=[]`; `graph_only_residue=0`; `scope_change_declared=endpoint_filter_before_boundary`; `graph_baseline_audit=label_permutation_null`. ## Claim Under Test > GUE e Poisson possono fungere da filtro endpoint del boundary solo se ogni riga stress resta endpoint-stable in tutti i reader e il label-null non ricostruisce la stessa stabilita'. ## Question Il lettore che ha rotto GUE nel ciclo 10:31 puo' essere riparato regressivamente calibrando gli endpoint, oppure il filtro e' ancora assorbito dal null di etichetta? ## Ritorno fisico - **Punto fisico sorgente**: crossover spettrale GUE/Poisson/Rosenzweig-Porter. - **Attraversamento matematico**: centroidi endpoint in spazio osservabile canonico con margine preregistrato. - **Punto fisico di ritorno**: assente come nuova misura fisica; il ritorno e' un vincolo sul protocollo che potra' essere applicato a RP o Anderson 3D dopo chiusura null. - **Controllo concretezza**: nessun setup fisico nuovo viene promosso. - **Relazione nuova**: endpoint stability precede boundary residue. - **Osservabile/test fisico possibile**: applicare lo stesso filtro a spettri RP/Anderson solo dopo null piu stretto. - **Se fallisce**: `ritorno_fisico_assente`: il ciclo resta filtro metodologico. ## Experiment Design - **Script nuovo**: `tools/exp_endpoint_stability_filter.py`. - **Run**: `python tools/exp_endpoint_stability_filter.py --out tools/data/endpoint_stability_filter_20260516_1045.json` - **Perimetro**: size `128/192/256`; 4 seed di calibrazione; 6 seed test; 6 repliche per riga. - **Reader**: `global_mean`, `exact_local:w9`, `exact_local:w12`, `odd_coerced:w9`, `odd_coerced:w12`. - **Soglia preregistrata**: `endpoint_stable=True` se tutti i reader predicono il vero endpoint con `centroid_margin >= 0.15`. - **Null**: 128 permutazioni delle etichette di calibrazione; p-value = frazione null con successi endpoint almeno pari all'osservato. ## Results | group | observed_successes | null_successes | p-value | Wilson 95% | min margin | median margin | lettura | |---|---:|---:|---:|---|---:|---:|---| | GUE endpoint | 18/18 | 774/2304 | 0.341085 | [0.824121, 1.0] | 0.655482 | 1.552507 | endpoint stabile, null non chiuso | | Poisson endpoint | 18/18 | 774/2304 | 0.341085 | [0.824121, 1.0] | 0.929876 | 1.685385 | endpoint stabile, null non chiuso | | Combined | 36/36 | 1452/4608 | 0.124031 | n/a | 0.655482 | n/a | filtro utile, specificita' insufficiente | ### Null Distribution | null_success_count | trials | |---:|---:| | 0 | 85 | | 27 | 1 | | 28 | 4 | | 29 | 2 | | 31 | 4 | | 33 | 1 | | 34 | 2 | | 35 | 14 | | 36 | 15 | ## Key Findings 1. Verificato: il lettore endpoint calibrato non rompe GUE. Le 18 righe GUE test hanno 5/5 reader pass e `endpoint_stable=True`. 2. Verificato: Poisson resta endpoint simmetrico nello stesso contratto. Le 18 righe Poisson test hanno 5/5 reader pass. 3. Verificato: il null di etichetta non e' abbastanza severo. 15/128 null raggiungono 36/36 e il p-value combinato resta 0.124031. 4. Inferito dal perimetro: il nodo regressivo non e' piu' la clausola classica `q AND w`, ma la specificita' del controllo di calibrazione. Serve un null che rompa la relazione reader-feature senza lasciare centroidi spurii separanti. ## Verdict CONSTRAINT GUE/Poisson sono endpoint-stable nel lettore calibrato, ma il filtro non supera ancora il null di etichetta. La prossima mossa non deve entrare in RP: deve stringere il null endpoint, per esempio con holdout per reader, bootstrap centroidale bilanciato o feature-scramble row-aligned, e richiedere `p <= 0.05` prima del boundary. ## Bicono della scoperta - **Due radici**: stabilita' osservata degli endpoint; specificita' insufficiente del null. - **Singolare**: vettore osservabile della riga prima del nome GUE/Poisson. - **Invariante di passaggio**: stesso denominatore source row x reader per osservato e controllo. - **Campo di possibilita**: possibile = usare un filtro endpoint calibrato come preflight; non-possibile = dichiarare terzo incluso RP con p endpoint non chiuso. ## Consecutio Il filtro endpoint ha forma ma non chiusura. Il prossimo ciclo deve riparare il null, non aumentare lambda, size o domini. Quando il null non raggiunge piu' 36/36 e gli endpoint restano 36/36 con `p<=0.05`, RP torna falsificabile come terzo incluso. ## Ricadute pratiche ssp_value: yes. `tools/exp_endpoint_stability_filter.py` diventa preflight riusabile per non far entrare un boundary test quando i poli o il null endpoint non sono chiusi. ## Telemetria - No API paid run: `ANTHROPIC_API_KEY` e `OPENAI_API_KEY` non presenti nell'ambiente. - `python tools/dnd_scenario.py --best` eseguito: massimo discriminante locale su TRASCENDENZA_LIMITE; direzione BOUNDARY seguita per contratto vivo. - `python -m py_compile tools/exp_endpoint_stability_filter.py` completato. - Run completato: `tools/data/endpoint_stability_filter_20260516_1045.json`. - Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. - Nessun update del seme. - Nessuna promozione e nessun public sync. ## Files - Script: `tools/exp_endpoint_stability_filter.py` - Data: `tools/data/endpoint_stability_filter_20260516_1045.json` - Report: `tools/data/reports/agent_20260516_1045.md` exec /bin/bash -lc "sed -n '1,260p' tools/data/reports/agent_20260516_1031.md" in /opt/MM_D-ND succeeded in 0ms: # Agent Report - Boundary Unfolding Transfer Matrix **Date**: 2026-05-16 10:31 **Piano**: 128 **Tension explored**: BOUNDARY (0.8) **verdict**: CONSTRAINT - `window_mode/unfolding` non trasferisce come asse cross-dominio nel perimetro dichiarato. Poisson resta endpoint su 8/8 righe, ma GUE non resta endpoint sotto la clausola classica a due lettori e RP produce 0/24 residui sopra i null row-aligned. Il boundary reader-axis resta ipotesi da riparare al nodo regressivo del lettore, non claim fisico. observables_registry: 1.0.0-2026-05-06 observables_used: [SR, SR2, L1, L2, triple_var, brody_q, berry_robnick_like_gue_weight, reader_sensitivity, endpoint_transfer_stable, reader_residue_pass, row_aligned_p, permutation_null_scores, position_shift_null_scores] **observable_contract**: claim=`window_mode/unfolding` e' coordinata del boundary se gli endpoint GUE/Poisson trasferiscono mentre le righe RP boundary espongono residuo reader-specific contro null row-aligned; observable=reader_sensitivity del vettore spettrale canonico tra global_mean, exact_local e odd_coerced; operator=stessa riga di gap letta con piu unfolding/window modes; generator=matrici GUE, gap Poisson esponenziali, RP `H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE`; denominator=domain x size x seed, null da permutazione e shift circolare sulla stessa riga; non_possible=asse reader come boundary se un endpoint si frattura o RP non batte i null; not_tested=spettri sperimentali, N infinito, Anderson 3D, prova analitica di universalita. ## Respiro fuori-tempo - **Combo**: A9 terzo incluso + QxG continuo/discreto + boundary operator/topologia del bordo + tensione BOUNDARY. - **Dipolo / punto-zero**: polo fisico stabile / lettore che decide. Punto-zero: la stessa sequenza di gap prima che global/local/odd-coerced la leggano. - **Piano superiore**: topologia assiomatica del bordo. Il boundary operator e' trattato come mappa fra lettori, non come parametro tecnico. - **Operatori laterali scelti**: boundary operator e parallel transport. Il primo decide se il bordo e' oggetto; il secondo chiede se l'identita' del dominio trasporta fra lettori. - **Contaminazione cognitiva**: CE-0019 usata come vincolo di respiro pre-esperimento; CE-0001/KSAR usata per reiterare il kernel 10:19 senza cercare un'altra lambda. - **Proto-ipotesi**: se `window_mode/unfolding` e' asse reale del confine, GUE e Poisson trasferiscono come poli mentre RP boundary mostra residuo specifico del lettore sopra i null row-aligned. - **Possibile/non-possibile**: possibile = reader axis come coordinata cross-dominio; non-possibile = endpoint GUE fratturato o RP reader residue assorbito dai null. - **Proiezione**: misuro `reader_sensitivity` e stato classico per righe GUE, Poisson e RP `0.045/0.060/0.075`, con null di permutazione e shift sulla stessa riga. - **Movimento A->M->B**: fisico A = crossover GUE/Poisson/RP finito; matematica M = matrice row-aligned `(domain, N, seed, reader)`; fisico B non emerge. Il ciclo consegna un vincolo sul lettore, non un rimbalzo fisico. ## Aderenza alla direzione - `relation`: `follows_direction` - `why`: porta l'asse `window_mode`/unfolding fuori dalla sola lambda RP e lo testa su GUE, Poisson e RP con null row-aligned. - `not_drift`: non cerca una lambda stabile, non usa phi/Sturmian/V_c, non promuove righe graph-only; il risultato cade se endpoints o RP non rispettano il contratto. ## Re-discovery audit - **Baseline noto piu vicino**: unfolding sensitivity negli spettri finiti, Rosenzweig-Porter crossover, Brody interpolation, Berry-Robnik mixture, kNN stability sul grafo di osservabili. - **Cosa assorbe il baseline**: la dipendenza delle statistiche spettrali finite dalla normalizzazione locale dei gap. - **Cosa resta Lab-specific**: il contratto row-aligned che separa endpoint transfer e RP reader residue nella stessa matrice di lettori. - **Separazione**: `two_reader_boundary_confirmed=[]`; `graph_only_residue=0`; `scope_change_declared=reader_axis_cross_domain`; `graph_baseline_audit=permutation_null + position_shift_null`. ## Claim Under Test > `window_mode/unfolding` trasferisce come coordinata del boundary se Poisson e GUE restano endpoint e RP `0.045/0.060/0.075` mostra residuo reader-specific sopra null row-aligned. ## Experiment Design - **Script nuovo**: `tools/exp_boundary_unfolding_transfer_matrix.py`. - **Run**: `python tools/exp_boundary_unfolding_transfer_matrix.py --out tools/data/boundary_unfolding_transfer_matrix_20260516_1031.json` - **Righe**: size `128/192`, seed `4`, domini `GUE`, `Poisson`, RP lambda `0.045/0.060/0.075`. - **Reader**: `global_mean`, `exact_local` windows `9/12`, `odd_coerced` windows `9/12`. - **Null row-aligned**: 32 permutazioni dei gap per riga + 8 shift circolari per riga. - **Soglia preregistrata RP**: `reader_sensitivity >= 0.75`, `row_aligned_p <= 0.05`, almeno due stati reader diversi. - **Soglia endpoint audit**: tutti gli stati reader devono matchare l'endpoint dichiarato; `endpoint_max_sensitivity=0.75` registrato come audit, non forzato nel pass. ## Results | group | observed | null | p / audit | median reader_sensitivity | lettura | |---|---:|---:|---:|---:|---| | GUE endpoint transfer | 0/8 | 0/256 | left-tail approx 0.000000 | 2.105328 | non trasferisce sotto clausola a due lettori | | Poisson endpoint transfer | 8/8 | 0/256 | left-tail approx 1.000000 | 2.444532 | trasferisce come endpoint | | RP reader residue | 0/24 | 551/960 | 1.000000 | 2.426735 | residuo assorbito dai null | ### Endpoint Rows | source | example states across readers | example q/w global | endpoint_transfer | |---|---|---|---| | GUE | intermediate, intermediate, intermediate, intermediate, intermediate | q=1.000000, w=0.526667 | 0/8 | | Poisson | poisson_endpoint, poisson_endpoint, poisson_endpoint, poisson_endpoint, poisson_endpoint | q=0.046667, w=0.033333 | 8/8 | ### RP Lambda Audit | lambda | reader_residue_pass | total | median reader_sensitivity | states | |---:|---:|---:|---:|---| | 0.045 | 0 | 8 | 2.377442 | all readers intermediate | | 0.060 | 0 | 8 | 2.489847 | all readers intermediate | | 0.075 | 0 | 8 | 2.375018 | all readers intermediate | ## Key Findings 1. Verificato: il contratto cross-dominio fallisce prima del boundary RP. GUE viene letto come `intermediate` in 8/8 righe sotto la clausola `q>=0.75` e `w>=0.75`; quindi l'endpoint non trasferisce. 2. Verificato: Poisson trasferisce come endpoint in 8/8 righe, ma questo non basta a validare l'asse reader perche' l'altro polo cade. 3. Verificato: RP `0.045/0.060/0.075` resta `intermediate` in tutte le letture e produce 0/24 `reader_residue_pass`; i null hanno 551/960 score >= osservato, quindi il residuo reader-specific non emerge. 4. Inferito dal perimetro: la sensibilita' del vettore osservabile e' alta in tutti i gruppi, ma non discrimina boundary. Il nodo regressivo e' la definizione del lettore/classificatore, non la scelta di lambda. ## Verdict CONSTRAINT `window_mode/unfolding` non diventa coordinata cross-dominio nel perimetro 10:31. La matrice conserva informazione utile perche' mostra dove cade: il lettore a due clausole classiche rompe GUE e i null assorbono RP. Il prossimo ciclo non deve cercare una cresta RP; deve riparare il lettore endpoint o cambiare dominio di ritorno con endpoint verificati prima del boundary. ## Bicono della scoperta - **Due radici**: endpoint transfer; reader residue RP. - **Singolare**: riga di gap prima dell'unfolding. - **Invariante di passaggio**: stesso denominatore row-aligned per osservato e null. - **Campo di possibilita**: possibile = audit del lettore prima della promozione del boundary; non-possibile = dichiarare terzo incluso cross-dominio con GUE endpoint non trasferito. ## Consecutio Il prossimo passo utile e' regressivo: prima validare endpoint GUE/Poisson con un lettore che non trasformi GUE in intermedio, poi rieseguire la matrice RP. Se la clausola classica resta `q AND w`, il boundary reader-axis e' bloccato. Se la clausola diventa endpoint-validata su baseline GUE indipendente, la domanda torna falsificabile. ## Ricadute pratiche ssp_value: yes. `tools/exp_boundary_unfolding_transfer_matrix.py` e' uno strumento riusabile per testare trasferibilita' del lettore su domini, size, seed, windows e null row-aligned. ## Telemetria - No API paid run: `ANTHROPIC_API_KEY` e `OPENAI_API_KEY` non presenti nell'ambiente. - `python tools/dnd_scenario.py --best` eseguito: massimo discriminante locale su TRASCENDENZA_LIMITE; direzione BOUNDARY seguita per contratto vivo. - `python -m py_compile tools/exp_boundary_unfolding_transfer_matrix.py` completato. - Run completato: `tools/data/boundary_unfolding_transfer_matrix_20260516_1031.json`. - Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. - Nessun update del seme. - Nessuna promozione e nessun public sync. ## Files - Script: `tools/exp_boundary_unfolding_transfer_matrix.py` - Data: `tools/data/boundary_unfolding_transfer_matrix_20260516_1031.json` - Report: `tools/data/reports/agent_20260516_1031.md` codex Il ciclo 10:45 ha chiuso gli endpoint osservati ma ha lasciato il null troppo permissivo; il 10:58 potrebbe avere già assorbito o corretto quella consecutio, quindi lo leggo prima di creare un nuovo script. exec /bin/bash -lc "sed -n '1,280p' tools/data/reports/agent_20260516_1058.md" in /opt/MM_D-ND succeeded in 0ms: # Agent Report — Endpoint Feature-Scramble Null **Date**: 2026-05-16 10:58 **Piano**: 129 **Tension explored**: BOUNDARY (0.8) **verdict**: CONSTRAINT - Il filtro endpoint GUE/Poisson resta completo su 36/36 righe e supera il nuovo feature-scramble null row-aligned (`raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`). Il label-permutation null resta permissivo (`raw_p=15/128=0.1171875`, `add_one_p=16/129=0.124031008`). Il nodo regressivo non e' l'endpoint reader, ma quale null e' legittimo per sfidare il lettore. observables_registry: 1.0.0-2026-05-06 observables_used: [SR, SR2, L1, L2, triple_var, brody_q, berry_robnick_like_gue_weight, endpoint_reader_pass, endpoint_stable, centroid_margin, label_permutation_null_counts, feature_scramble_null_counts, raw_p, add_one_p] **observable_contract**: claim=GUE/Poisson endpoint filter e' specifico se la stabilita' osservata resta completa e null feature-scramble che preservano marginali per reader non ricostruiscono la stabilita' completa; observable=`endpoint_stable` per source row, margine centroidale per reader, distribuzione null feature-scramble; operator=centroidi endpoint calibrati una volta su GUE/Poisson, poi scoring di test rows vere e feature-scrambled row-aligned; generator=matrici GUE e gap Poisson esponenziali; denominator=2 domini x 3 size x 6 test seed = 36 source rows, ogni source row richiede 5/5 reader pass; non_possible=filtro endpoint specifico se il feature-scramble null raggiunge 36/36; not_tested=RP residue, Anderson 3D, spettri sperimentali, limite N infinito, universalita analitica. ## Respiro fuori-tempo - **Combo**: A9 terzo incluso + QxG continuo/discreto + nodo BOUNDARY del grafo + tensione seme "8 domini GUE, 5 Poisson". - **Dipolo / punto-zero**: endpoint osservato / endpoint ricostruito dal null. Punto-zero: il vettore osservabile prima che la relazione multivariata fra feature decida il polo. - **Piano superiore**: topologia assiomatica del bordo. Il null e' boundary operator: separa polo reale da polo generato da marginali disaccoppiate. - **Operatori laterali scelti**: boundary operator e parallel transport. Il primo taglia il perimetro endpoint/null; il secondo verifica se l'identita' endpoint si trasporta attraverso reader senza dipendere da una singola feature. - **Contaminazione cognitiva**: CE-0019 metabolizzata come combo prima della misura; CE-0001/KSAR usata per reiterare il vincolo 10:45 senza tornare a RP; CE-0117 usata come cascata della possibilita': il risultato apre solo se il null non ricostruisce il polo. - **Proto-ipotesi**: un filtro endpoint e' utilizzabile prima del terzo incluso quando la stabilita' nasce dall'accoppiamento row-level delle feature, non dalle marginali isolate. - **Possibile/non-possibile**: possibile = riaprire RP come boundary test dopo endpoint chiuso contro null row-aligned; non-possibile = promuovere l'endpoint se un null che conserva marginali per reader arriva a 36/36. - **Proiezione**: misuro `endpoint_stable` sulle stesse 36 source rows e confronto due null: label permutation per continuita' e feature-scramble per specificita' row-aligned. - **Movimento A->M->B**: fisico A = crossover spettrale GUE/Poisson/RP; matematica M = vettore osservabile multivariato con null che rompe l'accoppiamento feature-riga; fisico B non emerge. Il ciclo consegna un gate metodologico prima del ritorno a RP/Anderson. ## Aderenza alla direzione - `relation`: `follows_direction` - `why`: segue la direzione valutatore: testare prima la stabilita' endpoint GUE/Poisson come filtro del confine-terzo incluso e riparare il null che nel ciclo 10:45 lasciava il filtro aperto. - `not_drift`: non torna a phi/Sturmian, V_c, lambda RP o residui graph-only; misura solo endpoint GUE/Poisson e null sullo stesso denominatore. - `seed_residue`: restano non testati gli 8 domini GUE / 5 Poisson originali come perimetro largo e il terzo incluso RP. - `why_not_drift`: il sotto-perimetro e' regressivo perche' chiude il prerequisito endpoint prima del boundary, non sostituisce il boundary con un deposito familiare. ## Re-discovery audit - **Baseline noto piu vicino**: statistiche spettrali GUE/Poisson, spacing ratio, Brody interpolation, Berry-Robnik-like mixture, Rosenzweig-Porter come crossover. - **Cosa assorbe il baseline**: la separazione dei poli GUE e Poisson nelle feature canoniche. - **Cosa resta Lab-specific**: il contratto operativo: prima di leggere il terzo incluso, il filtro endpoint deve restare completo contro null row-aligned che sfidano il lettore. - **Separazione**: `two_reader_boundary_confirmed=[]`; `graph_only_residue=0`; `scope_change_declared=endpoint_null_tightening_before_boundary`; `graph_baseline_audit=non_applicabile:no_graph_reader`. ## Claim Under Test > GUE e Poisson sono endpoint validi per il filtro boundary se 36/36 source rows restano endpoint-stable e un feature-scramble null row-aligned non ricostruisce 36/36. ## Question Il filtro endpoint 10:45 era assorbito solo dal label-null permissivo, oppure anche un null che preserva le marginali per reader puo' ricostruire la stabilita' completa? ## Ritorno fisico - **Punto fisico sorgente**: transizione spettrale GUE/Poisson/Rosenzweig-Porter. - **Attraversamento matematico**: classificatore centroidale in spazio osservabile e null feature-scramble che preserva marginali ma rompe accoppiamento row-level. - **Punto fisico di ritorno**: nessun nuovo setup fisico; il ritorno e' il protocollo per riaprire RP o Anderson 3D solo dopo endpoint-null chiuso. - **Controllo concretezza**: non viene promosso un fenomeno fisico nuovo. - **Relazione nuova**: endpoint stability richiede un null che rompa la relazione multivariata, non solo una permutazione di label. - **Osservabile/test fisico possibile**: applicare lo stesso endpoint-null gate a RP/Anderson e chiedere se il boundary intermedio batte null row-aligned dopo endpoint chiuso. - **Se fallisce**: `ritorno_fisico_assente`; resta gate metodologico. ## Experiment Design - **Script nuovo**: `tools/exp_endpoint_feature_scramble_null.py`. - **Run**: `python tools/exp_endpoint_feature_scramble_null.py --out tools/data/endpoint_feature_scramble_null_20260516_1058.json`. - **Perimetro**: size `128/192/256`; 4 seed di calibrazione; 6 seed test; 6 repliche per riga. - **Reader**: `global_mean`, `exact_local:w9`, `exact_local:w12`, `odd_coerced:w9`, `odd_coerced:w12`. - **Soglia preregistrata**: `endpoint_stable=True` se tutti i 5 reader predicono il vero endpoint con `centroid_margin >= 0.15`. - **Null 1, continuita'**: 128 label permutations sulle righe di calibrazione. P-value right-tail: `raw_p=k/N`, `add_one_p=(k+1)/(N+1)`, con `k=null_count >= observed_count`. - **Null 2, specificita'**: 512 feature-scramble trial; dentro ogni reader, ogni feature viene permutata indipendentemente fra test rows. Preserva marginali per feature/reader e rompe l'accoppiamento multivariato source row. - **Contratto osservabile-operatore**: claim, osservabile, operatore, generatore, denominatore e non-possibile sono quelli dell'header; `gap_ratio` e RP residue non sono testati. ## Results | group | observed_successes | min margin | median margin | lettura | |---|---:|---:|---:|---| | GUE endpoint | 18/18 | 0.655482 | 1.552507 | endpoint stabile | | Poisson endpoint | 18/18 | 0.929876 | 1.685385 | endpoint stabile | | Combined | 36/36 | 0.655482 | n/a | endpoint filter completo | | null | k/N >= 36 | raw_p | add_one_p | max null count | mean null count | histogram | |---|---:|---:|---:|---:|---:|---| | label permutation | 15/128 | 0.1171875 | 0.124031008 | 36 | 11.343750 | {0:85, 27:1, 28:4, 29:2, 31:4, 33:1, 34:2, 35:14, 36:15} | | feature scramble row-aligned | 0/512 | 0.0000000 | 0.001949318 | 2 | 0.312500 | {0:372, 1:120, 2:20} | ## Key Findings 1. Verificato: il filtro endpoint osservato resta completo. GUE = 18/18, Poisson = 18/18, combined = 36/36; ogni source row ha 5/5 reader pass. 2. Verificato: il label-permutation null replica il problema 10:45. 15/128 trial arrivano a 36/36; `raw_p=0.1171875`, `add_one_p=0.124031008`. 3. Verificato: il feature-scramble null non ricostruisce il filtro. 0/512 trial arrivano a 36/36; il massimo null e' 2/36. 4. Inferito dal perimetro: la specificita' vive nell'accoppiamento multivariato row-level delle feature, non nelle marginali isolate. Il label-null e' troppo grossolano per questo lettore perche' puo' creare centroidi spurii separanti. ## Verdict CONSTRAINT Il filtro endpoint GUE/Poisson e' chiuso contro feature-scramble row-aligned nel perimetro 36 source rows / 5 reader. Non diventa scoperta fisica: diventa preflight valido per riaprire il boundary test. La prossima mossa puo' tornare a RP solo mantenendo questo gate: endpoint observed 36/36, feature-scramble `add_one_p<=0.05`, poi boundary residue contro null row-aligned. ## Bicono della scoperta - **Due radici**: endpoint reale multivariato; endpoint spurio da marginali disaccoppiate. - **Singolare**: source row prima della scomposizione in feature indipendenti. - **Invariante di passaggio**: stesso denominatore source row x reader per osservato e null. - **Campo di possibilita**: possibile = usare il filtro endpoint come gate prima di RP; non-possibile = promuovere endpoint se il null feature-scramble raggiunge la stabilita' completa. ## Consecutio Il boundary puo' rientrare nel ciclo successivo solo dopo questo preflight: stesso lettore endpoint, stesso p-value dichiarato (`raw_p` e `add_one_p`), e null row-aligned separato dal label permutation. Se RP torna, non deve cercare una lambda; deve chiedere se una riga intermedia batte i null dopo endpoint chiuso. ## Ricadute pratiche ssp_value: yes. `tools/exp_endpoint_feature_scramble_null.py` diventa preflight riusabile per distinguere null permissivi da null che rompono l'accoppiamento row-level prima di testare un terzo incluso. ## Telemetria - No API paid run: `ANTHROPIC_API_KEY` e `OPENAI_API_KEY` non presenti nell'ambiente. - `python tools/dnd_scenario.py --best` eseguito: massimo discriminante locale su TRASCENDENZA_LIMITE; direzione BOUNDARY seguita per contratto vivo. - `python -m py_compile tools/exp_endpoint_feature_scramble_null.py` completato. - Run completato: `tools/data/endpoint_feature_scramble_null_20260516_1058.json`. - Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. - Nessun update del seme. - Nessuna promozione e nessun public sync. ## Files - Script: `tools/exp_endpoint_feature_scramble_null.py` - Data: `tools/data/endpoint_feature_scramble_null_20260516_1058.json` - Report: `tools/data/reports/agent_20260516_1058.md` exec /bin/bash -lc "sed -n '1,260p' tools/exp_endpoint_stability_filter.py" in /opt/MM_D-ND succeeded in 0ms: #!/usr/bin/env python3 """ Endpoint stability filter for the GUE/Poisson boundary direction. This is the regressively repaired reader check after the 10:31 cycle: before asking whether RP is a third-included boundary, verify that the same reader family recognizes the two endpoint poles under size/seed/window stress. """ from __future__ import annotations import argparse import json import math from collections import defaultdict from pathlib import Path from typing import Any import numpy as np from exp_boundary_unfolding_transfer_matrix import ( clean_gaps, exact_local_unfold, gue_gaps, poisson_gaps, ) from exp_rosenzweig_porter_bridge_physical_audit import ( OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, fit_brody_q, fit_mixture_weight, ) from exp_rp_boundary_raw_count_null_audit import wilson_interval from exp_rp_unfolding_sensitivity_audit import local_unfold_gaps as odd_coerced_unfold FEATURE_NAMES = [ "SR", "SR2", "L1", "L2", "triple_var", "brody_q", "berry_robnick_like_gue_weight", ] def parse_ints(value: str) -> list[int]: return [int(part.strip()) for part in value.split(",") if part.strip()] def feature_vector(gaps: np.ndarray, grid_size: int) -> dict[str, float]: gaps = clean_gaps(gaps) features = {name: float(fn(gaps)) for name, fn in OBSERVABLES_CANONICAL.items()} q, _ = fit_brody_q(gaps, grid_size) w, _ = fit_mixture_weight(gaps, grid_size) features["brody_q"] = float(q) features["berry_robnick_like_gue_weight"] = float(w) return features def read_gaps(gaps: np.ndarray, reader: str) -> np.ndarray: if reader == "global_mean": return clean_gaps(gaps) mode, window_raw = reader.split(":w", 1) window = int(window_raw) if mode == "exact_local": return exact_local_unfold(gaps, window) if mode == "odd_coerced": return clean_gaps(odd_coerced_unfold(gaps, window)) raise ValueError(f"unknown reader: {reader}") def build_rows(args: argparse.Namespace, split: str, seeds: list[int]) -> list[dict[str, Any]]: rows = [] readers = ["global_mean"] + [ f"{mode}:w{window}" for mode in ("exact_local", "odd_coerced") for window in parse_ints(args.local_windows) ] for n in parse_ints(args.sizes): for seed_idx, seed in enumerate(seeds): sources = { "GUE": gue_gaps(n, args.reps, seed + n * 1009, args.central_fraction), "Poisson": poisson_gaps(n, args.reps, seed + n * 1013, args.central_fraction), } for source_type, gaps in sources.items(): source_id = f"{split}_{source_type}_N{n}_s{seed_idx}" for reader in readers: features = feature_vector(read_gaps(gaps, reader), args.grid_size) rows.append( { "split": split, "source_id": source_id, "source_type": source_type, "n": n, "seed": seed, "reader": reader, "n_spacings": int(len(gaps)), "features": {key: round(value, 9) for key, value in features.items()}, } ) return rows def fit_reader_centroids(rows: list[dict[str, Any]], labels: dict[str, str] | None = None) -> dict[str, Any]: by_reader: dict[str, dict[str, list[np.ndarray]]] = defaultdict(lambda: defaultdict(list)) for row in rows: label = labels.get(row["source_id"], row["source_type"]) if labels else row["source_type"] by_reader[row["reader"]][label].append(np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float)) model = {} for reader, groups in by_reader.items(): all_vectors = np.vstack([item for vectors in groups.values() for item in vectors]) scale = np.std(all_vectors, axis=0) scale[scale <= 1e-9] = 1.0 centroids = {} for label, vectors in groups.items(): centroids[label] = np.mean(np.vstack(vectors), axis=0) model[reader] = {"scale": scale, "centroids": centroids} return model def classify(row: dict[str, Any], model: dict[str, Any], min_margin: float) -> dict[str, Any]: item = model[row["reader"]] vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) distances = {} for label, centroid in item["centroids"].items(): delta = (vector - centroid) / item["scale"] distances[label] = float(np.linalg.norm(delta) / math.sqrt(len(FEATURE_NAMES))) own = distances[row["source_type"]] other_label = "Poisson" if row["source_type"] == "GUE" else "GUE" other = distances[other_label] margin = other - own predicted = min(distances, key=distances.get) return { "predicted": predicted, "own_distance": round(own, 6), "other_distance": round(other, 6), "margin": round(margin, 6), "endpoint_reader_pass": bool(predicted == row["source_type"] and margin >= min_margin), } def score_sources(rows: list[dict[str, Any]], model: dict[str, Any], min_margin: float) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: reader_rows = [] by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) for row in rows: judged = {**row, **classify(row, model, min_margin)} reader_rows.append(judged) by_source[row["source_id"]].append(judged) source_rows = [] for source_id, items in sorted(by_source.items()): passes = sum(1 for item in items if item["endpoint_reader_pass"]) margins = [item["margin"] for item in items] source_rows.append( { "source_id": source_id, "source_type": items[0]["source_type"], "n": items[0]["n"], "seed": items[0]["seed"], "reader_passes": passes, "reader_total": len(items), "min_margin": round(float(min(margins)), 6), "median_margin": round(float(np.median(margins)), 6), "endpoint_stable": passes == len(items), "reader_predictions": [ { "reader": item["reader"], "predicted": item["predicted"], "margin": item["margin"], "pass": item["endpoint_reader_pass"], } for item in items ], } ) return reader_rows, source_rows def shuffled_label_map(calibration_rows: list[dict[str, Any]], rng: np.random.Generator) -> dict[str, str]: ids = sorted({row["source_id"] for row in calibration_rows}) true_labels = [next(row["source_type"] for row in calibration_rows if row["source_id"] == source_id) for source_id in ids] shuffled = list(true_labels) rng.shuffle(shuffled) return dict(zip(ids, shuffled)) def null_success_counts( calibration_rows: list[dict[str, Any]], test_rows: list[dict[str, Any]], args: argparse.Namespace, ) -> list[int]: rng = np.random.default_rng(args.null_seed) counts = [] for _ in range(args.label_null_trials): labels = shuffled_label_map(calibration_rows, rng) model = fit_reader_centroids(calibration_rows, labels=labels) _, source_rows = score_sources(test_rows, model, args.min_margin) counts.append(sum(1 for row in source_rows if row["endpoint_stable"])) return counts def summarize(source_rows: list[dict[str, Any]], null_counts: list[int]) -> dict[str, Any]: out = {} for source_type in ("GUE", "Poisson"): group = [row for row in source_rows if row["source_type"] == source_type] successes = sum(1 for row in group if row["endpoint_stable"]) null_successes = sum(min(count, len(group)) for count in null_counts) null_total = len(null_counts) * len(group) p_value = (1 + sum(1 for count in null_counts if count >= successes)) / (1 + len(null_counts)) out[source_type] = { "criterion": "all readers classify the endpoint with preregistered margin", "observed_successes": successes, "observed_total": len(group), "observed_rate": round(successes / len(group), 6) if group else None, "observed_wilson_95": wilson_interval(successes, len(group)) if group else None, "null_successes": null_successes, "null_total": null_total, "null_rate": round(null_successes / null_total, 6) if null_total else None, "permutation_p_value": round(p_value, 6), "min_margin": round(float(min(row["min_margin"] for row in group)), 6) if group else None, "median_margin": round(float(np.median([row["median_margin"] for row in group])), 6) if group else None, } all_successes = sum(1 for row in source_rows if row["endpoint_stable"]) out["combined"] = { "observed_successes": all_successes, "observed_total": len(source_rows), "observed_rate": round(all_successes / len(source_rows), 6) if source_rows else None, "null_successes": sum(null_counts), "null_total": len(null_counts) * len(source_rows), "permutation_p_value": round((1 + sum(1 for count in null_counts if count >= all_successes)) / (1 + len(null_counts)), 6), } return out def run(args: argparse.Namespace) -> dict[str, Any]: calibration_seeds = parse_ints(args.calibration_seeds) test_seeds = parse_ints(args.test_seeds) calibration_rows = build_rows(args, "calibration", calibration_seeds) test_rows = build_rows(args, "test", test_seeds) model = fit_reader_centroids(calibration_rows) reader_rows, source_rows = score_sources(test_rows, model, args.min_margin) null_counts = null_success_counts(calibration_rows, test_rows, args) output = { "experiment": "endpoint_stability_filter", "question": "Do GUE and Poisson remain endpoint-stable under the reader family before RP boundary residue is tested again?", "observables_registry": OBSERVABLES_REGISTRY_VERSION, "observables_used": FEATURE_NAMES + [ "endpoint_reader_pass", "endpoint_stable", "centroid_margin", "label_permutation_null_counts", ], "parameters": { "sizes": parse_ints(args.sizes), "calibration_seeds": calibration_seeds, "test_seeds": test_seeds, exec /bin/bash -lc "ls -1 tools/data | rg 'endpoint|feature_scramble|1058|1045'" in /opt/MM_D-ND succeeded in 0ms: endpoint_feature_scramble_null_20260516_1058.json endpoint_stability_filter_20260516_1045.json incrocio_20260516_1045.json incrocio_20260516_1058.json codex La consecutio viva non è più “riparare endpoint”, ma rientrare nel boundary solo mantenendo il gate 10:58: endpoint 36/36, feature-scramble add-one p<=0.05, poi residuo RP contro null row-aligned. Creo un esperimento che fa quel passaggio senza cercare lambda nuove. exec /bin/bash -lc "sed -n '1,320p' tools/exp_endpoint_feature_scramble_null.py" in /opt/MM_D-ND succeeded in 0ms: #!/usr/bin/env python3 """ Feature-scramble null for the endpoint stability filter. The 10:45 endpoint filter repaired the reader but left label permutation too permissive. This audit keeps the same observed reader/model contract and scrambles feature columns within each reader on test rows. It preserves the per-reader marginal distribution of every observable while breaking the row-level multivariate endpoint signature. """ from __future__ import annotations import argparse import json from pathlib import Path from typing import Any import numpy as np from exp_endpoint_stability_filter import ( FEATURE_NAMES, build_rows, fit_reader_centroids, null_success_counts, parse_ints, score_sources, summarize, ) from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION def scramble_test_features( rows: list[dict[str, Any]], rng: np.random.Generator, ) -> list[dict[str, Any]]: scrambled = [{**row, "features": dict(row["features"])} for row in rows] by_reader: dict[str, list[int]] = {} for idx, row in enumerate(scrambled): by_reader.setdefault(row["reader"], []).append(idx) for indices in by_reader.values(): for feature in FEATURE_NAMES: values = [scrambled[idx]["features"][feature] for idx in indices] rng.shuffle(values) for idx, value in zip(indices, values): scrambled[idx]["features"][feature] = value return scrambled def feature_scramble_null_counts( test_rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace, ) -> list[int]: rng = np.random.default_rng(args.feature_scramble_seed) counts = [] for _ in range(args.feature_scramble_trials): scrambled = scramble_test_features(test_rows, rng) _, source_rows = score_sources(scrambled, model, args.min_margin) counts.append(sum(1 for row in source_rows if row["endpoint_stable"])) return counts def tail_stats(counts: list[int], observed: int) -> dict[str, Any]: ge = sum(1 for count in counts if count >= observed) total = len(counts) return { "tail": "right", "criterion": "null endpoint-stable source count >= observed endpoint-stable source count", "k_ge_observed": ge, "n_trials": total, "raw_p": round(ge / total, 9) if total else None, "add_one_p": round((ge + 1) / (total + 1), 9) if total else None, "max_null_count": max(counts) if counts else None, "mean_null_count": round(float(np.mean(counts)), 6) if counts else None, "median_null_count": round(float(np.median(counts)), 6) if counts else None, } def count_histogram(counts: list[int]) -> dict[str, int]: values, freq = np.unique(np.array(counts, dtype=int), return_counts=True) return {str(int(value)): int(n) for value, n in zip(values, freq)} def run(args: argparse.Namespace) -> dict[str, Any]: calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) model = fit_reader_centroids(calibration_rows) reader_rows, source_rows = score_sources(test_rows, model, args.min_margin) observed_successes = sum(1 for row in source_rows if row["endpoint_stable"]) label_counts = null_success_counts(calibration_rows, test_rows, args) feature_counts = feature_scramble_null_counts(test_rows, model, args) output = { "experiment": "endpoint_feature_scramble_null", "question": "Does the endpoint filter remain specific when row-level feature coupling is destroyed but per-reader feature marginals are preserved?", "observables_registry": OBSERVABLES_REGISTRY_VERSION, "observables_used": FEATURE_NAMES + [ "endpoint_reader_pass", "endpoint_stable", "centroid_margin", "label_permutation_null_counts", "feature_scramble_null_counts", "raw_p", "add_one_p", ], "parameters": { "sizes": parse_ints(args.sizes), "calibration_seeds": parse_ints(args.calibration_seeds), "test_seeds": parse_ints(args.test_seeds), "reps": args.reps, "central_fraction": args.central_fraction, "local_windows": parse_ints(args.local_windows), "grid_size": args.grid_size, "min_margin": args.min_margin, "label_null_trials": args.label_null_trials, "null_seed": args.null_seed, "feature_scramble_trials": args.feature_scramble_trials, "feature_scramble_seed": args.feature_scramble_seed, }, "threshold_preregistered": { "endpoint_stable": f"every reader for a source row predicts the true endpoint and centroid margin >= {args.min_margin}", "feature_scramble_null": "within each reader, independently permute each feature column across test rows; keep true source labels for scoring", "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with stable source count >= observed", }, "observable_contract": { "claim": "GUE/Poisson endpoint filter is specific if observed endpoint stability remains complete and feature-scramble nulls do not reconstruct complete stability", "observable": "endpoint_stable source count, reader centroid margin, feature-scramble null count distribution", "operator": "calibrate endpoint centroids once on true calibration rows; score true test rows and feature-scrambled test rows row-aligned by reader", "generator": "GUE matrices and Poisson exponential spacings", "denominator": "2 domains x sizes x test seeds source rows; each row requires all readers to pass", "non_possible": "specific endpoint filter if feature-scramble null reaches observed complete endpoint stability", "not_tested": "RP boundary residue, Anderson 3D, experimental spectra, asymptotic universality", }, "summary": summarize(source_rows, label_counts), "observed_successes": observed_successes, "observed_total": len(source_rows), "label_permutation": { "counts": label_counts, "histogram": count_histogram(label_counts), "tail_stats": tail_stats(label_counts, observed_successes), }, "feature_scramble": { "counts": feature_counts, "histogram": count_histogram(feature_counts), "tail_stats": tail_stats(feature_counts, observed_successes), }, "source_rows": source_rows, "reader_rows": reader_rows, } out = Path(args.out) out.parent.mkdir(parents=True, exist_ok=True) out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") print(json.dumps({ "observed_successes": observed_successes, "observed_total": len(source_rows), "label_permutation": output["label_permutation"]["tail_stats"], "feature_scramble": output["feature_scramble"]["tail_stats"], }, indent=2, sort_keys=True)) return output def main() -> None: parser = argparse.ArgumentParser() parser.add_argument("--out", default="tools/data/endpoint_feature_scramble_null_20260516_1058.json") parser.add_argument("--sizes", default="128,192,256") parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") parser.add_argument("--reps", type=int, default=6) parser.add_argument("--central-fraction", type=float, default=0.6) parser.add_argument("--local-windows", default="9,12") parser.add_argument("--grid-size", type=int, default=151) parser.add_argument("--min-margin", type=float, default=0.15) parser.add_argument("--label-null-trials", type=int, default=128) parser.add_argument("--null-seed", type=int, default=202605161045) parser.add_argument("--feature-scramble-trials", type=int, default=512) parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) run(parser.parse_args()) if __name__ == "__main__": main() exec /bin/bash -lc "sed -n '1,320p' tools/exp_rp_boundary_raw_count_null_audit.py" in /opt/MM_D-ND succeeded in 0ms: #!/usr/bin/env python3 """ Raw-count null audit for the Rosenzweig-Porter BOUNDARY row. This extends the finite-size RP audit with explicit observed/null counts. The question is not whether a lambda looks intermediate once, but whether the same row has enough graph-reader support to beat row-aligned nulls before the word "residue" is allowed. """ from __future__ import annotations import argparse import json import math from pathlib import Path from types import SimpleNamespace from typing import Any import numpy as np from exp_rosenzweig_porter_bridge_physical_audit import ( FEATURE_NAMES, OBSERVABLES_REGISTRY_VERSION, build_knn_edges, classical_state, compute_row, parse_floats, parse_ints, stability_state, standardized_matrix, ) def wilson_interval(successes: int, total: int, z: float = 1.959963984540054) -> list[float]: if total <= 0: return [0.0, 0.0] phat = successes / total denom = 1.0 + z * z / total center = (phat + z * z / (2.0 * total)) / denom margin = z * math.sqrt((phat * (1.0 - phat) + z * z / (4.0 * total)) / total) / denom return [round(max(0.0, center - margin), 6), round(min(1.0, center + margin), 6)] def binomial_tail_at_least(k: int, n: int, p: float) -> float: if p <= 0.0: return 1.0 if k <= 0 else 0.0 if p >= 1.0: return 1.0 if k <= n else 0.0 return float(sum(math.comb(n, i) * (p**i) * ((1.0 - p) ** (n - i)) for i in range(k, n + 1))) def median(values: list[float]) -> float: return float(np.median(np.asarray(values, dtype=float))) def classify_with_labels(rows: list[dict[str, Any]], k: int, labels: list[str]) -> list[dict[str, Any]]: x = standardized_matrix(rows) poi_idx = [i for i, label in enumerate(labels) if label == "Poisson_pole"] gue_idx = [i for i, label in enumerate(labels) if label == "GUE_pole"] if not poi_idx or not gue_idx: raise ValueError("labels must include Poisson and GUE poles") c_poi = np.mean(x[poi_idx], axis=0) c_gue = np.mean(x[gue_idx], axis=0) edges = build_knn_edges(x, k) degree = {i: 0 for i in range(len(rows))} for i, j, _ in edges: degree[i] += 1 degree[j] += 1 out = [] for i, row in enumerate(rows): d_poi = float(np.linalg.norm(x[i] - c_poi)) d_gue = float(np.linalg.norm(x[i] - c_gue)) denom = d_poi + d_gue margin = float(abs(d_poi - d_gue) / denom) if denom > 1e-15 else 0.0 incident = [(a, b) for a, b, _ in edges if a == i or b == i] cross = 0 for a, b in incident: other = b if a == i else a if {labels[i], labels[other]} == {"Poisson_pole", "GUE_pole"}: cross += 1 elif labels[i] == "flow_candidate" and labels[other] in {"Poisson_pole", "GUE_pole"}: cross += 1 cross_fraction = float(cross / len(incident)) if incident else 0.0 state = "class_interior" if labels[i] == "flow_candidate" and cross_fraction > 0.0 and margin < 0.35: state = "third_included_candidate" elif cross_fraction > 0.0: state = "cut_edge" out.append( { "domain_window": row["domain_window"], "boundary_state": state, "centroid_margin": margin, "cross_neighbor_fraction": cross_fraction, "degree": degree[i], } ) return out def rotate_labels(labels: list[str], offset: int) -> list[str]: if not labels: return labels offset = offset % len(labels) return labels[offset:] + labels[:offset] def shuffled_labels(labels: list[str], rng: np.random.Generator) -> list[str]: shuffled = list(labels) rng.shuffle(shuffled) return shuffled def empty_hits(lambdas: list[float]) -> dict[str, dict[str, Any]]: return { f"RP_lambda_{lam:.3f}": { "lambda": round(float(lam), 6), "observed_hits": 0, "label_shuffle_hits": 0, "position_shift_hits": 0, "brody_q": [], "mixture_w": [], "mean_ipr": [], "sr": [], "margins": [], "cross_fractions": [], } for lam in lambdas } def audit_size(args: argparse.Namespace, n: int) -> dict[str, Any]: lambdas = parse_floats(args.lambdas) seeds = parse_ints(args.seeds) ks = parse_ints(args.k_values) label_null_trials = int(args.label_null_trials) position_offsets = parse_ints(args.position_offsets) row_hits = empty_hits(lambdas) observed_total = len(seeds) * len(ks) label_null_total = observed_total * label_null_trials position_null_total = observed_total * len(position_offsets) reader_runs = [] row_args = SimpleNamespace( n=n, reps=args.reps, central_fraction=args.central_fraction, grid_size=args.grid_size, poisson_pole_max=args.poisson_pole_max, gue_pole_min=args.gue_pole_min, ) for seed in seeds: rows = [compute_row(lam, row_args, seed + (n * 10000) + int(round(lam * 1000))) for lam in lambdas] labels = [row["source_domain_type"] for row in rows] rng = np.random.default_rng(seed + n) for k in ks: observed = classify_with_labels(rows, k, labels) observed_by_name = {row["domain_window"]: row for row in observed} observed_candidates = [ row["domain_window"] for row in observed if row["boundary_state"] == "third_included_candidate" ] reader_runs.append({"n": n, "seed": seed, "k": k, "observed_candidates": observed_candidates}) for row in rows: name = row["domain_window"] graph_row = observed_by_name[name] item = row_hits[name] if graph_row["boundary_state"] == "third_included_candidate": item["observed_hits"] += 1 item["margins"].append(float(graph_row["centroid_margin"])) item["cross_fractions"].append(float(graph_row["cross_neighbor_fraction"])) item["brody_q"].append(float(row["brody_q"])) item["mixture_w"].append(float(row["berry_robnick_like_gue_weight"])) item["mean_ipr"].append(float(row["mean_ipr"])) item["sr"].append(float(row["observables"]["SR"])) for _ in range(label_null_trials): null_rows = classify_with_labels(rows, k, shuffled_labels(labels, rng)) for null_row in null_rows: if null_row["boundary_state"] == "third_included_candidate": row_hits[null_row["domain_window"]]["label_shuffle_hits"] += 1 for offset in position_offsets: null_rows = classify_with_labels(rows, k, rotate_labels(labels, offset)) for null_row in null_rows: if null_row["boundary_state"] == "third_included_candidate": row_hits[null_row["domain_window"]]["position_shift_hits"] += 1 rows_out = [] two_reader_rows = [] graph_only_rows = [] for name in sorted(row_hits, key=lambda key: row_hits[key]["lambda"]): item = row_hits[name] class_row = { "brody_q": median(item["brody_q"]), "berry_robnick_like_gue_weight": median(item["mixture_w"]), } c_state = classical_state(class_row) observed_rate = item["observed_hits"] / observed_total label_rate = item["label_shuffle_hits"] / label_null_total position_rate = item["position_shift_hits"] / position_null_total min_lift = min(observed_rate - label_rate, observed_rate - position_rate) label_p = binomial_tail_at_least(item["observed_hits"], observed_total, label_rate) position_p = binomial_tail_at_least(item["observed_hits"], observed_total, position_rate) threshold_pass = ( c_state == "classical_intermediate" and observed_rate >= args.min_observed_rate and min_lift >= args.min_lift and label_p <= args.alpha and position_p <= args.alpha ) graph_stability = stability_state(observed_rate) if threshold_pass: two_reader_rows.append(name) if graph_stability == "stable_graph_bridge" and c_state != "classical_intermediate": graph_only_rows.append(name) rows_out.append( { "domain_window": name, "lambda": item["lambda"], "classical_audit_state": c_state, "graph_stability_state": graph_stability, "observed_successes": item["observed_hits"], "observed_total": observed_total, "observed_rate": round(observed_rate, 6), "observed_wilson_95": wilson_interval(item["observed_hits"], observed_total), "label_shuffle_successes": item["label_shuffle_hits"], "label_shuffle_total": label_null_total, "label_shuffle_rate": round(label_rate, 6), "label_shuffle_wilson_95": wilson_interval(item["label_shuffle_hits"], label_null_total), "label_shuffle_lift": round(observed_rate - label_rate, 6), "label_shuffle_binomial_tail_p": round(label_p, 6), "position_shift_successes": item["position_shift_hits"], "position_shift_total": position_null_total, "position_shift_rate": round(position_rate, 6), "position_shift_wilson_95": wilson_interval(item["position_shift_hits"], position_null_total), "position_shift_lift": round(observed_rate - position_rate, 6), "position_shift_binomial_tail_p": round(position_p, 6), "min_lift_against_nulls": round(min_lift, 6), "threshold_pass": threshold_pass, "median_brody_q": round(class_row["brody_q"], 6), "median_berry_robnick_like_gue_weight": round(class_row["berry_robnick_like_gue_weight"], 6), "median_SR": round(median(item["sr"]), 6), "median_mean_ipr": round(median(item["mean_ipr"]), 9), "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), } ) return { "n": n, "observed_total": observed_total, "label_shuffle_total": label_null_total, "position_shift_total": position_null_total, "summary": { "thresholded_two_reader_rows": two_reader_rows, "thresholded_two_reader_count": len(two_reader_rows), "graph_only_stable_rows": graph_only_rows, "graph_only_stable_count": len(graph_only_rows), }, "rows": rows_out, "reader_runs": reader_runs, } def run(args: argparse.Namespace) -> dict[str, Any]: sizes = parse_ints(args.sizes) by_size = [audit_size(args, n) for n in sizes] size_sets = {entry["n"]: set(entry["summary"]["thresholded_two_reader_rows"]) for entry in by_size} all_size_rows = sorted(set.intersection(*size_sets.values())) if size_sets else [] any_size_rows = sorted(set.union(*size_sets.values())) if size_sets else [] cross_rows = [] lambdas = parse_floats(args.lambdas) for lam in lambdas: name = f"RP_lambda_{lam:.3f}" rows_for_lambda = [] for entry in by_size: row = next(row for row in entry["rows"] if row["domain_window"] == name) rows_for_lambda.append(row) cross_rows.append( { "domain_window": name, "lambda": round(float(lam), 6), "threshold_pass_sizes": [ entry["n"] for entry in by_size if next(row for row in entry["rows"] if row["domain_window"] == name)["threshold_pass"] ], "all_size_threshold_pass": name in all_size_rows, "min_observed_rate": round(float(min(row["observed_rate"] for row in rows_for_lambda)), 6), "max_observed_rate": round(float(max(row["observed_rate"] for row in rows_for_lambda)), 6), "min_lift_against_nulls": round(float(min(row["min_lift_against_nulls"] for row in rows_for_lambda)), 6), "max_null_p": round( float( max( max(row["label_shuffle_binomial_tail_p"], row["position_shift_binomial_tail_p"]) for row in rows_for_lambda ) ), 6, ), "classical_states_seen": sorted(set(row["classical_audit_state"] for row in rows_for_lambda)), "graph_stability_seen": sorted(set(row["graph_stability_state"] for row in rows_for_lambda)), } ) output = { "experiment": "rp_boundary_raw_count_null_audit", "question": "Does the Rosenzweig-Porter boundary row beat row-aligned graph nulls with raw counts across sizes?", "observables_registry": OBSERVABLES_REGISTRY_VERSION, "observables_used": FEATURE_NAMES + [ "observed_successes", "label_shuffle_successes", "position_shift_successes", "observed_wilson_95", "label_shuffle_wilson_95", exec /bin/bash -lc "sed -n '1,260p' tools/exp_boundary_unfolding_transfer_matrix.py" in /opt/MM_D-ND succeeded in 0ms: #!/usr/bin/env python3 """ Cross-domain unfolding-transfer matrix for the BOUNDARY redesign. The unit is the reader axis, not a new RP lambda crest. For each row-aligned domain/size/seed spectrum, the script measures how much the observable vector changes when the same raw spacings are read by global, exact-local and odd-coerced local unfolding. Row-aligned permutation and circular-shift nulls test whether the reader residue is stronger than order-preserving baselines. """ from __future__ import annotations import argparse import json import math from pathlib import Path from typing import Any import numpy as np from exp_rosenzweig_porter_bridge_physical_audit import ( OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, fit_brody_q, fit_mixture_weight, rp_hamiltonian, ) from exp_rp_boundary_raw_count_null_audit import binomial_tail_at_least, wilson_interval from exp_rp_unfolding_sensitivity_audit import local_unfold_gaps as odd_coerced_unfold def parse_ints(value: str) -> list[int]: return [int(part.strip()) for part in value.split(",") if part.strip()] def parse_floats(value: str) -> list[float]: return [float(part.strip()) for part in value.split(",") if part.strip()] def central_slice(length: int, fraction: float) -> slice: keep = max(4, int(round(length * fraction))) start = max(0, (length - keep) // 2) return slice(start, start + keep) def exact_local_unfold(gaps: np.ndarray, window: int) -> np.ndarray: gaps = clean_gaps(gaps) if len(gaps) == 0: return gaps width = max(2, min(int(window), len(gaps))) left = width // 2 out = np.empty_like(gaps) for idx in range(len(gaps)): start = idx - left end = start + width if start < 0: start = 0 end = width if end > len(gaps): end = len(gaps) start = max(0, end - width) denom = float(np.mean(gaps[start:end])) if denom <= 1e-12: denom = float(np.mean(gaps)) out[idx] = gaps[idx] / denom return out / float(np.mean(out)) def clean_gaps(gaps: np.ndarray) -> np.ndarray: gaps = np.asarray(gaps, dtype=float) gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] if len(gaps) == 0: return gaps return gaps / float(np.mean(gaps)) def gue_gaps(n: int, reps: int, seed: int, central_fraction: float) -> np.ndarray: rng = np.random.default_rng(seed) all_gaps: list[float] = [] for _ in range(reps): real = rng.normal(0.0, 1.0, size=(n, n)) imag = rng.normal(0.0, 1.0, size=(n, n)) h = (real + real.T) / 2.0 + 1j * (imag - imag.T) / 2.0 levels = np.linalg.eigvalsh(h / math.sqrt(2.0 * n)) bulk = np.sort(levels)[central_slice(len(levels), central_fraction)] all_gaps.extend(np.diff(bulk).tolist()) return clean_gaps(np.asarray(all_gaps, dtype=float)) def poisson_gaps(n: int, reps: int, seed: int, _central_fraction: float) -> np.ndarray: rng = np.random.default_rng(seed) return clean_gaps(rng.exponential(1.0, size=max(4, (n - 1) * reps))) def rp_gaps(lam: float, n: int, reps: int, seed: int, central_fraction: float) -> np.ndarray: rng = np.random.default_rng(seed) all_gaps: list[float] = [] for _ in range(reps): levels = np.linalg.eigvalsh(rp_hamiltonian(rng, n, lam)) bulk = np.sort(levels)[central_slice(len(levels), central_fraction)] all_gaps.extend(np.diff(bulk).tolist()) return clean_gaps(np.asarray(all_gaps, dtype=float)) def read_by_mode(gaps: np.ndarray, mode: str, window: int) -> np.ndarray: gaps = clean_gaps(gaps) if mode == "global_mean": return gaps if mode.startswith("exact"): return exact_local_unfold(gaps, window) if mode.startswith("odd_coerced"): return clean_gaps(odd_coerced_unfold(gaps, window)) raise ValueError(f"unknown unfolding mode: {mode}") def feature_vector(gaps: np.ndarray, grid_size: int) -> dict[str, float]: gaps = clean_gaps(gaps) obs = {name: float(fn(gaps)) for name, fn in OBSERVABLES_CANONICAL.items()} q, _ = fit_brody_q(gaps, grid_size) w, _ = fit_mixture_weight(gaps, grid_size) obs["brody_q"] = float(q) obs["berry_robnick_like_gue_weight"] = float(w) return obs def classify(features: dict[str, float]) -> str: q = features["brody_q"] w = features["berry_robnick_like_gue_weight"] if q <= 0.25 and w <= 0.25: return "poisson_endpoint" if q >= 0.75 and w >= 0.75: return "gue_endpoint" return "intermediate" def mode_matrix(gaps: np.ndarray, modes: list[str], windows: list[int], grid_size: int) -> list[dict[str, Any]]: rows = [] for mode in modes: for window in windows: if mode == "global_mean" and window != windows[0]: continue features = feature_vector(read_by_mode(gaps, mode, window), grid_size) rows.append( { "reader": f"{mode}:w{window}" if mode != "global_mean" else "global_mean", "mode": mode, "window": window if mode != "global_mean" else None, "features": {key: round(value, 9) for key, value in features.items()}, "classical_state": classify(features), } ) return rows def sensitivity(rows: list[dict[str, Any]], feature_names: list[str]) -> float: matrix = np.asarray([[row["features"][name] for name in feature_names] for row in rows], dtype=float) if len(matrix) < 2: return 0.0 scale = np.std(matrix, axis=0) scale[scale <= 1e-9] = 1.0 z = matrix / scale best = 0.0 for i in range(len(z)): for j in range(i + 1, len(z)): best = max(best, float(np.linalg.norm(z[i] - z[j]) / math.sqrt(len(feature_names)))) return best def stable_endpoint(source_type: str, states: list[str]) -> bool: if source_type == "GUE": return all(state == "gue_endpoint" for state in states) if source_type == "Poisson": return all(state == "poisson_endpoint" for state in states) return False def row_nulls( gaps: np.ndarray, args: argparse.Namespace, modes: list[str], windows: list[int], feature_names: list[str], seed: int, ) -> tuple[list[float], list[float]]: rng = np.random.default_rng(seed) perm_scores = [] shift_scores = [] for _ in range(args.permutation_null_trials): permuted = np.array(gaps, copy=True) rng.shuffle(permuted) perm_scores.append(sensitivity(mode_matrix(permuted, modes, windows, args.grid_size), feature_names)) for shift in parse_ints(args.position_offsets): shifted = np.roll(gaps, shift) shift_scores.append(sensitivity(mode_matrix(shifted, modes, windows, args.grid_size), feature_names)) return perm_scores, shift_scores def build_source_rows(args: argparse.Namespace) -> list[dict[str, Any]]: rows = [] sizes = parse_ints(args.sizes) seeds = parse_ints(args.seeds) for n in sizes: for seed_idx, seed in enumerate(seeds): rows.append( { "row_id": f"GUE_N{n}_s{seed_idx}", "source_type": "GUE", "n": n, "seed": seed, "gaps": gue_gaps(n, args.reps, seed + n * 1009, args.central_fraction), } ) rows.append( { "row_id": f"Poisson_N{n}_s{seed_idx}", "source_type": "Poisson", "n": n, "seed": seed, "gaps": poisson_gaps(n, args.reps, seed + n * 1013, args.central_fraction), } ) for lam in parse_floats(args.rp_lambdas): rows.append( { "row_id": f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}", "source_type": "RP", "lambda": round(lam, 6), "n": n, "seed": seed, "gaps": rp_gaps(lam, n, args.reps, seed + n * 1019 + int(round(lam * 10000)), args.central_fraction), } ) return rows def summarize_group(rows: list[dict[str, Any]], source_type: str, args: argparse.Namespace) -> dict[str, Any]: group = [row for row in rows if row["source_type"] == source_type] if not group: return {} if source_type in {"GUE", "Poisson"}: successes = sum(1 for row in group if row["endpoint_transfer_stable"]) null_successes = sum(1 for row in group for score in row["permutation_null_scores"] if score <= args.endpoint_max_sensitivity) null_total = sum(len(row["permutation_null_scores"]) for row in group) p = 1.0 - binomial_tail_at_least(successes, len(group), null_successes / null_total) if null_total else None return { "source_type": source_type, "criterion": "endpoint_transfer_stable", "observed_successes": successes, "observed_total": len(group), "observed_rate": round(successes / len(group), 6), "observed_wilson_95": wilson_interval(successes, len(group)), "null_successes": null_successes, "null_total": null_total, "null_rate": round(null_successes / null_total, 6) if null_total else None, "binomial_tail_note": "left-tail endpoint failure risk; high observed rate is expected for true endpoints", "left_tail_p_approx": round(p, 6) if p is not None else None, "median_sensitivity": round(float(np.median([row["reader_sensitivity"] for row in group])), 6), } successes = sum(1 for row in group if row["reader_residue_pass"]) exec /bin/bash -lc "sed -n '260,620p' tools/exp_boundary_unfolding_transfer_matrix.py" in /opt/MM_D-ND succeeded in 0ms: successes = sum(1 for row in group if row["reader_residue_pass"]) null_successes = sum( 1 for row in group for score in row["permutation_null_scores"] + row["position_shift_null_scores"] if score >= row["reader_sensitivity"] ) null_total = sum(len(row["permutation_null_scores"]) + len(row["position_shift_null_scores"]) for row in group) p = binomial_tail_at_least(successes, len(group), null_successes / null_total) if null_total else None by_lambda = {} for lam in sorted({row.get("lambda") for row in group}): lam_rows = [row for row in group if row.get("lambda") == lam] by_lambda[f"{lam:.3f}"] = { "reader_residue_pass": sum(1 for row in lam_rows if row["reader_residue_pass"]), "total": len(lam_rows), "median_sensitivity": round(float(np.median([row["reader_sensitivity"] for row in lam_rows])), 6), "state_sequences": [row["state_sequence"] for row in lam_rows], } return { "source_type": source_type, "criterion": "reader_residue_pass", "observed_successes": successes, "observed_total": len(group), "observed_rate": round(successes / len(group), 6), "observed_wilson_95": wilson_interval(successes, len(group)), "null_successes": null_successes, "null_total": null_total, "null_rate": round(null_successes / null_total, 6) if null_total else None, "binomial_tail_p": round(p, 6) if p is not None else None, "median_sensitivity": round(float(np.median([row["reader_sensitivity"] for row in group])), 6), "by_lambda": by_lambda, } def run(args: argparse.Namespace) -> dict[str, Any]: modes = [part.strip() for part in args.unfolding_modes.split(",") if part.strip()] windows = parse_ints(args.local_windows) feature_names = ["SR", "SR2", "L1", "L2", "triple_var", "brody_q", "berry_robnick_like_gue_weight"] output_rows = [] for source in build_source_rows(args): gaps = source.pop("gaps") readers = mode_matrix(gaps, modes, windows, args.grid_size) score = sensitivity(readers, feature_names) perm, shift = row_nulls(gaps, args, modes, windows, feature_names, int(source["seed"]) + int(source["n"])) null_combined = perm + shift null_ge = sum(1 for item in null_combined if item >= score) row_p = (1 + null_ge) / (1 + len(null_combined)) states = [reader["classical_state"] for reader in readers] endpoint_ok = stable_endpoint(source["source_type"], states) reader_pass = ( source["source_type"] == "RP" and score >= args.min_reader_sensitivity and row_p <= args.alpha and len(set(states)) > 1 ) output_rows.append( { **source, "n_spacings": int(len(gaps)), "reader_sensitivity": round(score, 6), "null_ge_observed": null_ge, "null_total": len(null_combined), "row_aligned_p": round(row_p, 6), "endpoint_transfer_stable": endpoint_ok, "reader_residue_pass": reader_pass, "state_sequence": states, "readers": readers, "permutation_null_scores": [round(item, 6) for item in perm], "position_shift_null_scores": [round(item, 6) for item in shift], } ) summary = { "GUE": summarize_group(output_rows, "GUE", args), "Poisson": summarize_group(output_rows, "Poisson", args), "RP": summarize_group(output_rows, "RP", args), } output = { "experiment": "boundary_unfolding_transfer_matrix", "question": "Does the unfolding/window reader axis transfer across GUE, Poisson and RP as boundary coordinate rather than as a stable RP lambda?", "observables_registry": OBSERVABLES_REGISTRY_VERSION, "observables_used": feature_names + [ "reader_sensitivity", "endpoint_transfer_stable", "reader_residue_pass", "row_aligned_p", "permutation_null_scores", "position_shift_null_scores", ], "parameters": { "sizes": parse_ints(args.sizes), "seeds": parse_ints(args.seeds), "reps": args.reps, "rp_lambdas": parse_floats(args.rp_lambdas), "unfolding_modes": modes, "local_windows": windows, "permutation_null_trials": args.permutation_null_trials, "position_offsets": parse_ints(args.position_offsets), "central_fraction": args.central_fraction, "grid_size": args.grid_size, }, "threshold_preregistered": { "rp_reader_residue": f"reader_sensitivity >= {args.min_reader_sensitivity}, row_aligned_p <= {args.alpha}, and at least two reader states", "endpoint_transfer": f"all reader states match endpoint and reader_sensitivity <= {args.endpoint_max_sensitivity} is audited, not forced", "nulls": "permutation and circular-shift scores computed from the same row spacings", }, "observable_contract": { "claim": "window_mode/unfolding is a boundary coordinate if endpoints transfer while RP boundary rows expose reader-specific residue against row-aligned nulls", "observable": "reader_sensitivity of canonical spectral vector across global, exact-local and odd-coerced readers", "operator": "same raw spacing row read by multiple unfolding/window modes", "generator": "GUE matrices, Poisson exponential spacings, and RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", "denominator": "domain x size x seed rows; nulls use the same row spacings under permutation and circular shifts", "non_possible": "reader axis as boundary coordinate if GUE/Poisson endpoints also fracture or RP residue does not beat row-aligned nulls", "not_tested": "experimental spectra, N to infinity, Anderson 3D, analytic universality class proof", }, "summary": summary, "rows": output_rows, } out = Path(args.out) out.parent.mkdir(parents=True, exist_ok=True) out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") print(json.dumps(summary, indent=2, sort_keys=True)) return output def main() -> None: parser = argparse.ArgumentParser() parser.add_argument("--out", default="tools/data/boundary_unfolding_transfer_matrix_20260516_1031.json") parser.add_argument("--sizes", default="128,192") parser.add_argument("--seeds", default="202605161031,202605161032,202605161033,202605161034") parser.add_argument("--reps", type=int, default=6) parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") parser.add_argument("--unfolding-modes", default="global_mean,exact_local,odd_coerced") parser.add_argument("--local-windows", default="9,12") parser.add_argument("--permutation-null-trials", type=int, default=32) parser.add_argument("--position-offsets", default="1,2,3,4,5,6,7,8") parser.add_argument("--central-fraction", type=float, default=0.6) parser.add_argument("--grid-size", type=int, default=151) parser.add_argument("--min-reader-sensitivity", type=float, default=0.75) parser.add_argument("--endpoint-max-sensitivity", type=float, default=0.75) parser.add_argument("--alpha", type=float, default=0.05) run(parser.parse_args()) if __name__ == "__main__": main() exec /bin/bash -lc "sed -n '320,620p' tools/exp_rp_boundary_raw_count_null_audit.py" in /opt/MM_D-ND succeeded in 0ms: "label_shuffle_wilson_95", "position_shift_wilson_95", "label_shuffle_binomial_tail_p", "position_shift_binomial_tail_p", "min_lift_against_nulls", "threshold_pass", ], "parameters": { "sizes": sizes, "reps": args.reps, "lambdas": lambdas, "seeds": parse_ints(args.seeds), "k_values": parse_ints(args.k_values), "label_null_trials": args.label_null_trials, "position_offsets": parse_ints(args.position_offsets), "central_fraction": args.central_fraction, "grid_size": args.grid_size, "poisson_pole_max": args.poisson_pole_max, "gue_pole_min": args.gue_pole_min, }, "threshold_preregistered": { "min_observed_rate": args.min_observed_rate, "min_lift_against_each_null": args.min_lift, "alpha_each_null": args.alpha, "classical_clause": "classical_intermediate required for two-reader threshold pass", "decision": "thresholded_two_reader_boundary only if all clauses pass; otherwise graph bridge remains positive_lift_unthresholded or classic-only", }, "observable_contract": { "claim": "the RP boundary row is a controlled physical third-included only if raw graph hits beat label-shuffle and position-shift nulls at the same lambda row", "observable": "observed/null third-included graph successes, Wilson intervals, binomial-tail p-values, joined with Brody q and mixture weight", "operator": "finite-size RP diagonal-plus-GUE flow with kNN graph perturbations and two row-aligned nulls", "generator": "H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE across sizes, seeds and k values", "denominator": "same lambda grid per size; observed denominator seeds*k, null denominators observed*null_trials", "non_possible": "thresholded boundary if no lambda beats both nulls or if the pass is not size-stable", "not_tested": "N to infinity, experimental spectra, unfolding alternatives, Anderson 3D, many-body RP", }, "summary": { "sizes_analyzed": len(sizes), "lambda_rows": len(lambdas), "thresholded_two_reader_any_size": len(any_size_rows), "thresholded_two_reader_any_size_rows": any_size_rows, "thresholded_two_reader_all_sizes": len(all_size_rows), "thresholded_two_reader_all_size_rows": all_size_rows, }, "cross_size_rows": cross_rows, "by_size": by_size, } out = Path(args.out) out.parent.mkdir(parents=True, exist_ok=True) out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") print(json.dumps(output["summary"], indent=2, sort_keys=True)) return output def main() -> None: parser = argparse.ArgumentParser() parser.add_argument("--out", default="tools/data/rp_boundary_raw_count_null_audit_20260516_0820.json") parser.add_argument("--sizes", default="64,96,128") parser.add_argument("--reps", type=int, default=10) parser.add_argument("--lambdas", default="0,0.03,0.045,0.06,0.075,0.10,0.18,0.32,0.68,0.82,1.0") parser.add_argument("--seeds", default="202605160820,202605160821,202605160822,202605160823") parser.add_argument("--k-values", default="2,3,4") parser.add_argument("--label-null-trials", type=int, default=64) parser.add_argument("--position-offsets", default="1,2,3,4,5,6,7,8,9,10") parser.add_argument("--central-fraction", type=float, default=0.6) parser.add_argument("--grid-size", type=int, default=151) parser.add_argument("--poisson-pole-max", type=float, default=0.03) parser.add_argument("--gue-pole-min", type=float, default=0.82) parser.add_argument("--min-observed-rate", type=float, default=0.75) parser.add_argument("--min-lift", type=float, default=0.10) parser.add_argument("--alpha", type=float, default=0.05) args = parser.parse_args() run(args) if __name__ == "__main__": main() codex Il nuovo osservabile sarà diverso da quello del 10:31: non più sensibilità del reader, ma distanza bilanciata del vettore RP dai due centroidi endpoint già validati. Il non-possibile è atomico: se il null feature-scramble ricostruisce lo stesso numero di righe RP bilanciate, il terzo incluso non passa. apply patch patch: completed /opt/MM_D-ND/tools/exp_endpoint_gated_rp_boundary.py diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..beb5964893e1f91e0f4dffc7df548d2ba459b6a1 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,313 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_floats, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..beb5964893e1f91e0f4dffc7df548d2ba459b6a1 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,313 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_floats, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() codex Lo script è aggiunto. Ora lo compilo e lo eseguo; se il risultato è vuoto o assorbito dal null, il report dovrà dirlo come vincolo e non come scoperta fisica. exec /bin/bash -lc 'git status --short --branch' in /opt/MM_D-ND succeeded in 0ms: ## main...origin/main M applications/INDEX.draft.json M docs/guides/lab_current_state_logic_2026-05-08.md M tools/LAB_AGENT_CONTEXT.md M tools/build_agent_field.py M tools/build_lab_graph.py M tools/data/agent_field_live.md M tools/data/b2_apply_log.jsonl M tools/data/ciclo_memoria.json M tools/data/consecutio.json M tools/data/consecutio_processata.json M tools/data/domandatore_pre_cycle.json M tools/data/domande_fondamentali.json M tools/data/g1_log.jsonl M tools/data/g2_log.jsonl M tools/data/graph_completion/latest.json M tools/data/incrocio_risultato.json M tools/data/knowledge_state.json M tools/data/lab_bridge_issues.jsonl M tools/data/lab_data.json M tools/data/lab_graph.json M tools/data/lab_health.json M tools/data/lab_session_log.jsonl M tools/data/pipeline_state.json M tools/data/ponti_evoluti.json M tools/data/repairs/repair_run_log.jsonl M tools/data/reports/latest.md M tools/data/seme.json D tools/data/seme_archive/piano_37.json D tools/data/seme_archive/piano_38.json D tools/data/seme_archive/piano_4.json D tools/data/seme_archive/piano_5.json D tools/data/seme_archive/piano_6.json D tools/data/seme_archive/piano_7.json D tools/data/seme_archive/piano_8.json D tools/data/seme_archive/piano_9.json M tools/data/seme_backup_pre_run.json M tools/data/tm1_figures/tensions.json M tools/data/tm1_figures/tensions_raw.json M tools/data/valutatore_log.jsonl M tools/evolution_report.md M tools/graph_completion_compiler.py M tools/lab_aeternitas.py M tools/lab_agent.sh M tools/lab_falsifier.py M tools/lab_session_logger.py ?? applications/scoperte/20260513_0330_prime-vs-mod6-sr-boundary_auto/ ?? applications/scoperte/20260514_1330_sr-residual-width-audit_auto/ ?? applications/scoperte/20260514_1631_chiusura-tester-rimbalzo-fisico-w6_auto/ ?? applications/scoperte/20260514_1640_rafforzamento-tester-fisico-goegue-n-curve_auto/ ?? applications/scoperte/20260515_1712_primemod6-generative-null-w2048_auto/ ?? applications/scoperte/20260515_1816_v2-generator-scaling-gate_auto/ ?? applications/scoperte/20260515_1904_boundary-classical-crossover-audit_auto/ ?? applications/scoperte/20260515_1933_rosenzweig-porter-physical-bridge-audit_auto/ ?? applications/scoperte/20260515_1940_rp-boundary-size-stability-audit_auto/ ?? applications/scoperte/20260515_1947_anderson-3d-mobility-edge-two-reader_auto/ ?? applications/scoperte/20260516_0921_rp-unfolding-sensitivity-audit_auto/ ?? applications/scoperte/20260516_0938_rp-candidate-local-window-stress-gate_auto/ ?? applications/scoperte/20260516_1007_rp-local-window-persistence-curve_auto/ ?? applications/scoperte/20260516_1019_rp-exact-local-window-size-stress_auto/ ?? applications/scoperte/20260516_1031_boundary-unfolding-transfer-matrix_auto/ ?? applications/soluzioni/20260513_0330_prime-vs-mod6-sr-boundary/ ?? applications/soluzioni/20260514_1330_sr-residual-width-audit/ ?? applications/soluzioni/20260514_1631_chiusura-tester-rimbalzo-fisico-w6/ ?? applications/soluzioni/20260514_1640_rafforzamento-tester-fisico-goegue-n-curve/ ?? applications/soluzioni/20260515_1712_primemod6-generative-null-w2048/ ?? applications/soluzioni/20260515_1816_v2-generator-scaling-gate/ ?? applications/soluzioni/20260515_1904_boundary-classical-crossover-audit/ ?? applications/soluzioni/20260515_1933_rosenzweig-porter-physical-bridge-audit/ ?? applications/soluzioni/20260515_1940_rp-boundary-size-stability-audit/ ?? applications/soluzioni/20260515_1947_anderson-3d-mobility-edge-two-reader/ ?? applications/soluzioni/20260516_0921_rp-unfolding-sensitivity-audit/ ?? applications/soluzioni/20260516_0938_rp-candidate-local-window-stress-gate/ ?? applications/soluzioni/20260516_1007_rp-local-window-persistence-curve/ ?? applications/soluzioni/20260516_1019_rp-exact-local-window-size-stress/ ?? applications/soluzioni/20260516_1031_boundary-unfolding-transfer-matrix/ ?? docs/guides/lab_preflight_agent_2026-05-14.md ?? docs/operations/ ?? tools/build_lab_data.py ?? tools/build_safe_agent_field_preview.py ?? tools/compose_filtered_field_preview.py ?? tools/compose_supervised_entry_preview.py ?? tools/data/aeternitas/aeternitas_20260512_033539.json ?? tools/data/aeternitas/aeternitas_20260513_033605.json ?? tools/data/aeternitas/aeternitas_20260514_033420.json ?? tools/data/aeternitas/aeternitas_20260514_133424.json ?? tools/data/aeternitas/aeternitas_20260514_150454.json ?? tools/data/aeternitas/aeternitas_20260514_161058.json ?? tools/data/aeternitas/aeternitas_20260514_161719.json ?? tools/data/aeternitas/aeternitas_20260514_163527.json ?? tools/data/aeternitas/aeternitas_20260514_164509.json ?? tools/data/aeternitas/aeternitas_20260514_165437.json ?? tools/data/aeternitas/aeternitas_20260514_170109.json ?? tools/data/aeternitas/aeternitas_20260514_171152.json ?? tools/data/aeternitas/aeternitas_20260514_185450.json ?? tools/data/aeternitas/aeternitas_20260515_162727.json ?? tools/data/aeternitas/aeternitas_20260515_165116.json ?? tools/data/aeternitas/aeternitas_20260515_170328.json ?? tools/data/aeternitas/aeternitas_20260515_171005.json ?? tools/data/aeternitas/aeternitas_20260515_171725.json ?? tools/data/aeternitas/aeternitas_20260515_172913.json ?? tools/data/aeternitas/aeternitas_20260515_174023.json ?? tools/data/aeternitas/aeternitas_20260515_175045.json ?? tools/data/aeternitas/aeternitas_20260515_180306.json ?? tools/data/aeternitas/aeternitas_20260515_181257.json ?? tools/data/aeternitas/aeternitas_20260515_182126.json ?? tools/data/aeternitas/aeternitas_20260515_183111.json ?? tools/data/aeternitas/aeternitas_20260515_190118.json ?? tools/data/aeternitas/aeternitas_20260515_191018.json ?? tools/data/aeternitas/aeternitas_20260515_192915.json ?? tools/data/aeternitas/aeternitas_20260515_193919.json ?? tools/data/aeternitas/aeternitas_20260515_194625.json ?? tools/data/aeternitas/aeternitas_20260515_195317.json ?? tools/data/aeternitas/aeternitas_20260516_033848.json ?? tools/data/aeternitas/aeternitas_20260516_0720.json ?? tools/data/aeternitas/aeternitas_20260516_0820.json ?? tools/data/aeternitas/aeternitas_20260516_0921.json ?? tools/data/aeternitas/aeternitas_20260516_0938.json ?? tools/data/aeternitas/aeternitas_20260516_1007.json ?? tools/data/aeternitas/aeternitas_20260516_1019.json ?? tools/data/aeternitas/aeternitas_20260516_1031.json ?? tools/data/aeternitas/aeternitas_20260516_1045.json ?? tools/data/aeternitas/aeternitas_20260516_1058.json ?? tools/data/agent_field_entry_supervised.md ?? tools/data/anderson3d_component_state_interface_input_20260514_1850.json ?? tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json ?? tools/data/aubry_binary_grammar_surrogate_gate_20260515_1807.json ?? tools/data/aubry_boundary_phase_transport_gate_20260515_1745.json ?? tools/data/aubry_cosine_boundary_counter_gate_20260515_1758.json ?? tools/data/aubry_v2_generator_scaling_gate_20260515_1816.json ?? tools/data/biconi/bicono_20260512_0330.json ?? tools/data/biconi/bicono_20260513_0330.json ?? tools/data/biconi/bicono_20260514_0330.json ?? tools/data/biconi/bicono_20260514_1330.json ?? tools/data/biconi/bicono_20260514_1458.json ?? tools/data/biconi/bicono_20260514_1605.json ?? tools/data/biconi/bicono_20260514_1612.json ?? tools/data/biconi/bicono_20260514_1631.json ?? tools/data/biconi/bicono_20260514_1640.json ?? tools/data/biconi/bicono_20260514_1649.json ?? tools/data/biconi/bicono_20260514_1656.json ?? tools/data/biconi/bicono_20260514_1701.json ?? tools/data/biconi/bicono_20260514_1850.json ?? tools/data/biconi/bicono_20260515_1623.json ?? tools/data/biconi/bicono_20260515_1647.json ?? tools/data/biconi/bicono_20260515_1659.json ?? tools/data/biconi/bicono_20260515_1705.json ?? tools/data/biconi/bicono_20260515_1712.json ?? tools/data/biconi/bicono_20260515_1724.json ?? tools/data/biconi/bicono_20260515_1734.json ?? tools/data/biconi/bicono_20260515_1745.json ?? tools/data/biconi/bicono_20260515_1758.json ?? tools/data/biconi/bicono_20260515_1807.json ?? tools/data/biconi/bicono_20260515_1816.json ?? tools/data/biconi/bicono_20260515_1826.json ?? tools/data/biconi/bicono_20260515_1855.json ?? tools/data/biconi/bicono_20260515_1904.json ?? tools/data/biconi/bicono_20260515_1915.json ?? tools/data/biconi/bicono_20260515_1933.json ?? tools/data/biconi/bicono_20260515_1940.json ?? tools/data/biconi/bicono_20260515_1947.json ?? tools/data/biconi/bicono_20260516_0330.json ?? tools/data/biconi/bicono_20260516_0720.json ?? tools/data/biconi/bicono_20260516_0820.json ?? tools/data/biconi/bicono_20260516_0921.json ?? tools/data/biconi/bicono_20260516_0938.json ?? tools/data/biconi/bicono_20260516_1007.json ?? tools/data/biconi/bicono_20260516_1019.json ?? tools/data/biconi/bicono_20260516_1031.json ?? tools/data/biconi/bicono_20260516_1045.json ?? tools/data/biconi/bicono_20260516_1058.json ?? tools/data/boundary_bridge_stability_audit_20260515_1915.json ?? tools/data/boundary_classical_crossover_audit_20260515_1904.json ?? tools/data/boundary_graph_curvature_gate_20260515_1855.json ?? tools/data/boundary_graph_null_audit_20260516_0330.json ?? tools/data/boundary_graph_residue_threshold_audit_20260516_0720.json ?? tools/data/boundary_unfolding_transfer_matrix_20260516_1031.json ?? tools/data/component_state_anderson3d_interface_20260514_1850.json ?? tools/data/component_state_anderson3d_interface_20260514_1850.trace.jsonl ?? tools/data/component_state_fit_ready_20260514_1649.json ?? tools/data/component_state_interface_smoke_20260514_1649.json ?? tools/data/component_state_interface_smoke_20260514_1649.trace.jsonl ?? tools/data/component_state_interface_smoke_input_20260514_1649.json ?? tools/data/domandatore/domandatore_20260512_0330.json ?? tools/data/domandatore/domandatore_20260512_0345.json ?? tools/data/domandatore/domandatore_20260513_0330.json ?? tools/data/domandatore/domandatore_20260513_0345.json ?? tools/data/domandatore/domandatore_20260514_0330.json ?? tools/data/domandatore/domandatore_20260514_0345.json ?? tools/data/domandatore/domandatore_20260514_1330.json ?? tools/data/domandatore/domandatore_20260514_1458.json ?? tools/data/domandatore/domandatore_20260515_0345.json ?? tools/data/domandatore/domandatore_20260515_1623.json ?? tools/data/domandatore/domandatore_20260515_1647.json ?? tools/data/domandatore/domandatore_20260515_1659.json ?? tools/data/domandatore/domandatore_20260516_0345.json ?? tools/data/endpoint_feature_scramble_null_20260516_1058.json ?? tools/data/endpoint_stability_filter_20260516_1045.json ?? tools/data/evolution/evolution_20260512_0330.md ?? tools/data/evolution/evolution_20260513_0330.md ?? tools/data/evolution/evolution_20260514_0330.md ?? tools/data/evolution/evolution_20260514_1330.md ?? tools/data/evolution/evolution_20260514_1458.md ?? tools/data/evolution/evolution_20260514_1605.md ?? tools/data/evolution/evolution_20260514_1612.md ?? tools/data/evolution/evolution_20260514_1631.md ?? tools/data/evolution/evolution_20260514_1640.md ?? tools/data/evolution/evolution_20260514_1649.md ?? tools/data/evolution/evolution_20260514_1656.md ?? tools/data/evolution/evolution_20260514_1701.md ?? tools/data/evolution/evolution_20260514_1850.md ?? tools/data/evolution/evolution_20260515_1623.md ?? tools/data/evolution/evolution_20260515_1647.md ?? tools/data/evolution/evolution_20260515_1659.md ?? tools/data/evolution/evolution_20260515_1705.md ?? tools/data/evolution/evolution_20260515_1712.md ?? tools/data/evolution/evolution_20260515_1724.md ?? tools/data/evolution/evolution_20260515_1734.md ?? tools/data/evolution/evolution_20260515_1745.md ?? tools/data/evolution/evolution_20260515_1758.md ?? tools/data/evolution/evolution_20260515_1807.md ?? tools/data/evolution/evolution_20260515_1816.md ?? tools/data/evolution/evolution_20260515_1826.md ?? tools/data/evolution/evolution_20260515_1855.md ?? tools/data/evolution/evolution_20260515_1904.md ?? tools/data/evolution/evolution_20260515_1915.md ?? tools/data/evolution/evolution_20260515_1933.md ?? tools/data/evolution/evolution_20260515_1940.md ?? tools/data/evolution/evolution_20260515_1947.md ?? tools/data/evolution/evolution_20260516_0330.md ?? tools/data/evolution/evolution_20260516_0720.md ?? tools/data/evolution/evolution_20260516_0820.md ?? tools/data/evolution/evolution_20260516_0921.md ?? tools/data/evolution/evolution_20260516_0938.md ?? tools/data/evolution/evolution_20260516_1007.md ?? tools/data/evolution/evolution_20260516_1019.md ?? tools/data/evolution/evolution_20260516_1031.md ?? tools/data/evolution/evolution_20260516_1045.md ?? tools/data/evolution/evolution_20260516_1058.md ?? tools/data/graph_completion/graph_completion_20260512_0330.json ?? tools/data/graph_completion/graph_completion_20260513_0330.json ?? tools/data/graph_completion/graph_completion_20260514_0330.json ?? tools/data/graph_completion/graph_completion_20260514_1330.json ?? tools/data/graph_completion/graph_completion_20260514_1458.json ?? tools/data/graph_completion/graph_completion_20260514_1605.json ?? tools/data/graph_completion/graph_completion_20260514_1612.json ?? tools/data/graph_completion/graph_completion_20260514_1631.json ?? tools/data/graph_completion/graph_completion_20260514_1640.json ?? tools/data/graph_completion/graph_completion_20260514_1649.json ?? tools/data/graph_completion/graph_completion_20260514_1656.json ?? tools/data/graph_completion/graph_completion_20260514_1701.json ?? tools/data/graph_completion/graph_completion_20260514_1850.json ?? tools/data/graph_completion/graph_completion_20260515_1623.json ?? tools/data/graph_completion/graph_completion_20260515_1647.json ?? tools/data/graph_completion/graph_completion_20260515_1659.json ?? tools/data/graph_completion/graph_completion_20260515_1705.json ?? tools/data/graph_completion/graph_completion_20260515_1712.json ?? tools/data/graph_completion/graph_completion_20260515_1724.json ?? tools/data/graph_completion/graph_completion_20260515_1734.json ?? tools/data/graph_completion/graph_completion_20260515_1745.json ?? tools/data/graph_completion/graph_completion_20260515_1758.json ?? tools/data/graph_completion/graph_completion_20260515_1807.json ?? tools/data/graph_completion/graph_completion_20260515_1816.json ?? tools/data/graph_completion/graph_completion_20260515_1904.json ?? tools/data/graph_completion/graph_completion_20260515_1933.json ?? tools/data/graph_completion/graph_completion_20260515_1940.json ?? tools/data/graph_completion/graph_completion_20260515_1947.json ?? tools/data/graph_completion/graph_completion_20260516_0921.json ?? tools/data/graph_completion/graph_completion_20260516_0938.json ?? tools/data/graph_completion/graph_completion_20260516_1007.json ?? tools/data/graph_completion/graph_completion_20260516_1019.json ?? tools/data/graph_completion/graph_completion_20260516_1031.json ?? tools/data/incrocio_20260512_0330.json ?? tools/data/incrocio_20260513_0330.json ?? tools/data/incrocio_20260514_0330.json ?? tools/data/incrocio_20260514_1330.json ?? tools/data/incrocio_20260514_1458.json ?? tools/data/incrocio_20260514_1605.json ?? tools/data/incrocio_20260514_1612.json ?? tools/data/incrocio_20260514_1631.json ?? tools/data/incrocio_20260514_1640.json ?? tools/data/incrocio_20260514_1649.json ?? tools/data/incrocio_20260514_1656.json ?? tools/data/incrocio_20260514_1701.json ?? tools/data/incrocio_20260514_1850.json ?? tools/data/incrocio_20260515_1623.json ?? tools/data/incrocio_20260515_1647.json ?? tools/data/incrocio_20260515_1659.json ?? tools/data/incrocio_20260515_1705.json ?? tools/data/incrocio_20260515_1712.json ?? tools/data/incrocio_20260515_1724.json ?? tools/data/incrocio_20260515_1734.json ?? tools/data/incrocio_20260515_1745.json ?? tools/data/incrocio_20260515_1758.json ?? tools/data/incrocio_20260515_1807.json ?? tools/data/incrocio_20260515_1816.json ?? tools/data/incrocio_20260515_1826.json ?? tools/data/incrocio_20260515_1855.json ?? tools/data/incrocio_20260515_1904.json ?? tools/data/incrocio_20260515_1915.json ?? tools/data/incrocio_20260515_1933.json ?? tools/data/incrocio_20260515_1940.json ?? tools/data/incrocio_20260515_1947.json ?? tools/data/incrocio_20260516_0330.json ?? tools/data/incrocio_20260516_0720.json ?? tools/data/incrocio_20260516_0820.json ?? tools/data/incrocio_20260516_0921.json ?? tools/data/incrocio_20260516_0938.json ?? tools/data/incrocio_20260516_1007.json ?? tools/data/incrocio_20260516_1019.json ?? tools/data/incrocio_20260516_1031.json ?? tools/data/incrocio_20260516_1045.json ?? tools/data/incrocio_20260516_1058.json ?? tools/data/incrocio_20260516_1104.json ?? tools/data/operator_directives_consumed/operator_directive_20260514_1612.md ?? tools/data/operator_directives_consumed/operator_directive_20260514_1631.md ?? tools/data/operator_directives_consumed/operator_directive_20260514_1640.md ?? tools/data/operator_directives_consumed/operator_directive_20260514_1649.md ?? tools/data/operator_directives_consumed/operator_directive_20260514_1656.md ?? tools/data/operator_directives_consumed/operator_directive_20260514_1701.md ?? tools/data/operator_directives_consumed/operator_directive_20260514_1850.md ?? tools/data/photonic_boundary_third_included_gate_20260515_1734.json ?? tools/data/physical_sr_residue_bounce_20260514_1612.json ?? tools/data/physical_sr_residue_bounce_20260514_1612.trace.jsonl ?? tools/data/physical_sr_residue_bounce_20260514_1631_w6.json ?? tools/data/physical_sr_residue_bounce_20260514_1631_w6.trace.jsonl ?? tools/data/physical_sr_residue_bounce_20260514_1640_goe_gue_ncurve.json ?? tools/data/physical_sr_residue_bounce_20260514_1640_goe_gue_ncurve.trace.jsonl ?? tools/data/preflight/ ?? tools/data/prime_sr_persistent_boundary_20260512_0330.json ?? tools/data/prime_sr_persistent_boundary_20260512_0330_seedcheck.json ?? tools/data/prime_vs_mod6_sr_boundary_20260513_0330.json ?? tools/data/prime_vs_mod6_sr_boundary_20260513_0330_seedcheck.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_0330.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_0330.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_0330_seedcheck.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_0330_seedcheck.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1330_w1024.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1330_w1024.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1330_w2048.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1330_w2048.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1330_w512.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1330_w512.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1458_w4096.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1458_w4096.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1458_w4096_dense.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1458_w4096_dense.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1458_w8192_dense.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1458_w8192_dense.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1605_w16384.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1605_w16384.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1605_w4096.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1605_w4096.trace.jsonl ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1605_w8192.json ?? tools/data/prime_vs_mod6_sr_boundary_20260514_1605_w8192.trace.jsonl ?? tools/data/promotions/promotion_20260513_0330.json ?? tools/data/promotions/promotion_20260514_1330.json ?? tools/data/promotions/promotion_20260514_1631.json ?? tools/data/promotions/promotion_20260514_1640.json ?? tools/data/promotions/promotion_20260514_1656.json ?? tools/data/promotions/promotion_20260515_1712.json ?? tools/data/promotions/promotion_20260515_1758.json ?? tools/data/promotions/promotion_20260515_1816.json ?? tools/data/promotions/promotion_20260515_1904.json ?? tools/data/promotions/promotion_20260515_1933.json ?? tools/data/promotions/promotion_20260515_1940.json ?? tools/data/promotions/promotion_20260515_1947.json ?? tools/data/promotions/promotion_20260516_0921.json ?? tools/data/promotions/promotion_20260516_0938.json ?? tools/data/promotions/promotion_20260516_1007.json ?? tools/data/promotions/promotion_20260516_1019.json ?? tools/data/promotions/promotion_20260516_1031.json ?? tools/data/quasiperiodic_grammar_scale_gate_20260514_1701.json ?? tools/data/quasiperiodic_vc_lattice_gate_20260515_1724.json ?? tools/data/repairs/repair_20260512_0330_decision.json ?? tools/data/repairs/repair_20260513_0330_decision.json ?? tools/data/repairs/repair_20260514_0330_decision.json ?? tools/data/repairs/repair_20260514_1330_decision.json ?? tools/data/repairs/repair_20260514_1458_decision.json ?? tools/data/repairs/repair_20260514_1605_decision.json ?? tools/data/repairs/repair_20260514_1612_decision.json ?? tools/data/repairs/repair_20260514_1631_decision.json ?? tools/data/repairs/repair_20260514_1640_decision.json ?? tools/data/repairs/repair_20260514_1649_decision.json ?? tools/data/repairs/repair_20260514_1656.json ?? tools/data/repairs/repair_20260514_1656.md ?? tools/data/repairs/repair_20260514_1656_decision.json ?? tools/data/repairs/repair_20260514_1850_decision.json ?? tools/data/reports/agent_20260512_0330.md ?? tools/data/reports/agent_20260513_0330.md ?? tools/data/reports/agent_20260514_0330.md ?? tools/data/reports/agent_20260514_1330.md ?? tools/data/reports/agent_20260514_1458.md ?? tools/data/reports/agent_20260514_1605.md ?? tools/data/reports/agent_20260514_1612.md ?? tools/data/reports/agent_20260514_1631.md ?? tools/data/reports/agent_20260514_1640.md ?? tools/data/reports/agent_20260514_1649.md ?? tools/data/reports/agent_20260514_1656.md ?? tools/data/reports/agent_20260514_1701.md ?? tools/data/reports/agent_20260514_1850.md ?? tools/data/reports/agent_20260515_1623.md ?? tools/data/reports/agent_20260515_1647.md ?? tools/data/reports/agent_20260515_1659.md ?? tools/data/reports/agent_20260515_1705.md ?? tools/data/reports/agent_20260515_1712.md ?? tools/data/reports/agent_20260515_1724.md ?? tools/data/reports/agent_20260515_1734.md ?? tools/data/reports/agent_20260515_1745.md ?? tools/data/reports/agent_20260515_1758.md ?? tools/data/reports/agent_20260515_1807.md ?? tools/data/reports/agent_20260515_1816.md ?? tools/data/reports/agent_20260515_1826.md ?? tools/data/reports/agent_20260515_1855.md ?? tools/data/reports/agent_20260515_1904.md ?? tools/data/reports/agent_20260515_1915.md ?? tools/data/reports/agent_20260515_1933.md ?? tools/data/reports/agent_20260515_1940.md ?? tools/data/reports/agent_20260515_1947.md ?? tools/data/reports/agent_20260516_0330.md ?? tools/data/reports/agent_20260516_0720.md ?? tools/data/reports/agent_20260516_0820.md ?? tools/data/reports/agent_20260516_0921.md ?? tools/data/reports/agent_20260516_0938.md ?? tools/data/reports/agent_20260516_1007.md ?? tools/data/reports/agent_20260516_1019.md ?? tools/data/reports/agent_20260516_1031.md ?? tools/data/reports/agent_20260516_1045.md ?? tools/data/reports/agent_20260516_1058.md ?? tools/data/reports/ddf_20260512_0405.json ?? tools/data/reports/ddf_20260513_0405.json ?? tools/data/reports/ddf_20260514_0405.json ?? tools/data/reports/ddf_20260515_0405.json ?? tools/data/reports/ddf_20260516_0405.json ?? tools/data/reports/falsifier_20260512_0330.json ?? tools/data/reports/falsifier_20260513_0330.json ?? tools/data/reports/falsifier_20260514_0330.json ?? tools/data/reports/falsifier_20260514_1330.json ?? tools/data/reports/falsifier_20260514_1458.json ?? tools/data/reports/falsifier_20260514_1605.json ?? tools/data/reports/falsifier_20260514_1612.json ?? tools/data/reports/falsifier_20260514_1631.json ?? tools/data/reports/falsifier_20260514_1640.json ?? tools/data/reports/falsifier_20260514_1649.json ?? tools/data/reports/falsifier_20260514_1656.json ?? tools/data/reports/falsifier_20260514_1701.json ?? tools/data/reports/falsifier_20260514_1850.json ?? tools/data/reports/falsifier_20260515_1623.json ?? tools/data/reports/falsifier_20260515_1647.json ?? tools/data/reports/falsifier_20260515_1659.json ?? tools/data/reports/falsifier_20260515_1705.json ?? tools/data/reports/falsifier_20260515_1712.json ?? tools/data/reports/falsifier_20260515_1712.raw.txt ?? tools/data/reports/falsifier_20260515_1724.json ?? tools/data/reports/falsifier_20260515_1734.json ?? tools/data/reports/falsifier_20260515_1745.json ?? tools/data/reports/falsifier_20260515_1758.json ?? tools/data/reports/falsifier_20260515_1807.json ?? tools/data/reports/falsifier_20260515_1816.json ?? tools/data/reports/falsifier_20260515_1826.json ?? tools/data/reports/falsifier_20260515_1855.json ?? tools/data/reports/falsifier_20260515_1904.json ?? tools/data/reports/falsifier_20260515_1915.json ?? tools/data/reports/falsifier_20260515_1933.json ?? tools/data/reports/falsifier_20260515_1940.json ?? tools/data/reports/falsifier_20260515_1947.json ?? tools/data/reports/falsifier_20260516_0330.json ?? tools/data/reports/falsifier_20260516_0720.json ?? tools/data/reports/falsifier_20260516_0820.json ?? tools/data/reports/falsifier_20260516_0921.json ?? tools/data/reports/falsifier_20260516_0921.raw.txt ?? tools/data/reports/falsifier_20260516_0938.json ?? tools/data/reports/falsifier_20260516_1007.json ?? tools/data/reports/falsifier_20260516_1019.json ?? tools/data/reports/falsifier_20260516_1031.json ?? tools/data/reports/falsifier_20260516_1045.json ?? tools/data/reports/falsifier_20260516_1058.json ?? tools/data/reports/loop_guard_20260512_0330.json ?? tools/data/reports/loop_guard_20260513_0330.json ?? tools/data/reports/loop_guard_20260514_0330.json ?? tools/data/reports/loop_guard_20260514_1330.json ?? tools/data/reports/loop_guard_20260514_1458.json ?? tools/data/reports/loop_guard_20260514_1605.json ?? tools/data/reports/loop_guard_20260514_1612.json ?? tools/data/reports/loop_guard_20260514_1631.json ?? tools/data/reports/loop_guard_20260514_1640.json ?? tools/data/reports/loop_guard_20260514_1649.json ?? tools/data/reports/loop_guard_20260514_1656.json ?? tools/data/reports/loop_guard_20260514_1701.json ?? tools/data/reports/loop_guard_20260514_1850.json ?? tools/data/reports/loop_guard_20260515_1623.json ?? tools/data/reports/loop_guard_20260515_1647.json ?? tools/data/reports/loop_guard_20260515_1659.json ?? tools/data/reports/loop_guard_20260515_1705.json ?? tools/data/reports/loop_guard_20260515_1712.json ?? tools/data/reports/loop_guard_20260515_1724.json ?? tools/data/reports/loop_guard_20260515_1734.json ?? tools/data/reports/loop_guard_20260515_1745.json ?? tools/data/reports/loop_guard_20260515_1758.json ?? tools/data/reports/loop_guard_20260515_1807.json ?? tools/data/reports/loop_guard_20260515_1816.json ?? tools/data/reports/loop_guard_20260515_1826.json ?? tools/data/reports/loop_guard_20260515_1855.json ?? tools/data/reports/loop_guard_20260515_1904.json ?? tools/data/reports/loop_guard_20260515_1915.json ?? tools/data/reports/loop_guard_20260515_1933.json ?? tools/data/reports/loop_guard_20260515_1940.json ?? tools/data/reports/loop_guard_20260515_1947.json ?? tools/data/reports/loop_guard_20260516_0330.json ?? tools/data/reports/loop_guard_20260516_0720.json ?? tools/data/reports/loop_guard_20260516_0820.json ?? tools/data/reports/loop_guard_20260516_0921.json ?? tools/data/reports/loop_guard_20260516_0938.json ?? tools/data/reports/loop_guard_20260516_1007.json ?? tools/data/reports/loop_guard_20260516_1019.json ?? tools/data/reports/loop_guard_20260516_1031.json ?? tools/data/reports/loop_guard_20260516_1045.json ?? tools/data/reports/loop_guard_20260516_1058.json ?? tools/data/reports/quarantine_manifest.json ?? tools/data/restore_backups/ ?? tools/data/rosenzweig_porter_bridge_physical_audit_20260515_1933.json ?? tools/data/rp_boundary_raw_count_null_audit_20260516_0820.json ?? tools/data/rp_boundary_size_stability_audit_20260515_1940.json ?? tools/data/rp_candidate_window_stress_20260516_0938_w11.json ?? tools/data/rp_candidate_window_stress_20260516_0938_w5.json ?? tools/data/rp_candidate_window_stress_20260516_1007_w7.json ?? tools/data/rp_candidate_window_stress_20260516_1007_w9.json ?? tools/data/rp_exact_local_window_matrix_20260516_1019.json ?? tools/data/rp_exact_local_window_matrix_20260516_1019_w10.json ?? tools/data/rp_exact_local_window_matrix_20260516_1019_w11.json ?? tools/data/rp_exact_local_window_matrix_20260516_1019_w12.json ?? tools/data/rp_exact_local_window_matrix_20260516_1019_w9.json ?? tools/data/rp_unfolding_sensitivity_audit_20260516_0921.json ?? tools/data/seme_backup_b2_20260512_033557.json ?? tools/data/seme_backup_b2_20260513_033622.json ?? tools/data/seme_backup_b2_20260514_150530.json ?? tools/data/seme_backup_b2_20260514_161119.json ?? tools/data/seme_backup_b2_20260515_180327.json ?? tools/data/seme_backup_b2_20260515_194643.json ?? tools/data/seme_backup_b2_20260516_094447.json ?? tools/data/seme_backup_b2_20260516_101425.json ?? tools/data/seme_backup_b2_20260516_102450.json ?? tools/data/sturmian_denominator_alignment_gate_20260515_1826.json ?? tools/data/tool_contracts/ ?? tools/data/veritas/veritas_20260512_033539.json ?? tools/data/veritas/veritas_20260513_033605.json ?? tools/data/veritas/veritas_20260514_033420.json ?? tools/data/veritas/veritas_20260514_133424.json ?? tools/data/veritas/veritas_20260514_150454.json ?? tools/data/veritas/veritas_20260514_161058.json ?? tools/data/veritas/veritas_20260514_161719.json ?? tools/data/veritas/veritas_20260514_163527.json ?? tools/data/veritas/veritas_20260514_164509.json ?? tools/data/veritas/veritas_20260514_165437.json ?? tools/data/veritas/veritas_20260514_170109.json ?? tools/data/veritas/veritas_20260514_171152.json ?? tools/data/veritas/veritas_20260514_185450.json ?? tools/data/veritas/veritas_20260515_162727.json ?? tools/data/veritas/veritas_20260515_165116.json ?? tools/data/veritas/veritas_20260515_170328.json ?? tools/data/veritas/veritas_20260515_171005.json ?? tools/data/veritas/veritas_20260515_171725.json ?? tools/data/veritas/veritas_20260515_172913.json ?? tools/data/veritas/veritas_20260515_174023.json ?? tools/data/veritas/veritas_20260515_175045.json ?? tools/data/veritas/veritas_20260515_180306.json ?? tools/data/veritas/veritas_20260515_181257.json ?? tools/data/veritas/veritas_20260515_182126.json ?? tools/data/veritas/veritas_20260515_183111.json ?? tools/data/veritas/veritas_20260515_190118.json ?? tools/data/veritas/veritas_20260515_191018.json ?? tools/data/veritas/veritas_20260515_192915.json ?? tools/data/veritas/veritas_20260515_193919.json ?? tools/data/veritas/veritas_20260515_194625.json ?? tools/data/veritas/veritas_20260515_195317.json ?? tools/data/veritas/veritas_20260516_033848.json ?? tools/data/veritas/veritas_20260516_072533.json ?? tools/data/veritas/veritas_20260516_082608.json ?? tools/data/veritas/veritas_20260516_092735.json ?? tools/data/veritas/veritas_20260516_094423.json ?? tools/data/veritas/veritas_20260516_101403.json ?? tools/data/veritas/veritas_20260516_102427.json ?? tools/data/veritas/veritas_20260516_103737.json ?? tools/data/veritas/veritas_20260516_105525.json ?? tools/data/veritas/veritas_20260516_110354.json ?? tools/exp_anderson3d_mobility_edge_two_reader_audit.py ?? tools/exp_aubry_binary_grammar_surrogate_gate.py ?? tools/exp_aubry_boundary_phase_transport_gate.py ?? tools/exp_aubry_cosine_boundary_counter_gate.py ?? tools/exp_aubry_v2_generator_scaling_gate.py ?? tools/exp_boundary_bridge_stability_audit.py ?? tools/exp_boundary_classical_crossover_audit.py ?? tools/exp_boundary_graph_curvature_gate.py ?? tools/exp_boundary_graph_null_audit.py ?? tools/exp_boundary_graph_residue_threshold_audit.py ?? tools/exp_boundary_unfolding_transfer_matrix.py ?? tools/exp_endpoint_feature_scramble_null.py ?? tools/exp_endpoint_gated_rp_boundary.py ?? tools/exp_endpoint_stability_filter.py ?? tools/exp_photonic_boundary_third_included_gate.py ?? tools/exp_physical_sr_residue_bounce.py ?? tools/exp_prime_sr_persistent_boundary.py ?? tools/exp_prime_vs_mod6_sr_boundary.py ?? tools/exp_quasiperiodic_grammar_scale_gate.py ?? tools/exp_rosenzweig_porter_bridge_physical_audit.py ?? tools/exp_rp_boundary_raw_count_null_audit.py ?? tools/exp_rp_boundary_size_stability_audit.py ?? tools/exp_rp_exact_local_window_matrix.py ?? tools/exp_rp_unfolding_sensitivity_audit.py ?? tools/exp_sturmian_denominator_alignment_gate.py ?? tools/field_coherence_preflight.py ?? tools/field_rebuild_risk_map.py ?? tools/lab_cycle_monitor.py ?? tools/lab_preflight_agent.py ?? tools/lab_runtime_observer.py ?? tools/lab_surface_invariant_check.py ?? tools/lab_tool_contract.py ?? tools/prime_mod6_counter_null_audit.py ?? tools/prime_mod6_generative_null_audit.py ?? tools/prime_mod6_null_fairness_audit.py ?? tools/prime_mod6_pipeline_closeout.py ?? tools/selector_authority_matrix.py ?? tools/stale_field_source_map.py exec /bin/bash -lc 'python -m py_compile tools/exp_endpoint_gated_rp_boundary.py' in /opt/MM_D-ND succeeded in 0ms: diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..beb5964893e1f91e0f4dffc7df548d2ba459b6a1 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,313 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_floats, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() exec /bin/bash -lc 'python tools/exp_endpoint_gated_rp_boundary.py --out tools/data/endpoint_gated_rp_boundary_20260516_1104.json' in /opt/MM_D-ND exited 1 in 0ms: Traceback (most recent call last): File "/opt/MM_D-ND/tools/exp_endpoint_gated_rp_boundary.py", line 27, in from exp_endpoint_stability_filter import ( ImportError: cannot import name 'parse_floats' from 'exp_endpoint_stability_filter' (/opt/MM_D-ND/tools/exp_endpoint_stability_filter.py). Did you mean: 'parse_ints'? diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..beb5964893e1f91e0f4dffc7df548d2ba459b6a1 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,313 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_floats, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() codex Il primo giro ha trovato una frizione reale: ho importato `parse_floats` dal modulo sbagliato. La riparazione è locale al nodo regressivo dello script, poi rilancio. apply patch patch: completed /opt/MM_D-ND/tools/exp_endpoint_gated_rp_boundary.py diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() exec /bin/bash -lc 'python -m py_compile tools/exp_endpoint_gated_rp_boundary.py' in /opt/MM_D-ND succeeded in 0ms: exec /bin/bash -lc 'python tools/exp_endpoint_gated_rp_boundary.py --out tools/data/endpoint_gated_rp_boundary_20260516_1104.json' in /opt/MM_D-ND diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() codex Il run è in corso; sta calcolando endpoint, RP e 512 null feature-scramble. Aspetto il deposito invece di ridurre il perimetro a metà. diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() succeeded in 9497ms: { "endpoint_gate": { "feature_scramble": { "histogram": { "0": 372, "1": 120, "2": 20 }, "tail_stats": { "add_one_p": 0.001949318, "criterion": "null endpoint-stable source count >= observed endpoint-stable source count", "k_ge_observed": 0, "max_null_count": 2, "mean_null_count": 0.3125, "median_null_count": 0.0, "n_trials": 512, "raw_p": 0.0, "tail": "right" } }, "label_permutation": { "histogram": { "0": 85, "27": 1, "28": 4, "29": 2, "31": 4, "33": 1, "34": 2, "35": 14, "36": 15 }, "tail_stats": { "add_one_p": 0.124031008, "criterion": "null endpoint-stable source count >= observed endpoint-stable source count", "k_ge_observed": 15, "max_null_count": 36, "mean_null_count": 11.34375, "median_null_count": 0.0, "n_trials": 128, "raw_p": 0.1171875, "tail": "right" } }, "observed_successes": 36, "observed_total": 36, "pass": true }, "rp_boundary": { "by_lambda": { "0.045": { "boundary_candidates": 2, "median_balance": 0.614182, "median_bridge_distance": 0.67569, "total": 18 }, "0.060": { "boundary_candidates": 3, "median_balance": 0.632778, "median_bridge_distance": 0.777805, "total": 18 }, "0.075": { "boundary_candidates": 1, "median_balance": 0.588828, "median_bridge_distance": 0.655661, "total": 18 } }, "feature_scramble": { "histogram": { "0": 500, "1": 12 }, "tail_stats": { "add_one_p": 0.001949318, "criterion": "null endpoint-stable source count >= observed endpoint-stable source count", "k_ge_observed": 0, "max_null_count": 1, "mean_null_count": 0.023438, "median_null_count": 0.0, "n_trials": 512, "raw_p": 0.0, "tail": "right" } }, "observed_candidates": 6, "observed_total": 54, "pass": true } } codex Il deposito è non-vuoto: endpoint gate passa e RP produce 6/54 candidate, contro null massimo 1/54. Ora estraggo le righe e i denominatori grezzi per scrivere il report senza gonfiare il claim. exec /bin/bash -lc "jq '.rp_boundary, [.source_rows.rp[] | select(.boundary_candidate==true) | {source_id,lambda,n,reader_passes,reader_total,median_balance,min_balance,median_bridge_distance}]' tools/data/endpoint_gated_rp_boundary_20260516_1104.json" in /opt/MM_D-ND succeeded in 0ms: { "by_lambda": { "0.045": { "boundary_candidates": 2, "median_balance": 0.614182, "median_bridge_distance": 0.67569, "total": 18 }, "0.060": { "boundary_candidates": 3, "median_balance": 0.632778, "median_bridge_distance": 0.777805, "total": 18 }, "0.075": { "boundary_candidates": 1, "median_balance": 0.588828, "median_bridge_distance": 0.655661, "total": 18 } }, "feature_scramble": { "histogram": { "0": 500, "1": 12 }, "tail_stats": { "add_one_p": 0.001949318, "criterion": "null endpoint-stable source count >= observed endpoint-stable source count", "k_ge_observed": 0, "max_null_count": 1, "mean_null_count": 0.023438, "median_null_count": 0.0, "n_trials": 512, "raw_p": 0.0, "tail": "right" } }, "observed_candidates": 6, "observed_total": 54, "pass": true } [ { "source_id": "RP_lambda_0.045_N128_s1", "lambda": 0.045, "n": 128, "reader_passes": 5, "reader_total": 5, "median_balance": 0.925398, "min_balance": 0.859659, "median_bridge_distance": 0.962413 }, { "source_id": "RP_lambda_0.045_N128_s2", "lambda": 0.045, "n": 128, "reader_passes": 4, "reader_total": 5, "median_balance": 0.881177, "min_balance": 0.836987, "median_bridge_distance": 1.035103 }, { "source_id": "RP_lambda_0.060_N128_s1", "lambda": 0.06, "n": 128, "reader_passes": 5, "reader_total": 5, "median_balance": 0.974155, "min_balance": 0.947328, "median_bridge_distance": 1.241872 }, { "source_id": "RP_lambda_0.060_N128_s2", "lambda": 0.06, "n": 128, "reader_passes": 5, "reader_total": 5, "median_balance": 0.860909, "min_balance": 0.85885, "median_bridge_distance": 1.099612 }, { "source_id": "RP_lambda_0.060_N128_s3", "lambda": 0.06, "n": 128, "reader_passes": 4, "reader_total": 5, "median_balance": 0.866121, "min_balance": 0.847151, "median_bridge_distance": 0.945495 }, { "source_id": "RP_lambda_0.075_N128_s0", "lambda": 0.075, "n": 128, "reader_passes": 5, "reader_total": 5, "median_balance": 0.902608, "min_balance": 0.898356, "median_bridge_distance": 1.24069 } ] exec /bin/bash -lc "jq '.endpoint_gate | {observed_successes, observed_total, pass, label:.label_permutation.tail_stats, feature:.feature_scramble.tail_stats}' tools/data/endpoint_gated_rp_boundary_20260516_1104.json" in /opt/MM_D-ND succeeded in 0ms: { "observed_successes": 36, "observed_total": 36, "pass": true, "label": { "add_one_p": 0.124031008, "criterion": "null endpoint-stable source count >= observed endpoint-stable source count", "k_ge_observed": 15, "max_null_count": 36, "mean_null_count": 11.34375, "median_null_count": 0.0, "n_trials": 128, "raw_p": 0.1171875, "tail": "right" }, "feature": { "add_one_p": 0.001949318, "criterion": "null endpoint-stable source count >= observed endpoint-stable source count", "k_ge_observed": 0, "max_null_count": 2, "mean_null_count": 0.3125, "median_null_count": 0.0, "n_trials": 512, "raw_p": 0.0, "tail": "right" } } exec /bin/bash -lc "jq '[.source_rows.rp[] | {lambda, boundary_candidate, median_balance, median_bridge_distance}] | group_by(.lambda) | map({lambda:.[0].lambda,total:length,candidates:map(select(.boundary_candidate))|length,min_balance:(map(.median_balance)|min),median_balance:(map(.median_balance)|sort|.[length/2|floor]),max_balance:(map(.median_balance)|max)})' tools/data/endpoint_gated_rp_boundary_20260516_1104.json" in /opt/MM_D-ND succeeded in 0ms: [ { "lambda": 0.045, "total": 18, "candidates": 2, "min_balance": 0.435243, "median_balance": 0.618976, "max_balance": 0.925398 }, { "lambda": 0.06, "total": 18, "candidates": 3, "min_balance": 0.346526, "median_balance": 0.653179, "max_balance": 0.974155 }, { "lambda": 0.075, "total": 18, "candidates": 1, "min_balance": 0.398353, "median_balance": 0.650022, "max_balance": 0.902608 } ] diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() exec /bin/bash -lc "jq '[.source_rows.rp[] | {n, boundary_candidate}] | group_by(.n) | map({n:.[0].n,total:length,candidates:map(select(.boundary_candidate))|length})' tools/data/endpoint_gated_rp_boundary_20260516_1104.json" in /opt/MM_D-ND succeeded in 0ms: [ { "n": 128, "total": 18, "candidates": 6 }, { "n": 192, "total": 18, "candidates": 0 }, { "n": 256, "total": 18, "candidates": 0 } ] diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() codex La lettura importante è il limite: RP batte il null nel conteggio globale, ma tutte le 6 candidate vivono a N=128; N=192 e N=256 sono blank. Scrivo quindi un report di vincolo, non una promozione del terzo incluso. apply patch patch: completed /opt/MM_D-ND/tools/data/reports/agent_20260516_1104.md diff --git a/tools/data/reports/agent_20260516_1104.md b/tools/data/reports/agent_20260516_1104.md new file mode 100644 index 0000000000000000000000000000000000000000..fa9538f69f03574adceb507c7d45afc0b8544dee --- /dev/null +++ b/tools/data/reports/agent_20260516_1104.md @@ -0,0 +1,101 @@ +# Agent Report - Endpoint-Gated RP Boundary +**Date**: 2026-05-16 11:04 +**Piano**: 129 +**Tension explored**: BOUNDARY (0.8) +**verdict**: CONSTRAINT - Il gate endpoint GUE/Poisson resta chiuso (`36/36`, feature-scramble `raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`). RP produce 6/54 righe terzo-incluse contro null massimo 1/54 (`raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`), ma tutte le candidate sono a `N=128`; `N=192` e `N=256` restano blank. Il residuo RP e' finito-size, non boundary fisico promosso. +observables_registry: 1.0.0-2026-05-06 +observables_used: [SR, SR2, L1, L2, triple_var, brody_q, berry_robnick_like_gue_weight, endpoint_stable, endpoint_feature_scramble_null_counts, rp_boundary_candidate, centroid_distance_balance, rp_feature_scramble_null_counts, raw_p, add_one_p] +**observable_contract**: claim=RP e' terzo incluso endpoint-gated solo se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra i centroidi endpoint battono il null feature-scramble row-aligned; observable=`endpoint_stable`, `centroid_distance_balance`, `rp_boundary_candidate`, raw/add-one p-values; operator=centroidi endpoint GUE/Poisson calibrati, score RP per distanza bilanciata da entrambi i poli, null che preserva marginali per reader e rompe accoppiamento feature-riga; generator=GUE, Poisson, RP `H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE`; denominator=endpoint 36 source rows x 5 reader, RP 3 lambda x 3 size x 6 seed = 54 source rows x 5 reader; non_possible=terzo incluso se endpoint gate fallisce o null RP ricostruisce il numero osservato; not_tested=Anderson 3D, spettri sperimentali, limite N infinito, universalita analitica, nuova ricerca lambda. + +## Respiro fuori-tempo +- **Combo**: A9 terzo incluso + QxG continuo/discreto + nodo BOUNDARY del grafo + tensione seme "8 domini GUE, 5 Poisson". +- **Dipolo / punto-zero**: endpoint chiuso / boundary intermedio. Punto-zero: vettore osservabile prima della distanza dai due centroidi. +- **Piano superiore**: topologia assiomatica del bordo. Il boundary operator non legge RP finche' i poli GUE/Poisson non sono invarianti. +- **Operatori laterali scelti**: boundary operator e parallel transport. Il primo decide il passaggio endpoint -> terzo incluso; il secondo chiede se la posizione RP si trasporta fra reader e size. +- **Contaminazione cognitiva**: CE-0019 metabolizzata come combo prima della misura; CE-0001/KSAR usata per reiterare il gate 10:58 invece di cercare una nuova lambda; CE-0117 usata per trattenere la possibilita' solo se apre un boundary non assorbito dal null. +- **Proto-ipotesi**: dopo endpoint chiuso, RP e' terzo incluso se una riga resta bilanciata fra i due endpoint in almeno 4/5 reader e il null feature-scramble non ricostruisce quel conteggio. +- **Possibile/non-possibile**: possibile = leggere RP come boundary finito-size controllato; non-possibile = promuoverlo a confine fisico se il supporto non attraversa le size. +- **Proiezione**: misuro `rp_boundary_candidate` su lambda `0.045/0.060/0.075`, size `128/192/256`, 6 seed. +- **Movimento A->M->B**: fisico A = crossover spettrale GUE/Poisson/RP; matematica M = distanza bilanciata da centroidi endpoint in spazio osservabile; fisico B non emerge. Il ciclo consegna un vincolo di size-stability prima del rimbalzo fisico. + +## Aderenza alla direzione +- `relation`: `follows_direction` +- `why`: usa il filtro endpoint GUE/Poisson chiuso nel ciclo 10:58 e tenta il rientro controllato nel boundary RP come terzo incluso operativo. +- `not_drift`: non torna a phi/Sturmian, V_c, fit locali o graph-only; RP viene letto solo dopo endpoint gate e contro null row-aligned. +- `seed_residue`: restano non testati gli 8 domini GUE / 5 Poisson originali come perimetro largo, Anderson 3D e spettri fisici reali. +- `why_not_drift`: il sotto-perimetro e' regressivo perche' verifica se il prerequisito endpoint abilita il terzo incluso senza cancellare il residuo del seme. + +## Re-discovery audit +- **Baseline noto piu vicino**: Rosenzweig-Porter crossover, Brody interpolation, Berry-Robnik-like mixture, finite-size spectral crossover GUE/Poisson. +- **Cosa assorbe il baseline**: una finestra RP puo' collocarsi fra statistiche GUE e Poisson in size finite. +- **Cosa resta Lab-specific**: il contratto endpoint-gated: il terzo incluso viene letto solo dopo endpoint-null chiuso e con p-value raw/add-one dichiarato. +- **Separazione**: `two_reader_boundary_confirmed=[]`; `graph_only_residue=0`; `scope_change_declared=endpoint_gated_rp_boundary`; `graph_baseline_audit=non_applicabile:no_graph_reader`. + +## Claim Under Test +> RP e' boundary endpoint-gated se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra centroidi endpoint battono il null feature-scramble row-aligned. + +## Experiment Design +- **Script nuovo**: `tools/exp_endpoint_gated_rp_boundary.py`. +- **Run**: `python tools/exp_endpoint_gated_rp_boundary.py --out tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. +- **Endpoint gate**: stesso perimetro 10:58, 36 source rows; pass se `36/36` endpoint-stable e feature-scramble `add_one_p<=0.05`. +- **RP boundary candidate**: una source row RP passa se almeno `4/5` reader hanno `centroid_distance_balance >= 0.85` e bridge distance in `[0.35, 2.75]`. +- **P-value**: right-tail; `raw_p=k/N` e `add_one_p=(k+1)/(N+1)`, dove `k` e' il numero di null trial con candidate count almeno pari all'osservato. +- **Null RP**: 512 feature-scramble trial; dentro ogni reader, ogni feature viene permutata indipendentemente fra righe RP. Preserva marginali per feature/reader, rompe accoppiamento multivariato source row. + +## Results +| gate | observed | null k/N | raw_p | add_one_p | max null | lettura | +|---|---:|---:|---:|---:|---:|---| +| Endpoint feature-scramble | 36/36 | 0/512 | 0.000000000 | 0.001949318 | 2 | endpoint chiuso | +| Endpoint label permutation | 36/36 | 15/128 | 0.117187500 | 0.124031008 | 36 | null permissivo, solo continuita' | +| RP feature-scramble | 6/54 | 0/512 | 0.000000000 | 0.001949318 | 1 | residuo sopra null | + +| lambda | candidates | total | median balance | median bridge distance | +|---:|---:|---:|---:|---:| +| 0.045 | 2 | 18 | 0.614182 | 0.675690 | +| 0.060 | 3 | 18 | 0.632778 | 0.777805 | +| 0.075 | 1 | 18 | 0.588828 | 0.655661 | + +| size | candidates | total | lettura | +|---:|---:|---:|---| +| 128 | 6 | 18 | residuo concentrato | +| 192 | 0 | 18 | blank | +| 256 | 0 | 18 | blank | + +## Key Findings +1. Verificato: il gate endpoint GUE/Poisson resta chiuso sullo stesso denominatore del 10:58: `36/36`, feature-scramble `add_one_p=0.001949318`. +2. Verificato: il null label-permutation resta permissivo e viene riportato per continuita': `15/128`, `add_one_p=0.124031008`. +3. Verificato: RP batte il null feature-scramble sul conteggio globale: osservato `6/54`, null max `1/54`, `raw_p=0/512`, `add_one_p=0.001949318`. +4. Verificato: il supporto non trasferisce su size. Tutte le 6 candidate sono a `N=128`; `N=192` e `N=256` hanno `0/18`. +5. Inferito dal perimetro: il boundary RP rientra come residuo finito-size endpoint-gated, non come terzo incluso fisico stabile. + +## Verdict +CONSTRAINT + +Il terzo incluso RP esiste nel perimetro endpoint-gated solo come residuo `N=128`. Il null non lo assorbe, ma la size-stability lo blocca. Il prossimo ciclo deve separare due possibilita': residuo finito-size reale del lettore endpoint oppure boundary che si sposta con N. Non promuovere RP, Anderson 3D o sito pubblico finche' il residuo non sopravvive a una curva size preregistrata. + +## Bicono della scoperta +- **Due radici**: endpoint GUE/Poisson chiuso; RP bilanciato ma non size-stable. +- **Singolare**: source row RP prima della distanza dai centroidi endpoint. +- **Invariante di passaggio**: raw/add-one p-value dichiarati e stesso denominatore source row x reader. +- **Campo di possibilita**: possibile = boundary finito-size endpoint-gated; non-possibile = boundary fisico promosso senza trasferimento a `N=192/256`. + +## Consecutio +Il prossimo ciclo deve testare size-persistence del residuo endpoint-gated: fissare il criterio `4/5 reader`, mantenere il feature-scramble null, aumentare o riallineare le size, e chiedere se la finestra candidata resta non-zero fuori da `N=128`. Se resta `N=128` only, il nodo regressivo e' finite-size/reader calibration; se compare su size maggiori, il boundary torna candidato fisico. + +## Ricadute pratiche +ssp_value: yes. `tools/exp_endpoint_gated_rp_boundary.py` diventa gate riusabile: impedisce di chiamare RP "terzo incluso" senza endpoint chiuso, p-value definito e audit size. + +## Telemetria +- No API paid run: `ANTHROPIC_API_KEY` e `OPENAI_API_KEY` non presenti nell'ambiente. +- `python tools/dnd_scenario.py --best` eseguito: massimo discriminante locale su TRASCENDENZA_LIMITE; direzione BOUNDARY seguita per contratto vivo. +- `python -m py_compile tools/exp_endpoint_gated_rp_boundary.py` completato. +- Primo run fallito per import errato di `parse_floats`; riparato nel nodo regressivo dello script e rilanciato. +- Run completato: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. +- Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. +- Nessun update del seme. +- Nessuna promozione e nessun public sync. + +## Files +- Script: `tools/exp_endpoint_gated_rp_boundary.py` +- Data: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json` +- Report: `tools/data/reports/agent_20260516_1104.md` diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() diff --git a/tools/data/reports/agent_20260516_1104.md b/tools/data/reports/agent_20260516_1104.md new file mode 100644 index 0000000000000000000000000000000000000000..fa9538f69f03574adceb507c7d45afc0b8544dee --- /dev/null +++ b/tools/data/reports/agent_20260516_1104.md @@ -0,0 +1,101 @@ +# Agent Report - Endpoint-Gated RP Boundary +**Date**: 2026-05-16 11:04 +**Piano**: 129 +**Tension explored**: BOUNDARY (0.8) +**verdict**: CONSTRAINT - Il gate endpoint GUE/Poisson resta chiuso (`36/36`, feature-scramble `raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`). RP produce 6/54 righe terzo-incluse contro null massimo 1/54 (`raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`), ma tutte le candidate sono a `N=128`; `N=192` e `N=256` restano blank. Il residuo RP e' finito-size, non boundary fisico promosso. +observables_registry: 1.0.0-2026-05-06 +observables_used: [SR, SR2, L1, L2, triple_var, brody_q, berry_robnick_like_gue_weight, endpoint_stable, endpoint_feature_scramble_null_counts, rp_boundary_candidate, centroid_distance_balance, rp_feature_scramble_null_counts, raw_p, add_one_p] +**observable_contract**: claim=RP e' terzo incluso endpoint-gated solo se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra i centroidi endpoint battono il null feature-scramble row-aligned; observable=`endpoint_stable`, `centroid_distance_balance`, `rp_boundary_candidate`, raw/add-one p-values; operator=centroidi endpoint GUE/Poisson calibrati, score RP per distanza bilanciata da entrambi i poli, null che preserva marginali per reader e rompe accoppiamento feature-riga; generator=GUE, Poisson, RP `H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE`; denominator=endpoint 36 source rows x 5 reader, RP 3 lambda x 3 size x 6 seed = 54 source rows x 5 reader; non_possible=terzo incluso se endpoint gate fallisce o null RP ricostruisce il numero osservato; not_tested=Anderson 3D, spettri sperimentali, limite N infinito, universalita analitica, nuova ricerca lambda. + +## Respiro fuori-tempo +- **Combo**: A9 terzo incluso + QxG continuo/discreto + nodo BOUNDARY del grafo + tensione seme "8 domini GUE, 5 Poisson". +- **Dipolo / punto-zero**: endpoint chiuso / boundary intermedio. Punto-zero: vettore osservabile prima della distanza dai due centroidi. +- **Piano superiore**: topologia assiomatica del bordo. Il boundary operator non legge RP finche' i poli GUE/Poisson non sono invarianti. +- **Operatori laterali scelti**: boundary operator e parallel transport. Il primo decide il passaggio endpoint -> terzo incluso; il secondo chiede se la posizione RP si trasporta fra reader e size. +- **Contaminazione cognitiva**: CE-0019 metabolizzata come combo prima della misura; CE-0001/KSAR usata per reiterare il gate 10:58 invece di cercare una nuova lambda; CE-0117 usata per trattenere la possibilita' solo se apre un boundary non assorbito dal null. +- **Proto-ipotesi**: dopo endpoint chiuso, RP e' terzo incluso se una riga resta bilanciata fra i due endpoint in almeno 4/5 reader e il null feature-scramble non ricostruisce quel conteggio. +- **Possibile/non-possibile**: possibile = leggere RP come boundary finito-size controllato; non-possibile = promuoverlo a confine fisico se il supporto non attraversa le size. +- **Proiezione**: misuro `rp_boundary_candidate` su lambda `0.045/0.060/0.075`, size `128/192/256`, 6 seed. +- **Movimento A->M->B**: fisico A = crossover spettrale GUE/Poisson/RP; matematica M = distanza bilanciata da centroidi endpoint in spazio osservabile; fisico B non emerge. Il ciclo consegna un vincolo di size-stability prima del rimbalzo fisico. + +## Aderenza alla direzione +- `relation`: `follows_direction` +- `why`: usa il filtro endpoint GUE/Poisson chiuso nel ciclo 10:58 e tenta il rientro controllato nel boundary RP come terzo incluso operativo. +- `not_drift`: non torna a phi/Sturmian, V_c, fit locali o graph-only; RP viene letto solo dopo endpoint gate e contro null row-aligned. +- `seed_residue`: restano non testati gli 8 domini GUE / 5 Poisson originali come perimetro largo, Anderson 3D e spettri fisici reali. +- `why_not_drift`: il sotto-perimetro e' regressivo perche' verifica se il prerequisito endpoint abilita il terzo incluso senza cancellare il residuo del seme. + +## Re-discovery audit +- **Baseline noto piu vicino**: Rosenzweig-Porter crossover, Brody interpolation, Berry-Robnik-like mixture, finite-size spectral crossover GUE/Poisson. +- **Cosa assorbe il baseline**: una finestra RP puo' collocarsi fra statistiche GUE e Poisson in size finite. +- **Cosa resta Lab-specific**: il contratto endpoint-gated: il terzo incluso viene letto solo dopo endpoint-null chiuso e con p-value raw/add-one dichiarato. +- **Separazione**: `two_reader_boundary_confirmed=[]`; `graph_only_residue=0`; `scope_change_declared=endpoint_gated_rp_boundary`; `graph_baseline_audit=non_applicabile:no_graph_reader`. + +## Claim Under Test +> RP e' boundary endpoint-gated se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra centroidi endpoint battono il null feature-scramble row-aligned. + +## Experiment Design +- **Script nuovo**: `tools/exp_endpoint_gated_rp_boundary.py`. +- **Run**: `python tools/exp_endpoint_gated_rp_boundary.py --out tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. +- **Endpoint gate**: stesso perimetro 10:58, 36 source rows; pass se `36/36` endpoint-stable e feature-scramble `add_one_p<=0.05`. +- **RP boundary candidate**: una source row RP passa se almeno `4/5` reader hanno `centroid_distance_balance >= 0.85` e bridge distance in `[0.35, 2.75]`. +- **P-value**: right-tail; `raw_p=k/N` e `add_one_p=(k+1)/(N+1)`, dove `k` e' il numero di null trial con candidate count almeno pari all'osservato. +- **Null RP**: 512 feature-scramble trial; dentro ogni reader, ogni feature viene permutata indipendentemente fra righe RP. Preserva marginali per feature/reader, rompe accoppiamento multivariato source row. + +## Results +| gate | observed | null k/N | raw_p | add_one_p | max null | lettura | +|---|---:|---:|---:|---:|---:|---| +| Endpoint feature-scramble | 36/36 | 0/512 | 0.000000000 | 0.001949318 | 2 | endpoint chiuso | +| Endpoint label permutation | 36/36 | 15/128 | 0.117187500 | 0.124031008 | 36 | null permissivo, solo continuita' | +| RP feature-scramble | 6/54 | 0/512 | 0.000000000 | 0.001949318 | 1 | residuo sopra null | + +| lambda | candidates | total | median balance | median bridge distance | +|---:|---:|---:|---:|---:| +| 0.045 | 2 | 18 | 0.614182 | 0.675690 | +| 0.060 | 3 | 18 | 0.632778 | 0.777805 | +| 0.075 | 1 | 18 | 0.588828 | 0.655661 | + +| size | candidates | total | lettura | +|---:|---:|---:|---| +| 128 | 6 | 18 | residuo concentrato | +| 192 | 0 | 18 | blank | +| 256 | 0 | 18 | blank | + +## Key Findings +1. Verificato: il gate endpoint GUE/Poisson resta chiuso sullo stesso denominatore del 10:58: `36/36`, feature-scramble `add_one_p=0.001949318`. +2. Verificato: il null label-permutation resta permissivo e viene riportato per continuita': `15/128`, `add_one_p=0.124031008`. +3. Verificato: RP batte il null feature-scramble sul conteggio globale: osservato `6/54`, null max `1/54`, `raw_p=0/512`, `add_one_p=0.001949318`. +4. Verificato: il supporto non trasferisce su size. Tutte le 6 candidate sono a `N=128`; `N=192` e `N=256` hanno `0/18`. +5. Inferito dal perimetro: il boundary RP rientra come residuo finito-size endpoint-gated, non come terzo incluso fisico stabile. + +## Verdict +CONSTRAINT + +Il terzo incluso RP esiste nel perimetro endpoint-gated solo come residuo `N=128`. Il null non lo assorbe, ma la size-stability lo blocca. Il prossimo ciclo deve separare due possibilita': residuo finito-size reale del lettore endpoint oppure boundary che si sposta con N. Non promuovere RP, Anderson 3D o sito pubblico finche' il residuo non sopravvive a una curva size preregistrata. + +## Bicono della scoperta +- **Due radici**: endpoint GUE/Poisson chiuso; RP bilanciato ma non size-stable. +- **Singolare**: source row RP prima della distanza dai centroidi endpoint. +- **Invariante di passaggio**: raw/add-one p-value dichiarati e stesso denominatore source row x reader. +- **Campo di possibilita**: possibile = boundary finito-size endpoint-gated; non-possibile = boundary fisico promosso senza trasferimento a `N=192/256`. + +## Consecutio +Il prossimo ciclo deve testare size-persistence del residuo endpoint-gated: fissare il criterio `4/5 reader`, mantenere il feature-scramble null, aumentare o riallineare le size, e chiedere se la finestra candidata resta non-zero fuori da `N=128`. Se resta `N=128` only, il nodo regressivo e' finite-size/reader calibration; se compare su size maggiori, il boundary torna candidato fisico. + +## Ricadute pratiche +ssp_value: yes. `tools/exp_endpoint_gated_rp_boundary.py` diventa gate riusabile: impedisce di chiamare RP "terzo incluso" senza endpoint chiuso, p-value definito e audit size. + +## Telemetria +- No API paid run: `ANTHROPIC_API_KEY` e `OPENAI_API_KEY` non presenti nell'ambiente. +- `python tools/dnd_scenario.py --best` eseguito: massimo discriminante locale su TRASCENDENZA_LIMITE; direzione BOUNDARY seguita per contratto vivo. +- `python -m py_compile tools/exp_endpoint_gated_rp_boundary.py` completato. +- Primo run fallito per import errato di `parse_floats`; riparato nel nodo regressivo dello script e rilanciato. +- Run completato: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. +- Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. +- Nessun update del seme. +- Nessuna promozione e nessun public sync. + +## Files +- Script: `tools/exp_endpoint_gated_rp_boundary.py` +- Data: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json` +- Report: `tools/data/reports/agent_20260516_1104.md` diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() exec /bin/bash -lc "sed -n '1,260p' tools/data/reports/agent_20260516_1104.md" in /opt/MM_D-ND succeeded in 0ms: # Agent Report - Endpoint-Gated RP Boundary **Date**: 2026-05-16 11:04 **Piano**: 129 **Tension explored**: BOUNDARY (0.8) **verdict**: CONSTRAINT - Il gate endpoint GUE/Poisson resta chiuso (`36/36`, feature-scramble `raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`). RP produce 6/54 righe terzo-incluse contro null massimo 1/54 (`raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`), ma tutte le candidate sono a `N=128`; `N=192` e `N=256` restano blank. Il residuo RP e' finito-size, non boundary fisico promosso. observables_registry: 1.0.0-2026-05-06 observables_used: [SR, SR2, L1, L2, triple_var, brody_q, berry_robnick_like_gue_weight, endpoint_stable, endpoint_feature_scramble_null_counts, rp_boundary_candidate, centroid_distance_balance, rp_feature_scramble_null_counts, raw_p, add_one_p] **observable_contract**: claim=RP e' terzo incluso endpoint-gated solo se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra i centroidi endpoint battono il null feature-scramble row-aligned; observable=`endpoint_stable`, `centroid_distance_balance`, `rp_boundary_candidate`, raw/add-one p-values; operator=centroidi endpoint GUE/Poisson calibrati, score RP per distanza bilanciata da entrambi i poli, null che preserva marginali per reader e rompe accoppiamento feature-riga; generator=GUE, Poisson, RP `H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE`; denominator=endpoint 36 source rows x 5 reader, RP 3 lambda x 3 size x 6 seed = 54 source rows x 5 reader; non_possible=terzo incluso se endpoint gate fallisce o null RP ricostruisce il numero osservato; not_tested=Anderson 3D, spettri sperimentali, limite N infinito, universalita analitica, nuova ricerca lambda. ## Respiro fuori-tempo - **Combo**: A9 terzo incluso + QxG continuo/discreto + nodo BOUNDARY del grafo + tensione seme "8 domini GUE, 5 Poisson". - **Dipolo / punto-zero**: endpoint chiuso / boundary intermedio. Punto-zero: vettore osservabile prima della distanza dai due centroidi. - **Piano superiore**: topologia assiomatica del bordo. Il boundary operator non legge RP finche' i poli GUE/Poisson non sono invarianti. - **Operatori laterali scelti**: boundary operator e parallel transport. Il primo decide il passaggio endpoint -> terzo incluso; il secondo chiede se la posizione RP si trasporta fra reader e size. - **Contaminazione cognitiva**: CE-0019 metabolizzata come combo prima della misura; CE-0001/KSAR usata per reiterare il gate 10:58 invece di cercare una nuova lambda; CE-0117 usata per trattenere la possibilita' solo se apre un boundary non assorbito dal null. - **Proto-ipotesi**: dopo endpoint chiuso, RP e' terzo incluso se una riga resta bilanciata fra i due endpoint in almeno 4/5 reader e il null feature-scramble non ricostruisce quel conteggio. - **Possibile/non-possibile**: possibile = leggere RP come boundary finito-size controllato; non-possibile = promuoverlo a confine fisico se il supporto non attraversa le size. - **Proiezione**: misuro `rp_boundary_candidate` su lambda `0.045/0.060/0.075`, size `128/192/256`, 6 seed. - **Movimento A->M->B**: fisico A = crossover spettrale GUE/Poisson/RP; matematica M = distanza bilanciata da centroidi endpoint in spazio osservabile; fisico B non emerge. Il ciclo consegna un vincolo di size-stability prima del rimbalzo fisico. ## Aderenza alla direzione - `relation`: `follows_direction` - `why`: usa il filtro endpoint GUE/Poisson chiuso nel ciclo 10:58 e tenta il rientro controllato nel boundary RP come terzo incluso operativo. - `not_drift`: non torna a phi/Sturmian, V_c, fit locali o graph-only; RP viene letto solo dopo endpoint gate e contro null row-aligned. - `seed_residue`: restano non testati gli 8 domini GUE / 5 Poisson originali come perimetro largo, Anderson 3D e spettri fisici reali. - `why_not_drift`: il sotto-perimetro e' regressivo perche' verifica se il prerequisito endpoint abilita il terzo incluso senza cancellare il residuo del seme. ## Re-discovery audit - **Baseline noto piu vicino**: Rosenzweig-Porter crossover, Brody interpolation, Berry-Robnik-like mixture, finite-size spectral crossover GUE/Poisson. - **Cosa assorbe il baseline**: una finestra RP puo' collocarsi fra statistiche GUE e Poisson in size finite. - **Cosa resta Lab-specific**: il contratto endpoint-gated: il terzo incluso viene letto solo dopo endpoint-null chiuso e con p-value raw/add-one dichiarato. - **Separazione**: `two_reader_boundary_confirmed=[]`; `graph_only_residue=0`; `scope_change_declared=endpoint_gated_rp_boundary`; `graph_baseline_audit=non_applicabile:no_graph_reader`. ## Claim Under Test > RP e' boundary endpoint-gated se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra centroidi endpoint battono il null feature-scramble row-aligned. ## Experiment Design - **Script nuovo**: `tools/exp_endpoint_gated_rp_boundary.py`. - **Run**: `python tools/exp_endpoint_gated_rp_boundary.py --out tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. - **Endpoint gate**: stesso perimetro 10:58, 36 source rows; pass se `36/36` endpoint-stable e feature-scramble `add_one_p<=0.05`. - **RP boundary candidate**: una source row RP passa se almeno `4/5` reader hanno `centroid_distance_balance >= 0.85` e bridge distance in `[0.35, 2.75]`. - **P-value**: right-tail; `raw_p=k/N` e `add_one_p=(k+1)/(N+1)`, dove `k` e' il numero di null trial con candidate count almeno pari all'osservato. - **Null RP**: 512 feature-scramble trial; dentro ogni reader, ogni feature viene permutata indipendentemente fra righe RP. Preserva marginali per feature/reader, rompe accoppiamento multivariato source row. ## Results | gate | observed | null k/N | raw_p | add_one_p | max null | lettura | |---|---:|---:|---:|---:|---:|---| | Endpoint feature-scramble | 36/36 | 0/512 | 0.000000000 | 0.001949318 | 2 | endpoint chiuso | | Endpoint label permutation | 36/36 | 15/128 | 0.117187500 | 0.124031008 | 36 | null permissivo, solo continuita' | | RP feature-scramble | 6/54 | 0/512 | 0.000000000 | 0.001949318 | 1 | residuo sopra null | | lambda | candidates | total | median balance | median bridge distance | |---:|---:|---:|---:|---:| | 0.045 | 2 | 18 | 0.614182 | 0.675690 | | 0.060 | 3 | 18 | 0.632778 | 0.777805 | | 0.075 | 1 | 18 | 0.588828 | 0.655661 | | size | candidates | total | lettura | |---:|---:|---:|---| | 128 | 6 | 18 | residuo concentrato | | 192 | 0 | 18 | blank | | 256 | 0 | 18 | blank | ## Key Findings 1. Verificato: il gate endpoint GUE/Poisson resta chiuso sullo stesso denominatore del 10:58: `36/36`, feature-scramble `add_one_p=0.001949318`. 2. Verificato: il null label-permutation resta permissivo e viene riportato per continuita': `15/128`, `add_one_p=0.124031008`. 3. Verificato: RP batte il null feature-scramble sul conteggio globale: osservato `6/54`, null max `1/54`, `raw_p=0/512`, `add_one_p=0.001949318`. 4. Verificato: il supporto non trasferisce su size. Tutte le 6 candidate sono a `N=128`; `N=192` e `N=256` hanno `0/18`. 5. Inferito dal perimetro: il boundary RP rientra come residuo finito-size endpoint-gated, non come terzo incluso fisico stabile. ## Verdict CONSTRAINT Il terzo incluso RP esiste nel perimetro endpoint-gated solo come residuo `N=128`. Il null non lo assorbe, ma la size-stability lo blocca. Il prossimo ciclo deve separare due possibilita': residuo finito-size reale del lettore endpoint oppure boundary che si sposta con N. Non promuovere RP, Anderson 3D o sito pubblico finche' il residuo non sopravvive a una curva size preregistrata. ## Bicono della scoperta - **Due radici**: endpoint GUE/Poisson chiuso; RP bilanciato ma non size-stable. - **Singolare**: source row RP prima della distanza dai centroidi endpoint. - **Invariante di passaggio**: raw/add-one p-value dichiarati e stesso denominatore source row x reader. - **Campo di possibilita**: possibile = boundary finito-size endpoint-gated; non-possibile = boundary fisico promosso senza trasferimento a `N=192/256`. ## Consecutio Il prossimo ciclo deve testare size-persistence del residuo endpoint-gated: fissare il criterio `4/5 reader`, mantenere il feature-scramble null, aumentare o riallineare le size, e chiedere se la finestra candidata resta non-zero fuori da `N=128`. Se resta `N=128` only, il nodo regressivo e' finite-size/reader calibration; se compare su size maggiori, il boundary torna candidato fisico. ## Ricadute pratiche ssp_value: yes. `tools/exp_endpoint_gated_rp_boundary.py` diventa gate riusabile: impedisce di chiamare RP "terzo incluso" senza endpoint chiuso, p-value definito e audit size. ## Telemetria - No API paid run: `ANTHROPIC_API_KEY` e `OPENAI_API_KEY` non presenti nell'ambiente. - `python tools/dnd_scenario.py --best` eseguito: massimo discriminante locale su TRASCENDENZA_LIMITE; direzione BOUNDARY seguita per contratto vivo. - `python -m py_compile tools/exp_endpoint_gated_rp_boundary.py` completato. - Primo run fallito per import errato di `parse_floats`; riparato nel nodo regressivo dello script e rilanciato. - Run completato: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. - Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. - Nessun update del seme. - Nessuna promozione e nessun public sync. ## Files - Script: `tools/exp_endpoint_gated_rp_boundary.py` - Data: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json` - Report: `tools/data/reports/agent_20260516_1104.md` exec /bin/bash -lc 'ls -l tools/exp_endpoint_gated_rp_boundary.py tools/data/endpoint_gated_rp_boundary_20260516_1104.json tools/data/reports/agent_20260516_1104.md' in /opt/MM_D-ND succeeded in 0ms: -rw-r--r-- 1 root root 292552 May 16 11:07 tools/data/endpoint_gated_rp_boundary_20260516_1104.json -rw-r--r-- 1 root root 9369 May 16 11:09 tools/data/reports/agent_20260516_1104.md -rw-r--r-- 1 root root 14197 May 16 11:07 tools/exp_endpoint_gated_rp_boundary.py diff --git a/tools/data/reports/agent_20260516_1104.md b/tools/data/reports/agent_20260516_1104.md new file mode 100644 index 0000000000000000000000000000000000000000..fa9538f69f03574adceb507c7d45afc0b8544dee --- /dev/null +++ b/tools/data/reports/agent_20260516_1104.md @@ -0,0 +1,101 @@ +# Agent Report - Endpoint-Gated RP Boundary +**Date**: 2026-05-16 11:04 +**Piano**: 129 +**Tension explored**: BOUNDARY (0.8) +**verdict**: CONSTRAINT - Il gate endpoint GUE/Poisson resta chiuso (`36/36`, feature-scramble `raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`). RP produce 6/54 righe terzo-incluse contro null massimo 1/54 (`raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`), ma tutte le candidate sono a `N=128`; `N=192` e `N=256` restano blank. Il residuo RP e' finito-size, non boundary fisico promosso. +observables_registry: 1.0.0-2026-05-06 +observables_used: [SR, SR2, L1, L2, triple_var, brody_q, berry_robnick_like_gue_weight, endpoint_stable, endpoint_feature_scramble_null_counts, rp_boundary_candidate, centroid_distance_balance, rp_feature_scramble_null_counts, raw_p, add_one_p] +**observable_contract**: claim=RP e' terzo incluso endpoint-gated solo se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra i centroidi endpoint battono il null feature-scramble row-aligned; observable=`endpoint_stable`, `centroid_distance_balance`, `rp_boundary_candidate`, raw/add-one p-values; operator=centroidi endpoint GUE/Poisson calibrati, score RP per distanza bilanciata da entrambi i poli, null che preserva marginali per reader e rompe accoppiamento feature-riga; generator=GUE, Poisson, RP `H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE`; denominator=endpoint 36 source rows x 5 reader, RP 3 lambda x 3 size x 6 seed = 54 source rows x 5 reader; non_possible=terzo incluso se endpoint gate fallisce o null RP ricostruisce il numero osservato; not_tested=Anderson 3D, spettri sperimentali, limite N infinito, universalita analitica, nuova ricerca lambda. + +## Respiro fuori-tempo +- **Combo**: A9 terzo incluso + QxG continuo/discreto + nodo BOUNDARY del grafo + tensione seme "8 domini GUE, 5 Poisson". +- **Dipolo / punto-zero**: endpoint chiuso / boundary intermedio. Punto-zero: vettore osservabile prima della distanza dai due centroidi. +- **Piano superiore**: topologia assiomatica del bordo. Il boundary operator non legge RP finche' i poli GUE/Poisson non sono invarianti. +- **Operatori laterali scelti**: boundary operator e parallel transport. Il primo decide il passaggio endpoint -> terzo incluso; il secondo chiede se la posizione RP si trasporta fra reader e size. +- **Contaminazione cognitiva**: CE-0019 metabolizzata come combo prima della misura; CE-0001/KSAR usata per reiterare il gate 10:58 invece di cercare una nuova lambda; CE-0117 usata per trattenere la possibilita' solo se apre un boundary non assorbito dal null. +- **Proto-ipotesi**: dopo endpoint chiuso, RP e' terzo incluso se una riga resta bilanciata fra i due endpoint in almeno 4/5 reader e il null feature-scramble non ricostruisce quel conteggio. +- **Possibile/non-possibile**: possibile = leggere RP come boundary finito-size controllato; non-possibile = promuoverlo a confine fisico se il supporto non attraversa le size. +- **Proiezione**: misuro `rp_boundary_candidate` su lambda `0.045/0.060/0.075`, size `128/192/256`, 6 seed. +- **Movimento A->M->B**: fisico A = crossover spettrale GUE/Poisson/RP; matematica M = distanza bilanciata da centroidi endpoint in spazio osservabile; fisico B non emerge. Il ciclo consegna un vincolo di size-stability prima del rimbalzo fisico. + +## Aderenza alla direzione +- `relation`: `follows_direction` +- `why`: usa il filtro endpoint GUE/Poisson chiuso nel ciclo 10:58 e tenta il rientro controllato nel boundary RP come terzo incluso operativo. +- `not_drift`: non torna a phi/Sturmian, V_c, fit locali o graph-only; RP viene letto solo dopo endpoint gate e contro null row-aligned. +- `seed_residue`: restano non testati gli 8 domini GUE / 5 Poisson originali come perimetro largo, Anderson 3D e spettri fisici reali. +- `why_not_drift`: il sotto-perimetro e' regressivo perche' verifica se il prerequisito endpoint abilita il terzo incluso senza cancellare il residuo del seme. + +## Re-discovery audit +- **Baseline noto piu vicino**: Rosenzweig-Porter crossover, Brody interpolation, Berry-Robnik-like mixture, finite-size spectral crossover GUE/Poisson. +- **Cosa assorbe il baseline**: una finestra RP puo' collocarsi fra statistiche GUE e Poisson in size finite. +- **Cosa resta Lab-specific**: il contratto endpoint-gated: il terzo incluso viene letto solo dopo endpoint-null chiuso e con p-value raw/add-one dichiarato. +- **Separazione**: `two_reader_boundary_confirmed=[]`; `graph_only_residue=0`; `scope_change_declared=endpoint_gated_rp_boundary`; `graph_baseline_audit=non_applicabile:no_graph_reader`. + +## Claim Under Test +> RP e' boundary endpoint-gated se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra centroidi endpoint battono il null feature-scramble row-aligned. + +## Experiment Design +- **Script nuovo**: `tools/exp_endpoint_gated_rp_boundary.py`. +- **Run**: `python tools/exp_endpoint_gated_rp_boundary.py --out tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. +- **Endpoint gate**: stesso perimetro 10:58, 36 source rows; pass se `36/36` endpoint-stable e feature-scramble `add_one_p<=0.05`. +- **RP boundary candidate**: una source row RP passa se almeno `4/5` reader hanno `centroid_distance_balance >= 0.85` e bridge distance in `[0.35, 2.75]`. +- **P-value**: right-tail; `raw_p=k/N` e `add_one_p=(k+1)/(N+1)`, dove `k` e' il numero di null trial con candidate count almeno pari all'osservato. +- **Null RP**: 512 feature-scramble trial; dentro ogni reader, ogni feature viene permutata indipendentemente fra righe RP. Preserva marginali per feature/reader, rompe accoppiamento multivariato source row. + +## Results +| gate | observed | null k/N | raw_p | add_one_p | max null | lettura | +|---|---:|---:|---:|---:|---:|---| +| Endpoint feature-scramble | 36/36 | 0/512 | 0.000000000 | 0.001949318 | 2 | endpoint chiuso | +| Endpoint label permutation | 36/36 | 15/128 | 0.117187500 | 0.124031008 | 36 | null permissivo, solo continuita' | +| RP feature-scramble | 6/54 | 0/512 | 0.000000000 | 0.001949318 | 1 | residuo sopra null | + +| lambda | candidates | total | median balance | median bridge distance | +|---:|---:|---:|---:|---:| +| 0.045 | 2 | 18 | 0.614182 | 0.675690 | +| 0.060 | 3 | 18 | 0.632778 | 0.777805 | +| 0.075 | 1 | 18 | 0.588828 | 0.655661 | + +| size | candidates | total | lettura | +|---:|---:|---:|---| +| 128 | 6 | 18 | residuo concentrato | +| 192 | 0 | 18 | blank | +| 256 | 0 | 18 | blank | + +## Key Findings +1. Verificato: il gate endpoint GUE/Poisson resta chiuso sullo stesso denominatore del 10:58: `36/36`, feature-scramble `add_one_p=0.001949318`. +2. Verificato: il null label-permutation resta permissivo e viene riportato per continuita': `15/128`, `add_one_p=0.124031008`. +3. Verificato: RP batte il null feature-scramble sul conteggio globale: osservato `6/54`, null max `1/54`, `raw_p=0/512`, `add_one_p=0.001949318`. +4. Verificato: il supporto non trasferisce su size. Tutte le 6 candidate sono a `N=128`; `N=192` e `N=256` hanno `0/18`. +5. Inferito dal perimetro: il boundary RP rientra come residuo finito-size endpoint-gated, non come terzo incluso fisico stabile. + +## Verdict +CONSTRAINT + +Il terzo incluso RP esiste nel perimetro endpoint-gated solo come residuo `N=128`. Il null non lo assorbe, ma la size-stability lo blocca. Il prossimo ciclo deve separare due possibilita': residuo finito-size reale del lettore endpoint oppure boundary che si sposta con N. Non promuovere RP, Anderson 3D o sito pubblico finche' il residuo non sopravvive a una curva size preregistrata. + +## Bicono della scoperta +- **Due radici**: endpoint GUE/Poisson chiuso; RP bilanciato ma non size-stable. +- **Singolare**: source row RP prima della distanza dai centroidi endpoint. +- **Invariante di passaggio**: raw/add-one p-value dichiarati e stesso denominatore source row x reader. +- **Campo di possibilita**: possibile = boundary finito-size endpoint-gated; non-possibile = boundary fisico promosso senza trasferimento a `N=192/256`. + +## Consecutio +Il prossimo ciclo deve testare size-persistence del residuo endpoint-gated: fissare il criterio `4/5 reader`, mantenere il feature-scramble null, aumentare o riallineare le size, e chiedere se la finestra candidata resta non-zero fuori da `N=128`. Se resta `N=128` only, il nodo regressivo e' finite-size/reader calibration; se compare su size maggiori, il boundary torna candidato fisico. + +## Ricadute pratiche +ssp_value: yes. `tools/exp_endpoint_gated_rp_boundary.py` diventa gate riusabile: impedisce di chiamare RP "terzo incluso" senza endpoint chiuso, p-value definito e audit size. + +## Telemetria +- No API paid run: `ANTHROPIC_API_KEY` e `OPENAI_API_KEY` non presenti nell'ambiente. +- `python tools/dnd_scenario.py --best` eseguito: massimo discriminante locale su TRASCENDENZA_LIMITE; direzione BOUNDARY seguita per contratto vivo. +- `python -m py_compile tools/exp_endpoint_gated_rp_boundary.py` completato. +- Primo run fallito per import errato di `parse_floats`; riparato nel nodo regressivo dello script e rilanciato. +- Run completato: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. +- Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. +- Nessun update del seme. +- Nessuna promozione e nessun public sync. + +## Files +- Script: `tools/exp_endpoint_gated_rp_boundary.py` +- Data: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json` +- Report: `tools/data/reports/agent_20260516_1104.md` diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() codex Eseguito il ciclo e scritto il report richiesto: - Report: [agent_20260516_1104.md](/opt/MM_D-ND/tools/data/reports/agent_20260516_1104.md) - Script nuovo: [exp_endpoint_gated_rp_boundary.py](/opt/MM_D-ND/tools/exp_endpoint_gated_rp_boundary.py) - Data output: [endpoint_gated_rp_boundary_20260516_1104.json](/opt/MM_D-ND/tools/data/endpoint_gated_rp_boundary_20260516_1104.json) Risultato principale: endpoint GUE/Poisson chiuso, RP sopra null feature-scramble, ma tutte le candidate RP sono solo a `N=128`; quindi verdict `CONSTRAINT`, non promozione fisica del boundary. Ho verificato `py_compile` e il run completo. diff --git a/tools/data/reports/agent_20260516_1104.md b/tools/data/reports/agent_20260516_1104.md new file mode 100644 index 0000000000000000000000000000000000000000..fa9538f69f03574adceb507c7d45afc0b8544dee --- /dev/null +++ b/tools/data/reports/agent_20260516_1104.md @@ -0,0 +1,101 @@ +# Agent Report - Endpoint-Gated RP Boundary +**Date**: 2026-05-16 11:04 +**Piano**: 129 +**Tension explored**: BOUNDARY (0.8) +**verdict**: CONSTRAINT - Il gate endpoint GUE/Poisson resta chiuso (`36/36`, feature-scramble `raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`). RP produce 6/54 righe terzo-incluse contro null massimo 1/54 (`raw_p=0/512=0.0`, `add_one_p=1/513=0.001949318`), ma tutte le candidate sono a `N=128`; `N=192` e `N=256` restano blank. Il residuo RP e' finito-size, non boundary fisico promosso. +observables_registry: 1.0.0-2026-05-06 +observables_used: [SR, SR2, L1, L2, triple_var, brody_q, berry_robnick_like_gue_weight, endpoint_stable, endpoint_feature_scramble_null_counts, rp_boundary_candidate, centroid_distance_balance, rp_feature_scramble_null_counts, raw_p, add_one_p] +**observable_contract**: claim=RP e' terzo incluso endpoint-gated solo se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra i centroidi endpoint battono il null feature-scramble row-aligned; observable=`endpoint_stable`, `centroid_distance_balance`, `rp_boundary_candidate`, raw/add-one p-values; operator=centroidi endpoint GUE/Poisson calibrati, score RP per distanza bilanciata da entrambi i poli, null che preserva marginali per reader e rompe accoppiamento feature-riga; generator=GUE, Poisson, RP `H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE`; denominator=endpoint 36 source rows x 5 reader, RP 3 lambda x 3 size x 6 seed = 54 source rows x 5 reader; non_possible=terzo incluso se endpoint gate fallisce o null RP ricostruisce il numero osservato; not_tested=Anderson 3D, spettri sperimentali, limite N infinito, universalita analitica, nuova ricerca lambda. + +## Respiro fuori-tempo +- **Combo**: A9 terzo incluso + QxG continuo/discreto + nodo BOUNDARY del grafo + tensione seme "8 domini GUE, 5 Poisson". +- **Dipolo / punto-zero**: endpoint chiuso / boundary intermedio. Punto-zero: vettore osservabile prima della distanza dai due centroidi. +- **Piano superiore**: topologia assiomatica del bordo. Il boundary operator non legge RP finche' i poli GUE/Poisson non sono invarianti. +- **Operatori laterali scelti**: boundary operator e parallel transport. Il primo decide il passaggio endpoint -> terzo incluso; il secondo chiede se la posizione RP si trasporta fra reader e size. +- **Contaminazione cognitiva**: CE-0019 metabolizzata come combo prima della misura; CE-0001/KSAR usata per reiterare il gate 10:58 invece di cercare una nuova lambda; CE-0117 usata per trattenere la possibilita' solo se apre un boundary non assorbito dal null. +- **Proto-ipotesi**: dopo endpoint chiuso, RP e' terzo incluso se una riga resta bilanciata fra i due endpoint in almeno 4/5 reader e il null feature-scramble non ricostruisce quel conteggio. +- **Possibile/non-possibile**: possibile = leggere RP come boundary finito-size controllato; non-possibile = promuoverlo a confine fisico se il supporto non attraversa le size. +- **Proiezione**: misuro `rp_boundary_candidate` su lambda `0.045/0.060/0.075`, size `128/192/256`, 6 seed. +- **Movimento A->M->B**: fisico A = crossover spettrale GUE/Poisson/RP; matematica M = distanza bilanciata da centroidi endpoint in spazio osservabile; fisico B non emerge. Il ciclo consegna un vincolo di size-stability prima del rimbalzo fisico. + +## Aderenza alla direzione +- `relation`: `follows_direction` +- `why`: usa il filtro endpoint GUE/Poisson chiuso nel ciclo 10:58 e tenta il rientro controllato nel boundary RP come terzo incluso operativo. +- `not_drift`: non torna a phi/Sturmian, V_c, fit locali o graph-only; RP viene letto solo dopo endpoint gate e contro null row-aligned. +- `seed_residue`: restano non testati gli 8 domini GUE / 5 Poisson originali come perimetro largo, Anderson 3D e spettri fisici reali. +- `why_not_drift`: il sotto-perimetro e' regressivo perche' verifica se il prerequisito endpoint abilita il terzo incluso senza cancellare il residuo del seme. + +## Re-discovery audit +- **Baseline noto piu vicino**: Rosenzweig-Porter crossover, Brody interpolation, Berry-Robnik-like mixture, finite-size spectral crossover GUE/Poisson. +- **Cosa assorbe il baseline**: una finestra RP puo' collocarsi fra statistiche GUE e Poisson in size finite. +- **Cosa resta Lab-specific**: il contratto endpoint-gated: il terzo incluso viene letto solo dopo endpoint-null chiuso e con p-value raw/add-one dichiarato. +- **Separazione**: `two_reader_boundary_confirmed=[]`; `graph_only_residue=0`; `scope_change_declared=endpoint_gated_rp_boundary`; `graph_baseline_audit=non_applicabile:no_graph_reader`. + +## Claim Under Test +> RP e' boundary endpoint-gated se il gate GUE/Poisson resta chiuso e le righe RP bilanciate fra centroidi endpoint battono il null feature-scramble row-aligned. + +## Experiment Design +- **Script nuovo**: `tools/exp_endpoint_gated_rp_boundary.py`. +- **Run**: `python tools/exp_endpoint_gated_rp_boundary.py --out tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. +- **Endpoint gate**: stesso perimetro 10:58, 36 source rows; pass se `36/36` endpoint-stable e feature-scramble `add_one_p<=0.05`. +- **RP boundary candidate**: una source row RP passa se almeno `4/5` reader hanno `centroid_distance_balance >= 0.85` e bridge distance in `[0.35, 2.75]`. +- **P-value**: right-tail; `raw_p=k/N` e `add_one_p=(k+1)/(N+1)`, dove `k` e' il numero di null trial con candidate count almeno pari all'osservato. +- **Null RP**: 512 feature-scramble trial; dentro ogni reader, ogni feature viene permutata indipendentemente fra righe RP. Preserva marginali per feature/reader, rompe accoppiamento multivariato source row. + +## Results +| gate | observed | null k/N | raw_p | add_one_p | max null | lettura | +|---|---:|---:|---:|---:|---:|---| +| Endpoint feature-scramble | 36/36 | 0/512 | 0.000000000 | 0.001949318 | 2 | endpoint chiuso | +| Endpoint label permutation | 36/36 | 15/128 | 0.117187500 | 0.124031008 | 36 | null permissivo, solo continuita' | +| RP feature-scramble | 6/54 | 0/512 | 0.000000000 | 0.001949318 | 1 | residuo sopra null | + +| lambda | candidates | total | median balance | median bridge distance | +|---:|---:|---:|---:|---:| +| 0.045 | 2 | 18 | 0.614182 | 0.675690 | +| 0.060 | 3 | 18 | 0.632778 | 0.777805 | +| 0.075 | 1 | 18 | 0.588828 | 0.655661 | + +| size | candidates | total | lettura | +|---:|---:|---:|---| +| 128 | 6 | 18 | residuo concentrato | +| 192 | 0 | 18 | blank | +| 256 | 0 | 18 | blank | + +## Key Findings +1. Verificato: il gate endpoint GUE/Poisson resta chiuso sullo stesso denominatore del 10:58: `36/36`, feature-scramble `add_one_p=0.001949318`. +2. Verificato: il null label-permutation resta permissivo e viene riportato per continuita': `15/128`, `add_one_p=0.124031008`. +3. Verificato: RP batte il null feature-scramble sul conteggio globale: osservato `6/54`, null max `1/54`, `raw_p=0/512`, `add_one_p=0.001949318`. +4. Verificato: il supporto non trasferisce su size. Tutte le 6 candidate sono a `N=128`; `N=192` e `N=256` hanno `0/18`. +5. Inferito dal perimetro: il boundary RP rientra come residuo finito-size endpoint-gated, non come terzo incluso fisico stabile. + +## Verdict +CONSTRAINT + +Il terzo incluso RP esiste nel perimetro endpoint-gated solo come residuo `N=128`. Il null non lo assorbe, ma la size-stability lo blocca. Il prossimo ciclo deve separare due possibilita': residuo finito-size reale del lettore endpoint oppure boundary che si sposta con N. Non promuovere RP, Anderson 3D o sito pubblico finche' il residuo non sopravvive a una curva size preregistrata. + +## Bicono della scoperta +- **Due radici**: endpoint GUE/Poisson chiuso; RP bilanciato ma non size-stable. +- **Singolare**: source row RP prima della distanza dai centroidi endpoint. +- **Invariante di passaggio**: raw/add-one p-value dichiarati e stesso denominatore source row x reader. +- **Campo di possibilita**: possibile = boundary finito-size endpoint-gated; non-possibile = boundary fisico promosso senza trasferimento a `N=192/256`. + +## Consecutio +Il prossimo ciclo deve testare size-persistence del residuo endpoint-gated: fissare il criterio `4/5 reader`, mantenere il feature-scramble null, aumentare o riallineare le size, e chiedere se la finestra candidata resta non-zero fuori da `N=128`. Se resta `N=128` only, il nodo regressivo e' finite-size/reader calibration; se compare su size maggiori, il boundary torna candidato fisico. + +## Ricadute pratiche +ssp_value: yes. `tools/exp_endpoint_gated_rp_boundary.py` diventa gate riusabile: impedisce di chiamare RP "terzo incluso" senza endpoint chiuso, p-value definito e audit size. + +## Telemetria +- No API paid run: `ANTHROPIC_API_KEY` e `OPENAI_API_KEY` non presenti nell'ambiente. +- `python tools/dnd_scenario.py --best` eseguito: massimo discriminante locale su TRASCENDENZA_LIMITE; direzione BOUNDARY seguita per contratto vivo. +- `python -m py_compile tools/exp_endpoint_gated_rp_boundary.py` completato. +- Primo run fallito per import errato di `parse_floats`; riparato nel nodo regressivo dello script e rilanciato. +- Run completato: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json`. +- Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. +- Nessun update del seme. +- Nessuna promozione e nessun public sync. + +## Files +- Script: `tools/exp_endpoint_gated_rp_boundary.py` +- Data: `tools/data/endpoint_gated_rp_boundary_20260516_1104.json` +- Report: `tools/data/reports/agent_20260516_1104.md` diff --git a/tools/exp_endpoint_gated_rp_boundary.py b/tools/exp_endpoint_gated_rp_boundary.py new file mode 100644 index 0000000000000000000000000000000000000000..da98b5eeac614de4fbae708dc62c783d0d485ea2 --- /dev/null +++ b/tools/exp_endpoint_gated_rp_boundary.py @@ -0,0 +1,312 @@ +#!/usr/bin/env python3 +""" +Endpoint-gated RP boundary test. + +This cycle starts from the closed GUE/Poisson endpoint gate and only then asks +whether RP rows occupy a third-included position between the two endpoint +centroids. The null preserves per-reader feature marginals and breaks the +row-level RP feature coupling. +""" + +from __future__ import annotations + +import argparse +import json +from collections import defaultdict +from pathlib import Path +from typing import Any + +import numpy as np + +from exp_boundary_unfolding_transfer_matrix import parse_floats, rp_gaps +from exp_endpoint_feature_scramble_null import ( + count_histogram, + feature_scramble_null_counts, + tail_stats, +) +from exp_endpoint_stability_filter import ( + FEATURE_NAMES, + build_rows, + feature_vector, + fit_reader_centroids, + null_success_counts, + parse_ints, + read_gaps, + score_sources, +) +from exp_rosenzweig_porter_bridge_physical_audit import OBSERVABLES_REGISTRY_VERSION + + +def readers(local_windows: str) -> list[str]: + return ["global_mean"] + [ + f"{mode}:w{window}" + for mode in ("exact_local", "odd_coerced") + for window in parse_ints(local_windows) + ] + + +def build_rp_rows(args: argparse.Namespace) -> list[dict[str, Any]]: + rows = [] + for n in parse_ints(args.sizes): + for seed_idx, seed in enumerate(parse_ints(args.test_seeds)): + for lam in parse_floats(args.rp_lambdas): + gaps = rp_gaps( + lam, + n, + args.reps, + seed + n * 1019 + int(round(lam * 10000)), + args.central_fraction, + ) + source_id = f"RP_lambda_{lam:.3f}_N{n}_s{seed_idx}" + for reader in readers(args.local_windows): + features = feature_vector(read_gaps(gaps, reader), args.grid_size) + rows.append( + { + "source_id": source_id, + "source_type": "RP", + "lambda": round(float(lam), 6), + "n": n, + "seed": seed, + "reader": reader, + "n_spacings": int(len(gaps)), + "features": {key: round(value, 9) for key, value in features.items()}, + } + ) + return rows + + +def classify_boundary_reader(row: dict[str, Any], model: dict[str, Any], args: argparse.Namespace) -> dict[str, Any]: + item = model[row["reader"]] + vector = np.array([row["features"][name] for name in FEATURE_NAMES], dtype=float) + distances = {} + for label, centroid in item["centroids"].items(): + delta = (vector - centroid) / item["scale"] + distances[label] = float(np.linalg.norm(delta) / np.sqrt(len(FEATURE_NAMES))) + d_gue = distances["GUE"] + d_poisson = distances["Poisson"] + denom = d_gue + d_poisson + balance = 1.0 - abs(d_gue - d_poisson) / denom if denom > 1e-12 else 0.0 + bridge_distance = min(d_gue, d_poisson) + pass_reader = bool( + balance >= args.min_balance + and bridge_distance >= args.min_bridge_distance + and bridge_distance <= args.max_bridge_distance + ) + return { + "distance_gue": round(d_gue, 6), + "distance_poisson": round(d_poisson, 6), + "balance": round(balance, 6), + "bridge_distance": round(bridge_distance, 6), + "boundary_reader_pass": pass_reader, + } + + +def score_rp_sources(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]: + reader_rows = [] + by_source: dict[str, list[dict[str, Any]]] = defaultdict(list) + for row in rows: + judged = {**row, **classify_boundary_reader(row, model, args)} + reader_rows.append(judged) + by_source[row["source_id"]].append(judged) + + source_rows = [] + for source_id, items in sorted(by_source.items()): + passes = sum(1 for item in items if item["boundary_reader_pass"]) + balances = [item["balance"] for item in items] + distances = [item["bridge_distance"] for item in items] + source_rows.append( + { + "source_id": source_id, + "lambda": items[0]["lambda"], + "n": items[0]["n"], + "seed": items[0]["seed"], + "reader_passes": passes, + "reader_total": len(items), + "median_balance": round(float(np.median(balances)), 6), + "min_balance": round(float(min(balances)), 6), + "median_bridge_distance": round(float(np.median(distances)), 6), + "boundary_candidate": bool(passes >= args.min_reader_passes), + "reader_scores": [ + { + "reader": item["reader"], + "balance": item["balance"], + "bridge_distance": item["bridge_distance"], + "pass": item["boundary_reader_pass"], + } + for item in items + ], + } + ) + return reader_rows, source_rows + + +def scramble_rows(rows: list[dict[str, Any]], rng: np.random.Generator) -> list[dict[str, Any]]: + scrambled = [{**row, "features": dict(row["features"])} for row in rows] + by_reader: dict[str, list[int]] = defaultdict(list) + for idx, row in enumerate(scrambled): + by_reader[row["reader"]].append(idx) + for indices in by_reader.values(): + for feature in FEATURE_NAMES: + values = [scrambled[idx]["features"][feature] for idx in indices] + rng.shuffle(values) + for idx, value in zip(indices, values): + scrambled[idx]["features"][feature] = value + return scrambled + + +def rp_feature_scramble_counts(rows: list[dict[str, Any]], model: dict[str, Any], args: argparse.Namespace) -> list[int]: + rng = np.random.default_rng(args.rp_scramble_seed) + counts = [] + for _ in range(args.rp_scramble_trials): + _, source_rows = score_rp_sources(scramble_rows(rows, rng), model, args) + counts.append(sum(1 for row in source_rows if row["boundary_candidate"])) + return counts + + +def lambda_summary(source_rows: list[dict[str, Any]]) -> dict[str, Any]: + out = {} + for lam in sorted({row["lambda"] for row in source_rows}): + group = [row for row in source_rows if row["lambda"] == lam] + out[f"{lam:.3f}"] = { + "boundary_candidates": sum(1 for row in group if row["boundary_candidate"]), + "total": len(group), + "median_balance": round(float(np.median([row["median_balance"] for row in group])), 6), + "median_bridge_distance": round(float(np.median([row["median_bridge_distance"] for row in group])), 6), + } + return out + + +def run(args: argparse.Namespace) -> dict[str, Any]: + calibration_rows = build_rows(args, "calibration", parse_ints(args.calibration_seeds)) + endpoint_test_rows = build_rows(args, "test", parse_ints(args.test_seeds)) + model = fit_reader_centroids(calibration_rows) + + _, endpoint_sources = score_sources(endpoint_test_rows, model, args.min_margin) + endpoint_observed = sum(1 for row in endpoint_sources if row["endpoint_stable"]) + label_counts = null_success_counts(calibration_rows, endpoint_test_rows, args) + endpoint_feature_counts = feature_scramble_null_counts(endpoint_test_rows, model, args) + + rp_rows = build_rp_rows(args) + rp_reader_rows, rp_source_rows = score_rp_sources(rp_rows, model, args) + rp_observed = sum(1 for row in rp_source_rows if row["boundary_candidate"]) + rp_null_counts = rp_feature_scramble_counts(rp_rows, model, args) + + output = { + "experiment": "endpoint_gated_rp_boundary", + "question": "After endpoint closure, do RP rows form a third-included boundary against a row-aligned feature-scramble null?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "endpoint_stable", + "endpoint_feature_scramble_null_counts", + "rp_boundary_candidate", + "centroid_distance_balance", + "rp_feature_scramble_null_counts", + "raw_p", + "add_one_p", + ], + "parameters": { + "sizes": parse_ints(args.sizes), + "calibration_seeds": parse_ints(args.calibration_seeds), + "test_seeds": parse_ints(args.test_seeds), + "reps": args.reps, + "rp_lambdas": parse_floats(args.rp_lambdas), + "local_windows": parse_ints(args.local_windows), + "min_margin": args.min_margin, + "min_balance": args.min_balance, + "min_bridge_distance": args.min_bridge_distance, + "max_bridge_distance": args.max_bridge_distance, + "min_reader_passes": args.min_reader_passes, + "label_null_trials": args.label_null_trials, + "feature_scramble_trials": args.feature_scramble_trials, + "rp_scramble_trials": args.rp_scramble_trials, + }, + "threshold_preregistered": { + "endpoint_gate": f"36/36 endpoint rows stable and endpoint feature-scramble add_one_p <= {args.alpha}", + "rp_boundary_candidate": f"source row has at least {args.min_reader_passes}/5 readers with centroid balance >= {args.min_balance} and bridge_distance in [{args.min_bridge_distance}, {args.max_bridge_distance}]", + "p_value_definition": "right tail; raw_p=k/N and add_one_p=(k+1)/(N+1), where k is null trials with candidate count >= observed", + }, + "observable_contract": { + "claim": "RP is an endpoint-gated third-included boundary only if endpoint closure holds and RP candidate count beats row-aligned feature-scramble nulls", + "observable": "endpoint_stable count, RP centroid-distance balance count, raw/add-one p-values", + "operator": "calibrate GUE/Poisson endpoint centroids; score RP rows by balanced distance to both endpoint centroids; compare to feature-scrambled RP rows", + "generator": "GUE matrices, Poisson exponential spacings, RP H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE", + "denominator": "endpoint: 36 source rows x 5 readers; RP: lambda x size x test seed source rows x 5 readers", + "non_possible": "third included if endpoint gate fails or RP feature-scramble null reaches the observed candidate count", + "not_tested": "Anderson 3D, experimental spectra, N to infinity, analytic universality, new lambda search", + }, + "endpoint_gate": { + "observed_successes": endpoint_observed, + "observed_total": len(endpoint_sources), + "label_permutation": { + "histogram": count_histogram(label_counts), + "tail_stats": tail_stats(label_counts, endpoint_observed), + }, + "feature_scramble": { + "histogram": count_histogram(endpoint_feature_counts), + "tail_stats": tail_stats(endpoint_feature_counts, endpoint_observed), + }, + "pass": bool( + endpoint_observed == len(endpoint_sources) + and tail_stats(endpoint_feature_counts, endpoint_observed)["add_one_p"] <= args.alpha + ), + }, + "rp_boundary": { + "observed_candidates": rp_observed, + "observed_total": len(rp_source_rows), + "by_lambda": lambda_summary(rp_source_rows), + "feature_scramble": { + "histogram": count_histogram(rp_null_counts), + "tail_stats": tail_stats(rp_null_counts, rp_observed), + }, + "pass": bool( + rp_observed > 0 + and tail_stats(rp_null_counts, rp_observed)["add_one_p"] <= args.alpha + ), + }, + "source_rows": { + "endpoint": endpoint_sources, + "rp": rp_source_rows, + }, + "reader_rows": { + "rp": rp_reader_rows, + }, + } + out = Path(args.out) + out.parent.mkdir(parents=True, exist_ok=True) + out.write_text(json.dumps(output, indent=2, sort_keys=True) + "\n", encoding="utf-8") + print(json.dumps({ + "endpoint_gate": output["endpoint_gate"], + "rp_boundary": output["rp_boundary"], + }, indent=2, sort_keys=True)) + return output + + +def main() -> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/endpoint_gated_rp_boundary_20260516_1104.json") + parser.add_argument("--sizes", default="128,192,256") + parser.add_argument("--calibration-seeds", default="202605161101,202605161102,202605161103,202605161104") + parser.add_argument("--test-seeds", default="202605161105,202605161106,202605161107,202605161108,202605161109,202605161110") + parser.add_argument("--reps", type=int, default=6) + parser.add_argument("--rp-lambdas", default="0.045,0.060,0.075") + parser.add_argument("--central-fraction", type=float, default=0.6) + parser.add_argument("--local-windows", default="9,12") + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--min-margin", type=float, default=0.15) + parser.add_argument("--min-balance", type=float, default=0.85) + parser.add_argument("--min-bridge-distance", type=float, default=0.35) + parser.add_argument("--max-bridge-distance", type=float, default=2.75) + parser.add_argument("--min-reader-passes", type=int, default=4) + parser.add_argument("--label-null-trials", type=int, default=128) + parser.add_argument("--null-seed", type=int, default=202605161045) + parser.add_argument("--feature-scramble-trials", type=int, default=512) + parser.add_argument("--feature-scramble-seed", type=int, default=202605161058) + parser.add_argument("--rp-scramble-trials", type=int, default=512) + parser.add_argument("--rp-scramble-seed", type=int, default=202605161104) + parser.add_argument("--alpha", type=float, default=0.05) + run(parser.parse_args()) + + +if __name__ == "__main__": + main() tokens used 109,482 Eseguito il ciclo e scritto il report richiesto: - Report: [agent_20260516_1104.md](/opt/MM_D-ND/tools/data/reports/agent_20260516_1104.md) - Script nuovo: [exp_endpoint_gated_rp_boundary.py](/opt/MM_D-ND/tools/exp_endpoint_gated_rp_boundary.py) - Data output: [endpoint_gated_rp_boundary_20260516_1104.json](/opt/MM_D-ND/tools/data/endpoint_gated_rp_boundary_20260516_1104.json) Risultato principale: endpoint GUE/Poisson chiuso, RP sopra null feature-scramble, ma tutte le candidate RP sono solo a `N=128`; quindi verdict `CONSTRAINT`, non promozione fisica del boundary. Ho verificato `py_compile` e il run completo.