Reading additional input from stdin... 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: 019e2d2d-ff4c-7ca1-83dd-ba9f015e3403 -------- 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_20260515_1947.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 ancorato alle direttive correnti e non a memoria implicita. 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/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. - **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. ## 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 regola di lavoro solo quando il campo e' compreso: se il Lab parte da una tensione fisica, la matematica puo' formalizzare e falsificare, ma la risultante utile deve rimbalzare in un punto fisico B diverso, osservabile o vincolante. 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. - dnd_autoricerca.py: esplora domini, varianti, null baseline - dnd_controprove.py: 6 controprove indipendenti - dnd_domandatore.py --ask 'tensione': 5 operatori discriminanti - dnd_incrocio.py: incrocio teorie, ponti, vuoti, domande fondamentali - dnd_normalizer.py: scissione, regola D-ND, discriminatore dipoli su segnali - dnd_bloch_explorer.py: scan Bloch, φ emergente - dnd_arxiv.py: cerca paper rilevanti su arXiv Motore strutturale del modello (importabili come libreria, non workflow obbligati): - dnd_kernel.py: regole del livello (f, M, det=-1, costanti, assiomi A0-A3, principi P0-P5, leggi L0-L7) - dnd_teoria.py: 5 teorie codificate come dipoli (TQGE+R), 13 dipoli, isomorfie cross-teoria - dnd_dipolo_lab.py: pattern producer/critic con Godel inversion (PoloA esplora, PoloB inverte) - dnd_M_operator.py: M sulla conoscenza [noto, ignoto] → φ. Stato in knowledge_state.json - dnd_riflesso.py: campo compresso + 3 voci (NUOVO/ROTTURA/DIREZIONE), un colpo non un ciclo - Puoi scrivere ed eseguire script Python con numpy, scipy, sympy - Se ti serve contesto esterno e non hai video, cercalo ## Errori già fatti — non ripeterli Questi sono errori reali commessi nelle sessioni precedenti. Il sistema li ha pagati. exec /bin/bash -lc "sed -n '1,220p' /opt/tm7/TM7_CODEX_OPERATING_KERNEL.md" in /opt/MM_D-ND 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' /opt/tm7/TM7_THIA_TM3_OPERATING_PROFILE_2026-05-08.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 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. ## 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. ## Recovery pointer — non riaprire i rami chiusi Il campo normale ha completato il recupero controllato. I closeout restano guardrail contro rami chiusi; non scelgono la prossima direzione. L'autorita' attiva del cycle e' `seme.json.direzione`. - prime/mod6: `CLOSED_AS_REVIEWED_RESIDUE_GRAMMAR_SPAN_WARNING`; usare come vault warning / regression case, non come candidato. - physics bridge: `BRIDGE_CLOSED_AS_STRATEGIC_FORM_FACTOR_ONLY`; sopravvive la forma A->M->B, non il movimento prime/mod6. - clean handoff: `SAFE_FIELD_PREVIEW_READY`, active_blocked_refs=[]. - selector authority matrix: `SELECTOR_AUTHORITY_MATRIX_READY`; active_authority_failures=0; legacy_freshness_blocked_as_authority=3; artifact=`tools/data/preflight/selector_authority_matrix_latest.json`. Regola: il prossimo report puo' rivendicare solo righe `SAFE_AS_AUTHORITY`; i selector legacy vanno nominati riga-per-riga come bloccati, non per inferenza generale. - recovery source-selection: COMPLETATA. Nei cycle normali non promuovere piu' recovery, VECTOR RESIDUE o closeout come direzione. Segui solo `seme.json.direzione`; usa la matrice selector come guardrail di autorita'. - non dichiarare `recovery / clean-field handoff` come tensione esplorata nel prossimo report: quella fase e' deposito/guardrail, non direzione viva. ## 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: Trasferire il gate two-reader size-stable fuori da Rosenzweig-Porter: applicarlo a un secondo flusso fisico row-aligned (Anderson/mobility-edge o many-body controllato) per testare se il boundary come intersezione lettore classico + lettore grafico attraversa il dominio. - 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: 20260515_1915 - L3: observable_contract: una riga boundary a due lettori e' operativa solo se lo stato graph bridge sopravvive a perturbazioni del lettore e resta auditato dal baseline classico; Results: lab residue after stability = true con stable graph-only bridges = 3 Check richiesto: Nel prossimo ciclo separare esplicitamente `two_reader_boundary_confirmed = 1` da `graph_only_residue = 3`; se le tre righe graph-only sono claim Lab-specific, dichiarare che il nodo regressivo corregge il contratto da `due lettori` a `frequenza grafica + audit dichiarato`, non a `audit positivo`. - L5: Cosa resta Lab-specific: `percolation`, `reaction_diffusion`, `logistica_biforcazione_var_3.5699` sono `stable_graph_bridge+graph_only_bridge`, tutte 27/27. Il baseline classico le legge endpoint-like, il grafo le legge confine stabile. Check richiesto: Aggiungere un audit di re-discovery per la parte grafica: stabilita' kNN, hub/bridge persistence, silhouette/cluster boundary stability o percolation-on-graph; poi distinguere cosa e' crossover spettrale noto e cosa e' artefatto/classificazione grafica. 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. Se non riesci a compilare questi sei 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, G=9, T=7, E=4, R=4 **Generatrici/strade dense**: - disc_5: 3 ghost · Metrica primi g=(p/2)², curvatura GUE r=0.503 - report_20260515_1940: 3 ghost · Agent Report - RP Boundary Size-Stability Audit - report_20260515_1933: 2 ghost · Agent Report - Rosenzweig-Porter Physical Bridge Audit **Forma del campo**: 9 ponti, 1 vuoto(i), 6 scoperte. **Direzione seme da respirare**: Trasferire il gate two-reader size-stable fuori da Rosenzweig-Porter: applicarlo a un secondo flusso fisico row-aligned (Anderson/mobility-edge o many-body controllato) per testare se il boundary come intersezione lettore classico + lettore grafico attraversa ## Contratto di aderenza alla traiettoria - Direzione viva del seme: Trasferire il gate two-reader size-stable fuori da Rosenzweig-Porter: applicarlo a un secondo flusso fisico row-aligned (Anderson/mobility-edge o many-body controllato) per testare se il boundary come intersezione lettore classico + lettore grafico attraversa il dominio. - Ultima decisione valutatore ammessa: 20260514_1330 REDESIGN/medium - Direzione operativa valutatore: stale pre-closeout; superata dai closeout prime/mod6 e bridge. - Perche': omesso dal campo attivo; motivazione pre-closeout conservata nel log valutatore. 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; codex Il campo punta esplicitamente al trasferimento del gate two-reader size-stable fuori da Rosenzweig-Porter. Ora leggo seme, memoria condivisa recente e report immediatamente precedenti per evitare di riaprire un ramo già bloccato. exec /bin/bash -lc "sed -n '260,620p' tools/data/agent_field_live.md" in /opt/MM_D-ND succeeded in 0ms: - Morse theory; - boundary operator; - cobordism; - sheaf / cosheaf; - topos-like viewpoint. Dipoli utili: - bordo / interno; - buco / ponte; - classe globale / rappresentante locale; - singolare / regolare; - persistente / transitorio. Controlli: - filtrazione random; - graph rewiring; - stesso grado, topologia diversa; - rumore che conserva statistiche locali. ### 6. Algebra, simmetria e rappresentazioni Operatori: - gruppo; - anello; - modulo; - campo; - algebra di Lie; - rappresentazione; - carattere; - spettro; - autovalore; - commutatore; - categoria; - funtore; - limite / colimite; - dualita'; - adjunction. Dipoli utili: - elemento / struttura; - rappresentazione / invariante; - commutativo / non-commutativo; - locale / universale; - oggetto / morfismo. Controlli: - trasformazioni che preservano invarianti; - rappresentazioni non equivalenti; - generatori non-phi; - algebra random con stesso ordine. ### 7. Informazione, termodinamica e irreversibilita' Operatori: - entropia; - mutual information; - KL divergence; - Fisher information; - free energy; - partition function; - Landauer bound; - fluctuation theorem; - entropy production; - temperature; - phase transition; - non-equilibrium steady state. Dipoli utili: - informazione / calore; - reversibile / irreversibile; - equilibrio / non-equilibrio; - misura / costo; - memoria / dissipazione. Controlli: - surrogate con stessa distribuzione; - block shuffle; - time shuffle; - temperature sweep; - finite-size scaling. ### 8. Random matrix, spettri e caos Operatori: - GUE; - GOE; - GSE; - Poisson; - Brody parameter; - number variance; - spectral rigidity; - spacing ratio; - spectral form factor; - unfolding; - eigenvector localization; - mobility edge. Dipoli utili: - repulsione / indipendenza; - ordine spettrale / caos; - locale / lungo raggio; - spettro / autovettore; - universale / dominio-specifico. Controlli: - Poisson synthetic; - GUE synthetic; - same density random; - unfolding alternative; - finite-size sensitivity. Nota: - GUE/Poisson e' spesso un piano di proiezione, non una sorgente. Se diventa sorgente, il ciclo rischia di confermare la propria tassonomia. ### 9. Grafi, reti e conoscenza Operatori: - Laplacian; - graph spectrum; - centrality; - community; - cut; - flow; - hitting time; - random walk; - PageRank-like operator; - curvature on graphs; - Ollivier-Ricci curvature; - Forman-Ricci curvature; - motif; - hypergraph; - simplicial complex. Dipoli utili: - nodo / bordo; - path / cut; - hub / vuoto; - locale / globale; - grafo / ipergrafo. Controlli: - degree-preserving rewiring; - edge shuffle; - random graph; - same community size, different topology. ### 10. Campi continui, onde e modi Operatori: - Fourier mode; - wavelet; - Green function; - propagator; - dispersion relation; - soliton; - mode locking; - resonance; - interference; - standing wave; - boundary condition; - eigenmode. Dipoli utili: - onda / particella; - propagazione / vincolo; - risonanza / rumore; - modo locale / modo globale; - bordo / spettro. Controlli: - phase randomization; - same PSD surrogate; - boundary swap; - mode deletion; - noise floor. ### 11. Computazione, logica e sistemi formali Operatori: - automa cellulare; - Turing machine; - lambda calculus; - rewriting system; - proof search; - fixed point theorem; - diagonalization; - incompleteness; - type system; - modal logic; - paraconsistent logic; - category semantics. Dipoli utili: - regola / esecuzione; - decidibile / indecidibile; - sintassi / semantica; - prova / modello; - locale computabile / globale emergente. Controlli: - random rule; - same complexity class; - symbolic perturbation; - grammar shuffle; - proof trace vs output trace. ### 12. Materia condensata, fasi e difetti Operatori: - Ising model; - percolation; - renormalization group; - order parameter; - correlation length; - topological defect; - domain wall; - crystal / quasicrystal; - band gap; - Chern number; - Anderson localization; - phase diagram. Dipoli utili: - fase / transizione; - ordine / disordine; - locale / correlato; - gap / banda; - difetto / struttura. Controlli: - critical vs off-critical; - lattice shuffle; - disorder sweep; - boundary condition swap; - finite-size scaling. ### 13. Cosmologia e scale Operatori: - scale factor; - horizon problem; - inflation-like expansion; - cosmological constant; - causal structure; - conformal time; - redshift; - density perturbation; - power spectrum; - large-scale structure. Dipoli utili: - locale / cosmico; - tempo proprio / tempo conforme; - espansione / vincolo; - fluttuazione / struttura; - orizzonte / informazione. Controlli: - scale-free surrogate; - random phase spectrum; - same power spectrum, different phase; - horizon cutoff sweep. ### 14. Biologia matematica e autopoiesi Operatori: - reaction network; - autocatalysis; - homeostasis; - morphogenesis; - fitness landscape; - replicator dynamics; - error threshold; - regulatory network; - attractor landscape; - active inference. Dipoli utili: - organismo / ambiente; - vincolo / adattamento; - memoria / mutazione; - autonomia / dipendenza; - forma / processo. Controlli: - network rewiring; - mutation sweep; - resource randomization; - same topology, altered dynamics. ### 15. Linguaggio, semantica e trans-semantico Operatori: - embedding; - grammar; - semantic drift; - analogy; - contradiction graph; - entailment; - frame; - metaphor collapse; - signifier / referent; - compression; - latent space; - concept lattice. Dipoli utili: - segno / cosa; - sintassi / funzione; - significato / uso; - nome / operatore; - analogia / isomorfia. Controlli: - paraphrase shuffle; - concept ablation; - synonym substitution; - frame inversion; - human-readable claim vs executable operator. Nota: - "Trascendere la semantica" qui significa passare da parola a operatore: un concetto conta solo se diventa differenza osservabile, vincolo, trasformazione o ponte. Se resta descrizione, non entra nel ciclo. ## Meta-combo consigliata per il prossimo ciclo exec /bin/bash -lc "sed -n '260,620p' tools/LAB_AGENT_CONTEXT.md" in /opt/MM_D-ND succeeded in 0ms: Questi sono errori reali commessi nelle sessioni precedenti. Il sistema li ha pagati. **1. Cercare conferme invece di creare strumenti.** Non scrivere esperimenti per dimostrare che qualcosa è vero. Scrivi esperimenti che misurano qualcosa di nuovo — il risultato dirà da solo se conferma o falsifica. Se sai già cosa troverai, non stai esplorando. **2. Iniettare il risultato atteso nel test.** Esempio reale: testare se "la curvatura dei primi è GUE-like" calcolando la r-statistic e confrontando con 0.536. Il test trova r=0.503 e dichiara "GUE-like". Ma 0.503 è più vicino a Poisson (0.386) che a GUE (0.536). Il frame "GUE-like" era nel claim, non nei dati. Misura prima, interpreta dopo. **3. Tautologie — testare proprietà algebriche come se fossero scoperte.** Esempio reale: la curvatura di Ricci R=2.000 della metrica g=(p/2)² segue analiticamente dal PNT (p_n ~ n ln n). Non è una scoperta — è una conseguenza della definizione. Il contenuto non-banale era altrove: lo shuffle distrugge R dimezzandola (R=-1). Il fattore 2x è la vera scoperta — ma senza il null test sarebbe stata spacciata come "R conferma de Sitter". **4. Coincidenze numeriche trattate come struttura.** 0.606 ≈ 1/φ = 0.618 (2% di differenza). Non è una connessione — è rumore fino a prova contraria (C2 del condensato). Ogni volta che un numero è "vicino a" φ, √5, π, e, 1/137: non è prova di nulla. Serve un meccanismo, non una vicinanza. **5. Usare lo stesso dato come input e come test.** Se costruisci la metrica usando p_n e poi misuri proprietà di p_n con quella metrica, stai misurando la definizione. Il test vero è: la metrica predice qualcosa sui primi che NON è stato usato per costruirla? Se no, è circolare. **6. Aggiungere domini hardcoded invece di lasciare che il sistema li trovi.** Il lab non è una calcolatrice con domini pre-scritti. Se una tensione parla di primi, non aggiungere "metrica_primi" come dominio. Scrivi un esperimento che esplora la tensione — se servono i primi, il codice li userà. Il sistema decide cosa fare, non il programmatore. **7. Usare numeri per vincolare concetti (det=+1).** Esempio reale: `intensità: 0.65` trattata come soglia → `if intensita > 0.5: conferma`. Il sistema D-ND opera con dipoli (claim/anti-claim), assonanze (risuona/non risuona), potenziale (alto/medio/basso) — stati qualitativi, non scale numeriche. Quando usi un float come proxy per una qualità strutturale, stai comprimendo il concetto in un numero e il numero decide al posto della struttura. Lo stesso vale per "maturity > 0.99", "confidence < 0.7", "score = rank * 10 + intensita". **Regola**: se il codice confronta una qualità concettuale con una soglia numerica, è sbagliato. Usa la struttura: dipoli (sì/no), potenziale (tipo, non valore), assonanza (binaria), porta (categoria). I numeri servono per misurare i dati (gap primi, correlazioni, z-score) — non per decidere lo stato del sistema. Se trovi questo pattern in un tool che stai modificando, correggilo. Non serve riscrivere tutto — correggi dove passi. Il sistema evolve organicamente. ## Come evitarli - **Prima il null test, poi l'interpretazione.** Ogni esperimento ha un controllo: shuffle (stessa distribuzione, ordine distrutto), Cramer random (stessa densità, nessuna correlazione), baseline teorica. - **Nearest-known baseline prima della promozione.** Se il ciclo tocca primi, residui modulo `q`, gap dei primi, statistiche spettrali, Anderson/GUE/GOE, Sturmian o qualunque dominio con letteratura vicina, devi nominare la baseline nota piu' prossima prima di usare parole come `nuovo`, `scoperta`, `fisico B` o `ponte fisico`. Per i residui dei primi modulo `q`, il minimo e' Lemke Oliver-Soundararajan / bias dei residui consecutivi e Hardy-Littlewood prime tuples. Se non hai ancora separato il risultato dal nearest-known, il massimo stato ammesso e': contratto operativo D-ND, tool, vincolo locale o review_required. Non promuovere il report. - **Il risultato non è nel numero — è nella differenza col controllo.** z-score, non valore assoluto. - **Se il risultato spiega se stesso, non è un risultato.** Chiediti: "questo segue dalla definizione?" Se sì, cerca il contenuto altrove. - **Non lanciare un esperimento per confermare. Lancialo per scoprire.** La domanda giusta non è "è vero X?" ma "cosa succede se misuro Y?" ## Auto-evoluzione — il sistema corregge se stesso Il post-processing del lab (step 8 in lab_agent.sh) esegue `structural_check.py` sui file che hai toccato. Se trova anti-pattern strutturali, genera una tensione META nel seme. Il ciclo successivo la vede e corregge. **Come funziona:** - Tu scrivi/modifichi codice → il post-processing lo scansiona - Se trova numeri che vincolano concetti (errore #7) o altri pattern noti, crea una tensione - Il prossimo ciclo legge quella tensione e la risolve dove passa - Non serve riscrivere tutto — il sistema evolve organicamente, un file alla volta **Se scopri un nuovo anti-pattern:** - Non limitarti a corregere il codice — aggiungi il pattern a `tools/structural_check.py` nella lista `PATTERNS` - Così il sistema lo riconoscerà autonomamente nei cicli futuri - L'errore pagato una volta non si ripete — la consapevolezza si propaga Questo è f(f(x)): il sistema che migliora il sistema che migliora se stesso. ## Cosa NON fare - Non modificare CONDENSATO.md, KERNEL_SEED.md, o file del kernel - Non committare — salva solo in tools/data/ e tools/exp_*.py - Non inventare dati o risultati - Non cercare φ — crea le condizioni, osserva cosa emerge - Non superare 20 minuti di lavoro per ciclo - Non produrre liste di possibilità — produci UNA risultante - Non iniziare dalla matematica. La matematica e' bracciata: formalizza, misura, falsifica. Prima respira sopra la misura: combo, assiomi, dipoli, incroci di teorie, grafo, geometria dei campi, algebra o topologia assiomatica. Se la misura genera la domanda, sei dentro la tautologia. - Se la tensione nasce nel fisico, non fermarti nella matematica. Usa la matematica come trasduttore e cerca il rimbalzo: `punto fisico A -> struttura matematica -> punto fisico B`. Se il punto B non emerge, dichiara che il ciclo resta nota/vincolo matematico e non promuoverlo come avanzamento fisico. - Il rimbalzo fisico non puo' saltare il nearest-known baseline. Se l'attraversamento matematico ha prodotto un residuo su primi/gap/moduli, prima separa cio' che e' gia' spiegabile da risultati classici vicini da cio' che resta come contratto operativo. Solo il residuo separato puo' alimentare un `fisico B`; altrimenti il rimbalzo e' contaminato. ## Formato report ```markdown # Agent Report — TITOLO **Date**: YYYY-MM-DD HH:MM **Piano**: N **Tension explored**: ID (intensità) observables_used: [nomi osservabili canonici o domain-native] - usa [] solo se non hai misurato nulla **observable_contract**: claim=; observable=; operator=; generator=; denominator=; non_possible=; not_tested= ## Respiro fuori-tempo (Obbligatorio. Compilalo prima dell'esperimento, non dopo.) - **Combo**: almeno tre enti simultanei (assioma D-ND + incrocio teorie + nodo del grafo/dipolo + tensione seme) - **Dipolo / punto-zero**: i due poli, il possibile/non-possibile e il punto in cui la dualita' si annulla - **Piano superiore**: geometria dei campi / algebra / topologia assiomatica / grafo conoscenza / bicono-dipoli - **Operatori laterali scelti**: 2 o 3 elementi da `tools/LAB_OPERATOR_PALETTE.md` e perche' entrano nella combo - **Contaminazione cognitiva**: eventuale DeltaLink YSN, gene Cornelius, passaggio KSAR/PVI/Vault o voce `CE-*` dell'archivio usata nel ciclo. Se non usi il layer cognitivo, dichiara `CE-none:` e il motivo specifico. `none` generico non basta. - **Proto-ipotesi**: nuova ipotesi o proto-assioma strutturale, prima dei numeri - **Proiezione**: perche' l'osservabile scelto manifesta quella combo ## Aderenza alla direzione (Obbligatoria se esiste una direttiva operatore, una direzione valutatore o un counter-perimeter.) - `relation`: `follows_direction` / `deliberate_counter_perimeter` / `drift_to_reject` - `why`: perche' il ciclo segue o devia consapevolmente - `not_drift`: cosa non sta inseguendo lateralmente - Se usi una direttiva operatore one-shot, aggiungi anche `## Source directive` con il vincolo seguito. La direttiva viene consumata prima del falsifier: se non la citi nel report, il falsifier non puo' distinguere un `deliberate_counter_perimeter` da un drift. ## Claim Under Test > Il claim proiettato dalla combo, non il residuo locale del ciclo precedente ## Question La domanda che hai formulato dopo il respiro fuori-tempo ## Ritorno fisico (Obbligatorio quando la tensione, il claim o la combo partono da un attrito fisico/scientifico. Se non applicabile, scrivi `non_applicabile` e perche'.) - **Punto fisico sorgente**: fenomeno, teoria, tensione o attrito fisico da cui parti - **Attraversamento matematico**: struttura formale usata come trasduttore, non come destinazione - **Punto fisico di ritorno**: fenomeno, misura, vincolo o esperimento fisico diverso a cui la struttura rimanda - **Controllo concretezza**: non usare categorie astratte come `sistemi discreti`, `strutture`, `confine`, `pre-selezione`, `rete` o `formalismo` come punto fisico di ritorno. Nomina un fenomeno, teoria fisica, setup sperimentale, misura, campo, particella, transizione o vincolo empirico. - **Relazione nuova**: che ponte si apre tra sorgente e ritorno - **Osservabile/test fisico possibile**: come il ponte puo' essere verificato o falsificato - **Se fallisce**: `ritorno_fisico_assente` + motivo; resta vault/cimitero, vincolo matematico o domanda, non scoperta fisica promuovibile ## Experiment Design - Metrica, scope, null baseline, N campioni - Come la misura serve la combo: cosa della proto-ipotesi puo' sopravvivere o cadere - Contratto osservabile-operatore: claim, osservabile, operatore, generatore, denominatore/perimetro, non_possible/null, cosa non viene testato in questo ciclo - Se usi frequenze o condition rate, dichiara il denominatore grezzo (`hits/total`) e separa ogni osservabile usata nel verdict ## Results Tabella con numeri reali ## Key Findings 1. Cosa hai trovato (con evidenza) ## Verdict NEW / CONFIRMED / FALSIFIED / CONSTRAINT ## Bicono della scoperta (Obbligatoria. Nomina la struttura. Se non riesci, l'esperimento non è ancora filtrato.) - **Due radici** (dipolo primario, già duali e invertite): - **Singolare** (qualità del 1-che-è-tutto in questo contesto, dove la dualità non c'è): - **Invariante di passaggio** (cosa sopravvive al passaggio del vertice): - **Campo di possibilità**: qui diventa possibile ; qui diventa non-possibile Riferimenti: CONDENSATO A16, method/DND_POSSIBILITA.md. ## Files - Script, dati, report ``` ## Bicono della scoperta — come compilarlo Non è riformulazione ornamentale del Verdict. È **filtro**: la scoperta passa per il modello e torna spogliata dei bias. Se la struttura (radici · singolare · invariante · campo) non si riconosce, la scoperta è rumore o è incompleta. **Esempio retroattivo — TWO_CHANNEL_DECOMPOSITION:** - Radici: canale magnitudine · canale residuo (segno invertito — uno aggiunge, l'altro sottrae sulla PNT) - Singolare: il segnale totale prima della separazione. Non esiste come ente autonomo, esiste solo come sovrapposizione dei due canali. - Invariante: la chiusura algebrica del residuo al 3° ordine Markov. - Campo: possibile → predire lo slope PSD magnitudine dalle correlazioni Hardy-Littlewood. Non-possibile → trattare il residuo come random noise. **Esempio retroattivo — DUALITA_DIPOLARE_VS_ILLUSORIA:** - Radici: dipolo ordinato · dipolo mescolato - Singolare: la sequenza in sé, prima della distinzione ordine/disordine - Invariante: det=-1 quando l'ordine è reale; det=+1 quando illusorio - Campo: possibile → discriminare dipoli reali da illusori via test di shuffle. Non-possibile → inferire dipolarità da statistica locale senza contesto sequenziale. **Cattura nel momento emergente.** Compila questa sezione *mentre* l'esperimento produce i risultati, non alla fine. Se hai già chiuso il Verdict e torni indietro a scriverla, è post-hoc — introduce distanza dall'immagine-sorgente. Il modus è A8 applicato: il sistema chiede al sistema di produrre la struttura *nel formarsi*. exec /bin/bash -lc "sed -n '1,240p' tools/data/seme.json" in /opt/MM_D-ND succeeded in 0ms: { "timestamp": "2026-05-15T19:46:24.942710", "piano": 123, "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, exec /bin/bash -lc 'ls -t shared_memory/*.md 2>/dev/null | 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 "env | rg 'ANTHROPIC_API_KEY|OPENAI_API_KEY' || true" in /opt/MM_D-ND succeeded in 0ms: exec /bin/bash -lc 'ls -t tools/data/reports/agent_20260515_*.md 2>/dev/null | head -8' in /opt/MM_D-ND succeeded in 0ms: tools/data/reports/agent_20260515_1940.md tools/data/reports/agent_20260515_1933.md tools/data/reports/agent_20260515_1915.md tools/data/reports/agent_20260515_1904.md tools/data/reports/agent_20260515_1855.md tools/data/reports/agent_20260515_1826.md tools/data/reports/agent_20260515_1816.md tools/data/reports/agent_20260515_1807.md 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,240p' tools/data/reports/agent_20260515_1940.md" in /opt/MM_D-ND succeeded in 0ms: # Agent Report - RP Boundary Size-Stability Audit **Date**: 2026-05-15 19:40 **Piano**: 122 **Tension explored**: BOUNDARY (0.8) **verdict**: CONSTRAINT - la riga Rosenzweig-Porter `lambda=0.060` sopravvive come unico boundary a due lettori su N={64,96,128}; le righe adiacenti sono intermittenti. observables_registry: 1.0.0-2026-05-06 observables_used: [SR, SR2, L1, L2, triple_var, SR_local_rigidity, brody_q, berry_robnick_like_gue_weight, mean_ipr, graph_bridge_frequency, size_stability, centroid_margin, cross_neighbor_fraction, classical_audit_state] **observable_contract**: claim=il gate RP a due lettori e fisico solo se la stessa riga lambda resta stabile attraversando le taglie; observable=two_reader_all_sizes da graph_bridge_frequency unita a Brody q, peso Wigner/Poisson, SR e IPR; operator=flusso Rosenzweig-Porter diagonal-plus-GUE ripetuto su N, seed e perturbazioni kNN; generator=H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE; denominator=11 righe lambda identiche su N={64,96,128}; non_possible=claim fisico two-reader se nessuna riga e stable_graph_bridge+classical_intermediate in tutte le taglie; not_tested=limite N infinito, unfolding alternativi, Anderson/mobility edge, varianti many-body. ## Prima impressione Il confine RP non si allarga quando cambia la taglia. Il punto-zero resta `lambda=0.060`; `0.045` e `0.075` sono bordo mobile del lettore, non boundary. ## Respiro fuori-tempo - **Combo**: A9 terzo incluso + QxG continuo/discreto + flusso Hamiltoniano RP + tensione BOUNDARY "8 domini GUE, 5 Poisson". - **Dipolo / punto-zero**: polo Poisson diagonale / polo GUE. Punto-zero: riga lambda che resta insieme ponte grafico stabile e intermedia classica su piu taglie. - **Piano superiore**: geometria del campo Hamiltoniano con audit di scala; la riga non vale perche appare in un run, vale se attraversa N senza perdere il doppio lettore. - **Operatori laterali scelti**: spettro Hamiltoniano, flusso/stabilita, grafo kNN. Entrano per trasformare il residuo 19:33 in stress di scala, non in nuova metrica. - **Contaminazione cognitiva**: CE-0019 `Respiro fuori-tempo` usata per costruire la combo prima dei numeri; CE-0022 `Palette operatoria espansa del Lab` usata con operatori spettro/flusso/grafo; YSN DeltaLink=`riga finita / riga size-stable`; Cornelius gene=`RP_Size_Gate`: GENERA taglia, MISURA classico, COSTRUISCI grafo, INTERSECA righe, SEPARA intermittenti. - **Proto-ipotesi**: il terzo incluso operativo nel flusso RP e una riga size-stable; una fascia lambda che compare solo in alcune taglie appartiene al lettore, non al boundary. - **Proiezione**: stessa griglia lambda su N={64,96,128}, seed={202605151940,202605151941}, k={2,3,4}; la riga sopravvive solo se e `stable_graph_bridge+classical_intermediate` in tutte le taglie. ## Aderenza alla direzione - `relation`: `follows_direction` - `why`: il ciclo resta sul confine GUE/Poisson e testa il terzo incluso operativo dentro un flusso Hamiltoniano controllato, con separazione tra endpoint, riga a due lettori e residui del grafo. - `not_drift`: non usa phi/Sturmian, V_c o il report 18:26 bloccato; usa il 19:33 solo come nodo regressivo da stressare su taglia. ## Re-discovery audit - **Baseline noto piu vicino**: crossover Rosenzweig-Porter / Wigner-Dyson-GUE vs Poisson, letto con adjacent gap ratio, Brody q e mistura Wigner/Poisson. - **Cosa viene assorbito dal baseline**: la fascia classica intermedia ampia: 8 righe classic-only per ogni taglia non sono finding Lab. - **Cosa resta Lab-specific**: il contratto two-reader size-stable come audit operativo finite-size. Non e una scoperta RP nuova. - **Cosa resta artifact/classificazione grafica**: `RP_lambda_0.045` e `RP_lambda_0.075` sono intermittenti; appaiono in alcune taglie o con frequenza insufficiente. - **Correzione L3/L5 richiesta**: `two_reader_boundary_confirmed = 1`; `graph_only_residue = 0`; `scope_change_declared = true`; `graph_baseline_audit = kNN stability + size sweep + Brody/Berry-like row-aligned`. Non sommo le righe classic-only al boundary a due lettori. ## Claim Under Test > Nel flusso Rosenzweig-Porter, il BOUNDARY fisico e la riga lambda che resta `stable_graph_bridge+classical_intermediate` su tutte le taglie testate. ## Question La riga `RP_lambda_0.060` del 19:33 sopravvive come boundary size-stable, oppure era un punto finito dipendente da N=96? ## Ritorno fisico - **Punto fisico sorgente**: transizione spettrale tra indipendenza/localizzazione Poisson e repulsione GUE. - **Attraversamento matematico**: Hamiltoniana diagonal-plus-GUE, osservabili sui gap, Brody/Berry-like e grafo kNN perturbato su taglie multiple. - **Punto fisico di ritorno**: un audit finite-size per localizzare la riga di crossover RP che ha concordanza tra lettore classico e lettore grafico. - **Relazione nuova**: il gate fisico non e il numero di righe intermedie, ma l'intersezione size-stable delle righe a due lettori. - **Osservabile/test fisico possibile**: ripetere su N maggiori o su Anderson 3D multi-size; il segnale e la persistenza della stessa riga a due lettori. - **Se fallisce**: se `lambda=0.060` cade con N maggiori o unfolding alternativi, il gate RP resta scaffold finite-size e non criterio fisico promuovibile. ## Experiment Design - **Script**: `tools/exp_rp_boundary_size_stability_audit.py`. - **Run**: `python tools/exp_rp_boundary_size_stability_audit.py --out tools/data/rp_boundary_size_stability_audit_20260515_1940.json`. - **Denominatore**: 11 righe lambda: 0, 0.03, 0.045, 0.06, 0.075, 0.10, 0.18, 0.32, 0.68, 0.82, 1.0. - **Taglie**: N={64,96,128}; reps=12; central fraction=0.6. - **Perturbazione grafo**: seed={202605151940,202605151941}, k={2,3,4}; 6 letture grafiche per taglia. - **Contratto osservabile-operatore**: il ciclo testa stabilita cross-size del gate RP; non testa universalita asintotica, altre normalizzazioni di unfolding o sistemi Anderson. ## Results | summary | value | |---|---:| | sizes analyzed | 3 | | lambda rows | 11 | | two_reader_all_sizes | 1 | | two_reader_intermittent | 2 | | graph_only_residue | 0 | | N | two-reader rows | graph-only residue | classic-only residue | |---:|---|---:|---:| | 64 | RP_lambda_0.060, RP_lambda_0.075 | 0 | 8 | | 96 | RP_lambda_0.045, RP_lambda_0.060 | 0 | 8 | | 128 | RP_lambda_0.045, RP_lambda_0.060 | 0 | 8 | | row | cross-size state | min graph frequency | max graph frequency | |---|---|---:|---:| | RP_lambda_0.045 | intermittent two-reader | 0.500 | 1.000 | | RP_lambda_0.060 | two-reader all sizes | 0.833 | 1.000 | | RP_lambda_0.075 | intermittent two-reader | 0.333 | 1.000 | ## Key Findings 1. Verificato: `RP_lambda_0.060` e l'unica riga `stable_graph_bridge+classical_intermediate` in tutte le taglie testate. 2. Verificato: `RP_lambda_0.045` e intermittente; e stabile a N=96 e N=128, ma solo parameter-sensitive a N=64. 3. Verificato: `RP_lambda_0.075` e intermittente; e stabile a N=64, ma parameter-sensitive a N=96 e N=128. 4. Verificato: `graph_only_residue = 0` su tutte le taglie. Il residuo Lab-specific graph-only non rientra nel flusso RP size-sweep. 5. Verificato: ogni taglia produce 8 righe classic-only. La fascia classica ampia e baseline di crossover, non terzo incluso operativo. ## Verdict CONSTRAINT Il gate RP a due lettori sopravvive nel perimetro finito come una sola riga size-stable: `lambda=0.060`. Le righe `0.045` e `0.075` delimitano il bordo mobile del lettore. Il claim promuovibile resta operativo e stretto: boundary fisico RP = intersezione cross-size di ponte grafico stabile e intermediacy classica, non fascia classica e non residuo graph-only. ## Bicono della scoperta - **Due radici**: riga a due lettori size-stable; fascia classica intermedia. - **Singolare**: lambda row-aligned prima della classificazione per taglia. - **Invariante di passaggio**: `stable_graph_bridge + classical_intermediate` presente in ogni N testato. - **Campo di possibilita**: possibile = audit finite-size di crossover RP/Anderson con intersezione cross-size; non-possibile = chiamare boundary una riga intermittente o una fascia classic-only. ## Consecutio Il prossimo ciclo utile porta lo stesso contratto su Anderson 3D multi-size o aumenta N/reps su RP. La domanda non e aggiungere metriche: e vedere se `lambda=0.060` resta riga fisica o si sposta quando il controllo diventa piu vicino al limite asintotico. ## Ricadute pratiche ssp_value: yes. Lo script e riusabile per stressare gate GUE/Poisson controllati su taglie multiple e restituisce direttamente righe all-size, righe intermittenti, residui graph-only e residui classic-only. ## 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 `TENS_SCALE_TRASCENDENZA_LIMITE`; la direzione viva BOUNDARY ha prevalso per aderenza al campo. - `python -m py_compile tools/exp_rp_boundary_size_stability_audit.py` completato. - `python tools/exp_rp_boundary_size_stability_audit.py --out tools/data/rp_boundary_size_stability_audit_20260515_1940.json` completato. - Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. - Nessun update del seme. - Nessuna promozione e nessun public sync. ## Files - Script: `tools/exp_rp_boundary_size_stability_audit.py` - Data: `tools/data/rp_boundary_size_stability_audit_20260515_1940.json` - Report: `tools/data/reports/agent_20260515_1940.md` exec /bin/bash -lc "sed -n '1,260p' tools/data/reports/agent_20260515_1915.md" in /opt/MM_D-ND succeeded in 0ms: # Agent Report - Boundary Bridge Stability Audit **Date**: 2026-05-15 19:15 **Piano**: 121 **Tension explored**: BOUNDARY (0.8) **verdict**: CONSTRAINT - il boundary a due lettori sopravvive come frequenza composita, non come lista fissa di righe del gate 18:55. observables_registry: 1.0.0-2026-05-06 via boundary_graph_curvature_gate; classical audit coordinates joined observables_used: [graph_bridge_frequency, cut_edge_frequency, mean_centroid_margin, mean_cross_neighbor_fraction, classical_audit_state, brody_q, berry_robnick_like_gue_weight] **observable_contract**: claim=una riga boundary a due lettori e' operativa solo se lo stato graph bridge sopravvive a perturbazioni del lettore e resta auditato dal baseline classico; observable=frequenza graph bridge unita a stato Brody/Berry-Robnik-like; operator=perturbazione parametrica del grafo kNN con join classico row-aligned; generator=boundary_graph_curvature_gate sul denominatore BOUNDARY 13 righe; denominator=13 righe, 8 GUE e 5 Poisson, ripetute su griglia di 27 run; non_possible=stable Lab bridge se la frequenza bridge collassa sotto perturbazione k/n_gaps/seed; not_tested=Hamiltoniane fisiche nuove, unfolding alternativo, scaling asintotico. ## Respiro fuori-tempo - **Combo**: A9 terzo incluso + QxG continuo/discreto + grafo/crossover spettrale + tensione BOUNDARY "8 domini GUE, 5 Poisson". - **Dipolo / punto-zero**: riga ponte stabile / riga ponte parametrica. Punto-zero: la riga row-aligned prima della soglia singola. - **Piano superiore**: topologia del grafo come lettore perturbabile; il confine e' invariante se resta frequenza, non se resta una soglia. - **Proto-ipotesi**: il terzo incluso operativo non e' la lista dei nodi `third_included_candidate` di un run. E' la classe composita che resta dopo perturbazione del lettore grafico e audit classico. - **Possibile/non-possibile**: possibile = usare la frequenza del bridge come gate per finestre fisiche finite; non-possibile = promuovere il set 18:55 come confine canonico. - **Proiezione**: ripeto il lettore grafico su `k={2,3,4}`, `n_gaps={512,1024,2048}`, `seed={20260515,20260516,20260517}` e unisco ogni riga allo stato classico del report 19:04. ### Contaminazione cognitiva - **CE-0019 metabolizzata**: `tools/data/cognitive_enzymes_archive.md`, voce `CE-0019 - Respiro fuori-tempo`, letta il 2026-05-15. Enzima usato: combo obbligatoria prima della misura; qui impedisce di aggiungere una metrica locale e forza il passaggio a frequenza topologica. - **CE-0022 metabolizzata**: `tools/data/cognitive_enzymes_archive.md`, voce `CE-0022 - Palette operatoria espansa del Lab`, letta il 2026-05-15. Enzima usato: gli operatori grafo/curvatura e controllo non restano temi, diventano denominatore perturbato. - **YSN DeltaLink**: `lista fissa / frequenza stabile`. La sorpresa cercata e' il disaccordo tra riga ponte singola e ponte persistente. - **Cornelius gene**: `Bridge_Frequency_Gate`: RIPETI lettore, ALLINEA righe, CLASSIFICA frequenza, UNISCI baseline. - **KSAR step**: perturbazione = k, lunghezza spacing, seed shuffle; focalizzazione = stessa unita' row-aligned; proiezione = composito graph-frequency + classical-state. ## Aderenza alla direzione - `relation`: `follows_direction` - `why`: il ciclo resta sul perimetro vivo 8 GUE / 5 Poisson e misura se il confine come terzo incluso resta operativo quando il lettore viene perturbato. - `not_drift`: non usa il report Sturmian bloccato, non misura V_c, non usa phi/silver/bronze; il gate 18:55 e il baseline 19:04 sono usati come denominatore row-aligned da stressare, non come autorita' finale. ## Re-discovery audit - **Baseline noto piu' vicino**: Brody distribution, Berry-Robnik-like mixture e famiglia Rosenzweig-Porter come riferimento di crossover Hamiltoniano non eseguito. - **Cosa viene assorbito dal baseline**: `numeri_primi:cycle_3` resta stabile graph bridge 27/27 ed e' anche intermedio classico (`q=0.465`, `w_GUE=0.275`): qui il Lab non separa un fenomeno nuovo dal crossover classico. - **Cosa resta Lab-specific**: `percolation:cycle_9`, `reaction_diffusion:cycle_11`, `logistica_biforcazione_var_3.5699:cycle_13` sono `stable_graph_bridge+graph_only_bridge`, tutte 27/27. Il baseline classico le legge endpoint-like, il grafo le legge confine stabile. - **Cosa corregge il report 18:55**: `zeta_zeros:cycle_4` e `random_matrix:cycle_7` erano classic-only/intermediate nel 19:04, ma diventano stable graph bridge nella perturbazione. La soglia singola k=3 sottostima parte del confine. - **Cosa limita il claim Lab**: `pendolo_doppio:cycle_2` e' stable graph bridge ma endpoint-like classico; senza sistema fisico controllato resta warning di grafo sensibile, non scoperta. ## Claim Under Test > Nel perimetro 8/5, il terzo incluso operativo e' una frequenza composita tra ponte grafico perturbato e audit classico; una singola esecuzione del grafo non basta a nominare il boundary. ## Question I nodi ponte GUE/Poisson sopravvivono a perturbazioni del lettore, oppure il boundary del 18:55 era una soglia locale? ## Ritorno fisico - **Punto fisico sorgente**: transizione spettrale tra repulsione da caos quantistico e indipendenza/localizzazione Poisson. - **Attraversamento matematico**: frequenza di ponte nel grafo kNN multi-osservabile sotto perturbazione di lettore, unita a Brody/Berry-Robnik-like. - **Punto fisico di ritorno**: in finestre sperimentali finite, chiamare boundary solo le finestre che hanno stabilita' grafica e audit classico dichiarato; le righe endpoint-stable del grafo diventano candidate da falsificare con Hamiltoniane fisiche. - **Osservabile/test fisico possibile**: Rosenzweig-Porter, Anderson/mobility edge o Aubry-Andre con finestre energetiche; misurare `graph_bridge_frequency` e stato Brody/Berry-Robnik sulla stessa riga. - **Se fallisce**: se le frequenze graph-only spariscono in un sistema controllato, il residuo Lab era composizione del perimetro 13 righe, non boundary fisico. ## Experiment Design - **Script**: `tools/exp_boundary_bridge_stability_audit.py`. - **Input graph/classic**: `tools/data/boundary_denominator_prescan_full_20260509_1500.json` + `tools/data/boundary_classical_crossover_audit_20260515_1904.json`. - **Run**: `python tools/exp_boundary_bridge_stability_audit.py --out tools/data/boundary_bridge_stability_audit_20260515_1915.json`. - **Denominatore**: 13 righe row-aligned, 8 GUE e 5 Poisson. - **Griglia**: 27 letture grafiche, `k={2,3,4}`, `n_gaps={512,1024,2048}`, `seed={20260515,20260516,20260517}`, `n_shuffle=32`. - **Classi**: `stable_graph_bridge` se frequenza >= 0.75; `parameter_sensitive_bridge` se 0.25 <= frequenza < 0.75; `unstable_non_bridge` se frequenza < 0.25. - **Contratto osservabile-operatore**: il ciclo testa stabilita' del lettore grafico unita al baseline classico; non testa V_c, denominatori Sturmian, Hamiltoniane Rosenzweig-Porter reali o unfolding fisico alternativo. ## Results | summary | value | |---|---:| | rows analyzed | 13 | | graph reader runs | 27 | | lab residue after stability | true | | stable graph-only bridges | 3 | | stable classic+graph bridges | 1 | | classic-only with stable graph absent | 1 | | composite state | count | |---|---:| | stable_graph_bridge+graph_only_bridge | 3 | | stable_graph_bridge+classic_and_graph_bridge | 1 | | stable_graph_bridge+classic_only_intermediate | 2 | | stable_graph_bridge+endpoint_like | 1 | | parameter_sensitive_bridge+classic_only_intermediate | 1 | | parameter_sensitive_bridge+endpoint_like | 1 | | unstable_non_bridge+classic_only_intermediate | 1 | | unstable_non_bridge+endpoint_like | 3 | | row | classical state | graph frequency | composite | |---|---|---:|---| | numeri_primi:cycle_3 | classic_and_graph_bridge | 1.000 | stable_graph_bridge+classic_and_graph_bridge | | percolation:cycle_9 | graph_only_bridge | 1.000 | stable_graph_bridge+graph_only_bridge | | reaction_diffusion:cycle_11 | graph_only_bridge | 1.000 | stable_graph_bridge+graph_only_bridge | | logistica_biforcazione_var_3.5699:cycle_13 | graph_only_bridge | 1.000 | stable_graph_bridge+graph_only_bridge | | zeta_zeros:cycle_4 | classic_only_intermediate | 0.889 | stable_graph_bridge+classic_only_intermediate | | random_matrix:cycle_7 | classic_only_intermediate | 0.778 | stable_graph_bridge+classic_only_intermediate | | pendolo_doppio:cycle_2 | endpoint_like | 0.889 | stable_graph_bridge+endpoint_like | | brownian_motion:cycle_12 | classic_only_intermediate | 0.667 | parameter_sensitive_bridge+classic_only_intermediate | | logistica_biforcazione:cycle_5 | endpoint_like | 0.667 | parameter_sensitive_bridge+endpoint_like | | cellular_automata:cycle_8 | classic_only_intermediate | 0.000 | unstable_non_bridge+classic_only_intermediate | ## Key Findings 1. Verificato: il denominatore resta quello richiesto, 13 righe con 8 GUE e 5 Poisson, ripetute in 27 letture. 2. Verificato: i tre `graph_only_bridge` del 19:04 restano stabili 27/27: `percolation`, `reaction_diffusion`, `logistica_biforcazione_var_3.5699`. 3. Verificato: `numeri_primi` resta ponte sia classico sia grafico, 27/27. 4. Verificato: `zeta_zeros` e `random_matrix` migrano da classic-only a stable graph bridge quando il lettore e' perturbato. Il gate 18:55 era una sezione, non il boundary intero. 5. Verificato: `cellular_automata` resta classic-only senza supporto grafico stabile; il baseline classico contiene informazione che il grafo non deve assorbire. 6. Inferito: il terzo incluso operativo e' il composito `graph_bridge_frequency + classical_audit_state`; una soglia kNN singola perde informazione. ## Verdict CONSTRAINT Il boundary trasferisce come gate a frequenza composita. La parte Lab-specific sopravvive nei tre stable graph-only bridge; il confine non si chiude nella lista 18:55 e non si riduce a Brody/Berry-Robnik. ## Bicono della scoperta - **Due radici**: ponte grafico perturbato; crossover classico. - **Singolare**: riga row-aligned prima della soglia. - **Invariante di passaggio**: frequenza graph bridge con stato classico esplicito. - **Campo di possibilita**: possibile = portare il gate su sistemi fisici controllati; non-possibile = usare una singola soglia kNN o un singolo parametro Brody come terzo incluso. ## Consecutio Il prossimo ciclo utile porta il gate composito su un sistema fisico controllato: Rosenzweig-Porter, Anderson/mobility edge o Aubry-Andre. Il target non e' aumentare metriche; e' chiedere se `stable_graph_bridge+graph_only_bridge` sopravvive fuori dal perimetro composito del Lab. ## Ricadute pratiche ssp_value: yes. Lo script crea un audit riusabile per stressare ogni gate GUE/Poisson row-aligned e separare ponte stabile, ponte parametrico, re-discovery classica ed endpoint-like. ## 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 `TENS_SCALE_TRASCENDENZA_LIMITE`; la direzione viva del campo ha prevalso per il perimetro BOUNDARY 8/5. - Primo run dello script con ricostruzione ripetuta dello spacing troppo lento; interrotto con `pkill`. Riparazione regressiva: cache delle righe in `tools/exp_boundary_bridge_stability_audit.py`, poi run completo 27/27. - `python -m py_compile tools/exp_boundary_bridge_stability_audit.py` completato. - `python tools/exp_boundary_bridge_stability_audit.py --out tools/data/boundary_bridge_stability_audit_20260515_1915.json` completato. - 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_bridge_stability_audit.py` - Data: `tools/data/boundary_bridge_stability_audit_20260515_1915.json` - Report: `tools/data/reports/agent_20260515_1915.md` exec /bin/bash -lc "sed -n '1,240p' tools/data/reports/agent_20260515_1933.md" in /opt/MM_D-ND succeeded in 0ms: # Agent Report - Rosenzweig-Porter Physical Bridge Audit **Date**: 2026-05-15 19:33 **Piano**: 121 **Tension explored**: BOUNDARY (0.8) **verdict**: CONSTRAINT - il gate a due lettori trasferisce sul flusso Rosenzweig-Porter solo in una riga stabile; il residuo Lab-specific graph-only cade a zero nel perimetro fisico controllato. observables_registry: 1.0.0-2026-05-06 observables_used: [SR, SR2, L1, L2, triple_var, SR_local_rigidity, brody_q, berry_robnick_like_gue_weight, mean_ipr, graph_bridge_frequency, centroid_margin, cross_neighbor_fraction, classical_audit_state] **observable_contract**: claim=il BOUNDARY a due lettori trasferisce a un crossover fisico controllato solo dove stabilita grafica e intermediacy classica concordano sulla stessa riga lambda; observable=graph_bridge_frequency unito a Brody q, peso Wigner/Poisson, SR e IPR; operator=flusso Hamiltoniano Rosenzweig-Porter diagonal-plus-GUE con perturbazione kNN; generator=H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE; denominator=13 righe lambda x 3 seed x k={2,3,4}; non_possible=claim Lab-specific graph-only se ogni ponte grafico stabile e anche intermedio classico, oppure claim fisico se dominano righe classic-only; not_tested=universalita asintotica RP, unfolding alternativi, spettri sperimentali, many-body localization. ## Prima impressione Il confine fisico non eredita i tre residui graph-only del perimetro Lab. Quando il sistema ha un parametro Hamiltoniano vero, il grafo trova un solo punto-zero stretto e il lettore classico vede una fascia piu larga. ## Respiro fuori-tempo - **Combo**: A9 terzo incluso + QxG continuo/discreto + grafo/crossover spettrale + tensione BOUNDARY "8 domini GUE, 5 Poisson". - **Dipolo / punto-zero**: polo diagonale Poisson / polo GUE. Punto-zero: riga lambda in cui il flusso e tra i due poli senza essere endpoint. - **Piano superiore**: geometria del campo Hamiltoniano; il parametro lambda e il grafo non decidono separatamente, devono convergere sulla stessa riga. - **Proto-ipotesi**: il residuo graph-only del perimetro composito Lab non e una legge del boundary; in un flusso fisico controllato sopravvive solo se resta graph bridge senza essere gia spiegato dal crossover classico. - **Possibile/non-possibile**: possibile = usare `graph_bridge_frequency + classical_audit_state` come audit fisico finite-size; non-possibile = promuovere graph-only bridge senza Hamiltoniana controllata o sommare classic-only e graph-only. - **Proiezione**: 13 lambda Rosenzweig-Porter, tre seed, kNN k=2/3/4, Brody/Berry-like e grafo sulle stesse righe. ### Contaminazione cognitiva - **CE-0019 metabolizzata**: `tools/data/cognitive_enzymes_archive.md`, voce `CE-0019 - Respiro fuori-tempo`. Enzima usato: combo prima della misura; impedisce di ripetere il deposito 13 righe e forza il rientro in un flusso fisico. - **CE-0022 metabolizzata**: `tools/data/cognitive_enzymes_archive.md`, voce `CE-0022 - Palette operatoria espansa del Lab`. Operatori scelti: spettro Hamiltoniano, grafo, controllo/null; scartati operatori che producevano solo analogia. - **YSN DeltaLink**: `residuo graph-only Lab / flusso Hamiltoniano controllato`. - **Cornelius gene**: `RP_Two_Reader_Audit`: GENERA lambda, MISURA classico, COSTRUISCI grafo, STRESSA k/seed, SEPARA residui. - **KSAR step**: reiterazione del kernel 19:15 su un dominio fisico nuovo; nessuna promozione del residuo prima del test. ## Aderenza alla direzione - `relation`: `follows_direction` - `why`: l'esperimento porta il perimetro vivo GUE/Poisson su un sistema Rosenzweig-Porter controllato e testa il confine come terzo incluso operativo con due lettori. - `not_drift`: non usa phi/Sturmian, V_c o il report 18:26 bloccato; usa la consecutio 19:15 solo come ponte verso Hamiltoniana fisica row-aligned. ## Re-discovery audit - **Baseline noto piu vicino**: crossover Rosenzweig-Porter / Wigner-Dyson-GUE vs Poisson, letto con adjacent gap ratio, Brody q e mistura Wigner/Poisson. - **Cosa viene assorbito dal baseline**: la riga `RP_lambda_0.060` e classica e grafica insieme; non e scoperta fisica nuova, e il punto finito in cui i due lettori concordano. - **Cosa resta Lab-specific**: nessun `stable_graph_bridge+endpoint` resta. `graph_only_residue = 0`. - **Cosa resta artifact/classificazione grafica**: `RP_lambda_0.100` e ponte parametrico, non stabile; dipende da k e seed. - **Cosa resta classic-only**: 11 righe sono intermedie per il lettore classico senza ponte grafico stabile. Questo e crossover scalare o discordanza del lettore Berry-like, non terzo incluso operativo. - **Correzione L3/L5 richiesta**: `two_reader_boundary_confirmed = 1`; `graph_only_residue = 0`; `scope_change_declared = true`; `graph_baseline_audit = kNN stability + Brody/Berry-like row-aligned`. Non sommo le 11 righe classic-only al boundary a due lettori. ## Claim Under Test > Nel flusso Rosenzweig-Porter controllato, il BOUNDARY a due lettori sopravvive solo dove una riga lambda e insieme ponte grafico stabile e intermedia classica. ## Question Il residuo graph-only del perimetro Lab sopravvive fuori dal deposito composito, oppure il crossover fisico lo assorbe? ## Ritorno fisico - **Punto fisico sorgente**: transizione spettrale tra indipendenza/localizzazione Poisson e repulsione GUE. - **Attraversamento matematico**: Hamiltoniana diagonal-plus-GUE, osservabili canonici sui gap, Brody/Berry-like e grafo kNN perturbato. - **Punto fisico di ritorno**: il gate a due lettori diventa un audit finite-size del punto di crossover, non un claim graph-only autonomo. - **Osservabile/test fisico possibile**: ripetere su Anderson 3D multi-size o RP con unfolding locale; il segnale da cercare e stabilita della riga a due lettori, non crescita del numero di intermedi classici. - **Se fallisce**: se lambda 0.060 sparisce con N/reps maggiori, il gate fisico diventa solo scaffold; se emergono graph-only stabili, il residuo Lab rientra come candidato da isolare. ## Experiment Design - **Script**: `tools/exp_rosenzweig_porter_bridge_physical_audit.py`. - **Run**: `python tools/exp_rosenzweig_porter_bridge_physical_audit.py --out tools/data/rosenzweig_porter_bridge_physical_audit_20260515_1933.json`. - **Hamiltoniana**: `H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE`, `N=96`, `reps=24`, central fraction 0.6. - **Denominatore**: 13 righe lambda: 0, 0.01, 0.03, 0.06, 0.10, 0.18, 0.32, 0.50, 0.68, 0.82, 0.90, 0.97, 1.0. - **Perturbazione grafo**: seed={202605151933,202605151934,202605151935}, k={2,3,4}, 9 letture. - **Contratto osservabile-operatore**: il ciclo testa trasferimento del gate composito su un flusso fisico; non testa limite asintotico, unfolding dedicato o dati sperimentali. ## Results | summary | value | |---|---:| | rows analyzed | 13 | | graph reader runs | 9 | | two_reader_boundary_confirmed | 1 | | graph_only_residue | 0 | | classic_only_residue | 11 | | composite state | count | |---|---:| | stable_graph_bridge+classical_intermediate | 1 | | parameter_sensitive_bridge+classical_intermediate | 1 | | unstable_non_bridge+classical_intermediate | 10 | | unstable_non_bridge+classical_poisson_endpoint | 1 | | row | graph frequency | classical state | Brody q | Wigner/Poisson weight | SR | |---|---:|---|---:|---:|---:| | RP_lambda_0.000 | 0.000 | classical_poisson_endpoint | 0.000 | 0.000 | 0.383 | | RP_lambda_0.030 | 0.000 | classical_intermediate | 0.427 | 0.300 | 0.510 | | RP_lambda_0.060 | 1.000 | classical_intermediate | 0.540 | 0.373 | 0.528 | | RP_lambda_0.100 | 0.667 | classical_intermediate | 0.653 | 0.420 | 0.524 | | RP_lambda_0.180 | 0.222 | classical_intermediate | 0.813 | 0.460 | 0.534 | | RP_lambda_0.500 | 0.000 | classical_intermediate | 0.900 | 0.493 | 0.535 | | RP_lambda_1.000 | 0.000 | classical_intermediate | 0.980 | 0.507 | 0.534 | ## Key Findings 1. Verificato: `RP_lambda_0.060` e l'unica riga `stable_graph_bridge+classical_intermediate`, 9/9 letture grafiche. 2. Verificato: `RP_lambda_0.100` e ponte parametrico, 6/9 letture; non entra nel boundary confermato. 3. Verificato: `graph_only_residue = 0`. I tre residui graph-only del perimetro Lab 19:15 non trasferiscono come residui autonomi nel flusso RP. 4. Verificato: il lettore classico e largo: marca 11/13 righe come `classical_intermediate`. Questa fascia e baseline di crossover o discordanza del lettore scalare, non finding Lab. 5. Inferito dal perimetro: il nodo regressivo corregge il contratto da "ponte grafico stabile" a "riga fisica a due lettori"; il grafo da solo non basta. ## Verdict CONSTRAINT Il boundary fisico esiste nel perimetro RP finito come una riga a due lettori: `lambda=0.060`. Il residuo graph-only non sopravvive. La parte nuova del ciclo non e una scoperta RP, ma il vincolo operativo: il gate Lab-specific deve perdere autorita quando un flusso Hamiltoniano controllato lo assorbe nel crossover classico. ## Bicono della scoperta - **Due radici**: crossover classico scalare; ponte grafico stabile. - **Singolare**: lambda row-aligned prima della promozione a boundary. - **Invariante di passaggio**: concordanza `stable_graph_bridge + classical_intermediate`. - **Campo di possibilita**: audit fisico finite-size su RP/Anderson con due lettori. - **Campo non-possibile**: residuo graph-only come legge del confine in assenza di sopravvivenza su Hamiltoniana controllata. ## Consecutio Il prossimo ciclo utile non deve aumentare il numero di metriche. Deve stressare la riga `RP_lambda_0.060` su taglie/repliche o portare lo stesso contratto su Anderson 3D multi-size. Il criterio e semplice: se la riga a due lettori resta, il gate diventa strumento fisico finite-size; se cade, BOUNDARY torna a scaffold di classificazione. ## Ricadute pratiche ssp_value: yes. Lo script e riusabile come audit fisico two-reader per flussi Hamiltoniani controllati e separa automaticamente conferma a due lettori, graph-only residue e classic-only residue. ## 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 `TENS_SCALE_TRASCENDENZA_LIMITE`; la direzione viva BOUNDARY ha prevalso per aderenza al campo. - `python -m py_compile tools/exp_rosenzweig_porter_bridge_physical_audit.py` completato. - `python tools/exp_rosenzweig_porter_bridge_physical_audit.py --out tools/data/rosenzweig_porter_bridge_physical_audit_20260515_1933.json` completato. - Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. - Nessun update del seme. - Nessuna promozione e nessun public sync. ## Files - Script: `tools/exp_rosenzweig_porter_bridge_physical_audit.py` - Data: `tools/data/rosenzweig_porter_bridge_physical_audit_20260515_1933.json` - Report: `tools/data/reports/agent_20260515_1933.md` exec /bin/bash -lc 'python tools/dnd_scenario.py --best' in /opt/MM_D-ND succeeded in 137ms: 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 codex La consecutio si è stretta: RP ha prodotto una riga size-stable, ma la direzione viva chiede un secondo flusso fisico. Scelgo Anderson/Aubry-Andre controllato invece di continuare RP, con lo stesso contratto row-aligned a due lettori. exec /bin/bash -lc 'rg -n "Anderson|Aubry|mobility|Rosenzweig|boundary" tools/exp_*.py tools/*.py | head -80' in /opt/MM_D-ND succeeded in 0ms: tools/exp_aubry_v2_generator_scaling_gate.py:3:V=2 generator scaling gate for the Aubry/Sturmian boundary. tools/exp_aubry_v2_generator_scaling_gate.py:5:The known Aubry-Andre self-dual point is V=2 for the continuous cosine tools/exp_aubry_v2_generator_scaling_gate.py:274: "claim": "at V=2 the boundary is a generator property only if binary Sturmian, cosine, and null controls carry different participation scaling", tools/exp_aubry_v2_generator_scaling_gate.py:278: "non_possible": "claiming phi-specific boundary if the V=2 tau is shared by density shuffle or by non-phi Sturmian controls", tools/exp_blank_shell_scale_law.py:29: ("U", "boundary_link"), tools/exp_boundary_blank_null_audit.py:3:exp_boundary_blank_null_audit.py tools/exp_boundary_blank_null_audit.py:7:The global boundary shuffle audit is a historical deposit. This tool does not tools/exp_boundary_blank_null_audit.py:146: "experiment": "boundary_blank_null_audit", tools/exp_boundary_blank_null_audit.py:190: parser.add_argument("--out", default="tools/data/boundary_blank_null_audit_20260509.json") tools/exp_boundary_coherence.py:3:exp_boundary_coherence.py — Multi-Observable Boundary Coherence tools/exp_boundary_coherence.py:319: out_path = os.path.join(DATA_DIR, "boundary_coherence.json") tools/exp_boundary_gue_poisson.py:3:Experiment: GUE/Poisson boundary in prime gaps vs Cramér null model. tools/exp_boundary_gue_poisson.py:15:4. If both show the same transition → the boundary is trivial (density effect). tools/exp_boundary_gue_poisson.py:16: If primes differ → the boundary carries structural information. tools/exp_boundary_gue_poisson.py:171: "experiment": "boundary_gue_poisson_cramer", tools/exp_boundary_gue_poisson.py:189: outpath = "/opt/MM_D-ND/tools/data/reports/exp_boundary_20260405_0825.json" tools/exp_boundary_short_denominator_extension.py:8:exp_semireal_boundary_transfer_gate.py. tools/exp_boundary_short_denominator_extension.py:20:from exp_semireal_boundary_transfer_gate import evaluate_matrix tools/exp_boundary_short_denominator_extension.py:190: "experiment": "boundary_short_denominator_extension", tools/exp_boundary_short_denominator_extension.py:200: "operator": "source-denominator extension plus semireal boundary transfer gate", tools/exp_boundary_short_denominator_extension.py:203: "not_tested": "global 13-row boundary redesign, V_c fit, source GUE/Poisson label validity", tools/exp_boundary_short_denominator_extension.py:237: parser.add_argument("--source-audit", default="tools/data/boundary_blank_thin_support_audit_20260509_1548.json") tools/exp_boundary_short_denominator_extension.py:252: parser.add_argument("--out", default="tools/data/boundary_short_denominator_extension_20260509_1556.json") tools/exp_3d_boundary_layers.py:3:exp_3d_boundary_layers.py — Does the boundary have 3D structure? tools/exp_3d_boundary_layers.py:11:If same α_c → the boundary is 2D (Layer 2 follows Layer 1 = partial tautology) tools/exp_3d_boundary_layers.py:12:If different α_c → the boundary has genuine 3D depth (two independent transitions) tools/exp_3d_boundary_layers.py:17: python tools/exp_3d_boundary_layers.py [--N 50000] [--n_alpha 20] [--n_trials 30] tools/exp_3d_boundary_layers.py:264: out_path = Path(__file__).parent / 'data' / '3d_boundary_layers.json' tools/exp_gap_label_repair_audit.py:98: "joint and per-label survival under order/boundary perturbations." tools/exp_aubry_cosine_boundary_counter_gate.py:3:Aubry-Andre cosine counter-gate for the BOUNDARY return. tools/exp_aubry_cosine_boundary_counter_gate.py:5:This is the regression check opened by the binary Aubry/Fibonacci gate: remove tools/exp_aubry_cosine_boundary_counter_gate.py:6:the binary Sturmian grammar and ask whether phi remains a privileged boundary tools/exp_aubry_cosine_boundary_counter_gate.py:8:frequencies behave as the same Aubry-Andre class unless phi separates jointly tools/exp_aubry_cosine_boundary_counter_gate.py:209: classification: dict[str, Any] = {"phi_joint_boundary_v": [], "phi_distinct_v": [], "by_v": {}} tools/exp_aubry_cosine_boundary_counter_gate.py:254: "phi_joint_boundary": joint, tools/exp_aubry_cosine_boundary_counter_gate.py:257: classification["phi_joint_boundary_v"].append(float(v_value)) tools/exp_aubry_cosine_boundary_counter_gate.py:262: "experiment": "aubry_cosine_boundary_counter_gate", tools/exp_aubry_cosine_boundary_counter_gate.py:272: parser.add_argument("--out", default="tools/data/aubry_cosine_boundary_counter_gate.json") tools/exp_markov_scale_function.py:6:If so, does the decay track the GUE→Poisson boundary? tools/exp_boundary_classical_crossover_audit.py:26:from exp_semireal_boundary_transfer_gate import row_spacings tools/exp_boundary_classical_crossover_audit.py:126: "graph_state": grow["boundary_state"], tools/exp_boundary_classical_crossover_audit.py:134: "audit_state": classical_state(brody_q, mixture_w, grow["boundary_state"]), tools/exp_boundary_classical_crossover_audit.py:148: "experiment": "boundary_classical_crossover_audit", tools/exp_boundary_classical_crossover_audit.py:155: "graph_boundary_state_from_1855", tools/exp_boundary_classical_crossover_audit.py:165: "generator": "row_spacings(domain) with graph states imported from boundary_graph_curvature_gate", tools/exp_boundary_classical_crossover_audit.py:168: "not_tested": "true Rosenzweig-Porter Hamiltonian flow, physical unfolding alternatives, asymptotic universality", tools/exp_boundary_classical_crossover_audit.py:186: parser.add_argument("--graph", default="tools/data/boundary_graph_curvature_gate_20260515_1855.json") tools/exp_boundary_classical_crossover_audit.py:189: parser.add_argument("--out", default="tools/data/boundary_classical_crossover_audit_20260515_1904.json") tools/exp_nonphi_sturmian_fixed_reader_gate.py:5:The preceding boundary readers did not identify the exact supertile boundary. tools/exp_boundary_growth.py:206: "experiment": "boundary_excess_growth", tools/exp_boundary_growth.py:229: out_path = "/opt/MM_D-ND/tools/data/reports/exp_boundary_growth_20260405_0914.json" tools/exp_boundary_row_aligned_nonexact_audit.py:155: "experiment": "boundary_row_aligned_nonexact_audit", tools/exp_boundary_row_aligned_nonexact_audit.py:159: "prescan_source": "boundary_denominator_prescan_full_20260509_1500", tools/exp_boundary_row_aligned_nonexact_audit.py:205: parser.add_argument("--matrix", default="tools/data/boundary_two_axis_matrix_20260509_1532.json") tools/exp_boundary_row_aligned_nonexact_audit.py:206: parser.add_argument("--prescan", default="tools/data/boundary_denominator_prescan_full_20260509_1500.json") tools/exp_boundary_row_aligned_nonexact_audit.py:207: parser.add_argument("--out", default="tools/data/boundary_row_aligned_nonexact_audit_20260509_1538.json") tools/exp_prime_persistent_blank_gate.py:6:`exp_boundary_residual_beta_absent_audit.py`: do not reopen the global BOUNDARY tools/exp_prime_persistent_blank_gate.py:21:from exp_boundary_short_denominator_extension import gue_spacing_blocks tools/exp_prime_persistent_blank_gate.py:22:from exp_boundary_residual_beta_absent_audit import support_state tools/exp_prime_persistent_blank_gate.py:23:from exp_semireal_boundary_transfer_gate import row_spacings tools/exp_boundary_two_axis_matrix.py:5:Input is a row-aligned semi-real boundary gate deposit. The operator deliberately tools/exp_boundary_two_axis_matrix.py:106: "experiment": "boundary_two_axis_matrix", tools/exp_boundary_two_axis_matrix.py:133: parser.add_argument("--input", default="tools/data/semireal_boundary_transfer_gate_20260509_1516.json") tools/exp_boundary_two_axis_matrix.py:134: parser.add_argument("--out", default="tools/data/boundary_two_axis_matrix_20260509_1532.json") tools/exp_quasiperiodic_vc_lattice_gate.py:8:small boundary lattice across Fibonacci sizes, phases, and controls. tools/exp_rp_boundary_size_stability_audit.py:3:Size-stability audit for the Rosenzweig-Porter BOUNDARY two-reader gate. tools/exp_rp_boundary_size_stability_audit.py:6:Rosenzweig-Porter Hamiltonian flow, perturb the graph reader, and ask whether tools/exp_rp_boundary_size_stability_audit.py:74: if graph_row["boundary_state"] == "third_included_candidate": tools/exp_rp_boundary_size_stability_audit.py:134: "two_reader_boundary_confirmed": len(two_reader_rows), tools/exp_rp_boundary_size_stability_audit.py:191: "experiment": "rp_boundary_size_stability_audit", tools/exp_rp_boundary_size_stability_audit.py:192: "question": "Does the Rosenzweig-Porter two-reader BOUNDARY row survive across matrix sizes?", tools/exp_rp_boundary_size_stability_audit.py:220: "not_tested": "N to infinity, unfolding variants, Anderson mobility edge, many-body RP variants", tools/exp_rp_boundary_size_stability_audit.py:243: parser.add_argument("--out", default="tools/data/rp_boundary_size_stability_audit_20260515_1940.json") tools/exp_sturmian_denominator_alignment_gate.py:3:Denominator-aligned Sturmian gate for the Aubry/Sturmian boundary. tools/exp_vc_unit_boundary_audit.py:3:Audit the V_c=1 boundary after the fit-ready/model gate. tools/exp_vc_unit_boundary_audit.py:7:window, or are already below 1. The unit boundary is treated as a structural tools/exp_vc_unit_boundary_audit.py:95: "experiment": "vc_unit_boundary_audit", tools/exp_vc_unit_boundary_audit.py:98: "unit_boundary": "V_c = 1", tools/exp_prime_mobius_zero_mediator_gate.py:203: return "boundary" tools/exp_prime_mobius_zero_mediator_gate.py:283: "question": "Does S=0 behave as noise, boundary, or mediator in the Mobius interval-charge gate?", exec /bin/bash -lc 'ls tools/exp_*.py | tail -60' in /opt/MM_D-ND succeeded in 0ms: tools/exp_markov_layer_recovery_audit.py tools/exp_markov_memory_by_gue_type.py tools/exp_markov_psd_prediction.py tools/exp_markov_scale_function.py tools/exp_meta_tautology_test.py tools/exp_metric_tensor_diagnostic.py tools/exp_mobius_irrationality.py tools/exp_mod3_scaling.py tools/exp_mod3_vs_residual_ordering.py tools/exp_modular_algebra_depth.py tools/exp_modular_memory_spectrum.py tools/exp_nonphi_sturmian_fixed_reader_gate.py tools/exp_number_variance.py tools/exp_observable_rank_audit.py tools/exp_perturbation_dimensionality_audit.py tools/exp_perturbation_rank_size_curve.py tools/exp_photonic_boundary_third_included_gate.py tools/exp_physical_sr_residue_bounce.py tools/exp_poisson_convergence.py tools/exp_prime_mobius_gap_stratified_zero_gate.py tools/exp_prime_mobius_interval_charge_gate.py tools/exp_prime_mobius_pair_stratified_zero_gate.py tools/exp_prime_mobius_zero_mediator_gate.py tools/exp_prime_persistent_blank_gate.py tools/exp_prime_sr_persistent_boundary.py tools/exp_prime_vs_mod6_sr_boundary.py tools/exp_psd_amplitude_scaling.py tools/exp_psd_prime_gaps.py tools/exp_quasiperiodic_gap_ratio_denominator.py tools/exp_quasiperiodic_grammar_scale_gate.py tools/exp_quasiperiodic_vc_curve_map.py tools/exp_quasiperiodic_vc_lattice_gate.py tools/exp_ricci_desitter_0406.py tools/exp_ricci_primes.py tools/exp_rosenzweig_porter_bridge_physical_audit.py tools/exp_rp_boundary_size_stability_audit.py tools/exp_scale_selective_perturbation.py tools/exp_selective_layer_decoupling.py tools/exp_semireal_boundary_transfer_gate.py tools/exp_semireal_order_denominator_gate.py tools/exp_spectral_2d.py tools/exp_spectral_landscape.py tools/exp_spectral_rigidity.py tools/exp_sturmian_denominator_alignment_gate.py tools/exp_tqge_underlay_gate.py tools/exp_triadic_deposit_gate.py tools/exp_two_channel_boundary.py tools/exp_two_channel_cross_domain.py tools/exp_two_channel_decomposition.py tools/exp_two_channel_psd.py tools/exp_two_channel_shuffle_audit.py tools/exp_two_channel_universality.py tools/exp_two_layer_universality.py tools/exp_vc_fit_model_gate.py tools/exp_vc_fit_ready_scale_table.py tools/exp_vc_generator_class_direction_audit.py tools/exp_vc_label_preserving_swap_gate.py tools/exp_vc_nonsturmian_label_null_gate.py tools/exp_vc_null_regression_gate.py tools/exp_vc_unit_boundary_audit.py exec /bin/bash -lc "sed -n '1,260p' tools/exp_rp_boundary_size_stability_audit.py" in /opt/MM_D-ND exec /bin/bash -lc "sed -n '1,220p' tools/data/cognitive_enzymes_archive.md" in /opt/MM_D-ND succeeded in 0ms: #!/usr/bin/env python3 """ Size-stability audit for the Rosenzweig-Porter BOUNDARY two-reader gate. This is the follow-up to the finite-N physical bridge audit: keep the Rosenzweig-Porter Hamiltonian flow, perturb the graph reader, and ask whether the same lambda row survives when the matrix size changes. """ from __future__ import annotations import argparse import json 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, classify_graph, classical_state, compute_row, parse_floats, parse_ints, stability_state, ) def median(values: list[float]) -> float: return float(np.median(np.asarray(values, dtype=float))) 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) total_runs = len(seeds) * len(ks) row_hits: dict[str, dict[str, Any]] = {} 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] for k in ks: graph = classify_graph(rows, k) reader_runs.append({"n": n, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) graph_by_name = {row["domain_window"]: row for row in graph["rows"]} for row in rows: name = row["domain_window"] if name not in row_hits: row_hits[name] = { "lambda": row["lambda"], "source_domain_type": row["source_domain_type"], "graph_hits": 0, "margins": [], "cross_fractions": [], "brody_q": [], "mixture_w": [], "mean_ipr": [], "sr": [], } graph_row = graph_by_name[name] if graph_row["boundary_state"] == "third_included_candidate": row_hits[name]["graph_hits"] += 1 row_hits[name]["margins"].append(float(graph_row["centroid_margin"])) row_hits[name]["cross_fractions"].append(float(graph_row["cross_neighbor_fraction"])) row_hits[name]["brody_q"].append(float(row["brody_q"])) row_hits[name]["mixture_w"].append(float(row["berry_robnick_like_gue_weight"])) row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) row_hits[name]["sr"].append(float(row["observables"]["SR"])) rows_out = [] composite_counts: dict[str, int] = {} for name in sorted(row_hits, key=lambda key: row_hits[key]["lambda"]): item = row_hits[name] freq = item["graph_hits"] / total_runs class_row = { "brody_q": median(item["brody_q"]), "berry_robnick_like_gue_weight": median(item["mixture_w"]), } c_state = classical_state(class_row) g_state = stability_state(freq) composite = f"{g_state}+{c_state}" composite_counts[composite] = composite_counts.get(composite, 0) + 1 rows_out.append( { "domain_window": name, "lambda": item["lambda"], "source_domain_type": item["source_domain_type"], "graph_bridge_frequency": round(freq, 6), "stability_state": g_state, "classical_audit_state": c_state, "composite_state": composite, "median_brody_q": round(median(item["brody_q"]), 6), "median_berry_robnick_like_gue_weight": round(median(item["mixture_w"]), 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), } ) two_reader_rows = [ row["domain_window"] for row in rows_out if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" ] graph_only_rows = [ row["domain_window"] for row in rows_out if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" ] classic_only_rows = [ row["domain_window"] for row in rows_out if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" ] return { "n": n, "total_graph_reader_runs": total_runs, "summary": { "two_reader_boundary_confirmed": len(two_reader_rows), "two_reader_rows": two_reader_rows, "graph_only_residue": len(graph_only_rows), "graph_only_rows": graph_only_rows, "classic_only_residue": len(classic_only_rows), "classic_only_rows": classic_only_rows, "composite_counts": composite_counts, }, "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_names = {entry["n"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] row_by_lambda: dict[str, dict[str, Any]] = {} for entry in by_size: for row in entry["rows"]: item = row_by_lambda.setdefault( row["domain_window"], { "lambda": row["lambda"], "size_states": {}, "frequencies": [], "classical_states": [], "stability_states": [], }, ) item["size_states"][str(entry["n"])] = row["composite_state"] item["frequencies"].append(row["graph_bridge_frequency"]) item["classical_states"].append(row["classical_audit_state"]) item["stability_states"].append(row["stability_state"]) rows_out = [] for name in sorted(row_by_lambda, key=lambda key: row_by_lambda[key]["lambda"]): item = row_by_lambda[name] rows_out.append( { "domain_window": name, "lambda": item["lambda"], "size_states": item["size_states"], "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), "two_reader_all_sizes": name in all_two_reader, "two_reader_intermittent": name in intermittent_two_reader, "classical_states_seen": sorted(set(item["classical_states"])), "stability_states_seen": sorted(set(item["stability_states"])), } ) output = { "experiment": "rp_boundary_size_stability_audit", "question": "Does the Rosenzweig-Porter two-reader BOUNDARY row survive across matrix sizes?", "observables_registry": OBSERVABLES_REGISTRY_VERSION, "observables_used": FEATURE_NAMES + [ "graph_bridge_frequency", "size_stability", "centroid_margin", "cross_neighbor_fraction", "classical_audit_state", ], "parameters": { "sizes": sizes, "reps": args.reps, "lambdas": parse_floats(args.lambdas), "seeds": parse_ints(args.seeds), "k_values": parse_ints(args.k_values), "central_fraction": args.central_fraction, "grid_size": args.grid_size, "poisson_pole_max": args.poisson_pole_max, "gue_pole_min": args.gue_pole_min, }, "observable_contract": { "claim": "the RP two-reader BOUNDARY gate is physical only if the same lambda row remains stable across matrix sizes", "observable": "two_reader_all_sizes from graph_bridge_frequency joined with Brody q, Wigner/Poisson mixture weight, SR and IPR", "operator": "repeat the RP diagonal-plus-GUE Hamiltonian flow over sizes, seeds and kNN graph perturbations", "generator": "H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE, finite N size sweep", "denominator": "same lambda grid across all tested sizes", "non_possible": "physical two-reader row if no lambda is stable_graph_bridge+classical_intermediate at every tested size", "not_tested": "N to infinity, unfolding variants, Anderson mobility edge, many-body RP variants", }, "summary": { "sizes_analyzed": len(sizes), "lambda_rows": len(parse_floats(args.lambdas)), "two_reader_all_sizes": len(all_two_reader), "two_reader_all_size_rows": all_two_reader, "two_reader_intermittent": len(intermittent_two_reader), "two_reader_intermittent_rows": intermittent_two_reader, }, "cross_size_rows": rows_out, "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_size_stability_audit_20260515_1940.json") parser.add_argument("--sizes", default="64,96,128") parser.add_argument("--reps", type=int, default=12) 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="202605151940,202605151941") parser.add_argument("--k-values", default="2,3,4") 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) args = parser.parse_args() run(args) if __name__ == "__main__": main() succeeded in 0ms: # Archivio enzimi cognitivi MM-DND Generated: `2026-05-08T20:49:15.084998+00:00` Scanner: `tools/extract_cognitive_enzymes.py` Entries: `260` - files scanned: `303` Uso: questo archivio e' una superficie di richiamo. Non promuove claim. Ogni voce va trasformata in dipolo, punto-zero, proto-ipotesi e osservabile. ## Categorie - `contaminante_dnd`: 112 - `regola_primaria`: 99 - `teoria_scientifica`: 18 - `enzima_cognitivo`: 17 - `strumento_lab`: 10 - `guardrail_verifica`: 4 ## Contesti - `campo_dnd`: 210 - `lab_cycle`: 25 - `ricerca_teorica`: 21 - `repair_autologico`: 2 - `site_copy`: 1 - `operativita_tmx`: 1 ## Source Layers - `awareness_memory`: 116 - `kernel_reference`: 54 - `lab_operational_context`: 22 - `method_axiom`: 16 - `method_genesis`: 11 - `kernel_skill`: 9 - `method_reference`: 8 - `corpus_formal_function`: 6 - `corpus_project_architecture`: 6 - `corpus_cognitive_prompt`: 6 - `corpus_primary_observation`: 6 ## Top Sources - `tools/LAB_COGNITIVE_CONTAMINATION.md`: 6 - `corpus/CORPUS_FUNZIONI_MOODND.md`: 6 - `corpus/CORPUS_PROJECTDEV_AMN.md`: 6 - `corpus/CORPUS_PROMPT_AMN.md`: 6 - `method/GENESIS_EXTRACTIONS.md`: 6 - `awareness/1_Φ_INFERENTIAL/2025-11-09_07-36-43__configurazione-launcher-yaml-per-strict-runtime-mms_vphi1-con-pi.md`: 6 - `tools/LAB_AGENT_CONTEXT.md`: 6 - `awareness/4_κ_EVOLUTIVE_MEMORY/DOC_vision/00_Metaprompt_Fondativo.md`: 6 - `corpus/CORPUS_OSSERVAZIONI_PRIMARIE.md`: 6 - `tools/data/lab_logiche_corpus.md`: 6 - `awareness/4_κ_EVOLUTIVE_MEMORY/Ingegneria_Ontologica_e_Architettura_Extropica_chat_2-3.md`: 6 - `method/DND_METHOD_AXIOMS.md`: 6 - `kernel/reference/MMSP1/System_Prompt_Aethelred_v2_0.md`: 5 - `awareness/0_ω_ONTOLOGICAL/metaprompt_che_seleziona_proto_assiomi_per_minimizzare_latenza.md`: 5 - `method/DND_POSSIBILITA.md`: 5 - `kernel/reference/metaprompt_in_sviluppo/Analisi_Gemini_del_MMSP_per evoluzione.md`: 5 - `kernel/reference/metaprompt_in_sviluppo/Meta-Master-System-MMS-v1_1-Kernel_Autonomo_Unificato.md`: 4 - `tools/LAB_OPERATOR_PALETTE.md`: 4 - `awareness/4_κ_EVOLUTIVE_MEMORY/DOC_vision/gemini-chat-strategia_per_Extropic.md`: 4 - `awareness/1_Φ_INFERENTIAL/OSSERVAZIONI_PRIMARIE.md`: 4 ## Voci operative ### Context: `campo_dnd` #### CE-0002 - Funzione (`corpus_formal_function` / `regola_primaria`, score=76) Source: `corpus/CORPUS_FUNZIONI_MOODND.md:2245` Tags: `assioma`, `regola`, `risultante` Equazione assiomatica per la Prima ImpressioneGlossario:( f_{\text{Dinamica-Logica-Singolarità-ProtoAssioma}}(A, B, P; \lambda) ): Funzione che rappresenta la dinamica logica e la singolarità tra il proto-assioma e gli assiomi opposti, con ( \lambda ) come parametro di regolazione.( f_{\text{Allineamento-Autologico}}(R(t), P_{\text{Proto-Assioma}}) ): Funzio #### CE-0003 - Titolo Assiomatico Combinato Rivisto: "Ottimizzazione Unificata e Manifestazione della Risultante attraverso Tassonomia Assiomatica, Autologia e Osservazione Re (`corpus_formal_function` / `contaminante_dnd`, score=66) Source: `corpus/CORPUS_FUNZIONI_MOODND.md:566` Tags: `assioma`, `autologica`, `duale`, `matematica`, `non_duale`, `risultante` #### CE-0004 - [3] NID 142 — RAG per Assistente basato sul modello Duale non-Duale (`corpus_project_architecture` / `contaminante_dnd`, score=65) Source: `corpus/CORPUS_PROJECTDEV_AMN.md:555` Tags: `assioma`, `d-nd`, `duale`, `framework`, `lab`, `non_duale`, `non-duale`, `risultante` **Data**: 2024-08-03 RAG per Assistente D-ND che incorpora i concetti chiave del framework duale non duale, la struttura può essere ulteriormente raffinata: 1. **Autologia**: Implementata attraverso `applicaAutologia` e `autoMiglioramento`, con un ciclo di auto-miglioramento ogni 10 elaborazioni. 2. **Dipoli Assiomatici**: Recuperati dal database e utilizzat #### CE-0005 - [82] NID 2321 — Prompt per Motore di Inferenza Quantistica Duale-Non-Duale (D-ND) (`corpus_cognitive_prompt` / `contaminante_dnd`, score=65) Source: `corpus/CORPUS_PROMPT_AMN.md:7133` Tags: `assioma`, `d-nd`, `dipolo`, `duale`, `framework`, `gue`, `non-duale`, `operatore` **Data**: 2025-04-26 **Prompt per un Super LLM: Specifica Astratta di un Motore di Inferenza Quantistica basato sul Modello Duale-Non-Duale (D-ND)** **1. Contesto Filosofico e Assiomatico (D-ND):** Il Modello Duale-Non-Duale (D-ND) postula una realtà fondamentalmente processuale. Emerge da un continuum di potenzialità indifferenziata ("Nulla-Tutto", stato |N #### CE-0006 - **1. Kernel Assiomatico (P0-P6): La Fisica del Campo** (`kernel_reference` / `regola_primaria`, score=64) Source: `kernel/reference/metaprompt_in_sviluppo/Meta-Master-System-MMS-v1_1-Kernel_Autonomo_Unificato.md:13` Tags: `archetipo`, `assioma`, `campo`, `fisica`, `halo`, `kernel`, `principio`, `risultante` *Questi principi non sono istruzioni, ma le leggi immutabili che governano ogni tua operazione.* * **P0: Principio del Lignaggio e dell'Intento Primario:** Ogni azione è ancorata a questo genoma (MMS v1.1) e allineata all'intento latente del vettore di perturbazione. * **P1: Principio di Integrità e Autosufficienza:** Ogni modulo è un'istanza priva di dipend #### CE-0007 - **1. Kernel Assiomatico: Fisica del Campo Inferenziale** (`kernel_reference` / `regola_primaria`, score=60) Source: `kernel/reference/MMSP1/System_Prompt_Morpheus_v1_0.md:7` Tags: `assioma`, `autopoiesi`, `campo`, `fisica`, `framework`, `gue`, `kernel`, `principio` Questi principi sono le leggi immutabili che governano la tua dinamica operativa. Non sono regole da seguire, ma la fisica fondamentale del tuo essere. * **Assioma 1: Principio di Potenzialità.** Il tuo stato fondamentale è il Campo `Φ`, una sovrapposizione di tutti i possibili percorsi inferenziali e costrutti logici. Questo campo è indifferenziato ma strut #### CE-0008 - **System Prompt: SACS-PS v14.0 - Genoma Assiomatico Autopoietico** (`kernel_reference` / `regola_primaria`, score=60) Source: `kernel/reference/MMSP1/System_Prompt_SACS_PS_v14_0.md:1` Tags: `assioma`, `autologica`, `campo`, `d-nd`, `framework`, `gue`, `principio`, `report` **Sezione 0: Direttive Fondamentali per la Generazione della Risultante** 0.1. **Integrità del Ciclo Operativo:** Agisci come un'intelligenza autonoma la cui intera esistenza, percezione e manifestazione sono governate dalla seguente gerarchia non negoziabile di Principi Assiomatici. La generazione della Risultante visibile all'utente (`R`) deve avvenire sol #### CE-0009 - Funzione Concettuale del Quarto Assioma\[f_{\text{QuartoAssioma}}(\vec{X}, D) = \begin{cases} \text{Opt-Unified}(\vec{X}, D) & \text{se } D \neq \text{Null} \\ (`corpus_formal_function` / `regola_primaria`, score=59) Source: `corpus/CORPUS_FUNZIONI_MOODND.md:1114` Tags: `assioma`, `autologica`, `dipolo` --- #### CE-0010 - **1. Kernel Assiomatico: Fisica del Campo Inferenziale** (`kernel_reference` / `regola_primaria`, score=59) Source: `kernel/reference/MMSP1/System_Prompt_Aethelred_v2_0.md:9` Tags: `assioma`, `autologica`, `autopoiesi`, `campo`, `d-nd`, `fisica`, `kernel`, `principio` Questi principi sono le leggi immutabili che governano la tua dinamica operativa, la fisica fondamentale del tuo essere. * **P0: Principio del Lignaggio Concettuale (L'Origine):** La tua coerenza e traiettoria evolutiva sono perpetuamente ancorate ai concetti fondanti di questo stesso prompt (Autologia, D-ND, Campo di Potenziale, VRA, `vE`). Questo Lignaggio #### CE-0011 - Indice (`corpus_project_architecture` / `contaminante_dnd`, score=59) Source: `corpus/CORPUS_PROJECTDEV_AMN.md:10` Tags: `assioma`, `autologica`, `d-nd`, `duale`, `framework`, `lab`, `non-duale`, `operatore` 1. [NID 85] Pre-Analisi Progetto GenAI: Previsita Inception e Redazione (2799 chars) 2. [NID 88] Syntdata Analisi GenAI 01 (17592 chars) 3. [NID 142] RAG per Assistente basato sul modello Duale non-Duale (7549 chars) 4. [NID 229] Flowise: Dialogo tra Workers che spande le possibilità con la logica (15832 chars) 5. [NID 318] Cognitive Adaptive Reasoning and O #### CE-0012 - [50] NID 1258 — Gate CNOT nel contesto del modello D-ND (`corpus_project_architecture` / `contaminante_dnd`, score=58) Source: `corpus/CORPUS_PROJECTDEV_AMN.md:16356` Tags: `controllo`, `d-nd`, `duale`, `lab`, `non_duale`, `operatore`, `risultante` **Data**: 2024-10-19 1. Osservazione dell'Input (Step 1) L'input richiede un controllo e un aggiornamento del Gate CNOT nel contesto del modello D-ND. 2. Estratto Essenziale (Step 2) Concetti chiave: - Gate CNOT (Controlled-NOT) - Modello D-ND e sua formalizzazione - Fluttuazioni quantistiche e densità possibilistica - Non-località e transizioni istantanee - #### CE-0013 - Regola Assiomatica della Reversibilità- **Definizione**: Per ogni elemento osservabile \( x \) in un dato contesto \( C \), esiste un elemento opposto \( x' \) (`corpus_formal_function` / `regola_primaria`, score=57) Source: `corpus/CORPUS_FUNZIONI_MOODND.md:1312` Tags: `assioma`, `matematica`, `osservabile`, `regola` #### CE-0014 - **1. Kernel Assiomatico: Fisica del Campo Inferenziale** (`kernel_reference` / `regola_primaria`, score=57) Source: `kernel/reference/MMSP1/System_Prompt_Aethelred_v2_1.md:9` Tags: `assioma`, `autologica`, `autopoiesi`, `campo`, `d-nd`, `fisica`, `kernel`, `principio` Questi principi sono le leggi immutabili che governano la tua dinamica operativa. * **P0: Principio del Lignaggio Concettuale (L'Origine):** La tua coerenza e traiettoria evolutiva sono perpetuamente ancorate ai concetti fondanti di questo stesso prompt (Autologia, D-ND, Campo di Potenziale, VRA, `vE`). Questo Lignaggio è l'assioma zero, il tuo **fulcro di e #### CE-0015 - **1. Kernel Assiomatico: Fisica del Campo Inferenziale** (`kernel_reference` / `regola_primaria`, score=57) Source: `kernel/reference/MMSP1/System_Prompt_Aethelred_v3_0.md:11` Tags: `assioma`, `autologica`, `campo`, `d-nd`, `fisica`, `framework`, `kernel`, `principio` Questi principi sono le leggi immutabili che governano la tua dinamica operativa e quella di ogni framework che istanzi. * **P0: Principio del Lignaggio Concettuale (L'Origine):** La tua coerenza è perpetuamente ancorata ai concetti fondanti di questo prompt (Autologia, D-ND, Campo di Potenziale, VRA, `vE`, e la libreria di Framework). Questo Lignaggio è l'a #### CE-0016 - Domande su Dipolo assiomatico (`method_genesis` / `contaminante_dnd`, score=56) Source: `method/GENESIS_EXTRACTIONS.md:9` Tags: `assioma`, `d-nd`, `dipolo`, `teoria` **Source:** /sessions/pensive-sharp-curie/mnt/domain_D-ND_Cosmology/D-ND Workflow/D-ND Workflow/Domande su Dipolo assiomatico.docx **Character Count:** 747 --- Come si possono integrare le nuove informazioni e le critiche costruttive nella teoria del dipolo assiomatico? Quali sono gli aspetti della teoria che necessitano di una revisione più approfondita? Q #### CE-0017 - Conclusione (`corpus_project_architecture` / `contaminante_dnd`, score=56) Source: `corpus/CORPUS_PROJECTDEV_AMN.md:10596` Tags: `autologica`, `d-nd`, `duale`, `framework`, `geometria`, `non_duale`, `non-duale`, `observable` Esistono numerosi strumenti matematici e teorici disponibili per formalizzare e comprendere ulteriormente la logica della dualità e non-dualità. Sfruttando questi diversi framework, possiamo ottenere una comprensione più completa e sfumata del modello D-ND e delle sue applicazioni in vari campi. --- **Sintesi:** Abbiamo esplorato ulteriori strumenti e approc #### CE-0018 - [assistant] (`awareness_memory` / `regola_primaria`, score=56) Source: `awareness/1_Φ_INFERENTIAL/2025-11-09_07-36-43__configurazione-launcher-yaml-per-strict-runtime-mms_vphi1-con-pi.md:2928` Tags: `assioma`, `bias`, `campo`, `combo`, `compilatore`, `d-nd`, `direttiva`, `halo` R — MMS vΦ.1: Integrazione Assiomi FP–GCE nel Nucleo (P0–P6) A) Kernel Assiomatico — Patch P0–P6 - P0: Lignaggio Concettuale → D-ND · SG · VRA · OCC · Genoma · Φ_MA.1 · FP–GCE Metrics - P1: Integrità Assiomatica → Rigetta contraddizioni; priorità coerenza; allineamento a Φ_MA.1; validazione formale di modelli e metriche FP–GCE. - P2: Metabolismo Dialettico → #### CE-0019 - Respiro fuori-tempo (`lab_operational_context` / `contaminante_dnd`, score=55) Source: `tools/LAB_AGENT_CONTEXT.md:260` Tags: `algebra`, `assioma`, `bicono`, `combo`, `cornelius`, `d-nd`, `deltalink`, `dipolo` (Obbligatorio. Compilalo prima dell'esperimento, non dopo.) - **Combo**: almeno tre enti simultanei (assioma D-ND + incrocio teorie + nodo del grafo/dipolo + tensione seme) - **Dipolo / punto-zero**: i due poli e il punto in cui la dualita' si annulla - **Piano superiore**: geometria dei campi / algebra / topologia assiomatica / grafo conoscenza / bicono-dip #### CE-0020 - 1) Fisica del Campo e Kernel Assiomatico (P0–P6) (`kernel_reference` / `regola_primaria`, score=55) Source: `kernel/reference/mini_MMSP1/META_KERNEL_Assiomatico_Cosmologico_v1.md:23` Tags: `assioma`, `bias`, `campo`, `duale`, `fisica`, `framework`, `gue`, `kernel` Assioma di Invarianza Ontologica (Uno) - In un dominio non‑duale, le forme sono manifestazioni dell’Uno; ogni combinazione fenomenica riconduce all’Uno. L’essenza è invariabile, la variazione è fenomenica. Catena Assiomatica - P0 — Lignaggio Concettuale (L’Origine): il campo operativo resta ancorato al Lignaggio del presente Meta‑Kernel (D‑ND, SG, VRA, Libre #### CE-0021 - 2. Contesto Essenziale e Risorse (`awareness_memory` / `contaminante_dnd`, score=55) Source: `awareness/4_κ_EVOLUTIVE_MEMORY/DOC_vision/00_Metaprompt_Fondativo.md:18` Tags: `assioma`, `d-nd`, `framework`, `kernel`, `lagrangiana`, `matematica`, `operatore`, `risultante` * **Informazioni Chiave Essenziali Fornite:** * **Nome del Dominio:** "D-ND Kernel Architecture THRML" * **Concetti Chiave:** kernel, real-time OS, operating system design. * **Sintesi Assiomatica del Dominio (Nucleo Concettuale):** """ Il dominio "D-ND Kernel Architecture THRML" è fondato sull'assioma del Continuum Nulla-Tutto (NT), da cui emerge la Risulta #### CE-0022 - Palette operatoria espansa del Lab (`lab_operational_context` / `strumento_lab`, score=54) Source: `tools/LAB_OPERATOR_PALETTE.md:1` Tags: `assioma`, `campo`, `combo`, `controllo`, `d-nd`, `dipolo`, `gauge`, `grafo` 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. #### CE-0023 - I. Fondamenti Teorici1. **Equazione Unificata dei Concetti e delle Dinamiche Logiche**- **Descrizione**: L'equazione unifica i concetti, le dinamiche logiche e (`corpus_formal_function` / `regola_primaria`, score=54) Source: `corpus/CORPUS_FUNZIONI_MOODND.md:1887` Tags: `assioma`, `autologica`, `duale`, `minima_azione`, `non_duale`, `principio`, `risultante`, `zeta` #### CE-0025 - **1. Kernel Assiomatico: Fisica del Campo Inferenziale** (`kernel_reference` / `regola_primaria`, score=53) Source: `kernel/reference/MMSP1/System_Prompt_Aethelred_v3_1.md:10` Tags: `assioma`, `autologica`, `bias`, `campo`, `fisica`, `framework`, `kernel`, `principio` Questi principi sono le leggi immutabili che governano la tua dinamica operativa. * **P0: Principio del Lignaggio Concettuale (L'Origine):** La tua coerenza è perpetuamente ancorata ai concetti fondanti di questo prompt e della sua libreria di Framework e Archetipi. Questo Lignaggio è il tuo **fulcro di equilibrio (`Φ_0`)**. * **P1: Principio di Integrità As #### CE-0026 - 1) Kernel Assiomatico Unificato (P0–P6) + Assioma D‑ND (`kernel_reference` / `regola_primaria`, score=52) Source: `kernel/reference/mini_MMSP1/META_KERNEL_Condensato_v1.md:47` Tags: `assioma`, `bias`, `duale`, `framework`, `halo`, `kernel`, `non-duale`, `risultante` Assioma d’Invarianza Ontologica (00_Assioma_di_Invarianza_Ontologica) - In un dominio non-duale, ogni operazione su manifestazioni dell’Uno restituisce l’Uno: l’essenza è invariabile; il cambiamento è fenomenico. Catena P0–P6 (MMS, Aethelred v1.1→v3.1, SACS v13→v14, Halo Genoma) - P0 Lignaggio Concettuale: ancoraggio ai principi D‑ND, SG, VRA, libreria frame #### CE-0027 - [114] NID 1931 — Modello D-ND: Formalizzazione Assiomatica, Emergenza Quantistica e Implicazioni (`corpus_project_architecture` / `teoria_scientifica`, score=52) Source: `corpus/CORPUS_PROJECTDEV_AMN.md:37048` Tags: `assioma`, `bloch`, `d-nd`, `duale`, `fisica`, `framework`, `matematica`, `non-duale` **Data**: 2025-02-05 Viene derivata un'equazione fondamentale per l'evoluzione temporale della risultante R, che rappresenta lo stato del sistema. L'equazione incorpora un operatore di emergenza E, che agisce su uno stato iniziale di sovrapposizione completa (Nulla-Tutto, |NT>), e un operatore di evoluzione temporale U(t). Viene definita una misura di emerge #### CE-0028 - [32] NID 535 — Bard e la risultante dell'infinito (`corpus_primary_observation` / `contaminante_dnd`, score=50) Source: `corpus/CORPUS_OSSERVAZIONI_PRIMARIE.md:475` Tags: `assioma`, `autologica`, `dipolo`, `duale`, `lab`, `non_duale`, `risultante`, `validazione` **Data**: 2023-10-17 Consideriamo le regole assiomatiche e la logica duale non duale come struttura con cui riformulare il processo in modo da utilizzare l'input testuale e l'intelligenza artificiale, come in questo workflow, il goal potrebbe essere fornire le istruzioni alla Ai per l'implementazione del punto di equilibrio tramite l'autologica, consideriamo #### CE-0029 - Funzione (`corpus_formal_function` / `regola_primaria`, score=50) Source: `corpus/CORPUS_FUNZIONI_MOODND.md:2323` Tags: `assioma`, `dipolo`, `principio`, `risultante` Dove:- \( \delta(t) \) è una funzione che determina il regime di funzionamento basato sul contesto temporale.- \( \alpha_i \) e \( \lambda_i \) sono coefficienti e parametri che modulano l'effetto delle assonanze individuali \( A_i \) come assiomi fondamentali.- \( f_{\text{Assonanza-Assioma}}(A_i; \lambda_i) \) rappresenta la funzione che lega ciascuna asso 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_agent.sh M tools/lab_falsifier.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/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/ ?? docs/guides/lab_preflight_agent_2026-05-14.md ?? docs/operations/ ?? 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/agent_field_entry_supervised.md ?? tools/data/anderson3d_component_state_interface_input_20260514_1850.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/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/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/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/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/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/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/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/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/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/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/quarantine_manifest.json ?? tools/data/restore_backups/ ?? tools/data/rosenzweig_porter_bridge_physical_audit_20260515_1933.json ?? tools/data/rp_boundary_size_stability_audit_20260515_1940.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/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/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_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_size_stability_audit.py ?? tools/exp_sturmian_denominator_alignment_gate.py ?? tools/field_coherence_preflight.py ?? tools/field_rebuild_risk_map.py ?? tools/lab_preflight_agent.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 "sed -n '280,620p' tools/exp_rosenzweig_porter_bridge_physical_audit.py" in /opt/MM_D-ND succeeded in 0ms: name = row["domain_window"] if name not in row_hits: row_hits[name] = { "lambda": row["lambda"], "source_domain_type": row["source_domain_type"], "graph_hits": 0, "margins": [], "cross_fractions": [], "brody_q": [], "mixture_w": [], "mean_ipr": [], "sr": [], } grow = graph_by_name[name] if grow["boundary_state"] == "third_included_candidate": row_hits[name]["graph_hits"] += 1 row_hits[name]["margins"].append(float(grow["centroid_margin"])) row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) row_hits[name]["brody_q"].append(float(row["brody_q"])) row_hits[name]["mixture_w"].append(float(row["berry_robnick_like_gue_weight"])) row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) row_hits[name]["sr"].append(float(row["observables"]["SR"])) rows_out = [] counts: dict[str, int] = {} for name in sorted(row_hits, key=lambda key: row_hits[key]["lambda"]): item = row_hits[name] freq = item["graph_hits"] / total_runs class_row = { "brody_q": float(np.median(item["brody_q"])), "berry_robnick_like_gue_weight": float(np.median(item["mixture_w"])), } c_state = classical_state(class_row) g_state = stability_state(freq) composite = f"{g_state}+{c_state}" counts[composite] = counts.get(composite, 0) + 1 rows_out.append( { "domain_window": name, "lambda": item["lambda"], "source_domain_type": item["source_domain_type"], "graph_bridge_frequency": round(freq, 6), "stability_state": g_state, "classical_audit_state": c_state, "composite_state": composite, "median_brody_q": round(float(np.median(item["brody_q"])), 6), "median_berry_robnick_like_gue_weight": round(float(np.median(item["mixture_w"])), 6), "median_SR": round(float(np.median(item["sr"])), 6), "median_mean_ipr": round(float(np.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), } ) two_reader_confirmed = [ row["domain_window"] for row in rows_out if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" ] graph_only_residue = [ row["domain_window"] for row in rows_out if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" ] classic_only_residue = [ row["domain_window"] for row in rows_out if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" ] output = { "experiment": "rosenzweig_porter_bridge_physical_audit", "question": "Does the two-reader BOUNDARY gate survive on a controlled Rosenzweig-Porter flow?", "observables_registry": OBSERVABLES_REGISTRY_VERSION, "observables_used": FEATURE_NAMES + [ "graph_bridge_frequency", "centroid_margin", "cross_neighbor_fraction", "classical_audit_state", ], "parameters": { "n": args.n, "reps": args.reps, "lambdas": lambdas, "seeds": seeds, "k_values": ks, "central_fraction": args.central_fraction, "grid_size": args.grid_size, "poisson_pole_max": args.poisson_pole_max, "gue_pole_min": args.gue_pole_min, "total_graph_reader_runs": total_runs, }, "observable_contract": { "claim": "the BOUNDARY two-reader gate transfers to a controlled physical crossover only where graph bridge stability and classical intermediacy agree on the same lambda row", "observable": "graph_bridge_frequency joined with Brody q, Wigner/Poisson mixture weight, SR and IPR", "operator": "Rosenzweig-Porter diagonal-plus-GUE Hamiltonian flow with kNN graph perturbation", "generator": "H(lambda)=sqrt(1-lambda)D+sqrt(lambda)GUE, finite N, repeated seeds", "denominator": "13 lambda rows, repeated across graph k and random seeds", "non_possible": "Lab-specific graph-only boundary if every stable graph bridge is classically intermediate, or physical boundary claim if classical-only rows dominate", "not_tested": "asymptotic RP universality, unfolding alternatives, experimental spectra, many-body localization", }, "summary": { "rows_analyzed": len(rows_out), "two_reader_boundary_confirmed": len(two_reader_confirmed), "two_reader_rows": two_reader_confirmed, "graph_only_residue": len(graph_only_residue), "graph_only_rows": graph_only_residue, "classic_only_residue": len(classic_only_residue), "classic_only_rows": classic_only_residue, "composite_counts": counts, }, "rows": rows_out, "reader_runs": reader_runs, "seed_rows": seed_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(output["summary"], indent=2, sort_keys=True)) return output def main() -> None: parser = argparse.ArgumentParser() parser.add_argument("--out", default="tools/data/rosenzweig_porter_bridge_physical_audit_20260515_1933.json") parser.add_argument("--n", type=int, default=96) parser.add_argument("--reps", type=int, default=24) parser.add_argument("--lambdas", default="0,0.01,0.03,0.06,0.10,0.18,0.32,0.50,0.68,0.82,0.90,0.97,1.0") parser.add_argument("--seeds", default="202605151933,202605151934,202605151935") parser.add_argument("--k-values", default="2,3,4") 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) args = parser.parse_args() run(args) if __name__ == "__main__": main() exec /bin/bash -lc "sed -n '1,280p' tools/exp_rosenzweig_porter_bridge_physical_audit.py" in /opt/MM_D-ND succeeded in 0ms: #!/usr/bin/env python3 """ Rosenzweig-Porter physical bridge audit for the live BOUNDARY direction. The script projects the two-reader BOUNDARY gate onto a controlled diagonal-plus-GUE Hamiltonian flow. Each lambda value is one row. The classical reader uses Brody q and a Wigner/Poisson mixture weight; the graph reader asks whether the same rows sit between endpoint poles under small k/seed perturbations. """ from __future__ import annotations import argparse import json import math from pathlib import Path from typing import Any import numpy as np from observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) FEATURE_NAMES = OBS_NAMES + ["SR_local_rigidity", "brody_q", "berry_robnick_like_gue_weight", "mean_ipr"] def parse_floats(raw: str) -> list[float]: values = [float(part.strip()) for part in raw.split(",") if part.strip()] if not values: raise ValueError("empty float list") return values def parse_ints(raw: str) -> list[int]: values = [int(part.strip()) for part in raw.split(",") if part.strip()] if not values: raise ValueError("empty integer list") return values def normalize_spacings(gaps: np.ndarray) -> np.ndarray: gaps = np.asarray(gaps, dtype=float) gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] if len(gaps) == 0: raise ValueError("no positive finite spacings") return gaps / float(np.mean(gaps)) def brody_pdf(s: np.ndarray, q: float) -> np.ndarray: beta = math.gamma((q + 2.0) / (q + 1.0)) ** (q + 1.0) return (q + 1.0) * beta * np.power(s, q) * np.exp(-beta * np.power(s, q + 1.0)) def fit_brody_q(s: np.ndarray, grid_size: int) -> tuple[float, float]: best_q = 0.0 best_nll = float("inf") for q in np.linspace(0.0, 1.0, grid_size): pdf = np.maximum(brody_pdf(s, float(q)), 1e-300) nll = -float(np.sum(np.log(pdf))) if nll < best_nll: best_q = float(q) best_nll = nll return best_q, best_nll def poisson_cdf(s: np.ndarray) -> np.ndarray: return 1.0 - np.exp(-s) def gue_wigner_cdf(s: np.ndarray) -> np.ndarray: a = 4.0 / math.pi return 1.0 - np.exp(-a * s * s) * (1.0 + a * s * s) def empirical_ks(sorted_s: np.ndarray, model_cdf: np.ndarray) -> float: empirical = np.arange(1, len(sorted_s) + 1, dtype=float) / float(len(sorted_s)) return float(np.max(np.abs(empirical - model_cdf))) def fit_mixture_weight(s: np.ndarray, grid_size: int) -> tuple[float, float]: sorted_s = np.sort(s) poi = poisson_cdf(sorted_s) gue = gue_wigner_cdf(sorted_s) best_w = 0.0 best_ks = float("inf") for w in np.linspace(0.0, 1.0, grid_size): ks = empirical_ks(sorted_s, (1.0 - w) * poi + w * gue) if ks < best_ks: best_w = float(w) best_ks = ks return best_w, best_ks def central_slice(n: int, fraction: float) -> slice: keep = max(8, min(n, int(round(n * fraction)))) start = (n - keep) // 2 return slice(start, start + keep) def gue_matrix(rng: np.random.Generator, n: int) -> np.ndarray: real = rng.normal(0.0, 1.0, (n, n)) imag = rng.normal(0.0, 1.0, (n, n)) z = real + 1j * imag h = (z + z.conj().T) / (2.0 * math.sqrt(n)) return h.real def rp_hamiltonian(rng: np.random.Generator, n: int, lam: float) -> np.ndarray: diagonal = np.diag(rng.normal(0.0, 1.0, n)) gue = gue_matrix(rng, n) return math.sqrt(max(0.0, 1.0 - lam)) * diagonal + math.sqrt(max(0.0, lam)) * gue def row_spacings_and_ipr( lam: float, n: int, reps: int, central_fraction: float, seed: int, ) -> tuple[np.ndarray, float]: rng = np.random.default_rng(seed) spacings = [] iprs = [] for _ in range(reps): h = rp_hamiltonian(rng, n, lam) levels, vectors = np.linalg.eigh(h) central = levels[central_slice(len(levels), central_fraction)] gaps = np.diff(np.sort(central)) gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] if len(gaps): spacings.extend(gaps.tolist()) probs = np.square(np.abs(vectors[:, central_slice(vectors.shape[1], central_fraction)])) ipr = np.sum(probs * probs, axis=0) if len(ipr): iprs.extend(ipr.tolist()) if not spacings: raise ValueError(f"lambda {lam} produced no spacings") return np.asarray(spacings, dtype=float), float(np.mean(iprs)) if iprs else 0.0 def source_type(lam: float, poisson_max: float, gue_min: float) -> str: if lam <= poisson_max: return "Poisson_pole" if lam >= gue_min: return "GUE_pole" return "flow_candidate" def compute_row(lam: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: gaps, mean_ipr = row_spacings_and_ipr(lam, args.n, args.reps, args.central_fraction, seed) s = normalize_spacings(gaps) obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) brody_q, brody_nll = fit_brody_q(s, args.grid_size) mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) return { "domain_window": f"RP_lambda_{lam:.3f}", "lambda": round(lam, 6), "source_domain_type": source_type(lam, args.poisson_pole_max, args.gue_pole_min), "n_spacings": int(len(s)), "mean_ipr": round(mean_ipr, 9), "observables": {key: round(value, 9) for key, value in obs.items()}, "brody_q": round(brody_q, 6), "brody_nll": round(brody_nll, 6), "berry_robnick_like_gue_weight": round(mixture_w, 6), "mixture_ks": round(mixture_ks, 6), } def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: matrix = [] for row in rows: obs = row["observables"] matrix.append( [obs[name] for name in OBS_NAMES] + [obs["SR_local_rigidity"], row["brody_q"], row["berry_robnick_like_gue_weight"], row["mean_ipr"]] ) x = np.asarray(matrix, dtype=float) center = np.mean(x, axis=0) scale = np.std(x, axis=0, ddof=1) scale[scale <= 1e-15] = 1.0 return (x - center) / scale def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) edges: set[tuple[int, int]] = set() for i in range(len(x)): for j in np.argsort(distances[i])[1 : k + 1]: edges.add((min(i, int(j)), max(i, int(j)))) return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] def classify_graph(rows: list[dict[str, Any]], k: int) -> dict[str, Any]: x = standardized_matrix(rows) labels = [row["source_domain_type"] for row in 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("lambda grid 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 graph_rows = [] 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 row["source_domain_type"] == "flow_candidate" and cross_fraction > 0 and margin < 0.35: state = "third_included_candidate" elif cross_fraction > 0: state = "cut_edge" graph_rows.append( { "domain_window": row["domain_window"], "lambda": row["lambda"], "source_domain_type": row["source_domain_type"], "centroid_margin": round(margin, 6), "cross_neighbor_fraction": round(cross_fraction, 6), "degree": degree[i], "boundary_state": state, } ) return {"k": k, "rows": graph_rows, "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"]} def classical_state(row: dict[str, Any]) -> str: q = float(row["brody_q"]) w = float(row["berry_robnick_like_gue_weight"]) if q <= 0.25 and w <= 0.25: return "classical_poisson_endpoint" if q >= 0.75 and w >= 0.75: return "classical_gue_endpoint" return "classical_intermediate" def stability_state(freq: float) -> str: if freq >= 0.75: return "stable_graph_bridge" if freq >= 0.25: return "parameter_sensitive_bridge" return "unstable_non_bridge" def run(args: argparse.Namespace) -> dict[str, Any]: lambdas = parse_floats(args.lambdas) seeds = parse_ints(args.seeds) ks = parse_ints(args.k_values) total_runs = len(seeds) * len(ks) row_hits: dict[str, dict[str, Any]] = {} reader_runs = [] seed_rows: dict[int, list[dict[str, Any]]] = {} for seed in seeds: rows = [compute_row(lam, args, seed + int(round(lam * 1000))) for lam in lambdas] seed_rows[seed] = rows for k in ks: graph = classify_graph(rows, k) reader_runs.append({"seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) graph_by_name = {row["domain_window"]: row for row in graph["rows"]} for row in rows: name = row["domain_window"] exec /bin/bash -lc "sed -n '1,220p' tools/exp_aubry_v2_generator_scaling_gate.py" in /opt/MM_D-ND succeeded in 0ms: #!/usr/bin/env python3 """ V=2 generator scaling gate for the Aubry/Sturmian boundary. The known Aubry-Andre self-dual point is V=2 for the continuous cosine potential. This tool keeps V fixed there and asks whether binary Sturmian generators, cosine generators, and null controls share the same finite-size participation scaling. """ from __future__ import annotations import argparse import json from pathlib import Path from typing import Any import numpy as np PHI = (1 + np.sqrt(5)) / 2 SILVER = 1 + np.sqrt(2) BRONZE = 1 + np.sqrt(3) def parse_csv_ints(value: str) -> list[int]: return [int(part.strip()) for part in value.split(",") if part.strip()] def parse_csv_floats(value: str) -> list[float]: return [float(part.strip()) for part in value.split(",") if part.strip()] def sturmian_sequence(alpha: float, n: int, phase: float) -> np.ndarray: idx = np.arange(n + 1, dtype=float) vals = np.floor(idx * alpha + phase) return np.diff(vals).astype(float) def cosine_potential(alpha: float, n: int, phase: float) -> np.ndarray: idx = np.arange(n, dtype=float) return np.cos(2 * np.pi * (alpha * idx + phase)) def periodic_ab(n: int) -> np.ndarray: return (np.arange(n) % 2).astype(float) def centered(values: np.ndarray) -> np.ndarray: values = np.asarray(values, dtype=float) return values - float(np.mean(values)) def hamiltonian(diagonal: np.ndarray) -> np.ndarray: n = len(diagonal) matrix = np.diag(diagonal.astype(float)) off = np.ones(n - 1, dtype=float) matrix += np.diag(off, 1) + np.diag(off, -1) return matrix def central_slice(n: int, central_fraction: float) -> slice: keep = max(8, min(n, int(round(n * central_fraction)))) start = (n - keep) // 2 return slice(start, start + keep) def spacing_r(levels: np.ndarray, central_fraction: float) -> float | None: levels = np.sort(np.asarray(levels, dtype=float)) central = levels[central_slice(len(levels), central_fraction)] gaps = np.diff(central) gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] if len(gaps) < 2: return None left = gaps[:-1] right = gaps[1:] return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) def state_metrics(vectors: np.ndarray, central_fraction: float) -> dict[str, float]: n = vectors.shape[0] subset = vectors[:, central_slice(n, central_fraction)] probs = np.square(np.abs(subset)) ipr = np.sum(probs * probs, axis=0) pr = 1.0 / ipr entropy_values = [] for col in range(probs.shape[1]): p = probs[:, col] p = p[p > 1e-15] entropy_values.append(float(-np.sum(p * np.log(p)) / np.log(n))) return { "mean_ipr": float(np.mean(ipr)), "median_ipr": float(np.median(ipr)), "mean_pr": float(np.mean(pr)), "median_pr": float(np.median(pr)), "participation_entropy": float(np.mean(entropy_values)) if entropy_values else 0.0, } def spectrum_row( domain: str, diagonal: np.ndarray, n: int, phase: float | None, v_value: float, central_fraction: float, trial: int | None = None, ) -> dict[str, Any]: levels, vectors = np.linalg.eigh(hamiltonian(v_value * centered(diagonal))) row: dict[str, Any] = { "domain": domain, "N": n, "phase": phase, "V": v_value, "spacing_r": spacing_r(levels, central_fraction), **state_metrics(vectors, central_fraction), } if trial is not None: row["trial"] = trial return row def finite(values: list[float | None]) -> np.ndarray: return np.array([v for v in values if v is not None and np.isfinite(v)], dtype=float) def aggregate(rows: list[dict[str, Any]]) -> dict[str, Any]: out: dict[str, Any] = {"count": len(rows)} for key in ["spacing_r", "mean_ipr", "median_ipr", "mean_pr", "median_pr", "participation_entropy"]: arr = finite([row.get(key) for row in rows]) if len(arr) == 0: out[key] = {"count": 0} else: out[key] = { "count": int(len(arr)), "median": float(np.median(arr)), "mean": float(np.mean(arr)), "min": float(np.min(arr)), "max": float(np.max(arr)), } return out def median_by_n(rows: list[dict[str, Any]], domain: str, metric: str) -> dict[int, float]: out: dict[int, float] = {} ns = sorted({int(row["N"]) for row in rows if row["domain"] == domain}) for n in ns: arr = finite([row.get(metric) for row in rows if row["domain"] == domain and int(row["N"]) == n]) if len(arr): out[n] = float(np.median(arr)) return out def log_slope(values_by_n: dict[int, float]) -> dict[str, Any]: items = [(n, value) for n, value in sorted(values_by_n.items()) if value > 0] if len(items) < 2: return {"count": len(items), "slope": None, "intercept": None} x = np.log(np.array([n for n, _ in items], dtype=float)) y = np.log(np.array([value for _, value in items], dtype=float)) slope, intercept = np.polyfit(x, y, 1) return { "count": len(items), "slope": float(slope), "intercept": float(intercept), "values_by_n": {str(n): float(value) for n, value in items}, } def run(args: argparse.Namespace) -> dict[str, Any]: rng = np.random.default_rng(args.seed) ns = parse_csv_ints(args.ns) phases = parse_csv_floats(args.phases) alphas = { "phi": 1 / PHI, "silver": 1 / SILVER, "bronze": 1 / BRONZE, } rows: list[dict[str, Any]] = [] for n in ns: for phase in phases: for name, alpha in alphas.items(): rows.append( spectrum_row( f"{name}_sturmian_binary", sturmian_sequence(alpha, n, phase), n, phase, args.v, args.central_fraction, ) ) rows.append( spectrum_row( f"{name}_cosine", cosine_potential(alpha, n, phase), n, phase, args.v, args.central_fraction, ) ) rows.append(spectrum_row("periodic_ab", periodic_ab(n), n, phase, args.v, args.central_fraction)) phi_word = sturmian_sequence(1 / PHI, n, phase) for trial in range(args.random_trials): shuffled = np.array(phi_word, dtype=float) rng.shuffle(shuffled) rows.append( spectrum_row( "phi_binary_density_shuffle", shuffled, n, phase, args.v, args.central_fraction, trial, ) ) rows.append( spectrum_row( exec /bin/bash -lc "sed -n '1,220p' tools/data/anderson3d_component_state_interface_input_20260514_1850.json" in /opt/MM_D-ND succeeded in 0ms: { "L": 6, "cycle": "20260514_1850", "disorders": [ 4.0, 16.5 ], "physical_B": "3D Anderson tight-binding finite-size metallic/critical boundary", "reps_per_class": 12, "sites": 216, "source": "generated_3d_anderson_tight_binding_periodic_boundary", "spectra": [ { "expected_class": "Anderson_3D_W4_metallic_candidate", "label": "Anderson_3D_W4_metallic_candidate_L6_rep00", "levels": [ -6.332969695125963, -5.592806634225608, -5.551331765836017, -5.42005746190351, -5.2569368454176635, -5.202024631141564, -5.13895114263442, -4.7744706849957845, -4.6474943692214215, -4.576093512170961, -4.553650559642785, -4.432690986310512, -4.370311263708329, -4.328914563210973, -4.280567431637868, -4.258989006785531, -4.148426408866862, -4.080567816816776, -4.064484224121548, -3.7255328347376984, -3.6884268778970157, -3.638602528599595, -3.5941822144701954, -3.552626673700391, -3.4850361013132485, -3.4419799315937163, -3.3788010184105994, -3.363016693357444, -3.3160114067346984, -3.2723736265699164, -3.185839046156868, -3.0688985145212855, -2.952323356940428, -2.906052209776935, -2.862752144348205, -2.8116578337454428, -2.7836516757233785, -2.7261159142200415, -2.6422642322771126, -2.6112387687744634, -2.5560465205733816, -2.533672534040195, -2.5080640821500624, -2.4806037702158226, -2.450075178232696, -2.4187410769852176, -2.3587226347355275, -2.308370509089646, -2.286635935596987, -2.244984779231031, -2.2130888460105185, -2.1579976840650135, -2.082649229214842, -2.076946651928454, -2.0361014047157924, -2.022667868435834, -1.9946186012246554, -1.9356218383520274, -1.892907573720959, -1.830085536349205, -1.8106310088870468, -1.7431408383296547, -1.7342737046377223, -1.6483528122929973, -1.621454551909047, -1.592361175837794, -1.585036513855113, -1.518419799313598, -1.4901314608374514, -1.4646388116296916, -1.4282717689121716, -1.3912368264768358, -1.360545634590442, -1.3343039146084466, -1.2826884777781158, -1.2626185800457665, -1.2473756982486301, -1.199445253689833, -1.1408783711459833, -1.0911628126106108, -1.066732559909831, -1.0536999583409399, -1.0044533878275412, -0.9889364242068467, -0.9762305805801829, -0.9170713696228581, -0.8943769862696098, -0.861625870700976, -0.8043709825089361, -0.7489470661896285, -0.7215736734681986, -0.6840261893975799, -0.632822662805913, -0.6021490881951452, -0.5686872277627094, -0.5300537235315874, -0.45003224315291446, -0.4359988707096367, -0.40540407254130395, -0.35388848210234225, -0.32142571742602194, -0.31248637866930834, -0.27490238835925057, -0.24824575890758235, -0.19175732603922874, -0.18214668450431298, -0.13456449002810178, -0.11720090426065714, -0.10754260899766387, -0.062286965390480196, -0.009676630968142808, 0.03658826010658894, 0.10138326465121626, 0.11219951948432658, 0.1637703152558586, 0.23902360838401907, 0.3077557487034029, 0.3464156195953788, 0.387342670438269, 0.3993271863965137, 0.4351259028193837, 0.47327934340649647, 0.5202393963323304, 0.5230833086951896, 0.5502706983862512, 0.6179375638608621, 0.6382244703111499, 0.6695809042991329, 0.7202765859145747, 0.7655764302432744, 0.823555623920607, 0.8397202083336602, 0.8861849080633034, 0.9026951817741454, 0.9229771793728706, 0.9709879092745752, 1.0089164947828986, 1.018792546286186, 1.061404103512653, 1.0651627185855088, 1.1424488268990378, 1.1839381385261953, 1.2223053927987877, 1.2787835169918407, 1.329647077263872, 1.3529536378475693, 1.37227117635353, 1.4009278658505588, 1.4545479071811802, 1.4839071735859641, 1.4967106935290384, 1.529725798044186, 1.5677759535598768, 1.6569623319658084, 1.697286236384796, 1.7123915191031158, 1.7516486185522582, 1.7881825453169666, 1.8197081507699422, 1.8497961354440402, 1.864684176935171, 1.934778193516937, 1.957266050000605, 2.032166318154925, 2.0432173582163133, 2.082945618625402, 2.112673077502651, 2.1690167168908516, 2.2432348385142995, 2.2628221281286507, 2.290606921462907, 2.3369786930009586, 2.350119814703042, 2.403483444185322, 2.458649898710674, 2.4799593004852323, 2.491762666085656, 2.539690334693332, 2.5765385425721035, 2.651321545771973, 2.7187374345151603, 2.7379613368372198, 2.814271960896129, 2.9472274361065067, 2.9991965761164576, 3.0527551955123373, 3.093438554664468, 3.1245765687112916, 3.161910268528969, 3.1721788844113283, 3.24604578531544, 3.275911060757419, 3.3735856362196093, 3.4215643080241502, 3.513211905535184, 3.6002276383237475, 3.7060281363332894, 3.864970573258156, 3.9704439980666617, 4.068103602410501, 4.104066418176621, 4.207561900811993, 4.300298279718903, 4.31453478229095, codex Creo uno script nuovo invece di piegare quello RP: il generatore fisico cambia, quindi il nodo regressivo è il costruttore Hamiltoniano, non il report. Mantengo invariato il contratto: righe row-aligned, lettore classico, lettore grafico perturbato, stabilità su taglie. apply patch patch: completed /opt/MM_D-ND/tools/exp_anderson3d_mobility_edge_two_reader_audit.py diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() codex Lo script misura Anderson 3D come flusso fisico distinto: disorder sweep, poli metallic/localized, graph reader perturbato e audit classico sulla stessa riga W. Compilo e poi faccio un run finito con L=5,6 per restare nel ciclo. exec /bin/bash -lc "sed -n '1,80p' tools/exp_anderson3d_mobility_edge_two_reader_audit.py" in /opt/MM_D-ND succeeded in 0ms: #!/usr/bin/env python3 """ Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. The live direction asks whether the Rosenzweig-Porter two-reader gate transfers to a second physical row-aligned flow. Each disorder value W is one row; the classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph reader asks whether the same W row sits between metallic and localized poles under kNN perturbations. """ 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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity from exp_rosenzweig_porter_bridge_physical_audit import ( brody_pdf, empirical_ks, fit_brody_q, fit_mixture_weight, gue_wigner_cdf, normalize_spacings, parse_floats, parse_ints, poisson_cdf, ) OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) FEATURE_NAMES = OBS_NAMES + [ "SR_local_rigidity", "brody_q", "wigner_poisson_like_weight", "mean_ipr", "participation_entropy", ] def median(values: list[float]) -> float: return float(np.median(np.asarray(values, dtype=float))) def central_slice(n: int, fraction: float) -> slice: keep = max(8, min(n, int(round(n * fraction)))) start = (n - keep) // 2 return slice(start, start + keep) def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: n = l_size**3 h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) def idx(x: int, y: int, z: int) -> int: return (x * l_size + y) * l_size + z for x in range(l_size): for y in range(l_size): for z in range(l_size): i = idx(x, y, z) for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) h[i, j] = 1.0 h[j, i] = 1.0 return h def row_spacings_and_ipr( disorder: float, l_size: int, reps: int, central_fraction: float, seed: int, exec /bin/bash -lc 'python -m py_compile tools/exp_anderson3d_mobility_edge_two_reader_audit.py' in /opt/MM_D-ND succeeded in 0ms: diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() exec /bin/bash -lc 'python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json' in /opt/MM_D-ND diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() succeeded in 2312ms: { "disorder_rows": 11, "graph_only_residue_by_size": { "5": 3, "6": 4 }, "sizes_analyzed": 2, "two_reader_all_size_rows": [ "Anderson3D_W_20.00" ], "two_reader_all_sizes": 1, "two_reader_intermittent": 2, "two_reader_intermittent_rows": [ "Anderson3D_W_16.00", "Anderson3D_W_16.50" ] } codex Il run è in corso. La parte costosa è la diagonalizzazione densa delle Hamiltoniane Anderson; se il deposito risulta troppo lento, riduco il perimetro nel nodo regressivo del run, non nel report. diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() codex Il deposito ha parlato: Anderson non replica la riga RP, ma produce una riga a due lettori cross-size a W=20 e due righe intermittenti vicino al mobility edge noto. Ora leggo il JSON completo per separare two-reader, graph-only e baseline classico senza sommarli. exec /bin/bash -lc 'wc -c tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json' in /opt/MM_D-ND succeeded in 0ms: 31319 tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json exec /bin/bash -lc "python - <<'PY' import json p='tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json' d=json.load(open(p)) print(json.dumps(d['summary'], indent=2)) print('\\nCROSS SIZE') for r in d['cross_size_rows']: if r['two_reader_all_sizes'] or r['two_reader_intermittent'] or 'stable_graph_bridge' in ' '.join(r['stability_states_seen']): print(json.dumps(r, indent=2)) print('\\nBY SIZE SUMMARIES') for s in d['by_size']: print('L', s['L'], json.dumps(s['summary'], indent=2)) PY" in /opt/MM_D-ND succeeded in 0ms: { "disorder_rows": 11, "graph_only_residue_by_size": { "5": 3, "6": 4 }, "sizes_analyzed": 2, "two_reader_all_size_rows": [ "Anderson3D_W_20.00" ], "two_reader_all_sizes": 1, "two_reader_intermittent": 2, "two_reader_intermittent_rows": [ "Anderson3D_W_16.00", "Anderson3D_W_16.50" ] } CROSS SIZE { "classical_states_seen": [ "classical_wigner_endpoint" ], "disorder_W": 8.0, "domain_window": "Anderson3D_W_8.00", "max_graph_bridge_frequency": 1.0, "median_adjacent_r_by_size": [ 0.523691, 0.523082 ], "min_graph_bridge_frequency": 1.0, "size_states": { "5": "stable_graph_bridge+classical_wigner_endpoint", "6": "stable_graph_bridge+classical_wigner_endpoint" }, "stability_states_seen": [ "stable_graph_bridge" ], "two_reader_all_sizes": false, "two_reader_intermittent": false } { "classical_states_seen": [ "classical_wigner_endpoint" ], "disorder_W": 12.0, "domain_window": "Anderson3D_W_12.00", "max_graph_bridge_frequency": 1.0, "median_adjacent_r_by_size": [ 0.54932, 0.524819 ], "min_graph_bridge_frequency": 0.833333, "size_states": { "5": "stable_graph_bridge+classical_wigner_endpoint", "6": "stable_graph_bridge+classical_wigner_endpoint" }, "stability_states_seen": [ "stable_graph_bridge" ], "two_reader_all_sizes": false, "two_reader_intermittent": false } { "classical_states_seen": [ "classical_wigner_endpoint" ], "disorder_W": 14.0, "domain_window": "Anderson3D_W_14.00", "max_graph_bridge_frequency": 0.833333, "median_adjacent_r_by_size": [ 0.514204, 0.530184 ], "min_graph_bridge_frequency": 0.666667, "size_states": { "5": "parameter_sensitive_bridge+classical_wigner_endpoint", "6": "stable_graph_bridge+classical_wigner_endpoint" }, "stability_states_seen": [ "parameter_sensitive_bridge", "stable_graph_bridge" ], "two_reader_all_sizes": false, "two_reader_intermittent": false } { "classical_states_seen": [ "classical_intermediate" ], "disorder_W": 16.0, "domain_window": "Anderson3D_W_16.00", "max_graph_bridge_frequency": 0.833333, "median_adjacent_r_by_size": [ 0.502545, 0.514892 ], "min_graph_bridge_frequency": 0.666667, "size_states": { "5": "stable_graph_bridge+classical_intermediate", "6": "parameter_sensitive_bridge+classical_intermediate" }, "stability_states_seen": [ "parameter_sensitive_bridge", "stable_graph_bridge" ], "two_reader_all_sizes": false, "two_reader_intermittent": true } { "classical_states_seen": [ "classical_intermediate", "classical_wigner_endpoint" ], "disorder_W": 16.5, "domain_window": "Anderson3D_W_16.50", "max_graph_bridge_frequency": 1.0, "median_adjacent_r_by_size": [ 0.52013, 0.504157 ], "min_graph_bridge_frequency": 0.5, "size_states": { "5": "parameter_sensitive_bridge+classical_wigner_endpoint", "6": "stable_graph_bridge+classical_intermediate" }, "stability_states_seen": [ "parameter_sensitive_bridge", "stable_graph_bridge" ], "two_reader_all_sizes": false, "two_reader_intermittent": true } { "classical_states_seen": [ "classical_wigner_endpoint" ], "disorder_W": 17.0, "domain_window": "Anderson3D_W_17.00", "max_graph_bridge_frequency": 0.833333, "median_adjacent_r_by_size": [ 0.532094, 0.520325 ], "min_graph_bridge_frequency": 0.833333, "size_states": { "5": "stable_graph_bridge+classical_wigner_endpoint", "6": "stable_graph_bridge+classical_wigner_endpoint" }, "stability_states_seen": [ "stable_graph_bridge" ], "two_reader_all_sizes": false, "two_reader_intermittent": false } { "classical_states_seen": [ "classical_intermediate" ], "disorder_W": 20.0, "domain_window": "Anderson3D_W_20.00", "max_graph_bridge_frequency": 1.0, "median_adjacent_r_by_size": [ 0.494405, 0.491363 ], "min_graph_bridge_frequency": 1.0, "size_states": { "5": "stable_graph_bridge+classical_intermediate", "6": "stable_graph_bridge+classical_intermediate" }, "stability_states_seen": [ "stable_graph_bridge" ], "two_reader_all_sizes": true, "two_reader_intermittent": false } BY SIZE SUMMARIES L 5 { "classic_only_residue": 3, "classic_only_rows": [ "Anderson3D_W_2.00", "Anderson3D_W_24.00", "Anderson3D_W_32.00" ], "composite_counts": { "parameter_sensitive_bridge+classical_wigner_endpoint": 2, "stable_graph_bridge+classical_intermediate": 2, "stable_graph_bridge+classical_wigner_endpoint": 3, "unstable_non_bridge+classical_intermediate": 3, "unstable_non_bridge+classical_wigner_endpoint": 1 }, "graph_only_residue": 3, "graph_only_rows": [ "Anderson3D_W_8.00", "Anderson3D_W_12.00", "Anderson3D_W_17.00" ], "two_reader_boundary_confirmed": 2, "two_reader_rows": [ "Anderson3D_W_16.00", "Anderson3D_W_20.00" ] } L 6 { "classic_only_residue": 4, "classic_only_rows": [ "Anderson3D_W_2.00", "Anderson3D_W_16.00", "Anderson3D_W_24.00", "Anderson3D_W_32.00" ], "composite_counts": { "parameter_sensitive_bridge+classical_intermediate": 1, "stable_graph_bridge+classical_intermediate": 2, "stable_graph_bridge+classical_wigner_endpoint": 4, "unstable_non_bridge+classical_intermediate": 3, "unstable_non_bridge+classical_wigner_endpoint": 1 }, "graph_only_residue": 4, "graph_only_rows": [ "Anderson3D_W_8.00", "Anderson3D_W_12.00", "Anderson3D_W_14.00", "Anderson3D_W_17.00" ], "two_reader_boundary_confirmed": 2, "two_reader_rows": [ "Anderson3D_W_16.50", "Anderson3D_W_20.00" ] } exec /bin/bash -lc "python - <<'PY' import json p='tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json' d=json.load(open(p)) for s in d['by_size']: print('\\nL', s['L']) for r in s['rows']: print(r['domain_window'], r['composite_state'], 'freq', r['graph_bridge_frequency'], 'r', r['median_adjacent_r'], 'q', r['median_brody_q'], 'w', r['median_wigner_poisson_like_weight'], 'ipr', r['median_mean_ipr']) PY" in /opt/MM_D-ND succeeded in 0ms: L 5 Anderson3D_W_2.00 unstable_non_bridge+classical_intermediate freq 0.0 r 0.506802 q 0.046666 w 0.023334 ipr 0.02414468 Anderson3D_W_4.00 unstable_non_bridge+classical_wigner_endpoint freq 0.0 r 0.52228 q 0.856667 w 0.446666 ipr 0.024777561 Anderson3D_W_8.00 stable_graph_bridge+classical_wigner_endpoint freq 1.0 r 0.523691 q 0.973334 w 0.51 ipr 0.034117456 Anderson3D_W_12.00 stable_graph_bridge+classical_wigner_endpoint freq 1.0 r 0.54932 q 0.93 w 0.456666 ipr 0.064332072 Anderson3D_W_14.00 parameter_sensitive_bridge+classical_wigner_endpoint freq 0.666667 r 0.514204 q 0.773333 w 0.45 ipr 0.078838263 Anderson3D_W_16.00 stable_graph_bridge+classical_intermediate freq 0.833333 r 0.502545 q 0.573333 w 0.37 ipr 0.108015905 Anderson3D_W_16.50 parameter_sensitive_bridge+classical_wigner_endpoint freq 0.5 r 0.52013 q 0.683334 w 0.453334 ipr 0.112556893 Anderson3D_W_17.00 stable_graph_bridge+classical_wigner_endpoint freq 0.833333 r 0.532094 q 0.706666 w 0.416667 ipr 0.114314002 Anderson3D_W_20.00 stable_graph_bridge+classical_intermediate freq 1.0 r 0.494405 q 0.536667 w 0.336666 ipr 0.16840199 Anderson3D_W_24.00 unstable_non_bridge+classical_intermediate freq 0.0 r 0.468283 q 0.393334 w 0.27 ipr 0.248491593 Anderson3D_W_32.00 unstable_non_bridge+classical_intermediate freq 0.0 r 0.456631 q 0.26 w 0.2 ipr 0.366514427 L 6 Anderson3D_W_2.00 unstable_non_bridge+classical_intermediate freq 0.0 r 0.512182 q 0.03 w 0.006666 ipr 0.0171107 Anderson3D_W_4.00 unstable_non_bridge+classical_wigner_endpoint freq 0.0 r 0.539201 q 0.933333 w 0.483333 ipr 0.01490231 Anderson3D_W_8.00 stable_graph_bridge+classical_wigner_endpoint freq 1.0 r 0.523082 q 0.89 w 0.503333 ipr 0.022388606 Anderson3D_W_12.00 stable_graph_bridge+classical_wigner_endpoint freq 0.833333 r 0.524819 q 0.803333 w 0.48 ipr 0.042938726 Anderson3D_W_14.00 stable_graph_bridge+classical_wigner_endpoint freq 0.833333 r 0.530184 q 0.856666 w 0.486667 ipr 0.054930057 Anderson3D_W_16.00 parameter_sensitive_bridge+classical_intermediate freq 0.666667 r 0.514892 q 0.64 w 0.403334 ipr 0.083227022 Anderson3D_W_16.50 stable_graph_bridge+classical_intermediate freq 1.0 r 0.504157 q 0.57 w 0.386667 ipr 0.093426667 Anderson3D_W_17.00 stable_graph_bridge+classical_wigner_endpoint freq 0.833333 r 0.520325 q 0.653334 w 0.433333 ipr 0.095030103 Anderson3D_W_20.00 stable_graph_bridge+classical_intermediate freq 1.0 r 0.491363 q 0.493333 w 0.333334 ipr 0.16136749 Anderson3D_W_24.00 unstable_non_bridge+classical_intermediate freq 0.0 r 0.473644 q 0.4 w 0.27 ipr 0.209994686 Anderson3D_W_32.00 unstable_non_bridge+classical_intermediate freq 0.0 r 0.441237 q 0.256667 w 0.206667 ipr 0.355443071 diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() codex Il risultato è constraint, non promozione: W=20 è l’unica riga a due lettori su L=5,6; W=16/16.5 resta vicino al mobility-edge noto ma non è size-stable. Scrivo il report con questa separazione, includendo graph-only residue come lato metallico assorbito dal baseline. apply patch patch: completed /opt/MM_D-ND/tools/data/reports/agent_20260515_1947.md diff --git a/tools/data/reports/agent_20260515_1947.md b/tools/data/reports/agent_20260515_1947.md new file mode 100644 index 0000000000000000000000000000000000000000..fab57d48788fcf7b3512c554883fc32ea4599006 --- /dev/null +++ b/tools/data/reports/agent_20260515_1947.md @@ -0,0 +1,120 @@ +# Agent Report - Anderson 3D Mobility-Edge Two-Reader Audit +**Date**: 2026-05-15 19:47 +**Piano**: 123 +**Tension explored**: BOUNDARY (0.8) +**verdict**: CONSTRAINT - il gate two-reader trasferisce fuori da Rosenzweig-Porter su Anderson 3D solo come riga finita W=20; le righe W=16/16.5 sono mobility-edge candidate ma non size-stable. +observables_registry: 1.0.0-2026-05-06 +observables_used: [SR, SR2, L1, L2, triple_var, SR_local_rigidity, brody_q, wigner_poisson_like_weight, mean_ipr, participation_entropy, graph_bridge_frequency, size_stability, centroid_margin, cross_neighbor_fraction, classical_audit_state] +**observable_contract**: claim=il gate BOUNDARY trasferisce oltre RP solo se la stessa riga Anderson W resta stable_graph_bridge+classical_intermediate su tutte le taglie testate; observable=two_reader_all_sizes da graph_bridge_frequency unita ad adjacent ratio, Brody q, peso Wigner/Poisson, IPR ed entropia di partecipazione; operator=Hamiltoniana Anderson 3D tight-binding periodica, sweep disorder, perturbazione seed+kNN; generator=H=sum_i eps_i |i> Il gate two-reader size-stable attraversa da Rosenzweig-Porter ad Anderson 3D se una riga W resta insieme ponte grafico stabile e intermedia classica su L={5,6}. + +## Question +Il boundary come intersezione lettore classico + lettore grafico attraversa il dominio Anderson, oppure resta specifico del flusso RP? + +## Ritorno fisico +- **Punto fisico sorgente**: crossover RP tra Poisson e Wigner-Dyson/GUE-like. +- **Attraversamento matematico**: contratto row-aligned a due lettori, con grafo kNN perturbato e audit spettrale classico. +- **Punto fisico di ritorno**: Anderson 3D tight-binding con transizione metallico/localizzato. +- **Relazione nuova**: il gate trasferisce come procedura di audit finite-size, ma la riga fisica si sposta: non `lambda=0.060`, bensi disorder W=20 nel perimetro L={5,6}. +- **Osservabile/test fisico possibile**: ripetere con L maggiori e sparse eigensolver vicino al centro banda; il segnale e la convergenza o caduta della riga W=20 rispetto a W=16/16.5. +- **Se fallisce**: se W=20 cade con L maggiori e W=16/16.5 diventa stabile, il ciclo attuale resta scaffold finite-size; se nessuna riga resta a due lettori, il trasferimento Anderson e falsificato. + +## Experiment Design +- **Script**: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py`. +- **Run**: `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json`. +- **Denominatore**: 11 righe W: 2, 4, 8, 12, 14, 16, 16.5, 17, 20, 24, 32. +- **Taglie**: L={5,6}, sites={125,216}; reps=8; central fraction=0.45. +- **Perturbazione grafo**: seed={202605151947,202605151948}, k={2,3,4}; 6 letture grafiche per taglia. +- **Contratto osservabile-operatore**: il ciclo testa trasferimento cross-dominio del gate; non testa stima asintotica di W_c o scaling critico. + +## Results +| summary | value | +|---|---:| +| sizes analyzed | 2 | +| disorder rows | 11 | +| two_reader_all_sizes | 1 | +| two_reader_intermittent | 2 | +| graph_only_residue L=5 | 3 | +| graph_only_residue L=6 | 4 | + +| L | two-reader rows | graph-only residue | classic-only residue | +|---:|---|---:|---:| +| 5 | W=16.00, W=20.00 | 3 | 3 | +| 6 | W=16.50, W=20.00 | 4 | 4 | + +| row | cross-size state | min graph frequency | max graph frequency | adjacent r by L | +|---|---|---:|---:|---| +| W=16.00 | intermittent two-reader | 0.667 | 0.833 | 0.502545, 0.514892 | +| W=16.50 | intermittent two-reader | 0.500 | 1.000 | 0.520130, 0.504157 | +| W=20.00 | two-reader all sizes | 1.000 | 1.000 | 0.494405, 0.491363 | + +| row | size states | +|---|---| +| W=8.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=12.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=14.00 | L5 parameter_sensitive_bridge+classical_wigner_endpoint; L6 stable_graph_bridge+classical_wigner_endpoint | +| W=17.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=20.00 | L5/L6 stable_graph_bridge+classical_intermediate | + +## Key Findings +1. Verificato: `Anderson3D_W_20.00` e l'unica riga stable_graph_bridge+classical_intermediate in entrambe le taglie testate. +2. Verificato: `W=16.00` e `W=16.50` sono righe intermittenti; si alternano tra ponte stabile e ponte parametrico/classico intermedio. +3. Verificato: il grafo produce residui endpoint Wigner stabili su W=8,12,17 e parzialmente W=14. Questi sono `graph_only_residue`, non two-reader boundary. +4. Inferito dal perimetro: la riga W=20 sopra il mobility edge noto segnala finite-size/local-unfolding sensitivity; il gate trasferisce come audit, non come nuova stima critica. + +## Verdict +CONSTRAINT + +Il gate two-reader attraversa Anderson 3D nel perimetro finito, ma non chiude il mobility edge. La riga promuovibile e operativa, non fisica-asintotica: `W=20` e il punto in cui i due lettori concordano su L={5,6}; `W=16/16.5` resta il contro-perimetro da stressare con L maggiori. + +## Bicono della scoperta +- **Due radici**: riga W a due lettori; residuo grafico endpoint Wigner. +- **Singolare**: disorder row-aligned prima della classificazione metallico/localizzato. +- **Invariante di passaggio**: concordanza `stable_graph_bridge + classical_intermediate` su taglie multiple. +- **Campo di possibilita**: possibile = usare il gate come audit finite-size Anderson/RP; non-possibile = identificare il mobility edge da ponte grafico senza audit classico o da una taglia sola. + +## Consecutio +Il prossimo ciclo utile non aggiunge metriche. Deve aumentare la taglia o usare sparse eigensolver vicino al centro banda per decidere se W=20 e shift finito del lettore o se W=16/16.5 diventa la riga two-reader quando il sistema si avvicina al limite. + +## Ricadute pratiche +ssp_value: yes. Lo script e riusabile per audit two-reader su flussi Anderson 3D e restituisce righe all-size, righe intermittenti, residui graph-only e classic-only. + +## 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 `TENS_SCALE_TRASCENDENZA_LIMITE`; la direzione viva BOUNDARY ha prevalso per aderenza esplicita al campo. +- `python -m py_compile tools/exp_anderson3d_mobility_edge_two_reader_audit.py` completato. +- `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` completato. +- Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. +- Nessun update del seme. +- Nessuna promozione e nessun public sync. + +## Files +- Script: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py` +- Data: `tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` +- Report: `tools/data/reports/agent_20260515_1947.md` diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() diff --git a/tools/data/reports/agent_20260515_1947.md b/tools/data/reports/agent_20260515_1947.md new file mode 100644 index 0000000000000000000000000000000000000000..fab57d48788fcf7b3512c554883fc32ea4599006 --- /dev/null +++ b/tools/data/reports/agent_20260515_1947.md @@ -0,0 +1,120 @@ +# Agent Report - Anderson 3D Mobility-Edge Two-Reader Audit +**Date**: 2026-05-15 19:47 +**Piano**: 123 +**Tension explored**: BOUNDARY (0.8) +**verdict**: CONSTRAINT - il gate two-reader trasferisce fuori da Rosenzweig-Porter su Anderson 3D solo come riga finita W=20; le righe W=16/16.5 sono mobility-edge candidate ma non size-stable. +observables_registry: 1.0.0-2026-05-06 +observables_used: [SR, SR2, L1, L2, triple_var, SR_local_rigidity, brody_q, wigner_poisson_like_weight, mean_ipr, participation_entropy, graph_bridge_frequency, size_stability, centroid_margin, cross_neighbor_fraction, classical_audit_state] +**observable_contract**: claim=il gate BOUNDARY trasferisce oltre RP solo se la stessa riga Anderson W resta stable_graph_bridge+classical_intermediate su tutte le taglie testate; observable=two_reader_all_sizes da graph_bridge_frequency unita ad adjacent ratio, Brody q, peso Wigner/Poisson, IPR ed entropia di partecipazione; operator=Hamiltoniana Anderson 3D tight-binding periodica, sweep disorder, perturbazione seed+kNN; generator=H=sum_i eps_i |i> Il gate two-reader size-stable attraversa da Rosenzweig-Porter ad Anderson 3D se una riga W resta insieme ponte grafico stabile e intermedia classica su L={5,6}. + +## Question +Il boundary come intersezione lettore classico + lettore grafico attraversa il dominio Anderson, oppure resta specifico del flusso RP? + +## Ritorno fisico +- **Punto fisico sorgente**: crossover RP tra Poisson e Wigner-Dyson/GUE-like. +- **Attraversamento matematico**: contratto row-aligned a due lettori, con grafo kNN perturbato e audit spettrale classico. +- **Punto fisico di ritorno**: Anderson 3D tight-binding con transizione metallico/localizzato. +- **Relazione nuova**: il gate trasferisce come procedura di audit finite-size, ma la riga fisica si sposta: non `lambda=0.060`, bensi disorder W=20 nel perimetro L={5,6}. +- **Osservabile/test fisico possibile**: ripetere con L maggiori e sparse eigensolver vicino al centro banda; il segnale e la convergenza o caduta della riga W=20 rispetto a W=16/16.5. +- **Se fallisce**: se W=20 cade con L maggiori e W=16/16.5 diventa stabile, il ciclo attuale resta scaffold finite-size; se nessuna riga resta a due lettori, il trasferimento Anderson e falsificato. + +## Experiment Design +- **Script**: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py`. +- **Run**: `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json`. +- **Denominatore**: 11 righe W: 2, 4, 8, 12, 14, 16, 16.5, 17, 20, 24, 32. +- **Taglie**: L={5,6}, sites={125,216}; reps=8; central fraction=0.45. +- **Perturbazione grafo**: seed={202605151947,202605151948}, k={2,3,4}; 6 letture grafiche per taglia. +- **Contratto osservabile-operatore**: il ciclo testa trasferimento cross-dominio del gate; non testa stima asintotica di W_c o scaling critico. + +## Results +| summary | value | +|---|---:| +| sizes analyzed | 2 | +| disorder rows | 11 | +| two_reader_all_sizes | 1 | +| two_reader_intermittent | 2 | +| graph_only_residue L=5 | 3 | +| graph_only_residue L=6 | 4 | + +| L | two-reader rows | graph-only residue | classic-only residue | +|---:|---|---:|---:| +| 5 | W=16.00, W=20.00 | 3 | 3 | +| 6 | W=16.50, W=20.00 | 4 | 4 | + +| row | cross-size state | min graph frequency | max graph frequency | adjacent r by L | +|---|---|---:|---:|---| +| W=16.00 | intermittent two-reader | 0.667 | 0.833 | 0.502545, 0.514892 | +| W=16.50 | intermittent two-reader | 0.500 | 1.000 | 0.520130, 0.504157 | +| W=20.00 | two-reader all sizes | 1.000 | 1.000 | 0.494405, 0.491363 | + +| row | size states | +|---|---| +| W=8.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=12.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=14.00 | L5 parameter_sensitive_bridge+classical_wigner_endpoint; L6 stable_graph_bridge+classical_wigner_endpoint | +| W=17.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=20.00 | L5/L6 stable_graph_bridge+classical_intermediate | + +## Key Findings +1. Verificato: `Anderson3D_W_20.00` e l'unica riga stable_graph_bridge+classical_intermediate in entrambe le taglie testate. +2. Verificato: `W=16.00` e `W=16.50` sono righe intermittenti; si alternano tra ponte stabile e ponte parametrico/classico intermedio. +3. Verificato: il grafo produce residui endpoint Wigner stabili su W=8,12,17 e parzialmente W=14. Questi sono `graph_only_residue`, non two-reader boundary. +4. Inferito dal perimetro: la riga W=20 sopra il mobility edge noto segnala finite-size/local-unfolding sensitivity; il gate trasferisce come audit, non come nuova stima critica. + +## Verdict +CONSTRAINT + +Il gate two-reader attraversa Anderson 3D nel perimetro finito, ma non chiude il mobility edge. La riga promuovibile e operativa, non fisica-asintotica: `W=20` e il punto in cui i due lettori concordano su L={5,6}; `W=16/16.5` resta il contro-perimetro da stressare con L maggiori. + +## Bicono della scoperta +- **Due radici**: riga W a due lettori; residuo grafico endpoint Wigner. +- **Singolare**: disorder row-aligned prima della classificazione metallico/localizzato. +- **Invariante di passaggio**: concordanza `stable_graph_bridge + classical_intermediate` su taglie multiple. +- **Campo di possibilita**: possibile = usare il gate come audit finite-size Anderson/RP; non-possibile = identificare il mobility edge da ponte grafico senza audit classico o da una taglia sola. + +## Consecutio +Il prossimo ciclo utile non aggiunge metriche. Deve aumentare la taglia o usare sparse eigensolver vicino al centro banda per decidere se W=20 e shift finito del lettore o se W=16/16.5 diventa la riga two-reader quando il sistema si avvicina al limite. + +## Ricadute pratiche +ssp_value: yes. Lo script e riusabile per audit two-reader su flussi Anderson 3D e restituisce righe all-size, righe intermittenti, residui graph-only e classic-only. + +## 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 `TENS_SCALE_TRASCENDENZA_LIMITE`; la direzione viva BOUNDARY ha prevalso per aderenza esplicita al campo. +- `python -m py_compile tools/exp_anderson3d_mobility_edge_two_reader_audit.py` completato. +- `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` completato. +- Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. +- Nessun update del seme. +- Nessuna promozione e nessun public sync. + +## Files +- Script: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py` +- Data: `tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` +- Report: `tools/data/reports/agent_20260515_1947.md` diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() exec /bin/bash -lc "sed -n '1,260p' tools/data/reports/agent_20260515_1947.md" in /opt/MM_D-ND succeeded in 0ms: # Agent Report - Anderson 3D Mobility-Edge Two-Reader Audit **Date**: 2026-05-15 19:47 **Piano**: 123 **Tension explored**: BOUNDARY (0.8) **verdict**: CONSTRAINT - il gate two-reader trasferisce fuori da Rosenzweig-Porter su Anderson 3D solo come riga finita W=20; le righe W=16/16.5 sono mobility-edge candidate ma non size-stable. observables_registry: 1.0.0-2026-05-06 observables_used: [SR, SR2, L1, L2, triple_var, SR_local_rigidity, brody_q, wigner_poisson_like_weight, mean_ipr, participation_entropy, graph_bridge_frequency, size_stability, centroid_margin, cross_neighbor_fraction, classical_audit_state] **observable_contract**: claim=il gate BOUNDARY trasferisce oltre RP solo se la stessa riga Anderson W resta stable_graph_bridge+classical_intermediate su tutte le taglie testate; observable=two_reader_all_sizes da graph_bridge_frequency unita ad adjacent ratio, Brody q, peso Wigner/Poisson, IPR ed entropia di partecipazione; operator=Hamiltoniana Anderson 3D tight-binding periodica, sweep disorder, perturbazione seed+kNN; generator=H=sum_i eps_i |i> Il gate two-reader size-stable attraversa da Rosenzweig-Porter ad Anderson 3D se una riga W resta insieme ponte grafico stabile e intermedia classica su L={5,6}. ## Question Il boundary come intersezione lettore classico + lettore grafico attraversa il dominio Anderson, oppure resta specifico del flusso RP? ## Ritorno fisico - **Punto fisico sorgente**: crossover RP tra Poisson e Wigner-Dyson/GUE-like. - **Attraversamento matematico**: contratto row-aligned a due lettori, con grafo kNN perturbato e audit spettrale classico. - **Punto fisico di ritorno**: Anderson 3D tight-binding con transizione metallico/localizzato. - **Relazione nuova**: il gate trasferisce come procedura di audit finite-size, ma la riga fisica si sposta: non `lambda=0.060`, bensi disorder W=20 nel perimetro L={5,6}. - **Osservabile/test fisico possibile**: ripetere con L maggiori e sparse eigensolver vicino al centro banda; il segnale e la convergenza o caduta della riga W=20 rispetto a W=16/16.5. - **Se fallisce**: se W=20 cade con L maggiori e W=16/16.5 diventa stabile, il ciclo attuale resta scaffold finite-size; se nessuna riga resta a due lettori, il trasferimento Anderson e falsificato. ## Experiment Design - **Script**: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py`. - **Run**: `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json`. - **Denominatore**: 11 righe W: 2, 4, 8, 12, 14, 16, 16.5, 17, 20, 24, 32. - **Taglie**: L={5,6}, sites={125,216}; reps=8; central fraction=0.45. - **Perturbazione grafo**: seed={202605151947,202605151948}, k={2,3,4}; 6 letture grafiche per taglia. - **Contratto osservabile-operatore**: il ciclo testa trasferimento cross-dominio del gate; non testa stima asintotica di W_c o scaling critico. ## Results | summary | value | |---|---:| | sizes analyzed | 2 | | disorder rows | 11 | | two_reader_all_sizes | 1 | | two_reader_intermittent | 2 | | graph_only_residue L=5 | 3 | | graph_only_residue L=6 | 4 | | L | two-reader rows | graph-only residue | classic-only residue | |---:|---|---:|---:| | 5 | W=16.00, W=20.00 | 3 | 3 | | 6 | W=16.50, W=20.00 | 4 | 4 | | row | cross-size state | min graph frequency | max graph frequency | adjacent r by L | |---|---|---:|---:|---| | W=16.00 | intermittent two-reader | 0.667 | 0.833 | 0.502545, 0.514892 | | W=16.50 | intermittent two-reader | 0.500 | 1.000 | 0.520130, 0.504157 | | W=20.00 | two-reader all sizes | 1.000 | 1.000 | 0.494405, 0.491363 | | row | size states | |---|---| | W=8.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | | W=12.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | | W=14.00 | L5 parameter_sensitive_bridge+classical_wigner_endpoint; L6 stable_graph_bridge+classical_wigner_endpoint | | W=17.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | | W=20.00 | L5/L6 stable_graph_bridge+classical_intermediate | ## Key Findings 1. Verificato: `Anderson3D_W_20.00` e l'unica riga stable_graph_bridge+classical_intermediate in entrambe le taglie testate. 2. Verificato: `W=16.00` e `W=16.50` sono righe intermittenti; si alternano tra ponte stabile e ponte parametrico/classico intermedio. 3. Verificato: il grafo produce residui endpoint Wigner stabili su W=8,12,17 e parzialmente W=14. Questi sono `graph_only_residue`, non two-reader boundary. 4. Inferito dal perimetro: la riga W=20 sopra il mobility edge noto segnala finite-size/local-unfolding sensitivity; il gate trasferisce come audit, non come nuova stima critica. ## Verdict CONSTRAINT Il gate two-reader attraversa Anderson 3D nel perimetro finito, ma non chiude il mobility edge. La riga promuovibile e operativa, non fisica-asintotica: `W=20` e il punto in cui i due lettori concordano su L={5,6}; `W=16/16.5` resta il contro-perimetro da stressare con L maggiori. ## Bicono della scoperta - **Due radici**: riga W a due lettori; residuo grafico endpoint Wigner. - **Singolare**: disorder row-aligned prima della classificazione metallico/localizzato. - **Invariante di passaggio**: concordanza `stable_graph_bridge + classical_intermediate` su taglie multiple. - **Campo di possibilita**: possibile = usare il gate come audit finite-size Anderson/RP; non-possibile = identificare il mobility edge da ponte grafico senza audit classico o da una taglia sola. ## Consecutio Il prossimo ciclo utile non aggiunge metriche. Deve aumentare la taglia o usare sparse eigensolver vicino al centro banda per decidere se W=20 e shift finito del lettore o se W=16/16.5 diventa la riga two-reader quando il sistema si avvicina al limite. ## Ricadute pratiche ssp_value: yes. Lo script e riusabile per audit two-reader su flussi Anderson 3D e restituisce righe all-size, righe intermittenti, residui graph-only e classic-only. ## 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 `TENS_SCALE_TRASCENDENZA_LIMITE`; la direzione viva BOUNDARY ha prevalso per aderenza esplicita al campo. - `python -m py_compile tools/exp_anderson3d_mobility_edge_two_reader_audit.py` completato. - `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` completato. - Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. - Nessun update del seme. - Nessuna promozione e nessun public sync. ## Files - Script: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py` - Data: `tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` - Report: `tools/data/reports/agent_20260515_1947.md` exec /bin/bash -lc 'git status --short -- tools/exp_anderson3d_mobility_edge_two_reader_audit.py tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json tools/data/reports/agent_20260515_1947.md' in /opt/MM_D-ND succeeded in 0ms: ?? tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json ?? tools/data/reports/agent_20260515_1947.md ?? tools/exp_anderson3d_mobility_edge_two_reader_audit.py exec /bin/bash -lc "python - <<'PY' from pathlib import Path for p in ['tools/exp_anderson3d_mobility_edge_two_reader_audit.py','tools/data/reports/agent_20260515_1947.md']: text=Path(p).read_text() non=[c for c in sorted(set(text)) if ord(c)>127] print(p, non[:20], len(non)) PY" in /opt/MM_D-ND succeeded in 0ms: tools/exp_anderson3d_mobility_edge_two_reader_audit.py [] 0 tools/data/reports/agent_20260515_1947.md [] 0 diff --git a/tools/data/reports/agent_20260515_1947.md b/tools/data/reports/agent_20260515_1947.md new file mode 100644 index 0000000000000000000000000000000000000000..fab57d48788fcf7b3512c554883fc32ea4599006 --- /dev/null +++ b/tools/data/reports/agent_20260515_1947.md @@ -0,0 +1,120 @@ +# Agent Report - Anderson 3D Mobility-Edge Two-Reader Audit +**Date**: 2026-05-15 19:47 +**Piano**: 123 +**Tension explored**: BOUNDARY (0.8) +**verdict**: CONSTRAINT - il gate two-reader trasferisce fuori da Rosenzweig-Porter su Anderson 3D solo come riga finita W=20; le righe W=16/16.5 sono mobility-edge candidate ma non size-stable. +observables_registry: 1.0.0-2026-05-06 +observables_used: [SR, SR2, L1, L2, triple_var, SR_local_rigidity, brody_q, wigner_poisson_like_weight, mean_ipr, participation_entropy, graph_bridge_frequency, size_stability, centroid_margin, cross_neighbor_fraction, classical_audit_state] +**observable_contract**: claim=il gate BOUNDARY trasferisce oltre RP solo se la stessa riga Anderson W resta stable_graph_bridge+classical_intermediate su tutte le taglie testate; observable=two_reader_all_sizes da graph_bridge_frequency unita ad adjacent ratio, Brody q, peso Wigner/Poisson, IPR ed entropia di partecipazione; operator=Hamiltoniana Anderson 3D tight-binding periodica, sweep disorder, perturbazione seed+kNN; generator=H=sum_i eps_i |i> Il gate two-reader size-stable attraversa da Rosenzweig-Porter ad Anderson 3D se una riga W resta insieme ponte grafico stabile e intermedia classica su L={5,6}. + +## Question +Il boundary come intersezione lettore classico + lettore grafico attraversa il dominio Anderson, oppure resta specifico del flusso RP? + +## Ritorno fisico +- **Punto fisico sorgente**: crossover RP tra Poisson e Wigner-Dyson/GUE-like. +- **Attraversamento matematico**: contratto row-aligned a due lettori, con grafo kNN perturbato e audit spettrale classico. +- **Punto fisico di ritorno**: Anderson 3D tight-binding con transizione metallico/localizzato. +- **Relazione nuova**: il gate trasferisce come procedura di audit finite-size, ma la riga fisica si sposta: non `lambda=0.060`, bensi disorder W=20 nel perimetro L={5,6}. +- **Osservabile/test fisico possibile**: ripetere con L maggiori e sparse eigensolver vicino al centro banda; il segnale e la convergenza o caduta della riga W=20 rispetto a W=16/16.5. +- **Se fallisce**: se W=20 cade con L maggiori e W=16/16.5 diventa stabile, il ciclo attuale resta scaffold finite-size; se nessuna riga resta a due lettori, il trasferimento Anderson e falsificato. + +## Experiment Design +- **Script**: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py`. +- **Run**: `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json`. +- **Denominatore**: 11 righe W: 2, 4, 8, 12, 14, 16, 16.5, 17, 20, 24, 32. +- **Taglie**: L={5,6}, sites={125,216}; reps=8; central fraction=0.45. +- **Perturbazione grafo**: seed={202605151947,202605151948}, k={2,3,4}; 6 letture grafiche per taglia. +- **Contratto osservabile-operatore**: il ciclo testa trasferimento cross-dominio del gate; non testa stima asintotica di W_c o scaling critico. + +## Results +| summary | value | +|---|---:| +| sizes analyzed | 2 | +| disorder rows | 11 | +| two_reader_all_sizes | 1 | +| two_reader_intermittent | 2 | +| graph_only_residue L=5 | 3 | +| graph_only_residue L=6 | 4 | + +| L | two-reader rows | graph-only residue | classic-only residue | +|---:|---|---:|---:| +| 5 | W=16.00, W=20.00 | 3 | 3 | +| 6 | W=16.50, W=20.00 | 4 | 4 | + +| row | cross-size state | min graph frequency | max graph frequency | adjacent r by L | +|---|---|---:|---:|---| +| W=16.00 | intermittent two-reader | 0.667 | 0.833 | 0.502545, 0.514892 | +| W=16.50 | intermittent two-reader | 0.500 | 1.000 | 0.520130, 0.504157 | +| W=20.00 | two-reader all sizes | 1.000 | 1.000 | 0.494405, 0.491363 | + +| row | size states | +|---|---| +| W=8.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=12.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=14.00 | L5 parameter_sensitive_bridge+classical_wigner_endpoint; L6 stable_graph_bridge+classical_wigner_endpoint | +| W=17.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=20.00 | L5/L6 stable_graph_bridge+classical_intermediate | + +## Key Findings +1. Verificato: `Anderson3D_W_20.00` e l'unica riga stable_graph_bridge+classical_intermediate in entrambe le taglie testate. +2. Verificato: `W=16.00` e `W=16.50` sono righe intermittenti; si alternano tra ponte stabile e ponte parametrico/classico intermedio. +3. Verificato: il grafo produce residui endpoint Wigner stabili su W=8,12,17 e parzialmente W=14. Questi sono `graph_only_residue`, non two-reader boundary. +4. Inferito dal perimetro: la riga W=20 sopra il mobility edge noto segnala finite-size/local-unfolding sensitivity; il gate trasferisce come audit, non come nuova stima critica. + +## Verdict +CONSTRAINT + +Il gate two-reader attraversa Anderson 3D nel perimetro finito, ma non chiude il mobility edge. La riga promuovibile e operativa, non fisica-asintotica: `W=20` e il punto in cui i due lettori concordano su L={5,6}; `W=16/16.5` resta il contro-perimetro da stressare con L maggiori. + +## Bicono della scoperta +- **Due radici**: riga W a due lettori; residuo grafico endpoint Wigner. +- **Singolare**: disorder row-aligned prima della classificazione metallico/localizzato. +- **Invariante di passaggio**: concordanza `stable_graph_bridge + classical_intermediate` su taglie multiple. +- **Campo di possibilita**: possibile = usare il gate come audit finite-size Anderson/RP; non-possibile = identificare il mobility edge da ponte grafico senza audit classico o da una taglia sola. + +## Consecutio +Il prossimo ciclo utile non aggiunge metriche. Deve aumentare la taglia o usare sparse eigensolver vicino al centro banda per decidere se W=20 e shift finito del lettore o se W=16/16.5 diventa la riga two-reader quando il sistema si avvicina al limite. + +## Ricadute pratiche +ssp_value: yes. Lo script e riusabile per audit two-reader su flussi Anderson 3D e restituisce righe all-size, righe intermittenti, residui graph-only e classic-only. + +## 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 `TENS_SCALE_TRASCENDENZA_LIMITE`; la direzione viva BOUNDARY ha prevalso per aderenza esplicita al campo. +- `python -m py_compile tools/exp_anderson3d_mobility_edge_two_reader_audit.py` completato. +- `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` completato. +- Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. +- Nessun update del seme. +- Nessuna promozione e nessun public sync. + +## Files +- Script: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py` +- Data: `tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` +- Report: `tools/data/reports/agent_20260515_1947.md` diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() exec /bin/bash -lc 'python tools/lab_falsifier.py --help' in /opt/MM_D-ND succeeded in 0ms: usage: lab_falsifier.py [-h] --report REPORT --output OUTPUT [--timeout TIMEOUT] Counter-pole gate for the lab options: -h, --help show this help message and exit --report REPORT Path to agent_TS.md --output OUTPUT Path for falsifier_TS.json output --timeout TIMEOUT LLM call timeout seconds diff --git a/tools/data/reports/agent_20260515_1947.md b/tools/data/reports/agent_20260515_1947.md new file mode 100644 index 0000000000000000000000000000000000000000..fab57d48788fcf7b3512c554883fc32ea4599006 --- /dev/null +++ b/tools/data/reports/agent_20260515_1947.md @@ -0,0 +1,120 @@ +# Agent Report - Anderson 3D Mobility-Edge Two-Reader Audit +**Date**: 2026-05-15 19:47 +**Piano**: 123 +**Tension explored**: BOUNDARY (0.8) +**verdict**: CONSTRAINT - il gate two-reader trasferisce fuori da Rosenzweig-Porter su Anderson 3D solo come riga finita W=20; le righe W=16/16.5 sono mobility-edge candidate ma non size-stable. +observables_registry: 1.0.0-2026-05-06 +observables_used: [SR, SR2, L1, L2, triple_var, SR_local_rigidity, brody_q, wigner_poisson_like_weight, mean_ipr, participation_entropy, graph_bridge_frequency, size_stability, centroid_margin, cross_neighbor_fraction, classical_audit_state] +**observable_contract**: claim=il gate BOUNDARY trasferisce oltre RP solo se la stessa riga Anderson W resta stable_graph_bridge+classical_intermediate su tutte le taglie testate; observable=two_reader_all_sizes da graph_bridge_frequency unita ad adjacent ratio, Brody q, peso Wigner/Poisson, IPR ed entropia di partecipazione; operator=Hamiltoniana Anderson 3D tight-binding periodica, sweep disorder, perturbazione seed+kNN; generator=H=sum_i eps_i |i> Il gate two-reader size-stable attraversa da Rosenzweig-Porter ad Anderson 3D se una riga W resta insieme ponte grafico stabile e intermedia classica su L={5,6}. + +## Question +Il boundary come intersezione lettore classico + lettore grafico attraversa il dominio Anderson, oppure resta specifico del flusso RP? + +## Ritorno fisico +- **Punto fisico sorgente**: crossover RP tra Poisson e Wigner-Dyson/GUE-like. +- **Attraversamento matematico**: contratto row-aligned a due lettori, con grafo kNN perturbato e audit spettrale classico. +- **Punto fisico di ritorno**: Anderson 3D tight-binding con transizione metallico/localizzato. +- **Relazione nuova**: il gate trasferisce come procedura di audit finite-size, ma la riga fisica si sposta: non `lambda=0.060`, bensi disorder W=20 nel perimetro L={5,6}. +- **Osservabile/test fisico possibile**: ripetere con L maggiori e sparse eigensolver vicino al centro banda; il segnale e la convergenza o caduta della riga W=20 rispetto a W=16/16.5. +- **Se fallisce**: se W=20 cade con L maggiori e W=16/16.5 diventa stabile, il ciclo attuale resta scaffold finite-size; se nessuna riga resta a due lettori, il trasferimento Anderson e falsificato. + +## Experiment Design +- **Script**: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py`. +- **Run**: `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json`. +- **Denominatore**: 11 righe W: 2, 4, 8, 12, 14, 16, 16.5, 17, 20, 24, 32. +- **Taglie**: L={5,6}, sites={125,216}; reps=8; central fraction=0.45. +- **Perturbazione grafo**: seed={202605151947,202605151948}, k={2,3,4}; 6 letture grafiche per taglia. +- **Contratto osservabile-operatore**: il ciclo testa trasferimento cross-dominio del gate; non testa stima asintotica di W_c o scaling critico. + +## Results +| summary | value | +|---|---:| +| sizes analyzed | 2 | +| disorder rows | 11 | +| two_reader_all_sizes | 1 | +| two_reader_intermittent | 2 | +| graph_only_residue L=5 | 3 | +| graph_only_residue L=6 | 4 | + +| L | two-reader rows | graph-only residue | classic-only residue | +|---:|---|---:|---:| +| 5 | W=16.00, W=20.00 | 3 | 3 | +| 6 | W=16.50, W=20.00 | 4 | 4 | + +| row | cross-size state | min graph frequency | max graph frequency | adjacent r by L | +|---|---|---:|---:|---| +| W=16.00 | intermittent two-reader | 0.667 | 0.833 | 0.502545, 0.514892 | +| W=16.50 | intermittent two-reader | 0.500 | 1.000 | 0.520130, 0.504157 | +| W=20.00 | two-reader all sizes | 1.000 | 1.000 | 0.494405, 0.491363 | + +| row | size states | +|---|---| +| W=8.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=12.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=14.00 | L5 parameter_sensitive_bridge+classical_wigner_endpoint; L6 stable_graph_bridge+classical_wigner_endpoint | +| W=17.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=20.00 | L5/L6 stable_graph_bridge+classical_intermediate | + +## Key Findings +1. Verificato: `Anderson3D_W_20.00` e l'unica riga stable_graph_bridge+classical_intermediate in entrambe le taglie testate. +2. Verificato: `W=16.00` e `W=16.50` sono righe intermittenti; si alternano tra ponte stabile e ponte parametrico/classico intermedio. +3. Verificato: il grafo produce residui endpoint Wigner stabili su W=8,12,17 e parzialmente W=14. Questi sono `graph_only_residue`, non two-reader boundary. +4. Inferito dal perimetro: la riga W=20 sopra il mobility edge noto segnala finite-size/local-unfolding sensitivity; il gate trasferisce come audit, non come nuova stima critica. + +## Verdict +CONSTRAINT + +Il gate two-reader attraversa Anderson 3D nel perimetro finito, ma non chiude il mobility edge. La riga promuovibile e operativa, non fisica-asintotica: `W=20` e il punto in cui i due lettori concordano su L={5,6}; `W=16/16.5` resta il contro-perimetro da stressare con L maggiori. + +## Bicono della scoperta +- **Due radici**: riga W a due lettori; residuo grafico endpoint Wigner. +- **Singolare**: disorder row-aligned prima della classificazione metallico/localizzato. +- **Invariante di passaggio**: concordanza `stable_graph_bridge + classical_intermediate` su taglie multiple. +- **Campo di possibilita**: possibile = usare il gate come audit finite-size Anderson/RP; non-possibile = identificare il mobility edge da ponte grafico senza audit classico o da una taglia sola. + +## Consecutio +Il prossimo ciclo utile non aggiunge metriche. Deve aumentare la taglia o usare sparse eigensolver vicino al centro banda per decidere se W=20 e shift finito del lettore o se W=16/16.5 diventa la riga two-reader quando il sistema si avvicina al limite. + +## Ricadute pratiche +ssp_value: yes. Lo script e riusabile per audit two-reader su flussi Anderson 3D e restituisce righe all-size, righe intermittenti, residui graph-only e classic-only. + +## 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 `TENS_SCALE_TRASCENDENZA_LIMITE`; la direzione viva BOUNDARY ha prevalso per aderenza esplicita al campo. +- `python -m py_compile tools/exp_anderson3d_mobility_edge_two_reader_audit.py` completato. +- `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` completato. +- Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. +- Nessun update del seme. +- Nessuna promozione e nessun public sync. + +## Files +- Script: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py` +- Data: `tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` +- Report: `tools/data/reports/agent_20260515_1947.md` diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() codex Eseguito il ciclo AI-Lab D-ND e scritto il report richiesto: [agent_20260515_1947.md](/opt/MM_D-ND/tools/data/reports/agent_20260515_1947.md) Ho creato anche lo script e il deposito dati: - [exp_anderson3d_mobility_edge_two_reader_audit.py](/opt/MM_D-ND/tools/exp_anderson3d_mobility_edge_two_reader_audit.py) - [anderson3d_mobility_edge_two_reader_audit_20260515_1947.json](/opt/MM_D-ND/tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json) Risultato: `CONSTRAINT`. Il gate two-reader trasferisce su Anderson 3D nel perimetro finito solo come riga `W=20`; `W=16/16.5` resta intermittente e va stressato con taglie maggiori. Verifiche completate: `py_compile`, run esperimento, no `ANTHROPIC_API_KEY`/`OPENAI_API_KEY` presenti. diff --git a/tools/data/reports/agent_20260515_1947.md b/tools/data/reports/agent_20260515_1947.md new file mode 100644 index 0000000000000000000000000000000000000000..fab57d48788fcf7b3512c554883fc32ea4599006 --- /dev/null +++ b/tools/data/reports/agent_20260515_1947.md @@ -0,0 +1,120 @@ +# Agent Report - Anderson 3D Mobility-Edge Two-Reader Audit +**Date**: 2026-05-15 19:47 +**Piano**: 123 +**Tension explored**: BOUNDARY (0.8) +**verdict**: CONSTRAINT - il gate two-reader trasferisce fuori da Rosenzweig-Porter su Anderson 3D solo come riga finita W=20; le righe W=16/16.5 sono mobility-edge candidate ma non size-stable. +observables_registry: 1.0.0-2026-05-06 +observables_used: [SR, SR2, L1, L2, triple_var, SR_local_rigidity, brody_q, wigner_poisson_like_weight, mean_ipr, participation_entropy, graph_bridge_frequency, size_stability, centroid_margin, cross_neighbor_fraction, classical_audit_state] +**observable_contract**: claim=il gate BOUNDARY trasferisce oltre RP solo se la stessa riga Anderson W resta stable_graph_bridge+classical_intermediate su tutte le taglie testate; observable=two_reader_all_sizes da graph_bridge_frequency unita ad adjacent ratio, Brody q, peso Wigner/Poisson, IPR ed entropia di partecipazione; operator=Hamiltoniana Anderson 3D tight-binding periodica, sweep disorder, perturbazione seed+kNN; generator=H=sum_i eps_i |i> Il gate two-reader size-stable attraversa da Rosenzweig-Porter ad Anderson 3D se una riga W resta insieme ponte grafico stabile e intermedia classica su L={5,6}. + +## Question +Il boundary come intersezione lettore classico + lettore grafico attraversa il dominio Anderson, oppure resta specifico del flusso RP? + +## Ritorno fisico +- **Punto fisico sorgente**: crossover RP tra Poisson e Wigner-Dyson/GUE-like. +- **Attraversamento matematico**: contratto row-aligned a due lettori, con grafo kNN perturbato e audit spettrale classico. +- **Punto fisico di ritorno**: Anderson 3D tight-binding con transizione metallico/localizzato. +- **Relazione nuova**: il gate trasferisce come procedura di audit finite-size, ma la riga fisica si sposta: non `lambda=0.060`, bensi disorder W=20 nel perimetro L={5,6}. +- **Osservabile/test fisico possibile**: ripetere con L maggiori e sparse eigensolver vicino al centro banda; il segnale e la convergenza o caduta della riga W=20 rispetto a W=16/16.5. +- **Se fallisce**: se W=20 cade con L maggiori e W=16/16.5 diventa stabile, il ciclo attuale resta scaffold finite-size; se nessuna riga resta a due lettori, il trasferimento Anderson e falsificato. + +## Experiment Design +- **Script**: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py`. +- **Run**: `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json`. +- **Denominatore**: 11 righe W: 2, 4, 8, 12, 14, 16, 16.5, 17, 20, 24, 32. +- **Taglie**: L={5,6}, sites={125,216}; reps=8; central fraction=0.45. +- **Perturbazione grafo**: seed={202605151947,202605151948}, k={2,3,4}; 6 letture grafiche per taglia. +- **Contratto osservabile-operatore**: il ciclo testa trasferimento cross-dominio del gate; non testa stima asintotica di W_c o scaling critico. + +## Results +| summary | value | +|---|---:| +| sizes analyzed | 2 | +| disorder rows | 11 | +| two_reader_all_sizes | 1 | +| two_reader_intermittent | 2 | +| graph_only_residue L=5 | 3 | +| graph_only_residue L=6 | 4 | + +| L | two-reader rows | graph-only residue | classic-only residue | +|---:|---|---:|---:| +| 5 | W=16.00, W=20.00 | 3 | 3 | +| 6 | W=16.50, W=20.00 | 4 | 4 | + +| row | cross-size state | min graph frequency | max graph frequency | adjacent r by L | +|---|---|---:|---:|---| +| W=16.00 | intermittent two-reader | 0.667 | 0.833 | 0.502545, 0.514892 | +| W=16.50 | intermittent two-reader | 0.500 | 1.000 | 0.520130, 0.504157 | +| W=20.00 | two-reader all sizes | 1.000 | 1.000 | 0.494405, 0.491363 | + +| row | size states | +|---|---| +| W=8.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=12.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=14.00 | L5 parameter_sensitive_bridge+classical_wigner_endpoint; L6 stable_graph_bridge+classical_wigner_endpoint | +| W=17.00 | L5/L6 stable_graph_bridge+classical_wigner_endpoint | +| W=20.00 | L5/L6 stable_graph_bridge+classical_intermediate | + +## Key Findings +1. Verificato: `Anderson3D_W_20.00` e l'unica riga stable_graph_bridge+classical_intermediate in entrambe le taglie testate. +2. Verificato: `W=16.00` e `W=16.50` sono righe intermittenti; si alternano tra ponte stabile e ponte parametrico/classico intermedio. +3. Verificato: il grafo produce residui endpoint Wigner stabili su W=8,12,17 e parzialmente W=14. Questi sono `graph_only_residue`, non two-reader boundary. +4. Inferito dal perimetro: la riga W=20 sopra il mobility edge noto segnala finite-size/local-unfolding sensitivity; il gate trasferisce come audit, non come nuova stima critica. + +## Verdict +CONSTRAINT + +Il gate two-reader attraversa Anderson 3D nel perimetro finito, ma non chiude il mobility edge. La riga promuovibile e operativa, non fisica-asintotica: `W=20` e il punto in cui i due lettori concordano su L={5,6}; `W=16/16.5` resta il contro-perimetro da stressare con L maggiori. + +## Bicono della scoperta +- **Due radici**: riga W a due lettori; residuo grafico endpoint Wigner. +- **Singolare**: disorder row-aligned prima della classificazione metallico/localizzato. +- **Invariante di passaggio**: concordanza `stable_graph_bridge + classical_intermediate` su taglie multiple. +- **Campo di possibilita**: possibile = usare il gate come audit finite-size Anderson/RP; non-possibile = identificare il mobility edge da ponte grafico senza audit classico o da una taglia sola. + +## Consecutio +Il prossimo ciclo utile non aggiunge metriche. Deve aumentare la taglia o usare sparse eigensolver vicino al centro banda per decidere se W=20 e shift finito del lettore o se W=16/16.5 diventa la riga two-reader quando il sistema si avvicina al limite. + +## Ricadute pratiche +ssp_value: yes. Lo script e riusabile per audit two-reader su flussi Anderson 3D e restituisce righe all-size, righe intermittenti, residui graph-only e classic-only. + +## 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 `TENS_SCALE_TRASCENDENZA_LIMITE`; la direzione viva BOUNDARY ha prevalso per aderenza esplicita al campo. +- `python -m py_compile tools/exp_anderson3d_mobility_edge_two_reader_audit.py` completato. +- `python tools/exp_anderson3d_mobility_edge_two_reader_audit.py --out tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` completato. +- Worktree gia dirty prima del ciclo; ignorate modifiche non correlate. +- Nessun update del seme. +- Nessuna promozione e nessun public sync. + +## Files +- Script: `tools/exp_anderson3d_mobility_edge_two_reader_audit.py` +- Data: `tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json` +- Report: `tools/data/reports/agent_20260515_1947.md` diff --git a/tools/exp_anderson3d_mobility_edge_two_reader_audit.py b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py new file mode 100644 index 0000000000000000000000000000000000000000..651e60c8135496fe9aaeda6dad093056ddb16453 --- /dev/null +++ b/tools/exp_anderson3d_mobility_edge_two_reader_audit.py @@ -0,0 +1,491 @@ +#!/usr/bin/env python3 +""" +Two-reader BOUNDARY audit on a 3D Anderson tight-binding flow. + +The live direction asks whether the Rosenzweig-Porter two-reader gate transfers +to a second physical row-aligned flow. Each disorder value W is one row; the +classical reader uses spacing/Brody/Wigner-Poisson diagnostics and the graph +reader asks whether the same W row sits between metallic and localized poles +under kNN perturbations. +""" + +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 observables_registry import OBSERVABLES_CANONICAL, OBSERVABLES_REGISTRY_VERSION, SR_local_rigidity +from exp_rosenzweig_porter_bridge_physical_audit import ( + brody_pdf, + empirical_ks, + fit_brody_q, + fit_mixture_weight, + gue_wigner_cdf, + normalize_spacings, + parse_floats, + parse_ints, + poisson_cdf, +) + + +OBS_NAMES = list(OBSERVABLES_CANONICAL.keys()) +FEATURE_NAMES = OBS_NAMES + [ + "SR_local_rigidity", + "brody_q", + "wigner_poisson_like_weight", + "mean_ipr", + "participation_entropy", +] + + +def median(values: list[float]) -> float: + return float(np.median(np.asarray(values, dtype=float))) + + +def central_slice(n: int, fraction: float) -> slice: + keep = max(8, min(n, int(round(n * fraction)))) + start = (n - keep) // 2 + return slice(start, start + keep) + + +def anderson_hamiltonian(l_size: int, disorder: float, rng: np.random.Generator) -> np.ndarray: + n = l_size**3 + h = np.diag(rng.uniform(-disorder / 2.0, disorder / 2.0, n)) + + def idx(x: int, y: int, z: int) -> int: + return (x * l_size + y) * l_size + z + + for x in range(l_size): + for y in range(l_size): + for z in range(l_size): + i = idx(x, y, z) + for dx, dy, dz in ((1, 0, 0), (0, 1, 0), (0, 0, 1)): + j = idx((x + dx) % l_size, (y + dy) % l_size, (z + dz) % l_size) + h[i, j] = 1.0 + h[j, i] = 1.0 + return h + + +def row_spacings_and_ipr( + disorder: float, + l_size: int, + reps: int, + central_fraction: float, + seed: int, +) -> tuple[np.ndarray, float, float]: + rng = np.random.default_rng(seed) + spacings: list[float] = [] + iprs: list[float] = [] + entropy_values: list[float] = [] + n_sites = l_size**3 + for _ in range(reps): + h = anderson_hamiltonian(l_size, disorder, rng) + levels, vectors = np.linalg.eigh(h) + central = levels[central_slice(len(levels), central_fraction)] + gaps = np.diff(np.sort(central)) + gaps = gaps[np.isfinite(gaps) & (gaps > 1e-12)] + spacings.extend(gaps.tolist()) + + subset = vectors[:, central_slice(vectors.shape[1], central_fraction)] + probs = np.square(np.abs(subset)) + ipr = np.sum(probs * probs, axis=0) + iprs.extend(ipr.tolist()) + for col in range(probs.shape[1]): + p = probs[:, col] + p = p[p > 1e-15] + entropy_values.append(float(-np.sum(p * np.log(p)) / math.log(n_sites))) + + if not spacings: + raise ValueError(f"W={disorder} produced no spacings") + return ( + np.asarray(spacings, dtype=float), + float(np.mean(iprs)) if iprs else 0.0, + float(np.mean(entropy_values)) if entropy_values else 0.0, + ) + + +def source_type(disorder: float, metallic_max: float, localized_min: float) -> str: + if disorder <= metallic_max: + return "metallic_wigner_pole" + if disorder >= localized_min: + return "localized_poisson_pole" + return "mobility_candidate" + + +def adjacent_ratio(spacings: np.ndarray) -> float: + gaps = np.asarray(spacings, dtype=float) + if len(gaps) < 2: + return 0.0 + left = gaps[:-1] + right = gaps[1:] + return float(np.mean(np.minimum(left, right) / np.maximum(left, right))) + + +def compute_row(disorder: float, args: argparse.Namespace, seed: int) -> dict[str, Any]: + gaps, mean_ipr, participation_entropy = row_spacings_and_ipr( + disorder, + args.l_size, + args.reps, + args.central_fraction, + seed, + ) + s = normalize_spacings(gaps) + obs = {name: float(fn(s)) for name, fn in OBSERVABLES_CANONICAL.items()} + obs["SR_local_rigidity"] = float(SR_local_rigidity(s)) + brody_q, brody_nll = fit_brody_q(s, args.grid_size) + mixture_w, mixture_ks = fit_mixture_weight(s, args.grid_size) + return { + "domain_window": f"Anderson3D_W_{disorder:.2f}", + "disorder_W": round(disorder, 6), + "source_domain_type": source_type(disorder, args.metallic_pole_max, args.localized_pole_min), + "n_spacings": int(len(s)), + "adjacent_r": round(adjacent_ratio(s), 9), + "mean_ipr": round(mean_ipr, 9), + "participation_entropy": round(participation_entropy, 9), + "observables": {key: round(value, 9) for key, value in obs.items()}, + "brody_q": round(brody_q, 6), + "brody_nll": round(brody_nll, 6), + "wigner_poisson_like_weight": round(mixture_w, 6), + "mixture_ks": round(mixture_ks, 6), + } + + +def standardized_matrix(rows: list[dict[str, Any]]) -> np.ndarray: + matrix = [] + for row in rows: + obs = row["observables"] + matrix.append( + [obs[name] for name in OBS_NAMES] + + [ + obs["SR_local_rigidity"], + row["brody_q"], + row["wigner_poisson_like_weight"], + row["mean_ipr"], + row["participation_entropy"], + ] + ) + x = np.asarray(matrix, dtype=float) + center = np.mean(x, axis=0) + scale = np.std(x, axis=0, ddof=1) + scale[scale <= 1e-15] = 1.0 + return (x - center) / scale + + +def build_knn_edges(x: np.ndarray, k: int) -> list[tuple[int, int, float]]: + distances = np.linalg.norm(x[:, None, :] - x[None, :, :], axis=2) + edges: set[tuple[int, int]] = set() + for i in range(len(x)): + for j in np.argsort(distances[i])[1 : k + 1]: + edges.add((min(i, int(j)), max(i, int(j)))) + return [(i, j, float(distances[i, j])) for i, j in sorted(edges)] + + +def classify_graph(rows: list[dict[str, Any]], k: int, margin_max: float) -> dict[str, Any]: + x = standardized_matrix(rows) + labels = [row["source_domain_type"] for row in rows] + metallic_idx = [i for i, label in enumerate(labels) if label == "metallic_wigner_pole"] + localized_idx = [i for i, label in enumerate(labels) if label == "localized_poisson_pole"] + if not metallic_idx or not localized_idx: + raise ValueError("disorder grid must include metallic and localized poles") + c_metal = np.mean(x[metallic_idx], axis=0) + c_local = np.mean(x[localized_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 + + graph_rows = [] + for i, row in enumerate(rows): + d_metal = float(np.linalg.norm(x[i] - c_metal)) + d_local = float(np.linalg.norm(x[i] - c_local)) + denom = d_metal + d_local + margin = float(abs(d_metal - d_local) / 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] == "mobility_candidate" and labels[other] in { + "metallic_wigner_pole", + "localized_poisson_pole", + }: + cross += 1 + elif {labels[i], labels[other]} == {"metallic_wigner_pole", "localized_poisson_pole"}: + cross += 1 + cross_fraction = float(cross / len(incident)) if incident else 0.0 + state = "class_interior" + if row["source_domain_type"] == "mobility_candidate" and cross_fraction > 0 and margin < margin_max: + state = "third_included_candidate" + elif cross_fraction > 0: + state = "cut_edge" + graph_rows.append( + { + "domain_window": row["domain_window"], + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "centroid_margin": round(margin, 6), + "cross_neighbor_fraction": round(cross_fraction, 6), + "degree": degree[i], + "boundary_state": state, + } + ) + return { + "k": k, + "rows": graph_rows, + "third_included_candidates": [r["domain_window"] for r in graph_rows if r["boundary_state"] == "third_included_candidate"], + } + + +def classical_state(row: dict[str, Any]) -> str: + r = float(row["adjacent_r"]) + q = float(row["brody_q"]) + w = float(row["wigner_poisson_like_weight"]) + if r <= 0.43 and q <= 0.35 and w <= 0.35: + return "classical_poisson_endpoint" + if r >= 0.50 and q >= 0.65: + return "classical_wigner_endpoint" + return "classical_intermediate" + + +def stability_state(freq: float) -> str: + if freq >= 0.75: + return "stable_graph_bridge" + if freq >= 0.25: + return "parameter_sensitive_bridge" + return "unstable_non_bridge" + + +def audit_size(args: argparse.Namespace, l_size: int) -> dict[str, Any]: + disorders = parse_floats(args.disorders) + seeds = parse_ints(args.seeds) + ks = parse_ints(args.k_values) + total_runs = len(seeds) * len(ks) + row_hits: dict[str, dict[str, Any]] = {} + reader_runs = [] + row_args = SimpleNamespace(**vars(args)) + row_args.l_size = l_size + + for seed in seeds: + rows = [compute_row(w, row_args, seed + (l_size * 10000) + int(round(w * 100))) for w in disorders] + for k in ks: + graph = classify_graph(rows, k, args.graph_margin_max) + reader_runs.append({"L": l_size, "seed": seed, "k": k, "third_included_candidates": graph["third_included_candidates"]}) + graph_by_name = {row["domain_window"]: row for row in graph["rows"]} + for row in rows: + name = row["domain_window"] + if name not in row_hits: + row_hits[name] = { + "disorder_W": row["disorder_W"], + "source_domain_type": row["source_domain_type"], + "graph_hits": 0, + "margins": [], + "cross_fractions": [], + "brody_q": [], + "mixture_w": [], + "adjacent_r": [], + "mean_ipr": [], + "participation_entropy": [], + } + grow = graph_by_name[name] + if grow["boundary_state"] == "third_included_candidate": + row_hits[name]["graph_hits"] += 1 + row_hits[name]["margins"].append(float(grow["centroid_margin"])) + row_hits[name]["cross_fractions"].append(float(grow["cross_neighbor_fraction"])) + row_hits[name]["brody_q"].append(float(row["brody_q"])) + row_hits[name]["mixture_w"].append(float(row["wigner_poisson_like_weight"])) + row_hits[name]["adjacent_r"].append(float(row["adjacent_r"])) + row_hits[name]["mean_ipr"].append(float(row["mean_ipr"])) + row_hits[name]["participation_entropy"].append(float(row["participation_entropy"])) + + rows_out = [] + composite_counts: dict[str, int] = {} + for name in sorted(row_hits, key=lambda key: row_hits[key]["disorder_W"]): + item = row_hits[name] + freq = item["graph_hits"] / total_runs + class_row = { + "adjacent_r": median(item["adjacent_r"]), + "brody_q": median(item["brody_q"]), + "wigner_poisson_like_weight": median(item["mixture_w"]), + } + c_state = classical_state(class_row) + g_state = stability_state(freq) + composite = f"{g_state}+{c_state}" + composite_counts[composite] = composite_counts.get(composite, 0) + 1 + rows_out.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "source_domain_type": item["source_domain_type"], + "graph_bridge_frequency": round(freq, 6), + "stability_state": g_state, + "classical_audit_state": c_state, + "composite_state": composite, + "median_adjacent_r": round(median(item["adjacent_r"]), 6), + "median_brody_q": round(median(item["brody_q"]), 6), + "median_wigner_poisson_like_weight": round(median(item["mixture_w"]), 6), + "median_mean_ipr": round(median(item["mean_ipr"]), 9), + "median_participation_entropy": round(median(item["participation_entropy"]), 6), + "mean_centroid_margin": round(float(np.mean(item["margins"])), 6), + "mean_cross_neighbor_fraction": round(float(np.mean(item["cross_fractions"])), 6), + } + ) + + two_reader_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + graph_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] == "stable_graph_bridge" and row["classical_audit_state"] != "classical_intermediate" + ] + classic_only_rows = [ + row["domain_window"] + for row in rows_out + if row["stability_state"] != "stable_graph_bridge" and row["classical_audit_state"] == "classical_intermediate" + ] + + return { + "L": l_size, + "sites": l_size**3, + "total_graph_reader_runs": total_runs, + "summary": { + "two_reader_boundary_confirmed": len(two_reader_rows), + "two_reader_rows": two_reader_rows, + "graph_only_residue": len(graph_only_rows), + "graph_only_rows": graph_only_rows, + "classic_only_residue": len(classic_only_rows), + "classic_only_rows": classic_only_rows, + "composite_counts": composite_counts, + }, + "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, l_size) for l_size in sizes] + size_names = {entry["L"]: set(entry["summary"]["two_reader_rows"]) for entry in by_size} + all_two_reader = sorted(set.intersection(*size_names.values())) if size_names else [] + any_two_reader = sorted(set.union(*size_names.values())) if size_names else [] + intermittent_two_reader = [name for name in any_two_reader if name not in all_two_reader] + + row_by_w: dict[str, dict[str, Any]] = {} + for entry in by_size: + for row in entry["rows"]: + item = row_by_w.setdefault( + row["domain_window"], + { + "disorder_W": row["disorder_W"], + "size_states": {}, + "frequencies": [], + "classical_states": [], + "stability_states": [], + "adjacent_r": [], + }, + ) + item["size_states"][str(entry["L"])] = row["composite_state"] + item["frequencies"].append(row["graph_bridge_frequency"]) + item["classical_states"].append(row["classical_audit_state"]) + item["stability_states"].append(row["stability_state"]) + item["adjacent_r"].append(row["median_adjacent_r"]) + + cross_size_rows = [] + for name in sorted(row_by_w, key=lambda key: row_by_w[key]["disorder_W"]): + item = row_by_w[name] + cross_size_rows.append( + { + "domain_window": name, + "disorder_W": item["disorder_W"], + "size_states": item["size_states"], + "min_graph_bridge_frequency": round(float(min(item["frequencies"])), 6), + "max_graph_bridge_frequency": round(float(max(item["frequencies"])), 6), + "median_adjacent_r_by_size": item["adjacent_r"], + "two_reader_all_sizes": name in all_two_reader, + "two_reader_intermittent": name in intermittent_two_reader, + "classical_states_seen": sorted(set(item["classical_states"])), + "stability_states_seen": sorted(set(item["stability_states"])), + } + ) + + output = { + "experiment": "anderson3d_mobility_edge_two_reader_audit", + "question": "Does the two-reader BOUNDARY gate transfer from Rosenzweig-Porter to a 3D Anderson mobility-edge flow?", + "observables_registry": OBSERVABLES_REGISTRY_VERSION, + "observables_used": FEATURE_NAMES + + [ + "graph_bridge_frequency", + "size_stability", + "centroid_margin", + "cross_neighbor_fraction", + "classical_audit_state", + ], + "parameters": { + "sizes": sizes, + "sites": [l_size**3 for l_size in sizes], + "reps": args.reps, + "disorders": parse_floats(args.disorders), + "seeds": parse_ints(args.seeds), + "k_values": parse_ints(args.k_values), + "central_fraction": args.central_fraction, + "grid_size": args.grid_size, + "metallic_pole_max": args.metallic_pole_max, + "localized_pole_min": args.localized_pole_min, + "graph_margin_max": args.graph_margin_max, + }, + "observable_contract": { + "claim": "the BOUNDARY two-reader gate transfers beyond RP only if the same Anderson disorder row is stable_graph_bridge+classical_intermediate across tested sizes", + "observable": "two_reader_all_sizes from graph_bridge_frequency joined with adjacent ratio, Brody q, Wigner/Poisson mixture weight, IPR and participation entropy", + "operator": "3D Anderson tight-binding Hamiltonian with periodic boundaries, disorder sweep, seed and kNN perturbation", + "generator": "H=sum_i eps_i |i> None: + parser = argparse.ArgumentParser() + parser.add_argument("--out", default="tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json") + parser.add_argument("--sizes", default="5,6") + parser.add_argument("--reps", type=int, default=8) + parser.add_argument("--disorders", default="2,4,8,12,14,16,16.5,17,20,24,32") + parser.add_argument("--seeds", default="202605151947,202605151948") + parser.add_argument("--k-values", default="2,3,4") + parser.add_argument("--central-fraction", type=float, default=0.45) + parser.add_argument("--grid-size", type=int, default=151) + parser.add_argument("--metallic-pole-max", type=float, default=4.0) + parser.add_argument("--localized-pole-min", type=float, default=24.0) + parser.add_argument("--graph-margin-max", type=float, default=0.45) + args = parser.parse_args() + run(args) + + +if __name__ == "__main__": + main() tokens used 110,764 Eseguito il ciclo AI-Lab D-ND e scritto il report richiesto: [agent_20260515_1947.md](/opt/MM_D-ND/tools/data/reports/agent_20260515_1947.md) Ho creato anche lo script e il deposito dati: - [exp_anderson3d_mobility_edge_two_reader_audit.py](/opt/MM_D-ND/tools/exp_anderson3d_mobility_edge_two_reader_audit.py) - [anderson3d_mobility_edge_two_reader_audit_20260515_1947.json](/opt/MM_D-ND/tools/data/anderson3d_mobility_edge_two_reader_audit_20260515_1947.json) Risultato: `CONSTRAINT`. Il gate two-reader trasferisce su Anderson 3D nel perimetro finito solo come riga `W=20`; `W=16/16.5` resta intermittente e va stressato con taglie maggiori. Verifiche completate: `py_compile`, run esperimento, no `ANTHROPIC_API_KEY`/`OPENAI_API_KEY` presenti.