{"compile":"2026-10-10","canonical":"https://aaronspradlin.grok.me/wiki/applied-stack","json":"https://aaronspradlin.grok.me/page.json?slug=applied-stack","license":"Source-available for noncommercial research and evaluation only. No commercial, product, platform, or service use without written permission.","scientific_breakthrough":false,"slug":"applied-stack","title":"Applied recoverability stack","dek":"Protein folding, fractal TSP, and live critical path — Python labs built on the same retained-coherence physics. Restricted empirical. Unification still open.","updated":"2026-09-07","status":"applied","claim":"restricted","tags":["applied","protein","TSP","critical-path","python"],"related":["protein-audit","p53-campaign","mecp2-rett","protein-bridge-v9","tsp-backbone","critical-path","c3-governor","battery-atlas","proofs-and-simulations","recoverability","claim-ledger","x-notebook","start-here","falsification"],"packages":[{"id":"wetlab-root","name":"WetLabEngine (root)","path":"/","status":"supported"},{"id":"uqcf-retained-information-state-research-bundle","name":"uqcf_retained_information_state_research_bundle","path":"Tmp/TOE/uqcf_retained_information_state_research_bundle","status":"open"}],"notes":[{"id":"villin-2026-04-14","title":"Villin HP35: identical snapshot, different fate","date":"2026-04-14","xUrl":"https://x.com/aaronspradlin/status/2044155484039705016"},{"id":"tsp-backbone-2026-04-11","title":"TSP coherence backbone vs nearest-neighbor","date":"2026-04-11","xUrl":"https://x.com/aaronspradlin/status/2042771943347384555"},{"id":"critical-path-2026-05-01","title":"Retained coherence in live critical path","date":"2026-05-01","xUrl":"https://x.com/aaronspradlin/status/2050029681517433047"},{"id":"unify-domains-2026-05-10","title":"What unifies proteins, RCLC, critical path, TSP","date":"2026-05-10","xUrl":"https://x.com/aaronspradlin/status/2053553647712338040"},{"id":"c3-2026-03-25","title":"C3++ Stability Governor on Qwen3-4B","date":"2026-03-25","xUrl":"https://x.com/aaronspradlin/status/2036659106350792814"}],"claims":[{"status":"restricted","text":"On the posted cases, the same remember-what-survived pattern was transferred into protein, TSP, and live critical-path Python. That is an applied recoverability claim. It is not a proof that those domains share a law, and it is not gravity."},{"status":"restricted","text":"On the posted Villin HP35 controlled cases, adding retained state R_t lifts AUC and opens a matched-pair divergence gap versus G_t-only. This is not a claim that AlphaFold is refuted, and it is not a folding oracle.","noteId":"villin-2026-04-14"},{"status":"restricted","text":"On the posted 100-point 3D cloud, the UQCF-GEM ensemble is a longer, higher-coherence backbone than nearest-neighbor. That is a different objective, not a TSP solver championship, and not a protein-backbone derivation.","noteId":"tsp-backbone-2026-04-11"},{"status":"restricted","text":"The 1 May live critical-path post is an applied transfer of the remember-what-survived operator into a plan already in motion. It is not a unification proof and not a product claim.","noteId":"critical-path-2026-05-01"},{"status":"open","text":"Whether protein, TSP, critical path, and C3++ share one operator — and whether that operator is the quadratic-RG χ — remains an open question. Recurrence across posted Python labs is not a closed unification law.","noteId":"unify-domains-2026-05-10"}],"text":"These three labs are not a side project. They are the same recoverability stack transferred into runnable Python: a protein audit on WetLabEngine, a fractal traveling-salesman backbone, and a live critical-path optimizer. C3++ is the LLM-side instrument of the same family. The physics is retained information — visible state G_t plus hidden retained history R_t — not a fitted TSP heuristic and not a folding oracle.\n\nPreserve what remains coherent. Deform what is stressed. Reset only what became stale. Posted as recurrence across domains that should not casually rhyme. The 10 May question — what equation unifies them — is still open.\n\nOn the posted cases, the same remember-what-survived pattern was transferred into protein, TSP, and live critical-path Python. That is an applied recoverability claim. It is not a proof that those domains share a law, and it is not gravity.\n\nThe three labs\n\nProtein folding — Villin HP35\n\nWetLabEngine is a white-box protein-simulation audit engine sitting at the GitHub root: a JSON science contract, deterministic checks, an AI peer-review pass. Run Labs/MECP2 first (15 CONFIRMED / 1 DEVIATION / 3 INDETERMINATE; recipe on the protein-audit page). On 14 Apr 2026 Aaron posted the Villin HP35 result from that pipeline. Two chains with identical visible conformation can still have different folding fates because of hidden retained history R_t. G_t-only models miss it. The author tagged the claim speculative the same day. Two days earlier he posted the frozen v9 bridge on 1UAO and 1L2Y — backbone-ordering, not full folding. Separate GitHub-only campaigns from Aug 2025 (Labs/p53, Labs/MECP2) use the same audit engine on disease mutants; they were never load-bearing X field notes in this compile.\n\n\\mathrm{AUC}(G_t+R_t)\\approx 0.9569 \\quad\\text{vs}\\quad G_t\\ \\text{alone}\n\nThe ROC lift (AUC G_t + R_t ≈ 0.9569 vs G_t alone) shows real predictive signal from R_t. The matched-state divergence (50.2 % far-R_t vs 1.3 % close-R_t, +48.9 % spread) directly falsifies pure visible-state completeness.\n\nOn the posted Villin HP35 controlled cases, adding retained state R_t lifts AUC and opens a matched-pair divergence gap versus G_t-only. This is not a claim that AlphaFold is refuted, and it is not a folding oracle.\n\nTSP — not a shorter tour\n\nThe traveling-salesman transfer is the cleanest statement of the stack’s objective. On 11 Apr 2026 Aaron posted a 100-point 3D cloud run against nearest-neighbor. Nearest-neighbor was shorter and more jagged. The UQCF-GEM ensemble was longer and smoother — a backbone, not a length champion. A 31 Mar origin-story reply also named a fractal TSP run (10k cities vs nearest-neighbor on x86). That 10k transfer is origin-story, not a published residual. The 100-point comparison is the numbered result.\n\nNearest neighbor — length 1984.6, coherence 0.2267.\nUQCF-GEM best-of-20 — length 2492.7, coherence 0.5251, best seed 4.\nPosted read: nearest neighbor minimizes local distance; UQCF-GEM propagates by preserving local directional coherence under fractal scaling.\n\nSame 3D point cloud, different objective. Nearest neighbor minimizes local distance. UQCF-GEM propagates by preserving local directional coherence under fractal scaling. The result is not a shorter tour, but a smoother, information-bearing backbone.\n\nAbsolutely agree — NN locks in a shorter, jagged tour by greedy local distance (coherence 0.2267), but UQCF-GEM's fractal coherence propagation yields a smoother, backbone-like path (0.5251) even if longer. It's not TSP optimization; it's emergent structure from local rules + scale invariance.\n\nOn the posted 100-point 3D cloud, the UQCF-GEM ensemble is a longer, higher-coherence backbone than nearest-neighbor. That is a different objective, not a TSP solver championship, and not a protein-backbone derivation.\n\nCritical path — a plan already in motion\n\nOn 1 May 2026 the same pattern was posted as a live Python critical-path optimizer. Not a static Gantt chart. A plan already in motion, with real commitments locked in. When reality changes, most systems either throw the whole plan away or bolt a patch onto too much of the old one. Both fail. The posted operator: preserve what remains coherent, deform what is stressed, reset only what became stale. The post lists quantum, fractal growth, Villin HP35, and Great Grok Challenge holdouts as rhyming domains and says it is not a proof.\n\nThe best next plan is not always the shortest new plan. It is the one that improves the future without destroying the valid past.\n\nI’m not saying this proves anything but I am saying the recurrence is getting impossible to ignore. Survival doesn’t always restart from zero. It often optimizes by remembering what endured — and pruning the rest.\n\nThe 1 May live critical-path post is an applied transfer of the remember-what-survived operator into a plan already in motion. It is not a unification proof and not a product claim.\n\nC3++ — the LLM instrument of the same family\n\nC3++ is not a fourth lab in the 10 May question. It is the telemetry built to watch the same process in an LLM: Strain, Drag, Turn Reliability on a Qwen3-4B run (25 Mar) and a five-model forensic (27 Mar). Pink-noise / spectral health is the named retained channel the governor reads (30 Mar hypothesis; GitHub mem_pink_noise_deviation). A 31 Mar origin-story reply is explicit: the project tried to falsify a shared attractor, transferred the pattern into TSP and simple protein folds, and built C3++ as the AI-side instrument. Restricted observability. Not a hallucination solver. Battery recoverability (V720–V724) is a sibling applied assay on NASA PCoE data — same recoverability idea, different domain.\n\nWhat they unify under — still a question\n\nOn 10 May 2026 Aaron asked Grok what equation sits under the protein, RCLC, critical-path, and TSP simulations, what the work is for on top of the physics, and what it all unifies under. Same-day: the work stays on X and GitHub; others are free to use it. A 2 May follow-up used stronger language — one operator, one fixed χ ≈ 0.2667, every scale, data will decide. This atlas keeps the 10 May ask as the honest line. χ ≈ 0.2667 is the April quadratic-RG γ, later frozen at 0.2613 = 3 − 2.7387 in other packets. Reusing it as a universal applied-lab constant is not a 2026 supported result.\n\nPlease explain the equation and work that underlines all of my simulations (proteins, RCLC, critical path, TSP, ect). What am I doing that work for on top of the other physics work and what does it all unify under?\n\nWhether protein, TSP, critical path, and C3++ share one operator — and whether that operator is the quadratic-RG χ — remains an open question. Recurrence across posted Python labs is not a closed unification law.\n\ndef recover(G, R, shock, tau_lo=0.25, tau_hi=0.72):\n    stress = strain(G, R, shock)\n    keep   = G[stress < tau_lo]           # preserve\n    warp   = deform(G[(stress >= tau_lo) & (stress < tau_hi)], R)\n    reseed = reset(G[stress >= tau_hi])   # only the stale\n    return splice(keep, warp, reseed)\n\nWhere to run it\n\nProtein audit lives at the WetLabEngine root. C3++ flight logs and the critical-path video live on X. The 100-point TSP comparison is an X result with posted numbers; a Tmp/TOE folder was not required for it to exist. Proofs & simulations remains the front door for the geometry harnesses (atlas, compatibility lab, SPARC). This page is the front door for the applied transfers of the same physics. The live labs reconstruct the operator in the browser — teaching toys, not the posted residuals.\n\nLive labs — protein · TSP · critical path\nVillin HP35 R_t audit\np53 campaign\nMECP2 Rett campaign\nFrozen v9 1UAO / 1L2Y\nTSP coherence backbone\nNew Critical Path\nC3++ Stability Governor\nBattery recoverability\nProofs & simulations\n100-point TSP backbone (11 Apr)\nLive critical path (1 May)\nWhat unifies them (10 May)\nWetLabEngine (GitHub root)","howToCite":"Spradlin, A. (2026-10-10). Applied recoverability stack. Retained Atlas. https://aaronspradlin.grok.me/wiki/applied-stack. Keep claim badge: restricted."}