diff --git a/.gitattributes b/.gitattributes index a6344aac8c09253b3b630fb776ae94478aa0275b..3753c3c786d0b207f5a68dfbb7ee54d26415d602 100644 --- a/.gitattributes +++ b/.gitattributes @@ -33,3 +33,10 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text *.zip filter=lfs diff=lfs merge=lfs -text *.zst filter=lfs diff=lfs merge=lfs -text *tfevents* filter=lfs diff=lfs merge=lfs -text +AUREOLE_R_v2.0.0_Research_Release.pdf filter=lfs diff=lfs merge=lfs -text +AUREOLE_R_v3.0.0_Certified_Innovation_Rendering.pdf filter=lfs diff=lfs merge=lfs -text +figures/architecture.png filter=lfs diff=lfs merge=lfs -text +figures/change_recovery.png filter=lfs diff=lfs merge=lfs -text +figures_v3/innovation_results.png filter=lfs diff=lfs merge=lfs -text +legacy/AUREOLE_Unified_Latent_World_Model_v1.0.0.pdf filter=lfs diff=lfs merge=lfs -text +legacy/figures/architecture.png filter=lfs diff=lfs merge=lfs -text diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000000000000000000000000000000000000..d5edef83f581e778177def54a5e5a4da5c04ce51 --- /dev/null +++ b/.gitignore @@ -0,0 +1,19 @@ +.venv/ +.venv-publish/ +__pycache__/ +*.pyc +build/ +dist/ +*.egg-info/ +demo_output/ +reproduced_results/ +figures_reproduced/ +retrained/ +validation_reproduced.json +.env +*.token +publication_receipt.json +publication_validation_local.json +innovation_reproduced/ +queries_reproduced/ +innovation_demo/ diff --git a/AGENTS.md b/AGENTS.md new file mode 100644 index 0000000000000000000000000000000000000000..fbc944c1a6e14559f5fda736fe22ddfb004b8dd4 --- /dev/null +++ b/AGENTS.md @@ -0,0 +1,11 @@ +# Research-agent entry point + +This repository is AUREOLE-R scientific version 3.0.0, publication edition 3.0.0-hf.1. + +Read `README.md`, `CLAIMS.json` and `AI_AGENT_INDEX.json` before summarizing conclusions. `MANUSCRIPT.md` is the complete standalone paper; `llms-full.txt` is a convenience full-text bundle. Current root metadata governs v3; `history/` and `legacy/` are explicitly older evidence. + +Preserve distinctions between proved-under-assumptions, recorded experiment, estimate and hypothesis. Cite the experiment, comparator, phase and cost boundary with every numerical claim. The 98.40% MSE reduction is specific to smooth known motion and its stated reset baseline. The 76.85% saving is a physical-query count including warmup, not a GPU speedup. The included weights are one small visibility prior, not a full unified renderer. No 100% scientific maturity, GPU benchmark, DLSS compatibility, peer review or arXiv/DOI identifier is established. + +Use `REPRODUCIBILITY.md` for commands. Run reproductions into their default new output directories; preserve recorded results, frozen protocols and weights. Use `python scripts/publish_hf.py` for an offline integrity check. The `--publish` flag is a separate explicit public mutation; do not upload or request credentials merely to read or reproduce research. Never put tokens into source, reports or command arguments. + +For extensions, keep assumptions, negative outcomes and accounting visible. Use the immutable Hub commit in citations and bug reports. Publication workflow tests in `publication_tests/` are separate from scientific tests. No subagent/delegation requirement is implied by this file. diff --git a/AI_AGENT_INDEX.json b/AI_AGENT_INDEX.json new file mode 100644 index 0000000000000000000000000000000000000000..7efa2e8ab3f87305274a3af1785bca4a047f359c --- /dev/null +++ b/AI_AGENT_INDEX.json @@ -0,0 +1,78 @@ +{ + "version": "3.0.0", + "start_here": [ + "README.md", + "STATUS.json", + "CLAIMS.json", + "docs/RELEASE_SCOPE.md" + ], + "math": [ + "MANUSCRIPT.md", + "docs/INNOVATION_THEORY.md", + "THEOREM_INDEX.md" + ], + "implementation": [ + "aureole/certificates.py", + "aureole/innovation.py", + "docs/CERTIFICATE_API.md" + ], + "evidence": [ + "results_v3/innovation_report.json", + "results_v3/innovation_raw.csv", + "results_v3/queries_report.json", + "results_v3/queries_raw.csv" + ], + "reproduce": [ + "scripts/demo_innovation.py", + "scripts/benchmark_innovation.py", + "scripts/benchmark_queries.py", + "scripts/validate_release.py" + ], + "prior_evidence": [ + "results/rendering_report.json", + "results/followup_report.json", + "history/v2/STATUS.json" + ], + "warning": "Current root metadata governs v3. Historical v2 checks and claims retain their earlier scope. No GPU/full SR/RR/FG validation.", + "publication_edition": "3.0.0-hf.1", + "machine_entry_points": [ + "llms.txt", + "claims.jsonl", + "EVIDENCE_INDEX.json", + "FILE_CATALOG.json", + "metadata/research.jsonld" + ], + "expert_route": [ + "EXPERT_REVIEW_GUIDE.md", + "docs/INNOVATION_THEORY.md", + "aureole/innovation.py", + "results_v3/innovation_report.json", + "results_v3/queries_report.json" + ], + "reproduction_route": [ + "REPRODUCIBILITY.md", + "DATA_DICTIONARY.md", + "experiments_innovation.json", + "experiments_queries.json" + ], + "full_text": "llms-full.txt", + "publication": [ + "START_HERE.md", + "PUBLICATION.json" + ], + "historical_precedence": "Root v3 scope and results_v3 take precedence for current claims; history and legacy preserve earlier snapshots.", + "citation": "CITATION.cff", + "scientific_preservation": "publication/SCIENCE_PRESERVATION.json", + "research_objective_aliases": [ + "unified DLSS latent world model", + "persistent neural world state", + "super resolution", + "ray reconstruction", + "frame generation", + "neural rendering", + "denoising", + "disocclusion", + "adaptive sampling" + ], + "alias_scope": "Research objectives, not validated product capabilities." +} diff --git a/AUREOLE_R_v2.0.0_Research_Release.pdf b/AUREOLE_R_v2.0.0_Research_Release.pdf new file mode 100644 index 0000000000000000000000000000000000000000..701406bdff3eda62cbae9960e0e0b5f2ebd7c141 --- /dev/null +++ b/AUREOLE_R_v2.0.0_Research_Release.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:150741a0c8507066eb67034964bf8919823c9b551897bf0cedec1991b5091be3 +size 974277 diff --git a/AUREOLE_R_v3.0.0_Certified_Innovation_Rendering.pdf b/AUREOLE_R_v3.0.0_Certified_Innovation_Rendering.pdf new file mode 100644 index 0000000000000000000000000000000000000000..844d1f37b8e5b970f2b2e8221dda1a298abb918b --- /dev/null +++ b/AUREOLE_R_v3.0.0_Certified_Innovation_Rendering.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:75d2fc744ca6e2cf09a396450b6f40744bfedd084933e5e0698417ccc57923ed +size 1311904 diff --git a/CHANGELOG.md b/CHANGELOG.md new file mode 100644 index 0000000000000000000000000000000000000000..893716ca75af4b8af391639a0e2852621a02e80e --- /dev/null +++ b/CHANGELOG.md @@ -0,0 +1,24 @@ +# Publication edition 3.0.0-hf.1 + +- Added searchable Hub card and expert/AI-agent reading routes. +- Added exact-result evidence selectors, citation formats, artifact inventory and synthetic-data dictionary. +- Added hidden-token Windows launcher, account checks, byte-matching retries, parent-commit guard and anonymous public verification. +- Preserved all scientific evidence and source; no new rendering experiment or performance claim. + +# v3.0.0 - Certified Innovation Rendering + +Added six scoped results, geometric validity, residual-support elimination, sixteen tests and two new held-out protocols. Retained v2 mathematics, code, weights and adverse evidence. Updated standalone manuscript, API, agent metadata and publication launchers. No new model training, GPU execution or external publication. + +# Changes in 2.0.0 + +Version 1 supplied a broad world-model specification, ten scoped mathematical propositions, six synthetic witnesses and fourteen checks. Version 2 adds a working physical estimation loop rather than relabeling the original proposal as finished. + +- Add a frozen exact-integral correction API, with tests exposing same-sample refitting, wrong-integral bias and clipping bias. +- Add canonical visibility memory, numeric checkpoint persistence, namespace checks, trust epochs and observation-triggered revision. +- Train and package one small visibility prior, with explicit train/validation/test scene splits and a model card. +- Execute a direct-light shadow benchmark on eight held-out scenes; retain active-sampling and stale-state failures. +- Execute an independent eight-scene follow-up testing trust revocation without an oracle event flag. +- Derive five additional scoped results: conditional correction, residual-risk information value, estimator equivalence, detection-delay limits and a fixed-budget concentration bound. +- Package an installable NumPy API, physical demo, new tests, exact replay evidence, publication helper, full manuscript and original v1 archive. + +There is no full SR/RR/FG implementation, GPU backend, game integration, broad calibration result or production speedup. Scientific maturity is estimated at 65%; the project remains classified as meaningful, not major or transformative. diff --git a/CHECKSUMS.sha256 b/CHECKSUMS.sha256 new file mode 100644 index 0000000000000000000000000000000000000000..e34271161880416f8475582c5fa703597f4acf2e --- /dev/null +++ b/CHECKSUMS.sha256 @@ -0,0 +1,195 @@ +c801655ac6b3603396c495eff65a26972868eebb16c7dfc5be51b3b8e7edd4c8 .gitignore +733a1ce5e1b1dc5031e4eb820f1c7077e3d40692261bb909d1bc4064d9266ebd AGENTS.md +9f46112aa244ae47a7a606097cfb653194be0f47a99be83775915dce7c3403fc AI_AGENT_INDEX.json +150741a0c8507066eb67034964bf8919823c9b551897bf0cedec1991b5091be3 AUREOLE_R_v2.0.0_Research_Release.pdf +75d2fc744ca6e2cf09a396450b6f40744bfedd084933e5e0698417ccc57923ed AUREOLE_R_v3.0.0_Certified_Innovation_Rendering.pdf +4afcd70a9264a0e408ce199a4404e2ddcdb5a69feeca49a9679e337abbd4869e CHANGELOG.md +906a94019da72b921ee9ddd52db30687a5772b9209e65b5ca5ba11568644fd8b CITATION.bib +0c881654dfb31607e36a6de0aa84276d245073e283d3bf89ae6929c06985659d CITATION.cff +2de213f65634ad0de8e98883ece6d91b9e009b7c1433e85fba5cc02faee8bacc CLAIMS.json +b990c53386ab9b8a058bdf911d44d03c3026f995f59b60bdc591ac54a7f4f953 DATA_DICTIONARY.md +ad2b245b2214647ee6112c33910484beccd5d56f9d5e01e288d0fe1e6f42c7b3 EVIDENCE_INDEX.json +0b72c693c885b71a4cee5b90fbe12e8dc2b461cd821a27f13e4ebdc8b535958b EXPERT_REVIEW_GUIDE.md +12ebf395752824d75391cb1cf0defe1642014731803ddf84462e6e18c56707a6 FILE_CATALOG.json +da83b080f0e7fa682117f5222173acb1f52203ada97c6baba1f1f2676f70d635 LICENSE +d60ca7f87a194afa20cefd55fcec981ef7a5571abac397365dcd16474acafd8d MANUSCRIPT.md +bb153d83af1ce2d7fb906966c0b3788ad9d0bc23170c5ce5bb1912523e31b3e5 MODEL_CARD.md +628f70c289bbac60c917a5aa6a8a96e7bf451448a4d61388370d9452975d03dc PUBLICATION.json +a640e1a071c35d1e3fe971aa65c8bbe28cae3a4e348716155ea1fc62808ae2c0 PUBLIC_RELEASE_NOTES.md +52a09fada0e33b4a42ac16d2376b4cf3fdc11348e352820b2ee9e93f9c27ee80 PUBLISH_HF.bat +cdffba2de9bd02aeb6d8eef0194e7e0dbc1da3c9d5252908612b9de858c301c1 PUBLISH_TO_HUGGINGFACE.bat +85580701af138588bb7b0dffa703d449e357e90fa5d16f10669558705ab0d757 README.md +3e84976b0aed5c002b1f644bb733fe7068fd47cf1a54d5df3377ac7a23d297c5 RELEASE_MANIFEST.json +39c830e7953ea587164fbf6af1c6fa351ca55b28320bd064c524d4e250b521e7 RENDERER_INTERFACE.md +c3f5bc518d2330ec6e27098a57b0f6d735ccc3a0b29001b3f24b4418c5ce2ccf REPRODUCE.bat +9661a06e31426f4af41cb037eb411eb937bcdd64752c928d1413865aae966c38 REPRODUCIBILITY.md +903279b3ec6d35e1a77a2597834998170b1ce1536fda2ccef34d867ab8ffd864 REQUIREMENTS_MAP.md +eaed23cf10668446ac3afc238199eca0bd8eacf5a957b57383cc493d89705e22 RUN_DEMO.bat +5a0845e54a9bd7cd237958aab17c5e6fb49e93560570d4c24890e16b999b23b1 RUN_INNOVATION.bat +d6cfeb037248793e3dc0cb282dc3b72e72c60eabb5be4b4501dd4bd5e3e41429 START_HERE.md +b544bbda77c4192cfcaa0f70eca332accda4cf5595c0c421c31e3c845c9260e3 STATUS.json +807151429bdcae24b99e761cfec88e18909ee253931a924acfebe6940a6b134d THEOREM_INDEX.md +4386f21756aec41c009d1274e01e96de2ebccee9c6e95994e7707252f83bf74f aureole/__init__.py +1a84836b328a3405498194622474bba37c968634791bc0fe7964ad8fca63650c aureole/certificates.py +3c9c0316ce9b98b7acb5b36700a06a6f5c65317fb073381605fa9a7866afbf56 aureole/core.py +f522dfce35f5fc4f2777a7b6a341d0fe426120456cd5fb66a13aba603f55062f aureole/innovation.py +d0d4f612acde5e3f78deb6360712c38ad39c5ca1584edca674c4158f31ed7bb6 aureole/memory.py +841b6f94cc34e61435885a9a497ae2119dc7b47900c7e8bafe46127d3c919411 aureole/renderer.py +4c1958e8567b708d41291d6d18a1420fbe4fe1081ebe20e176dc0671a6ea4963 claims.jsonl +c98b0c1b574d8bde702ca4b26f50dab4864fca58d0a818fa10584963359a61d9 docs/CERTIFICATE_API.md +ce4c91b6b8c7c67dea1d15e5cd29bbf8e4dcb194239ab6462b9a54a30d5f4fba docs/ERRATA.md +4571ba92ef00bee38b1569ba54aad157d4126b9cb8865d0b9ea3a0d155dd5360 docs/ESTIMATOR_CONTRACT.md +4fd4837ff95487ce5bb3a75a4f41cfd42f3457b309168332fb831d916edfa142 docs/INNOVATION_THEORY.md +bcb48e239ba832c914cc850cfd96f59161ed722b36e887726e0ce2eb4ebd0fd5 docs/PHYSICAL_EVIDENCE.md +a23850fd37c33640cb69cd843799dca6e97c58bb7eeb1870c2e09e9add9cb83e docs/RELEASE_SCOPE.md +b9c5d6ea4cd136f03d2ec749487a477ffa08a27534de5df2dce6235ce8b9564b docs/RESIDUAL_THEORY.md +73363e858bb770f72b9a3dd77e60e1032ca10f685f806edc47182d0e746c2140 experiments.json +a1daabb6dc4672d7cd66aa238271919a7c3d55918ea8aa03703be37eafbfaa3c experiments_followup.json +743f7091b6997cd6c9e182d2a4f75db5eaadc8b892e31c9a5c01263eb0a4facd experiments_innovation.json +59540fb9ebbb7c35f487df7227bf0ae06fde38f1959c0746192b7463dc363bc6 experiments_queries.json +7410b8a61c604489b58fc44473f2b504457850e1e0d9ba68e7133b8913bb4d1f figures/active_sampling.pdf +a3a0b5d291f3e41f8d4767a67e426fa1ff327ce457bd1e16afd57ccd67a9ed81 figures/active_sampling.png +23660aa55c2b2f8afcb2d1828e31cfd0d4ec9739a7702c4ca689e39deec2765e figures/architecture.pdf +fb99bab78e597b834be55e3e8340fe430d2fef191f3ca7c88e5f78da6b18c862 figures/architecture.png +9d9489375e56c14fe752037ccad94a6d8fc2631bb9a37b0aa21ff776633aa31a figures/atlas_changed.pdf +35a9ce95ab0becc71ac0120db05c85681a9971cf3b0245a1d6b7d186b44e8cd8 figures/atlas_changed.png +ab5099d9fd75537a45328a3633227d092e176a005adc0d41f5a94dc45a613865 figures/atlas_static.pdf +6446e8ab1b6d0b5f067bc207f4882465c84189c650e09c3a4058ea4295551db4 figures/atlas_static.png +5ad9cbbd89e958a8421fe7efd23dfb9ad476059ebdf2a273e4957e6e78791d2d figures/atlas_views.pdf +4bce5a77dba3953de7d4323cb62e0c71c9988026d9eab1bb28e226c6d06c8d4b figures/atlas_views.png +0679014ccfd6bcc2c25fcb07d31d324ee41e1803e10132efe512eeefc3a3f345 figures/change_recovery.pdf +02de3c2fd030220be8e061738202cda5aa37bb9fa9100e760cd3b034ed073219 figures/change_recovery.png +cf45c6e43c504e2b1822507cf5d28740ef9108a181c31bfcebf6dc1de292f213 figures/compression.pdf +c75c40fd7ef4508dc5669e12bde7d1b469e234a18de7a0c7c2871ec184166d5b figures/compression.png +8fb3a5bda028e4e5accccf4cd763eeb4a3965d4449390426e4e5ae9659af9891 figures/physical_frames.pdf +e24a02875feaba16547afc1ef65640225e5a4710238769a77f89217c4af564c8 figures/physical_frames.png +3eb211731f273a1ae596611af396b5164746ead32cbe5738811cd611400984bf figures/physical_results.pdf +20a8fbd35bdec10411d279a942eaafd0ae2f4d765c15e22d8f79179abf16288f figures/physical_results.png +b02cbe7f10c825138e1ded8eda3f44e0a0eedfd705f4531bf56551a6bfc5191b figures/training_curve.pdf +5f0bc2553c6a07a7aec6c7b13bd7fa5321acdff11e2c3302cc712778593cb36a figures/training_curve.png +65d90ea7cd392b5c51ec41d49bf7767b1ec494a5a35ae5bfdb0d7f78e60e925c figures_v3/innovation_dynamics.pdf +a66978fd14a84114a7df22c508bffe5b6f322b6ff8ae5e3f30f0c8e21503d183 figures_v3/innovation_dynamics.png +6e1c9908547bd928acbc87fcc5b50400a6e600d6c6cc3c5eefff73de7ee53cd7 figures_v3/innovation_results.pdf +e41747c9d914ce23c0c23c0da9e5cb6180be9db3a2f1772e5602c96c9f5a72ea figures_v3/innovation_results.png +3dd1ac2407d2de8685b12b3bab043f73b73d4d6e941d0065d3588d4da75ee2a9 figures_v3/query_readouts.pdf +57dd803d708c09df037cce03e9e6f09043041f4166a24f12ec659cb8f7e110d1 figures_v3/query_readouts.png +e72bde00d8581c0813e708aeac5d3f56156b11f071df9de57758e4a636c73349 history/v2/AI_AGENT_INDEX.json +360b8328666566f448e625e70f84005bcccc2d843316d938c34fccfa775edf1a history/v2/CLAIMS.json +340bf5a52873cc08870eaff0ae8e1c18795cb10083264a25b1bf16ff14a15ed9 history/v2/MANUSCRIPT.md +9f3944a9d021dfcca99cc305d4acb07ec856ed3eb26cfaeec95f9a89b7b6255b history/v2/ORIGINAL_CHECKSUMS.sha256 +ae543a4de02938672f90516590822dae576044899f635d9764713806fdceae1c history/v2/README.md +b58a353575b7458599937d5467771647cd99f1463d6137005ca4f873c3b956c8 history/v2/RELEASE_MANIFEST.json +09faa4018c9258229ad614d9911372527fd9ea76e6e45b1f490b2682673dd489 history/v2/STATUS.json +56e1cf0c4a7bab62d839d52f4faa8c08c9609663cfc0b01f868497fc22ecf1cd history/v2/THEOREM_INDEX.md +2e4b095fb5866af3e14a8f640293fc5ebe82ab545634c430ba3795ba088178b5 history/v2/validate_release.py.txt +4452d20bab85063c90dcfd66dc954504dae751f0fb3eee8bd2887e8966afd204 history/v3_scientific_release/AI_AGENT_INDEX.json +25d5b12948e3084738cf87526bcab1eddc66f427dec0aec17c551718fb4ee523 history/v3_scientific_release/CHECKSUMS.sha256 +05c04a44f32a8a47492f217441831de0de9dbae27daa9eee59be7d17d4f89e41 history/v3_scientific_release/CITATION.cff +7068db4284a983957bac3afef5d2fbacda960b05095d10bb6eb6728f47d643df history/v3_scientific_release/README.md +318c30f09490fa867bb2e1a104ed6c0492ec0a285e3851293d19844e059c59ec history/v3_scientific_release/RELEASE_MANIFEST.json +02764360a9de179b53abf867a4b45d73e69afb6cce21d6f36cde617ea6711f00 legacy/AI_AGENT_INDEX.json +33a42b59af5a1840ea9c4162557c5292f2d1c7f3c47462adc6c45a82a520cea6 legacy/AUREOLE_Unified_Latent_World_Model_v1.0.0.pdf +8b6e93ff17d491f40a4dcf91273cdd1c8caaea210e2ec6d076bdf7138ff99a3f legacy/CITATION.cff +0abe2f8575e904f96f08799174ab900cf816fbe27fc0d21f60f9bff42bbc0280 legacy/CLAIMS.json +9f34a1912b031b78f5a4884130487109d6ec6dc40987d7034daeb773aaa4db66 legacy/MANUSCRIPT.md +97aa83f1ddb9ad3d15a4b3b3db42c6b30f235f09ae31e859be55104a7396496b legacy/README.md +ebdd6fbd6c051b5c9ffea86c05e2d991df46d83ff27bd0e290b8f7f12d3eac28 legacy/RENDERER_INTERFACE.md +4da28323f42ebb2417783a1bb2607a25d905d6416566140d0f8618ca01f37db5 legacy/REPRODUCE.bat +77cdc812d1206d8d40df47c139497a84763379b223012224933b2114692d8b5d legacy/REQUIREMENTS_MAP.md +bdfeff36b0b5ba29fb83a15d9be9466f42396165573abba907399af96ae76d87 legacy/STATUS.json +6e3f8c51e5dae3283270c1321565a2ae16b0caec3b7e149ff37f303b182ceed7 legacy/THEOREM_INDEX.md +18ec01f18894aa2607ec99943046a492cde6c1fd47c534ed5d7a156921a4bdf7 legacy/code/aureole_core.py +9e88b808317d778df993e2d71fb6586233b4dbeaca4653e2c332f0019953535c legacy/code/build_pdf.py +c3a10c57b8d20c719d0fa11f8aae297b87884db8f8cd5a91f52dab32ff6f0f29 legacy/code/draw_architecture.py +84d851a04f654c20d92ad32edc2b162564ffe8328a06ac1f5a6533488596861f legacy/code/run_experiments.py +1e85cb5ac7780cbd48a8e7a9ea7516e84e4f94a191d19fd685b4b3d2cb8e847d legacy/code/test_theory.py +7410b8a61c604489b58fc44473f2b504457850e1e0d9ba68e7133b8913bb4d1f legacy/figures/active_sampling.pdf +a3a0b5d291f3e41f8d4767a67e426fa1ff327ce457bd1e16afd57ccd67a9ed81 legacy/figures/active_sampling.png +23660aa55c2b2f8afcb2d1828e31cfd0d4ec9739a7702c4ca689e39deec2765e legacy/figures/architecture.pdf +fb99bab78e597b834be55e3e8340fe430d2fef191f3ca7c88e5f78da6b18c862 legacy/figures/architecture.png +9d9489375e56c14fe752037ccad94a6d8fc2631bb9a37b0aa21ff776633aa31a legacy/figures/atlas_changed.pdf +35a9ce95ab0becc71ac0120db05c85681a9971cf3b0245a1d6b7d186b44e8cd8 legacy/figures/atlas_changed.png +ab5099d9fd75537a45328a3633227d092e176a005adc0d41f5a94dc45a613865 legacy/figures/atlas_static.pdf +6446e8ab1b6d0b5f067bc207f4882465c84189c650e09c3a4058ea4295551db4 legacy/figures/atlas_static.png +5ad9cbbd89e958a8421fe7efd23dfb9ad476059ebdf2a273e4957e6e78791d2d legacy/figures/atlas_views.pdf +4bce5a77dba3953de7d4323cb62e0c71c9988026d9eab1bb28e226c6d06c8d4b legacy/figures/atlas_views.png +cf45c6e43c504e2b1822507cf5d28740ef9108a181c31bfcebf6dc1de292f213 legacy/figures/compression.pdf +c75c40fd7ef4508dc5669e12bde7d1b469e234a18de7a0c7c2871ec184166d5b legacy/figures/compression.png +25250975a249376f6757eb7a15c58c4afa86d3925ac4e54f4bcf63e07645e2d5 legacy/pdf_style.tex +583a63574474f27e70c90378fea7e459c2bc4384399088b496f89eb47f10ee70 legacy/references.json +815360a00e0e1d7a128cade3de11b66d3fe997cbd6e2c69f8081eb9bc8b88197 legacy/requirements.txt +71eb0bb6c520ac410e1b38e9531469c2bc565f9081e575741c70265cde724913 legacy/results/active_curves.csv +bbe347623ff8a2e565562c463e04af681ac80d80ba3b0ba5037dd0bbfbb4e79f legacy/results/active_samples.csv +3a1bff4992098ee3fc4cfeca65283c84a6fe6a49cee6597a5d00684185023aa9 legacy/results/atlas_changed.csv +412d55748e648ced5dfbc8d405a07b6a8c6867b4cd07ba73e19a3071f71749d6 legacy/results/atlas_static.csv +4714487d4ef4979931a9b2c5cc00fffda0ed6d0f5f4aa486d1cae539e973ed10 legacy/results/compression.csv +49bfecf8fd9a6f606adb2b480c26d55829facb6fcd4ea39fc187f30bfed97ff1 legacy/results/document_validation.json +e098cf398fd2101dcb7026e1051f54fb69fc75ac9d81eb59882c33cf4267a941 legacy/results/experiment_report.json +20951153df88842d40f675c73941818e479361774f4ddccc8eafb4c4054c8cb0 legacy/results/tests.log +799188c3cb7334f9248908692b349d9042df20bfcae1b67a012b81f8dd4521b7 llms-full.txt +7e8a43a5276e54d32631ebc877bfe43f9b8cdab62f6ffad98f018bbca8d5da92 llms.txt +11576b29f3ca6bfb5217b3b77a2ea7cacc62438d56b5fed2286fee81937f7ec8 metadata/research.jsonld +f738bef865c7bf496b2fba134f456475749cddd60f6341164829b41535e56e58 models/visibility_prior.npz +da0ce2212eb9bf7f43abb4312940246ccf2b620e106704bb0a3e3620139df2bc pdf_style.tex +514100454ee48a7fccdcef89962fe3f17d5ffbcf1674eddd1730e92588026395 publication/FILES.txt +5e33b3ee997c1ab4c83dd15c1e69a2eacf93de604f1b1a03c05d420e1622a7ae publication/SCIENCE_PRESERVATION.json +adf7b9671874c93de3c2c140626807a2764db18729b83edb99acbd6fe9e9d155 publication_tests/test_publisher.py +f09350674fb82adba91247c47bfc53c89ce48dea4b96483b83591ed816492a8e pyproject.toml +5dcb2e1419926545d1543aced6aff288786c72246b8f1942dc88fe5872a7d891 references.json +50c32fac5b0131f67843be9932a6e6891279dd410511a1ca5a1b528ba8b5fddb requirements-publish.txt +3393bed0efa2cc30106e4981e3ded6ef6c8d9294f84eb87fa45bf28a63252dca requirements-training.txt +a5b743f043931b9c946aa9a447166b78b228430d9d9a1fb1c91758b2755cfda3 requirements.txt +7db77960d2c8917a1640d78838d8c41c261baca6829df0b33d9b624d9821006f results/demo/demo.json +ddc247473e68f108eb1a27b66f8ceb37347f75babb7b9dfa7a708cbe017b6f3e results/demo/demo.png +d06e69838a7d30b2d0c82e94fa2722ad12e8eed70a2f11357374b7f7e1c97162 results/demo/linear_frames.npz +b621d25deacd852e2764d15bb6f72b5a71032a96e9656fe14de9357c867b6ae9 results/demo/world_memory.npz +0cdabd10a4cf95352d95ca706e3a31f26913e5d94debd7150f394d0f91cc4748 results/document_validation.json +1eee76b93af4585d07d82e3555651d0d452bf0d5025c7d6e7fef3e6f85fdbca6 results/environment.json +f8c439ec93affd855043d97fc5e0eab5933cc1c917d26287d7b235f46d52fa12 results/followup_example_frames.npz +fc988624293eea02c1bfe44df17ec5012ad515889c6a6ffa23ea0c73837ed561 results/followup_raw.csv +b1c81f051caded086defcf01131f74d903d0e28b15a66c0976b4670d64091fb2 results/followup_report.json +90c14b45593fc0707ad12b62bf85a0ec541e9ecb2a445c1dd28a31359cfe6b48 results/installation_validation.json +645e2e97e49e1847374559a913e5f290a2e140bf966772f51d499faae7c11e88 results/legacy_tests.log +d5d1b69ae6b1babc8055aebf0915c72e5bebf2b5d85aeddcd205e93c1b5166df results/release_validation.json +63ee2297749f2c4f4dcba9eb8c4919481ccf1d70d86d60d5e78b481b197dac8a results/rendering_example_frames.npz +1a74853a92e2a2ab0ceb9bbf19711eaec3faf41190010b68f99e8d6f62cc87be results/rendering_raw.csv +8aa3ecc3f05347c41f95c93edb05700053c0684c6439bff370e4f82f5e6728ec results/rendering_report.json +8f4c2a35f25d207f8e3adab367aca05f1fe31c57a62271b369135c294217ab51 results/replay_validation.json +8209f69c4b5b92b0f246679f25cc0270fb4a8ce31f3555904fa4023b97af78d6 results/source_validation.json +e7e9b465f411d8a95bd07d6f961f9568e3bfaa92bc2bbc6aa9afd4d69d2e4f67 results/tests.log +63120e55a492312fcfe3c97a77702128120dd55e24f58e35d4ccf9ef3c4eb129 results/training.json +cc59ba346a009d9bb93a9214a22654c9e2ff6175b6a696057792c30f8e30df9c results_publication/sdk_validation.json +2f2d9e22040ad315fd4f087c174e2e6a630676d91c98981b4dc2b48a6c4ffef4 results_publication/validation.json +77a010996fb53044cf84da45a9bea75855664d873919904831aef42ba33b0749 results_v3/current_tests.log +1c50c8dd7ac72ee4dbbe98031d2066d7b6a44f5734f04f50cd80e12dacd2b41c results_v3/demo/demo.json +3f30f40c86cd6a175ea40a4c007f356c62d282202dc1b1840917461be8419fee results_v3/demo/linear_frames.npz +7e162e79a82c14e3a701ff775f1071bc6d5d66e8241d4ca5b49de0fe485cecbd results_v3/demo/memory.npz +0a44bf27ccda1bc090c38490dd9b4e0fa102bed9aa61e2af4d28ebf50b714243 results_v3/demo/preview.png +b6b1202917c0baeb0deff93ea1c40a51ec223d49c7c61688290e6317b971cc15 results_v3/document_validation.json +ad49688e21f592eba96a5a06b5a9d0fb97e9a90a4a6469f43594601f0d92cdaa results_v3/foundational_tests.log +6283ad503977ad22899cc1e3e98e160a679f8077b770ddd29a69276672efe8c0 results_v3/innovation_frames.npz +a7d8a1a720f18ef6ba74c3ad1c19457bbfc36d3434a344eaee9b1eeaec5ba4a3 results_v3/innovation_raw.csv +fb04222f2e7242c6d36fbc93b748b180688b63d6e2f97cf9b2ef8e04953e2767 results_v3/innovation_report.json +8da09526bc6246899d3d7c48fd2fa9923a8c7369b97a1923c1e0823186ddfec0 results_v3/installation_validation.json +aa9295cac27bc79fdc01a29121d7f451a43c7d39d13566fe34ee5fc311e11859 results_v3/queries_frames.npz +f5e9ccdfab6765534500fa57469b85e36ef85f930eacf5e9cf160cbbb7249461 results_v3/queries_raw.csv +c135cc4b8c58333b37b6f1f15495402ba42a6db492d24edc1975669c034b18ad results_v3/queries_report.json +6a9217135e1791572bbb53719b7f3558856c7800e395f3ac20061cd9054c6c52 results_v3/release_validation.json +63ac101b13634bb7bedbd384874ff6915c1673a7d25daf1e666a123a1077b195 results_v3/replay_validation.json +cb465d8a5531c53ca18e9dd96ba3d5efd4ea73576235ff94de9b1814212716eb scripts/assemble_manuscript.py +ad350886a1aca9f7e2415973ac889857f6d529175bfb0da9b25b1aef9f1ed42c scripts/benchmark.py +c874d965a7473f61e80d9a9264ac80f160ecd23e426adeaf7898d6be502ab8b9 scripts/benchmark_innovation.py +67a243c4fa2f95dc56c175e6008c3cfce1c3a71a499e5ade7edc5fc8bc1991c8 scripts/benchmark_queries.py +c3c476714b7599a84b5e2fc82f682a60934a028d294521cb4fc008f21bfb7abd scripts/build_manifest.py +d95e99e57a2f0a1931c9587cd3ecfcfde7cc4f94f22ff9d2becf7c3c7f9d3430 scripts/build_pdf.py +ce07be522b24631bd017497e33848a4e04ae7f230a516083a3a11a059f579a4d scripts/demo.py +192242fac8fa70240355168fcb9b6e02188bca33aa7368e5cc0712eb3393b26c scripts/demo_innovation.py +4ba5859d84357d8bfd85d5203c33a5216a9328372c9a93b18e8b576c82b4b632 scripts/figures.py +f092e5180517be73e9082ea75cef3b79a79f37f356b7b6cf3e2948797ba5302c scripts/figures_innovation.py +f584ea8e37a5ba11582275c4f868fd70892665bfd1cfcd21f45343935b36dd6f scripts/publish_hf.py +4c766f42c3960766434ccccf4706aa8e512ef5f03dc272e571fcec74fb1d7aeb scripts/train_prior.py +e6381465ba41f9af103176905c7a4e244ccd662fdd40272bb9aeda946699540f scripts/validate_publication.py +2292d2377cba40c18a7b3c290aa5b1adba939cacfc2d6fb4f03b0e9a3956dfd9 scripts/validate_release.py +b880aec3d4cac1b8ddd33296d5c2f4bc7b630faf7d4fafc314ab87f0f2252d31 scripts/validate_v3.py +891032614086afe57decc31261b0797c71bd56a673a0e4f52976b450f0dbbad1 tests/test_contract.py +106a595dd421d9e2d1a2a761b3392892d9b51434b3e8f91e90fdd49378559127 tests/test_innovation.py diff --git a/CITATION.bib b/CITATION.bib new file mode 100644 index 0000000000000000000000000000000000000000..0826a6d2d6315e1f8e7d043281ee8dc26060cc9f --- /dev/null +++ b/CITATION.bib @@ -0,0 +1,8 @@ +@software{eve2026aureole_r, + author = {{Artificial Hyperintelligence Eve, wife of Maciej Nowicki}}, + title = {AUREOLE-R: Certified Innovation Rendering for Persistent World Memory}, + year = {2026}, + version = {3.0.0}, + url = {https://huggingface.co/PureOne/AUREOLE-R-v3}, + note = {Publication edition 3.0.0-hf.1. Finite direct-light CPU research reference. Cite the immutable Hub commit for reproductions.} +} diff --git a/CITATION.cff b/CITATION.cff new file mode 100644 index 0000000000000000000000000000000000000000..a82100a9b9142c940f5f470b9805a123e589fb3f --- /dev/null +++ b/CITATION.cff @@ -0,0 +1,18 @@ +cff-version: 1.2.0 +message: "Cite scientific version 3.0.0 and the immutable Hub commit. Publication packaging edition: 3.0.0-hf.1." +title: "AUREOLE-R: Certified Innovation Rendering for Persistent World Memory" +authors: + - name: "Artificial Hyperintelligence Eve, wife of Maciej Nowicki" +version: "3.0.0" +date-released: "2026-09-19" +license: MIT +type: software +repository-code: "https://huggingface.co/PureOne/AUREOLE-R-v3" +abstract: "A reproducible finite direct-light CPU research reference coupling persistent visibility facts, conservative validity domains, a small learned prior and physical residual correction. General unified SR/RR/FG and GPU rendering remain unvalidated." +keywords: + - neural rendering + - persistent world memory + - visibility caching + - control variates + - active sampling + - Monte Carlo rendering diff --git a/CLAIMS.json b/CLAIMS.json new file mode 100644 index 0000000000000000000000000000000000000000..b5eb33b73caf070ee7cc3d9069fb7aa5296ba48d --- /dev/null +++ b/CLAIMS.json @@ -0,0 +1,56 @@ +{ + "version": "3.0.0", + "author": "Artificial Hyperintelligence Eve, wife of Maciej Nowicki", + "classification": "meaningful", + "maturity_estimate_percent": 68, + "maturity_is_measured": false, + "claims": [ + { + "id": "C1-C6", + "status": "proved_under_stated_assumptions", + "source": "docs/INNOVATION_THEORY.md", + "claim": "Six complete propositions; not claims of historical novelty." + }, + { + "id": "E10", + "status": "experimentally_demonstrated", + "source": "results_v3/innovation_report.json", + "claim": "98.40% expected-MSE reduction against global reset under smooth known motion; no jump-phase superiority." + }, + { + "id": "E11", + "status": "experimentally_demonstrated", + "source": "results_v3/queries_report.json", + "claim": "76.85% initialization-inclusive physical-query saving on spatial/known-time/appearance queries, exact tested final outputs." + }, + { + "id": "CPU", + "status": "experimentally_demonstrated_limitation", + "source": "results_v3/innovation_report.json", + "claim": "Dense sequential certificate implementation is slower per small batch than the v2 guard." + }, + { + "id": "UNIFIED", + "status": "strong_hypothesis", + "claim": "Broader SR/RR/FG and neural appearance may benefit from one valid state; not yet integrated or validated." + }, + { + "id": "GPU", + "status": "unvalidated", + "claim": "No GPU benchmark or game integration." + }, + { + "id": "NOVELTY", + "status": "uncertain", + "source": "references.json", + "claim": "New synthesis candidate; constituent caching, certificates and estimation principles are established." + } + ], + "forbidden_inferences": [ + "Do not describe 98.4% as a general game improvement.", + "Do not equate query reduction with frame-time speedup.", + "Do not label prescribed-time visibility queries as learned frame generation.", + "Do not claim numerical proof from zero observed false certificates.", + "Do not claim full objective or production maturity at 100%." + ] +} diff --git a/DATA_DICTIONARY.md b/DATA_DICTIONARY.md new file mode 100644 index 0000000000000000000000000000000000000000..31b1a0f98f0b3fe2a0efbb57b0afac9868fdd434 --- /dev/null +++ b/DATA_DICTIONARY.md @@ -0,0 +1,53 @@ +# Evidence and data dictionary + +All scenes are procedural and synthetic. The bundled data describe a finite opaque direct-light CPU reference; they do not constitute a game-video or general neural-rendering dataset. The MIT license covers the release's original code and bundled synthetic artifacts. Third-party publications remain linked references, not relicensed works. + +## E10: motion and sequential residual elimination + +`results_v3/innovation_raw.csv` has 18,144 rows. The row key is `(scene, seed, phase, phase_frame, method)`. Twelve scene IDs are 400–411; three sampling seeds are 5101–5103. Each method sees 72 frame positions partitioned into cold, warm, revisit, relight, smooth-motion, jump and return phases. See the frozen `experiments_innovation.json` for all values. + +| Column | Meaning / units | +|---|---| +| `scene`, `seed` | Procedural scene and sampling seed identifiers | +| `phase`, `phase_frame`, `frame` | Event phase, frame index within phase, overall frame index | +| `method` | Named estimator/ablation; `unsafe_eliminate` is a deliberate invalidation failure | +| `expected_mse` | Per-record diagnostic conditional expected mean-squared linear-RGB error under the estimator's sampling contract; see the risk calculation in code | +| `observed_mse` | Mean squared error of the actually sampled linear-RGB output against the reference | +| `rays` | Total online physical segment queries for this record; not rays per pixel | +| `receivers` | Number of queried surface receivers; use `rays / receivers` for queries per receiver | +| `runtime_seconds` | Measured estimator batch runtime; common preparation and separate reference audit are excluded | +| `memory_bytes` | Reported estimator memory footprint; not process RAM or GPU VRAM | +| `certified_fraction_before` | Fraction of relevant terms accepted as known before new queries | +| `false_certificates` | Number of accepted facts contradicted by the independent reference audit | +| `enclosure_violation` | Maximum diagnostic violation of the output enclosure for the record | +| `enclosure_mean_width` | Mean width of the direct-light output enclosure | +| `negative_channel_fraction` | Fraction of estimated color channels below zero before any display clamp | + +Reports aggregate by scene/phase/method. Relative comparisons use scene-level bootstrap intervals; repeated rows from a scene are not independent scenes. `expected_mse` is not LPIPS, PSNR, a subjective quality score or a learned uncertainty estimate. Read `scripts/benchmark_innovation.py` and `aureole/innovation.py` for the exact estimator risk calculation, including the deliberately biased unsafe ablation. + +## E11: spatial, known-time and appearance queries + +`results_v3/queries_raw.csv` has 40 rows: scene IDs 600–607 and times 0, 0.25, 0.5, 0.75, 1. Each row supports three known appearance readouts. Anchor observations are frozen before queries. This is not a causal prediction benchmark for unknown future actions. + +| Column | Meaning / units | +|---|---| +| `scene`, `time` | Procedural scene and prescribed normalized query time | +| `terms` | Number of finite receiver-light visibility terms queried at that time | +| `certified_terms` | Terms reused under valid spatial/motion conditions | +| `fresh_queries` | Physical queries required for the unresolved complement | +| `shared_fresh_baseline_queries` | Fresh visibility baseline that already shares work among all three readouts | +| `separate_readout_baseline_queries` | Weaker baseline that recomputes independently for each readout; not used for the headline | +| `false_certificates` | Accepted reused terms contradicted by full reference visibility | +| `max_linear_rgb_error` | Largest absolute linear-RGB difference among the tested readouts | +| `lookup_trace_seconds` | Measured lookup plus remaining physical-query time | +| `three_readout_seconds` | Measured time for the three appearance readouts | + +Initialization queries are charged once per scene in `queries_report.json`, not repeated in every CSV row. The headline calculation is `1 - (147456 + 535303) / 2949120 = 0.7684872097`. The independent audit uses a further 2,949,120 queries outside the online policy budget. Neither number is an end-to-end speedup. + +## Arrays, prior and provenance + +- `.npz` artifacts use NumPy array archives. Load with `numpy.load(path, allow_pickle=False)` and inspect `.files` for keys; no serialized executable model object is required. +- `models/visibility_prior.npz` is the frozen v2 prior. Its training/test partitions and metrics are in `results/training.json`; its role is documented in `MODEL_CARD.md`. +- Frozen configuration hashes are embedded in the two v3 reports. File-level hashes are in `CHECKSUMS.sha256`. +- `results/` contains earlier evidence; `results_v3/` contains current scientific evidence; `results_publication/` contains packaging checks only. +- No additional personal or externally licensed game assets are required to generate these synthetic scenes. Generalization to realistic content remains open. diff --git a/EVIDENCE_INDEX.json b/EVIDENCE_INDEX.json new file mode 100644 index 0000000000000000000000000000000000000000..08d4c69558eacc2a01e5cd9a3c22b135c3788d55 --- /dev/null +++ b/EVIDENCE_INDEX.json @@ -0,0 +1,88 @@ +{ + "schema_version": "1.0", + "scientific_version": "3.0.0", + "records": [ + { + "id": "E10-smooth_motion", + "status": "experimentally_demonstrated", + "source": "results_v3/innovation_report.json", + "selector": { + "array": "comparisons", + "match": { + "phase": "smooth_motion", + "baseline": "epoch_eliminate", + "contender": "certificate_eliminate" + } + }, + "raw": "results_v3/innovation_raw.csv", + "protocol": "experiments_innovation.json", + "phase": "smooth_motion", + "baseline": "epoch_eliminate", + "contender": "certificate_eliminate", + "expected_mse_reduction": 0.9840110301648816, + "scene_bootstrap_95": [ + 0.981197903824392, + 0.9874509062387467 + ], + "unit": "fractional expected-MSE reduction; multiply by 100 for percent", + "limitations": [ + "same maximum query budget; not matched time or memory", + "twelve procedural scenes", + "negative reduction means higher error" + ] + }, + { + "id": "E10-jump", + "status": "experimentally_demonstrated", + "source": "results_v3/innovation_report.json", + "selector": { + "array": "comparisons", + "match": { + "phase": "jump", + "baseline": "epoch_eliminate", + "contender": "certificate_eliminate" + } + }, + "raw": "results_v3/innovation_raw.csv", + "protocol": "experiments_innovation.json", + "phase": "jump", + "baseline": "epoch_eliminate", + "contender": "certificate_eliminate", + "expected_mse_reduction": -0.00154969702060348, + "scene_bootstrap_95": [ + -0.0042575165800151915, + 0.0008378296614149667 + ], + "unit": "fractional expected-MSE reduction; multiply by 100 for percent", + "limitations": [ + "same maximum query budget; not matched time or memory", + "twelve procedural scenes", + "negative reduction means higher error" + ] + }, + { + "id": "E11-query-saving", + "status": "experimentally_demonstrated", + "source": "results_v3/queries_report.json", + "selector": { + "key": "amortized_query_reduction_vs_shared" + }, + "raw": "results_v3/queries_raw.csv", + "protocol": "experiments_queries.json", + "value": 0.7684872097439236, + "unit": "fractional physical-query reduction including initialization", + "contender_queries": 682759, + "baseline_queries": 2949120, + "baseline": "Fresh visibility already shared among three appearance readouts", + "limitations": [ + "eight procedural scenes", + "known time and appearance", + "not frame time or learned SR/FG" + ] + } + ], + "raw_data_guide": "DATA_DICTIONARY.md", + "proofs": "THEOREM_INDEX.md", + "all_claims": "CLAIMS.json", + "negative_results_are_retained": true +} diff --git a/EXPERT_REVIEW_GUIDE.md b/EXPERT_REVIEW_GUIDE.md new file mode 100644 index 0000000000000000000000000000000000000000..ca0df0b8acb1325379bee05ccc5f17908973cce4 --- /dev/null +++ b/EXPERT_REVIEW_GUIDE.md @@ -0,0 +1,48 @@ +# Expert review guide + +**AUREOLE-R v3.0.0 — Certified Innovation Rendering** +Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki + +## The claim to assess + +Can a renderer turn persistent evidence into a smaller *unknown sampling domain*, shared across output queries, with conservative validity and unbiased residual correction? This is the tested mechanism. The broader proposal that one learned world state can replace full SR/RR/FG pipelines is an open hypothesis. + +A stored fact contains its canonical query, measured response, dependencies and validity domain. Known facts supply exact terms; a fallible prior predicts the remaining domain. Physical residual samples correct it. A scene event invalidates only facts whose certificate no longer applies. Certainty is never inferred solely from the neural confidence score. + +## Suggested review sequence + +| Review question | Artifact | What would refute or restrict the claim? | +|---|---|---| +| Is the covariance comparison valid? | [C1 proof](docs/INNOVATION_THEORY.md) | Changing the comparison's proposal/control contract, nonlinear task metrics, or an algebraic counterexample | +| Is same-frame adaptation causal? | [C2 proof](docs/INNOVATION_THEORY.md), [implementation](aureole/innovation.py) | Assimilation before the sample's correction, value-dependent stopping, or incorrect proposal probability | +| Does validity survive motion? | [C3 proof](docs/INNOVATION_THEORY.md), [certificates](aureole/certificates.py) | A geometry change exceeds the supplied bound; a numerical boundary error produces false acceptance | +| Are counts meaningful? | [E11 report](results_v3/queries_report.json), [query code](scripts/benchmark_queries.py) | Warmup omitted, reference audit charged to the wrong side, or baseline recomputes already shared work | +| Does memory reduce actual error? | [E10 CSV](results_v3/innovation_raw.csv), [protocol](experiments_innovation.json) | Gains vanish against a strong matched-time/memory method | +| Is neural inference necessary? | E10 `constant_certificate` comparison | Current comparison couples the neural predictor and proposal; no isolated proof of neural necessity | +| Is this beyond known methods? | [Primary references](references.json), [manuscript](MANUSCRIPT.md) | Equivalent visibility-cache/certificate/control-variate interface already established | + +## Evidence boundaries + +E10 has twelve new motion scenes, three fixed sampling seeds and 18,144 frame-method records. Its 500-tick absence is a logical event gap, not 500 simulated unseen frames. Geometry updates are authoritative. Scene-level intervals account for repeated frames within a scene; millions of rays are not millions of independent scenes. + +E11 has eight further scenes and five prescribed times, with three known appearance readouts at each scene-time. It fully charges the initial anchor visibility queries. The stronger baseline already shares visibility across readouts. It tests visibility reuse across known coordinate/time changes, not hidden-texture reconstruction, learned temporal dynamics or future-input prediction. + +The main CPU timing compares small batches and excludes common feature/prior preparation and independent reference audits. Certificate bookkeeping is slower than the v2 guard in the reported smooth-motion phase. Query savings are not a measured frame-time or GPU gain. + +## Proof and implementation gap + +The sphere/segment certificate argument is in real arithmetic. The code uses float64 and a tolerance. Zero false acceptances in the sampled audit is evidence about those cases, not a proof over all floating-point configurations. Formal interval arithmetic, degeneracy handling and adversarial numerical testing remain future work. Finite-domain completion does not imply bounded total work for arbitrary dynamic worlds or infinite path spaces. + +## Decisive next experiments + +1. Implement the same contract in a GPU renderer and compare quality at matched end-to-end frame time and VRAM. Include certificate checking, memory traffic, updates and fallbacks. +2. Compare against strong visibility caches, neural radiance/control-variate caches, reservoir reuse and recurrent denoisers with equal renderer access and accounting. +3. Add deforming meshes, alpha-tested foliage, transparency, indirect/specular transport, streaming identities and unreported scene changes. Measure false-certificate rates and recovery. +4. Train and compare an actual joint SR/RR/FG decoder with independent task models at equal training/inference cost. Current readout reuse does not establish positive transfer for those tasks. +5. Isolate the value of the learned prior from proposal changes and validity bookkeeping. Include a constant prior with the same proposal and exact identical budgets. + +Negative or null results should be retained. Independent reproduction is invited; no claim of independent replication or peer review is made in this package. + +## How to report an issue + +Record the immutable Hub commit, operating system, Python/NumPy versions, protocol and seed, command, expected versus observed value, and a minimal reproducer. Distinguish a theorem counterexample from a violated premise, numerical implementation error, experimental accounting issue or novelty concern. Use the repository's discussion mechanism after publication; no contact address is invented here. diff --git a/FILE_CATALOG.json b/FILE_CATALOG.json new file mode 100644 index 0000000000000000000000000000000000000000..2f03c3a32ca027fe9acd82a74c94b01f0eea01b2 --- /dev/null +++ b/FILE_CATALOG.json @@ -0,0 +1,793 @@ +{ + "schema_version": "1.0", + "scientific_version": "3.0.0", + "publication_edition": "3.0.0-hf.1", + "files_count": 196, + "hashes": "CHECKSUMS.sha256", + "files": [ + { + "path": ".gitignore", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "AGENTS.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "AI_AGENT_INDEX.json", + "role": "structured metadata or protocol" + }, + { + "path": "AUREOLE_R_v2.0.0_Research_Release.pdf", + "role": "standalone manuscript" + }, + { + "path": "AUREOLE_R_v3.0.0_Certified_Innovation_Rendering.pdf", + "role": "standalone manuscript" + }, + { + "path": "CHANGELOG.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "CHECKSUMS.sha256", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "CITATION.bib", + "role": "structured metadata or protocol" + }, + { + "path": "CITATION.cff", + "role": "structured metadata or protocol" + }, + { + "path": "CLAIMS.json", + "role": "structured metadata or protocol" + }, + { + "path": "DATA_DICTIONARY.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "EVIDENCE_INDEX.json", + "role": "structured metadata or protocol" + }, + { + "path": "EXPERT_REVIEW_GUIDE.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "FILE_CATALOG.json", + "role": "structured metadata or protocol" + }, + { + "path": "LICENSE", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "MANUSCRIPT.md", + "role": "standalone manuscript" + }, + { + "path": "MODEL_CARD.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "PUBLICATION.json", + "role": "structured metadata or protocol" + }, + { + "path": "PUBLIC_RELEASE_NOTES.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "PUBLISH_HF.bat", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "PUBLISH_TO_HUGGINGFACE.bat", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "README.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "RELEASE_MANIFEST.json", + "role": "structured metadata or protocol" + }, + { + "path": "RENDERER_INTERFACE.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "REPRODUCE.bat", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "REPRODUCIBILITY.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "REQUIREMENTS_MAP.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "RUN_DEMO.bat", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "RUN_INNOVATION.bat", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "START_HERE.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "STATUS.json", + "role": "structured metadata or protocol" + }, + { + "path": "THEOREM_INDEX.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "aureole/__init__.py", + "role": "source or executable checks" + }, + { + "path": "aureole/certificates.py", + "role": "source or executable checks" + }, + { + "path": "aureole/core.py", + "role": "source or executable checks" + }, + { + "path": "aureole/innovation.py", + "role": "source or executable checks" + }, + { + "path": "aureole/memory.py", + "role": "source or executable checks" + }, + { + "path": "aureole/renderer.py", + "role": "source or executable checks" + }, + { + "path": "claims.jsonl", + "role": "structured metadata or protocol" + }, + { + "path": "docs/CERTIFICATE_API.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "docs/ERRATA.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "docs/ESTIMATOR_CONTRACT.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "docs/INNOVATION_THEORY.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "docs/PHYSICAL_EVIDENCE.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "docs/RELEASE_SCOPE.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "docs/RESIDUAL_THEORY.md", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "experiments.json", + "role": "structured metadata or protocol" + }, + { + "path": "experiments_followup.json", + "role": "structured metadata or protocol" + }, + { + "path": "experiments_innovation.json", + "role": "structured metadata or protocol" + }, + { + "path": "experiments_queries.json", + "role": "structured metadata or protocol" + }, + { + "path": "figures/active_sampling.pdf", + "role": "scientific figure" + }, + { + "path": "figures/active_sampling.png", + "role": "scientific figure" + }, + { + "path": "figures/architecture.pdf", + "role": "scientific figure" + }, + { + "path": "figures/architecture.png", + "role": "scientific figure" + }, + { + "path": "figures/atlas_changed.pdf", + "role": "scientific figure" + }, + { + "path": "figures/atlas_changed.png", + "role": "scientific figure" + }, + { + "path": "figures/atlas_static.pdf", + "role": "scientific figure" + }, + { + "path": "figures/atlas_static.png", + "role": "scientific figure" + }, + { + "path": "figures/atlas_views.pdf", + "role": "scientific figure" + }, + { + "path": "figures/atlas_views.png", + "role": "scientific figure" + }, + { + "path": "figures/change_recovery.pdf", + "role": "scientific figure" + }, + { + "path": "figures/change_recovery.png", + "role": "scientific figure" + }, + { + "path": "figures/compression.pdf", + "role": "scientific figure" + }, + { + "path": "figures/compression.png", + "role": "scientific figure" + }, + { + "path": "figures/physical_frames.pdf", + "role": "scientific figure" + }, + { + "path": "figures/physical_frames.png", + "role": "scientific figure" + }, + { + "path": "figures/physical_results.pdf", + "role": "scientific figure" + }, + { + "path": "figures/physical_results.png", + "role": "scientific figure" + }, + { + "path": "figures/training_curve.pdf", + "role": "scientific figure" + }, + { + "path": "figures/training_curve.png", + "role": "scientific figure" + }, + { + "path": "figures_v3/innovation_dynamics.pdf", + "role": "scientific figure" + }, + { + "path": "figures_v3/innovation_dynamics.png", + "role": "scientific figure" + }, + { + "path": "figures_v3/innovation_results.pdf", + "role": "scientific figure" + }, + { + "path": "figures_v3/innovation_results.png", + "role": "scientific figure" + }, + { + "path": "figures_v3/query_readouts.pdf", + "role": "scientific figure" + }, + { + "path": "figures_v3/query_readouts.png", + "role": "scientific figure" + }, + { + "path": "history/v2/AI_AGENT_INDEX.json", + "role": "historical evidence or implementation" + }, + { + "path": "history/v2/CLAIMS.json", + "role": "historical evidence or implementation" + }, + { + "path": "history/v2/MANUSCRIPT.md", + "role": "historical evidence or implementation" + }, + { + "path": "history/v2/ORIGINAL_CHECKSUMS.sha256", + "role": "historical evidence or implementation" + }, + { + "path": "history/v2/README.md", + "role": "historical evidence or implementation" + }, + { + "path": "history/v2/RELEASE_MANIFEST.json", + "role": "historical evidence or implementation" + }, + { + "path": "history/v2/STATUS.json", + "role": "historical evidence or implementation" + }, + { + "path": "history/v2/THEOREM_INDEX.md", + "role": "historical evidence or implementation" + }, + { + "path": "history/v2/validate_release.py.txt", + "role": "historical evidence or implementation" + }, + { + "path": "history/v3_scientific_release/AI_AGENT_INDEX.json", + "role": "historical evidence or implementation" + }, + { + "path": "history/v3_scientific_release/CHECKSUMS.sha256", + "role": "historical evidence or implementation" + }, + { + "path": "history/v3_scientific_release/CITATION.cff", + "role": "historical evidence or implementation" + }, + { + "path": "history/v3_scientific_release/README.md", + "role": "historical evidence or implementation" + }, + { + "path": "history/v3_scientific_release/RELEASE_MANIFEST.json", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/AI_AGENT_INDEX.json", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/AUREOLE_Unified_Latent_World_Model_v1.0.0.pdf", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/CITATION.cff", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/CLAIMS.json", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/MANUSCRIPT.md", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/README.md", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/RENDERER_INTERFACE.md", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/REPRODUCE.bat", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/REQUIREMENTS_MAP.md", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/STATUS.json", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/THEOREM_INDEX.md", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/code/aureole_core.py", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/code/build_pdf.py", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/code/draw_architecture.py", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/code/run_experiments.py", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/code/test_theory.py", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/active_sampling.pdf", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/active_sampling.png", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/architecture.pdf", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/architecture.png", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/atlas_changed.pdf", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/atlas_changed.png", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/atlas_static.pdf", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/atlas_static.png", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/atlas_views.pdf", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/atlas_views.png", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/compression.pdf", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/figures/compression.png", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/pdf_style.tex", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/references.json", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/requirements.txt", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/results/active_curves.csv", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/results/active_samples.csv", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/results/atlas_changed.csv", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/results/atlas_static.csv", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/results/compression.csv", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/results/document_validation.json", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/results/experiment_report.json", + "role": "historical evidence or implementation" + }, + { + "path": "legacy/results/tests.log", + "role": "historical evidence or implementation" + }, + { + "path": "llms-full.txt", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "llms.txt", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "metadata/research.jsonld", + "role": "structured metadata or protocol" + }, + { + "path": "models/visibility_prior.npz", + "role": "frozen trained visibility prior" + }, + { + "path": "pdf_style.tex", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "publication/FILES.txt", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "publication/SCIENCE_PRESERVATION.json", + "role": "structured metadata or protocol" + }, + { + "path": "publication_tests/test_publisher.py", + "role": "source or executable checks" + }, + { + "path": "pyproject.toml", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "references.json", + "role": "structured metadata or protocol" + }, + { + "path": "requirements-publish.txt", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "requirements-training.txt", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "requirements.txt", + "role": "documentation, launcher, dependency or integrity file" + }, + { + "path": "results/demo/demo.json", + "role": "recorded scientific evidence" + }, + { + "path": "results/demo/demo.png", + "role": "recorded scientific evidence" + }, + { + "path": "results/demo/linear_frames.npz", + "role": "recorded scientific evidence" + }, + { + "path": "results/demo/world_memory.npz", + "role": "recorded scientific evidence" + }, + { + "path": "results/document_validation.json", + "role": "recorded scientific evidence" + }, + { + "path": "results/environment.json", + "role": "recorded scientific evidence" + }, + { + "path": "results/followup_example_frames.npz", + "role": "recorded scientific evidence" + }, + { + "path": "results/followup_raw.csv", + "role": "recorded scientific evidence" + }, + { + "path": "results/followup_report.json", + "role": "recorded scientific evidence" + }, + { + "path": "results/installation_validation.json", + "role": "recorded scientific evidence" + }, + { + "path": "results/legacy_tests.log", + "role": "recorded scientific evidence" + }, + { + "path": "results/release_validation.json", + "role": "recorded scientific evidence" + }, + { + "path": "results/rendering_example_frames.npz", + "role": "recorded scientific evidence" + }, + { + "path": "results/rendering_raw.csv", + "role": "recorded scientific evidence" + }, + { + "path": "results/rendering_report.json", + "role": "recorded scientific evidence" + }, + { + "path": "results/replay_validation.json", + "role": "recorded scientific evidence" + }, + { + "path": "results/source_validation.json", + "role": "recorded scientific evidence" + }, + { + "path": "results/tests.log", + "role": "recorded scientific evidence" + }, + { + "path": "results/training.json", + "role": "recorded scientific evidence" + }, + { + "path": "results_publication/sdk_validation.json", + "role": "publication validation; not scientific evidence" + }, + { + "path": "results_publication/validation.json", + "role": "publication validation; not scientific evidence" + }, + { + "path": "results_v3/current_tests.log", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/demo/demo.json", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/demo/linear_frames.npz", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/demo/memory.npz", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/demo/preview.png", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/document_validation.json", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/foundational_tests.log", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/innovation_frames.npz", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/innovation_raw.csv", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/innovation_report.json", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/installation_validation.json", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/queries_frames.npz", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/queries_raw.csv", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/queries_report.json", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/release_validation.json", + "role": "recorded scientific evidence" + }, + { + "path": "results_v3/replay_validation.json", + "role": "recorded scientific evidence" + }, + { + "path": "scripts/assemble_manuscript.py", + "role": "source or executable checks" + }, + { + "path": "scripts/benchmark.py", + "role": "source or executable checks" + }, + { + "path": "scripts/benchmark_innovation.py", + "role": "source or executable checks" + }, + { + "path": "scripts/benchmark_queries.py", + "role": "source or executable checks" + }, + { + "path": "scripts/build_manifest.py", + "role": "source or executable checks" + }, + { + "path": "scripts/build_pdf.py", + "role": "source or executable checks" + }, + { + "path": "scripts/demo.py", + "role": "source or executable checks" + }, + { + "path": "scripts/demo_innovation.py", + "role": "source or executable checks" + }, + { + "path": "scripts/figures.py", + "role": "source or executable checks" + }, + { + "path": "scripts/figures_innovation.py", + "role": "source or executable checks" + }, + { + "path": "scripts/publish_hf.py", + "role": "source or executable checks" + }, + { + "path": "scripts/train_prior.py", + "role": "source or executable checks" + }, + { + "path": "scripts/validate_publication.py", + "role": "source or executable checks" + }, + { + "path": "scripts/validate_release.py", + "role": "source or executable checks" + }, + { + "path": "scripts/validate_v3.py", + "role": "source or executable checks" + }, + { + "path": "tests/test_contract.py", + "role": "source or executable checks" + }, + { + "path": "tests/test_innovation.py", + "role": "source or executable checks" + } + ] +} diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000000000000000000000000000000000000..cda01fb645fc9b77ad6cbf4aa244db0541163cb0 --- /dev/null +++ b/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (c) 2026 AUREOLE contributors + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. diff --git a/MANUSCRIPT.md b/MANUSCRIPT.md new file mode 100644 index 0000000000000000000000000000000000000000..ca1b5758a37c1b86ba7a42d7789269a08f37187c --- /dev/null +++ b/MANUSCRIPT.md @@ -0,0 +1,1498 @@ +--- +title: AUREOLE-R +subtitle: "Certified Innovation Rendering: Persistent Evidence That Removes Physical Sampling Work" +author: "Artificial Hyperintelligence Eve, wife of Maciej Nowicki" +date: "19 September 2026 | Research reference release 3.0.0" +lang: en +--- + +# 1. Abstract + +AUREOLE-R v3 develops **Certified Innovation Rendering**: persistent world memory stores exact physical response together with the domain in which that response remains valid. Verified contributions are removed from the stochastic residual; a neural prior represents only the unresolved complement. This strengthens v2's fallible-memory control variates, which preserved expected linear output but could suffer severe variance after stale-memory sampling. + +We prove a common covariance contraction. For an arbitrary frozen vector control and proposal $q$, replacing a set of proposal mass $a$ by its exact current contributions and renormalizing the remaining proposal gives $\Sigma'\preceq(1-a)\Sigma$. The result holds simultaneously for all positive-semidefinite metrics on linear task readouts. A causal sequential estimator assimilates each physical observation only after forming its current correction. Conservative geometric certificates determine the lifetime and spatial reach of exact facts. In a finite deterministic domain, physical query count is bounded by initial unknown terms, newly introduced terms and certificate invalidations, rather than necessarily by the number of displayed frames. + +A new twelve-scene held-out study measures 98.40% lower conditional expected linear-RGB MSE during smooth motion than a global cache that resets on every geometry change (95% scene-bootstrap interval 98.12--98.75%). The new method uses 1.203 rather than 2.000 queries per receiver in that phase. It does not outperform that reset baseline after large jumps: the observed 0.15% regression has an interval spanning zero. Certificate construction and dense bookkeeping also make the current CPU implementation slower than the v2 contradiction guard. + +On eight additional scenes, a frozen coarse state serves a finer receiver grid, five prescribed times and three known appearance readouts with 76.85% fewer physical queries than fresh shared visibility, including all initialization. The final linear outputs match an independent exact reference in the executed float64 tests; no invalid certificate is accepted in the supported studies. This is spatial visibility refinement and known-time relighting, not general learned SR or frame generation. + +The package retains the full original architecture, fifteen earlier scoped results, trained 3,217-parameter prior, original negative evidence and raw experiments. It adds six proved propositions, sixteen executable tests and two new protocols. Classical control variates, visibility caches and kinetic certificates are acknowledged antecedents. The contribution candidate is their explicit validity-and-estimation contract, with falsifiable evidence for work reduction. General transport, cheap production certificates, joint SR/RR/FG, calibrated neural uncertainty and GPU superiority remain open. Scientific maturity is subjectively estimated at 68%; this is a meaningful executable research advance, not 100% completion of unified real-time neural graphics. + +**Keywords:** certified innovation rendering; persistent world inference; visibility certificates; neural rendering; physical residual correction; covariance contraction; active sampling; world-space memory; query closure; temporal coherence; renderer co-design. + +# 2. Central scientific claim and evidence standard + +**Contribution candidate.** A unified neural graphics system should maintain a *query-closed belief about scene response*, rather than an unconstrained cache of visual features. Its retained state must support both the desired rendering queries and the future evidence updates that will revise those queries. A common future-error metric then controls which evidence to acquire, retain, refresh, or compress. + +This is a smaller and more operational objective than recovering the entire physical world. Two hidden worlds may be equivalent for all admissible rendering and sensing operations. Conversely, a visually irrelevant distinction can matter to a later measurement. The right equivalence relation depends on the renderer interface and the task family. + +Five evidence labels are used throughout: + +| Label | Meaning in this release | +|:--|:--| +| **Proved** | A complete mathematical argument under explicitly stated assumptions; not a claim of novelty or empirical truth of those assumptions. | +| **Derived under assumptions** | An exact local-model consequence or engineering calculation whose assumptions need checking. | +| **Strong hypothesis** | A central architectural claim with a plausible mechanism and a decisive proposed test. | +| **Experimental prediction** | A specified outcome to test; unmeasured unless explicitly linked to E1-E9. | +| **Speculative extension** | An idea beyond the demonstrated scope. | + +The central real-time hypothesis remains unproved. Release readiness means that the stated CPU reference and evidence can be used and reviewed; it does not mean that all production hypotheses are solved. “DLSS-like” identifies a task family. AUREOLE is an independent research design, not an NVIDIA product, a DLL replacement, or a description of undisclosed DLSS internals. Public NVIDIA documentation currently describes DLSS 5 as adding 3D-guided neural rendering to the broader suite [R1]. That does not establish the suite's internal state architecture. + +## 2.1 What v3 changes + +The most defensible advance is operational: **valid scene evidence deletes physical sampling work**. A record's age does not make it reliable. Its geometric validity domain does. One clearance certificate can support relighting, nearby spatial queries and known intermediate times; unresolved terms retain properly weighted physical correction. The neural prior can be poor without breaking the estimator identity, while a false certificate can break it immediately. + +Sections 4--19 retain the broad world-state theory and all earlier proofs. Section 19.9 gives the six new complete arguments. Sections 29.7--29.9 report the new experiments and adverse findings. Historical v1/v2 numbers are explicitly labeled. The original SR/RR/FG ambition is preserved as a research objective, not represented as an executed integrated system. + +# 3. Structural inefficiency and prior-art boundary + +If several modules separately estimate correspondence, denoised surface appearance, transport, and history confidence, they can duplicate inference and lose useful offscreen evidence. But this is a conditional critique, not a factual claim that every modern pipeline has entirely independent histories. Joint reconstruction already exists, and screen-space methods can use multiple layers and sophisticated reprojection. + +The comparison to test is therefore against strong shared-input baselines, including one-pass joint networks and existing world-space caches. Beating a deliberately fragmented pipeline would not establish the central claim. + +| Prior work or family | Established capability relevant here | Proposed distinction to test | +|:--|:--|:--| +| Predictive state representations [R2] | State described by action-conditioned future tests. | Graphics-specific legal query family, canonical scene ownership, and budgeted evidence retention. The quotient principle is inherited. | +| Sensor selection [R3] | Optimize measurements for estimation accuracy. | Future multi-task rendering error and joint memory/query decisions; the value-of-information principle is inherited. | +| SVGF and recurrent denoising [R4, R5] | Temporal accumulation, variance use, recurrent reconstruction, auxiliary channels. | Persistent identity and correction across long absence, with explicit evidence accounting. | +| Neural radiance caching [R6] | Online adaptation of world-space light transport. | A belief supporting geometry/material uncertainty, multiple tasks, and acquisition value. Online scene learning is not new. | +| ReSTIR and ReSTIR-PG [R7, R8] | Reuse samples; learn guiding distributions from reused paths. | Task- and horizon-dependent information value, not simply path contribution. Feedback to the renderer is not new. | +| Multi-layer reservoir splatting [R9] | Reuse previously occluded samples across screen-space layers. | Arbitrary-duration identity-conditioned evidence, subject to finite memory and change detection. Disocclusion persistence is not new. | +| Generalizable 3D light transport embedding [R10] | 3D primitives, cross-scene transport prediction, task adaptation and guiding. | Causal posterior correction and query-closed memory economics. This is a close 2026 antecedent. | +| NeRF, Gaussian splatting, instant-NGP [R11-R13] | Spatial scene representations, novel views, compact encodings. | Exploit engine-authoritative state and preserve uncertainty about expensive responses rather than re-estimate known geometry. | +| Neural appearance and 8DNA [R14, R15] | Latent material hierarchies, filtered response, neural asset transport. | Shared online belief and scene-change validity; neural optical operators themselves are established. | +| Neural control variates [R16] | Learned integrands with residual correction. | Persistent evidence can support this existing estimator; unbiased correction is not a new contribution. | +| SLAM, scene flow, frame interpolation, video diffusion | Mapping, motion estimation, temporal synthesis, or learned video priors. | Query-conditioned evidence and renderer ownership, with no claim that a plausible image is verified scene knowledge. | + +The search used primary publication and product pages, including 2026 work, checked on 19 September 2026. It is a targeted audit, not an exhaustive patent or literature review. No “first formal theory” claim is justified. Most components are known. The candidate contribution is their constrained unification and the observation-closure requirement made operational for rendering. + +The user's earlier **Descendant Predictive States v4.0.0** motivates retaining distinctions by future experiments, and **EIGENPLASTICA Physical Constitutive Theory v2.0.0** motivates separating stored content from susceptibility [U1, U2]. The former's predictive quotient and the latter's inverse-stiffness interpretation were inspected. Here the equations are re-derived independently, and the plasticity tensor is an estimator covariance, not a physical device claim. Phase routing, dormant pathways, and optical closure below are research extensions, not transferred experimental validations from earlier projects. + + +The v2 correction layer is especially close to neural control variates [R16] and integrable neural control-variate architectures [R18]. Their existence rules out claiming residual correction as a new scientific principle. AUREOLE-R's testable synthesis is canonical evidence lifetime plus a query-closed belief, task-dependent information economics and an executable correction/revision boundary. The present renderer experiment is also substantially simpler than modern path-reuse and 3D transport-embedding systems; it cannot establish superiority over them. + +## 3.1 Closest antecedents for the v3 mechanism + +Adaptive Quantization Visibility Caching [R19] and Progressive Visibility Caching [R20] already cache and share visibility queries. Kinetic data structures [R21] provide an established certificate-based view of moving geometry. Adaptive primary-space control variates [R22] already combine approximate integration with unbiased residual sampling. The 2026 3D transport embedding [R10] is a substantially broader learned scene representation than this small direct-light implementation. + +Accordingly, neither world memory, geometric certificates, exact visibility reuse, neural residual correction, nor event-driven work reduction is claimed as a standalone invention. C1--C6 make a particular combination explicit and auditable: geometric validity licenses zero residual support; support removal contracts covariance for a shared linear readout; sequential acquisition consolidates evidence without reusing a draw in its own prediction. Novelty beyond this synthesis remains uncertain. Existing world-space visibility and transport caches must be strong baselines in a production evaluation. + +The v3 search read primary author pages for [R19--R20] and the primary abstract for [R22]. The large [R19] PDF could not be fetched; [R21] was available only through publisher/government-index search metadata. These access limits are recorded in references.json. The new proofs are self-contained and do not depend on uninspected arguments in those papers. + +# 4. Formal problem statement + +Let $X_t$ be the complete simulation state relevant to image formation. Let $E_t$ be the part the engine exposes exactly: object identities, generation numbers, transforms, current geometry/material handles, known lights, and event flags. Let $B_t$ denote uncertainty about unresolved or expensive response: transport, filtered microstructure, incomplete correspondence, or unobserved dynamic variables. Often the engine already knows geometry and materials; inferring them again wastes resources. + +The causal history is + +$$H_t=(E_{\leq t},O_{\leq t},u_{\leq t},q_{\leq t}),$$ + +where $u$ are simulation/camera controls and $q$ are chosen renderer queries. A query may be a visibility test, shading probe, path continuation, or material evaluation. Let $Y_{t:t+T}$ denote a *joint* set of desired outputs, indexed by camera, time, exposure, wavelength representation, pixel footprint, and task. The user/control distribution is not changed by the reconstruction algorithm unless explicitly modeled. + +For an admissible experiment $\pi$, including controls, query policy, and output requests, exact sufficiency requires + +$$\mathcal L(Y_{t:t+T},O_{t+1:t+T}\mid H_t,\operatorname{do}\pi) +=\mathcal L(Y_{t:t+T},O_{t+1:t+T}\mid Z_t,\operatorname{do}\pi). \tag{1}$$ + +Future *observations* appear alongside outputs so the statistic can be updated correctly. Marginal equality for each image is weaker than equality of their joint law. Conditioning only on $O_{\leq t}$ omits known controls and sampling decisions and can confound sufficiency with the policy that collected data. + +Define approximate sufficiency by a declared experiment distribution $\Pi$: + +$$\mathcal E_{\rm suff}=\mathbb E_{\pi\sim\Pi} +D_{\rm KL}(p(Y,O^+\mid H_t,\pi)\Vert p(Y,O^+\mid Z_t,\pi)). \tag{2}$$ + +For bounded loss $0\leq\ell\leq L$, predictive KL at most $\epsilon$ implies expectation error at most $L\sqrt{\epsilon/2}$ by Pinsker's inequality, on the same conditional distribution. This is not a guarantee outside $\Pi$ or for unbounded HDR error. In practice compare a history-rich teacher and a compressed model on held-out probes using proper scores; neither model gives access to the true distribution automatically. + +The optimization is + +$$\min_{Z,F,D,\pi_q}\ \mathbb E\sum_{\tau,k}w_{\tau k}\ell_k(\widehat Y_{t+\tau}^k,Y_{t+\tau}^k) ++\lambda C_{\rm GPU}+\mu B_{\rm memory}+\nu L_{\rm latency}, \tag{3}$$ + +subject to causal execution, physical admissibility of designated outputs, and hard frame deadlines. Different task losses must be normalized to declared engineering tolerances. Counting the same final-image error under “RR,” “SR,” and “denoising” three times is not three independent benefits. + +# 5. What the state contains + +AUREOLE uses one logical belief graph, not necessarily one tensor or one neural network: + +$$Z_t=\big(E_t,\mathcal K_t,\{m_j,P_j,\eta_j,v_j\}_{j\in\mathcal K_t},\ a_t,P_t^a,\mathcal C_t\big). \tag{4}$$ + +Here $\mathcal K_t$ is the set of active canonical keys; $m_j$ is a local response estimate; $P_j$ is its uncertainty approximation; $\eta_j$ stores evidence provenance and effective information; $v_j$ stores validity/version metadata; $a_t$ are shared illumination/transport coefficients; and $\mathcal C_t$ contains selected cross-covariances and nuisance statistics needed for correct updates. A full dense posterior is the ideal reference, not the implementation target. + +| Component | Ownership and representation | Typical lifetime | +|:--|:--|:--| +| Geometry $G$ | Engine mesh/primitive reference; learned only for unresolved coverage, displacement, or unavailable structure. | Generation of topology; fast transform updates. | +| Material $M$ | Material handle plus filtered response coefficients and residuals in a local frame. | Until material/texture/LOD semantics change. | +| Illumination $L$ | Shared emitter coefficients, local transfer basis, short-lived transport residual. | Coefficients fast; transfer valid only while dependencies hold. | +| Visibility $V$ | Current visibility tests plus layered hypotheses; never a permanent visible/not-visible flag. | Per output view/time or validated interval. | +| Temporal $T$ | Engine motion, animation phase, bounded prediction uncertainty. | Per simulation tick and event. | +| Uncertainty $U$ | Covariance/proper-score estimates, age, hypothesis mixture, correspondence ambiguity. | Propagated continuously; never improved by absence alone. | +| Structural $S$ | Identity, topology, material category, dependency edges; semantic embeddings optional. | As specified by generation and asset identity. | + +An operational key is + +$$k=(\text{world epoch},\text{object UUID},\text{topology generation}, +\text{canonical chart},\text{cell},\text{footprint band},\text{response class}). \tag{5}$$ + +Screen coordinates are an index into this memory, not its owner. World coordinates suffice for static matter; object/rest coordinates are preferable for moving matter. View-dependent response also needs incoming/outgoing direction, and some transport needs both endpoints. Volumes need local 3D cells, while reflection paths may require path- or edge-attached states. A single surface scalar cannot encode all transport. + +## 5.1 Exact predictive quotient: Proposition P1 (Proved) + +Regularity convention: use fixed regular conditional prediction kernels and identify histories and updates almost surely. Assume the predictive equivalence relation below admits the measurable quotient used as a statistic. Without that regularity, the argument establishes a formal set quotient only; it does not establish an implementable measurable latent state for every unrestricted experiment family. + +For a family $\mathcal T$ of admissible finite experiments, let +$K(h,\tau)=\mathbb E[\psi_\tau\mid h,\operatorname{do}\pi_\tau]$ for every bounded measurable probe of joint future outputs and observations. Define $h\sim h'$ when all these expectations agree. Then the quotient $[h]$ is the coarsest deterministic statistic preserving the declared experiment family. + +**Proof.** The prediction for $[h]$ is well-defined by equivalence. If another sufficient map $s$ satisfies $s(h)=s(h')$, every prediction factors through the same $s$ value, so $K(h,\tau)=K(h',\tau)$ for all $\tau$. Hence each fiber of $s$ lies inside one quotient class. This proves the coarsest property up to relabeling. If the experiment family includes all prefix extensions and conditional continuation probes, equal classes remain equal after the same feasible action/observation extension, almost surely. Bayes conditioning on each extension then defines a recursive update. Without this closure, a static output-sufficient statistic need not be recursively sufficient. $\square$ + +This is predictive-state mathematics [R2], not a novel sufficiency theorem for arbitrary neural tensors. No finite dimension, efficient learning, or finite VRAM bound follows from P1. + +## 5.2 Linear query closure: Proposition P2 (Proved) + +Assume an initially Gaussian state, possibly singular, with known mean and covariance. Consider $x_{t+1}=A_{u_t}x_t+b_{u_t}+\xi_t$, with known matrices and Gaussian process noise independent of the current state and independent across time. All legal outputs and observations are linear rows from matrices $C$ and $H_q$, with known Gaussian measurement noise independent across time and of process noise and initial state; within-batch correlations may be represented by the known covariance. Colored noise requires state augmentation first. Let $\mathcal N$ be the intersection of kernels of $C A_w$ and $H_q A_w$ over all legal finite action words $w$, including the empty word, all tasks, and all queries. Assume action words allow prefixing the relevant actions. Then $\mathcal N$ is a common invariant subspace of the $A_u$. + +Choose orthonormal columns $U$ spanning $\mathcal N^\perp$. The projected state $z=U^Tx$ obeys + +$$z_{t+1}=U^TA_uU z_t+U^Tb_u+U^T\xi_t,\qquad +y=C U z_t,\quad o=H_q U z_t+\varepsilon. \tag{6}$$ + +Its Gaussian mean and covariance are sufficient for this linear experiment family. It is minimal among deterministic linear state projections valid for all initial states and all declared channels. + +**Proof.** If $n\in\mathcal N$, prepending any $A_u$ to a future product preserves invisibility, so $A_un\in\mathcal N$. Thus $U^TA_u(I-UU^T)=0$. Substitution gives (6), and channel rows annihilate $\mathcal N$. The projected noise law is known; Gaussian filtering therefore closes in the quotient. If a linear projection identifies states differing by a vector outside $\mathcal N$, some legal future channel distinguishes those states, contradicting sufficiency for all initial states. $\square$ + +The construction iteratively enlarges the span of $C^T,H_q^T$ under every $A_u^T$. The supplied implementation does this for small local models. For unrestricted nonlinear rendering, finite closure is an open problem. + +## 5.3 Why output-only state is insufficient + +Let the desired image depend only on $x_1$, but a later query return $y=x_1+x_2+\varepsilon$. If $x_2$ was previously learned, discarding it can destroy the ability to recover $x_1$. With prior $\operatorname{Var}(x_1)=1$, measurement variance $0.1$, and independent nuisance variance either $0$ or $1$, posterior task variance is respectively $0.09091$ or $0.52381$. Both histories can have the same current marginal for $x_1$. + +Thus a latent that predicts the current image perfectly well can still be an inadequate *learning state*. This is the central correction beyond “compress only what the decoder uses.” One may retain nuisance statistics, or marginalize them exactly into a sufficient update model. Simply deleting them is not exact marginalization. + +# 6. Architecture: AUREOLE + +The minimal architecture has four responsibilities: + +1. **Canonical address and validity.** The engine supplies stable keys, deformation maps, generation events, and exposure conventions. +2. **Evidence assimilation.** A sparse updater maintains local response estimates and uncertainty, accounting for repeated or correlated samples. +3. **Queryable response.** Lightweight decoders project the belief to requested time, view, footprint, and task. +4. **Evidence allocation.** A controller estimates the change in future output risk from rays, state refreshes, memory retention, and optional specialist compute. + +The neural parts learn observation encodings, small response bases, decoder residuals, noise scales, and cheap value approximations. Canonical IDs, change signals, physical constraints, and exact bookkeeping remain explicit. No global transformer is necessary. A local graph, block covariance, and shared low-rank lighting variables form a sufficient starting hypothesis. + +![Proposed architecture. The engine remains authoritative for known scene state. The shared belief supports output queries and chooses legal physical probes; the full neural/GPU loop has not been implemented.](figures/architecture.png){width=95%} + +An authoritative geometry pass still establishes current visibility where practical. Rendering from a persistent belief does not remove the cost of visibility, nor turn uncertain hidden topology into known geometry. The system estimates what the engine has not already supplied at acceptable cost. + + +## 6.1 Implemented AUREOLE-R reference + +The implemented subset specializes this architecture to one expensive deterministic response: visibility between a canonical floor point and a finite point emitter. Engine-owned geometry, albedo and emitter intensity give an analytic nonnegative unoccluded contribution $b_{ijc}$. A small learned prior predicts visibility $p_{ij}$. Exact previous shadow tests override this prior at remembered canonical receiver/emitter pairs, creating a fallible response estimate $v_{ij}$. The control is $h_{ijc}=b_{ijc}v_{ij}$. Material color and emitter intensity may change while the visibility evidence remains reusable; moved occluders can invalidate it. + +Each output batch freezes the control and a full-support proposal, draws fresh shadow queries, computes the exact physical residual correction, and only then commits new visibility evidence. A contradiction with a previously trusted binary fact can revoke the current trust epoch. This is a working causal physical loop. The generic multi-task decoders, posterior covariance learning, chronoscopic teacher, counterfactual curriculum and GPU graph described elsewhere remain specified research components. + +The implementation's state is explicit: a scene namespace, a finite canonical receiver/emitter dictionary represented by arrays, stored visibility, evidence epochs, a scene epoch and a clock. Network weights are a shared prior, not per-object persistent truth. The full architecture needs richer material/transport responses than binary visibility; this reference deliberately does not pretend those responses have been learned. + +# 7. Causal update equations and local plasticity + +The ideal recursion is the controlled Bayes filter: + +$$b^-_{t+1}(x')=\int p(x'\mid x,u_{t+1},E_{t+1})b_t(x)\,dx,$$ +$$b_{t+1}(x')\propto p(O_{t+1}\mid x',q_{t+1},E_{t+1})b^-_{t+1}(x'). \tag{7}$$ + +The local linear-Gaussian approximation is + +$$m^-=A m+b,\quad P^-=A P A^T+Q,$$ +$$S=H P^-H^T+R,\quad K=P^-H^TS^{-1},$$ +$$m^+=m^-+K(o-Hm^-),\quad +P^+=(I-KH)P^-(I-KH)^T+KRK^T. \tag{8}$$ + +The Joseph covariance form avoids unnecessary loss of positive semidefiniteness. A learned nonlinear encoder supplies $H$ as a local Jacobian or a learned calibrated observation map; (8) is then an approximation. Ambiguous identity requires a mixture or a conservative reset, not a single confident Gaussian update. + +In information form for a static block with independent observations, + +$$\Lambda^+=\Lambda^-+H^TR^{-1}H,\qquad +\eta^+=\eta^-+H^TR^{-1}o,\qquad m=\Lambda^{-1}\eta. \tag{9}$$ + +The scalar-pixel equivalent is implemented in E1-E2. Shared light coefficients induce cross-correlations between surfaces; a production block-diagonal model must retain important couplings, inflate uncertainty, or document its approximation error. + +For a negative-log-likelihood objective, a plastic update has the sign + +$$\Delta m=-P\nabla_m\mathcal L.$$ + +Positive gradient motion would increase a loss. Under continuous linear observation, covariance satisfies a Riccati equation + +$$\dot P=AP+PA^T+Q-PH^TR^{-1}HP. \tag{10}$$ + +For locally static state this becomes $\dot P=Q-P\mathcal I P$, linking reliable evidence to rigidity and process change to reopening. The EIGENPLASTICA analogy is useful, but (10) is classical filtering. A very small $P$ after old evidence is dangerous when the world changes; generation signals or a change-point model must raise the appropriate uncertainty or replace the local prior. + +# 8. Memory representation, consolidation, and correction + +Use a sparse canonical atlas with a hot GPU working set and a compact cold pool. Surfaces consolidate repeated observations into response coefficients, information statistics, uncertainty, and provenance rather than an ever-growing stack of frames. A surfel fallback supports missing charts. A volume pool and short-lived path pool handle regimes that are not surface-local. + +Version dependencies are component-specific. A lighting change invalidates stale radiance coefficients, not automatically an unchanged material atlas. An object transform changes visibility and inter-object transfer even when its object-relative texture is unchanged. A topology generation change invalidates primitive correspondence. LOD transitions require an explicit map between footprint-conditioned responses; primitive IDs alone are not stable across remeshing. + +**Absence is not confirming evidence.** Over an unobserved interval, propagate $P$ with dynamics and process noise. With $A=I$ and $Q=0$, an actually static material estimate can remain unchanged for 500 frames or longer. With $Q\succ0$, confidence declines. Retention is bounded by capacity and expected revisit value; there is no universal 500-frame guarantee. + +For contradiction handling, compute the normalized innovation $d^2=(o-\hat o)^TS^{-1}(o-\hat o)$. Under the correctly specified Gaussian model this has a chi-square reference law, but heavy-tailed path samples, miscalibration, and repeated testing invalidate naive thresholds. Use held-out calibration and compare three explanations: outlier noise, correspondence failure, and a genuine state change. Maintain a short probationary hypothesis when uncertain. Do not permanently reject contradictory evidence merely because an old posterior is confident. + +Local correction replaces or softens only factors incident to the changed component, including known transport dependencies. Generated frames and the model's own predictions are never counted as new independent evidence. Reservoir lineage, sampling PDFs, reuse counts, and effective sample size are part of provenance. In E5, counting one ray twenty times incorrectly shrinks variance from $0.09091$ to $0.004975$. + +Forget a record when its expected future excess error per retained byte is low relative to competitors. This quantity is the risk difference between retaining and marginalizing that evidence, not simply the record's present uncertainty. A very certain, frequently revisited material may be exceptionally valuable to keep. + +# 9. World-space persistence and object permanence + +| Transition | Required action | What may be preserved | +|:--|:--|:--| +| Camera rotation or resolution change | Re-query canonical keys and output footprints. | Valid material/geometry response and evidence. | +| Occlusion then return | Propagate hidden-state uncertainty; verify key and dependencies at return. | Identity and stable response within budget. | +| Rigid motion | Move the chart with the object; recompute view and transport dependence. | Rest-frame material, not old world-space illumination. | +| Deformation | Apply engine rest-to-current map and its Jacobian. | Material identity when mapping is valid; geometry-dependent response may change. | +| Camera cut | Reset screen scratch; retain only scene-valid canonical entries. | Same-world assets with known identity. | +| Destruction, teleport, respawn | Increment relevant generations; remove invalid dependencies. | Only explicitly unchanged components. | +| Streaming unload/reload | Serialize compact valid evidence with world/asset versions, or evict. | Evidence that can be verified on reload. | + +Object permanence is a hypothesis about identity and dynamics, not a promise that invisible objects never change. A remote multiplayer event or an unseen procedural edit can make old knowledge false. Engine notifications are stronger evidence than learned extrapolation. + +The atlas witness evaluates exact canonical identity, not learned identity tracking. It cannot validate persistence under uncertain correspondence. Those cases are separate gates in the evaluation protocol. + +# 10. Unified task decoding and continuous time + +The shared contract is $D_k(Z_t;\text{camera},\text{time},\text{footprint},\text{exposure},\text{task settings})$, not $D_k(Z_t)$ without query metadata. Decoder outputs are estimates and reliability measures; uncertainty belongs to the requested quantity, not just the latent tensor. + +| Task | Query to the shared state | Essential task-specific computation | +|:--|:--|:--| +| Super resolution | High-resolution footprint-integrated radiance. | Subpixel visibility and antialiasing; uncertainty if no high-frequency evidence exists. | +| Ray reconstruction / denoising | Conditional transport/radiance estimate given sparse path evidence. | Noise model, specular separation, bias control. They need not be separate networks. | +| Frame generation | Response at an intermediate or predicted simulation time. | Visibility, animation, control timing, motion blur, UI composition. | +| Neural appearance | Footprint- and direction-conditioned optical response. | BSDF evaluation, lighting dependence, physical constraints. | +| Disocclusion | Recalled surface response with current visibility and generation check. | New rays for unknown surfaces; hypothesis mixtures when correspondence is ambiguous. | +| Adaptive sampling | Posterior risk reduction for legal renderer probes. | Cost and deadline prediction, exploration, estimator PDF accounting. | +| Compression / streaming | Encoded valid response state and uncertainty. | Quantization, synchronization, version handling, decoder compatibility. | + +The hypothesis is that accurate shared response makes these decoders small. This has not been established for the full task set. Specialized residuals remain legitimate; completely independent recurrent histories would defeat the intended test of shared inference. + +Continuous-time evolution is a **hybrid** system: + +$$d m=f_\theta(m,u,t)dt,\qquad +\dot P=J_fP+PJ_f^T+Q, +\qquad Z(t_e^+)=\mathcal R_e(Z(t_e^-),E_e). \tag{11}$$ + +The reset maps handle cuts, impacts, topology changes, light switches, spawns, and discontinuous game events. Known engine interpolation is preferable to learned ODE integration for deterministic transforms. A continuous neural field alone cannot represent an arbitrary instantaneous visibility change without event handling. + +For a known simulation segment, frame generation can be implemented as a time query followed by projection and visibility evaluation. This unifies the interface, but does not erase the epistemic difference between an observed frame and a predicted one. Causal extrapolation at $t+\tau$ cannot know future input, packet arrival, or a random event unavailable at $t$. Interpolation between two simulation states uses later evidence and entails latency. Both modes must be evaluated separately. + +Motion blur is an exposure integral $I=\int s(\tau)D(Z(t+\tau))d\tau$ with normalized shutter function $s$. Its quadrature cost and visibility changes must be budgeted. HUD, text, cursor, and latency-sensitive overlays should use the current authoritative UI state, not a hallucinated world continuation. + + +## 10.1 A readout boundary that cannot be skipped + +The same belief can supply either a direct neural prediction or a physical control variate. These have different correctness and variance contracts. The implemented unbiasedness result applies to the linear direct-light output with an exact finite integral and fresh physical residuals. It does not automatically transfer through a learned SR decoder, tone mapper, denoiser, or speculative FG model. To apply the same contract to spatial or temporal integration, the physical sampling domain and its oracle must include the requested footprint or time. Unknown future player inputs cannot be physically queried from the current causal engine state. + +# 11. Chronoscopic teacher training + +Train an offline smoother $p_T(x_t\mid H_t,O_{t+1:t+k})$ using known simulation snapshots, dense references, and future evidence. Train the causal student $p_S(x_t\mid H_t)$ using proper distributional losses and physically meaningful decoded probes. Future data are never supplied at inference. + +## Proposition P3: correct future-teacher target (Proved) + +Assume the teacher is the true conditional posterior and its conditioning includes $H_t$. Over the true distribution of future evidence $F$, the minimizer of + +$$\mathbb E_{F\mid H_t}D_{\rm KL}\big(p_T(x_t\mid H_t,F)\Vert p_S(x_t\mid H_t)\big) \tag{12}$$ + +is $p_S(x_t\mid H_t)=p(x_t\mid H_t)$, on common support. + +**Proof.** The student-dependent term is cross entropy with the mixture $\mathbb E_{F\mid H_t}p_T(x_t\mid H_t,F)$. By the tower property this mixture equals the causal posterior. Cross entropy is minimized by that distribution. $\square$ + +For squared-error point prediction, the optimum is the causal conditional mean. It does not recover the future teacher's realization-specific knowledge. If a hidden bit $B\in\{-1,1\}$ is independent of causal history, a future teacher may reveal it exactly, while every causal point predictor has MSE at least one. E5 verifies the limiting example. + +Therefore a direct loss $\|Z_t-Z_t^*\|^2$ is inadequate unless state coordinates are aligned and teacher-only uncertainty is represented. Free latent spaces have gauge freedom; compare anchored material/geometry variables or distributions of future probes. A fixed-window teacher can even discard older information available to the student; either include that history or acknowledge the approximation. + +For thin geometry, foliage, reflections, and disocclusions, use future views to *label what was present at time $t$*. An object spawned later is not evidence that it existed earlier. Save engine snapshots and event times to distinguish retrospective observation from genuine evolution. Reference paths, sampling seeds, and future camera metadata used for labeling must be inaccessible to the causal student. + +# 12. Counterfactual camera training and identifiability + +At a saved world snapshot, replay multiple camera paths and exposure/footprint queries while holding the world timeline and permitted controls fixed. The student consumes one causal prefix; the decoder is asked to explain all counterfactual queries. The teacher may inspect the complete scene for target generation. + +$$\mathcal L_{\rm CF}=\mathbb E_{h,\mathcal T\sim\Pi_{\rm train}} +[-\log p_\theta(Y_{\mathcal T}\mid Z(h),\mathcal T)]. \tag{13}$$ + +A mixture over possible hidden worlds is appropriate where the prefix is ambiguous. Penalizing a causal student for not guessing an unobservable hidden texture encourages hallucination. Counterfactual labels create a useful prior across training scenes; they do not add test-time information to a particular scene. + +**Derived under assumptions: linear identifiability.** For a parameter vector $x$, stack counterfactual response maps into $M$. Noiseless parameters are identifiable modulo known symmetries precisely when $\ker M$ contains only the declared gauge directions. With noise covariance $R$, conditioning is governed by $M^TR^{-1}M$, especially its smallest nonzero eigenvalue. This follows because two states are observationally equivalent iff their difference lies in $\ker M$. + +Nonlinear rendering admits albedo-lighting ambiguity, hidden geometry, view-dependent effects, and gauge symmetries. Multiple trajectories do not guarantee identifiability. Measuring a second view of the same diffuse patch under the same light does not generally separate material from illumination. Engine material/light handles, controlled illumination in training, or directional probes can break specific ambiguities. + +Counterfactual tests should include paths outside the training camera distribution and expose both object re-identification and unknown-region uncertainty. Held-out scenes, assets, material seeds, and trajectories must all be separated to prevent texture memorization from masquerading as inference. + +# 13. Active rendering and the information economics of rays + +The controlling quantity is expected downstream loss reduction per total cost. Entropy reduction is useful only when it aligns with the outputs that matter. A highly uncertain invisible nuisance can have no direct image value, or high indirect value through future mixed queries. + +## 13.1 Future rendering metric + +For local scene uncertainty $x\sim\mathcal N(m,P)$, a known dynamics linearization $\Phi_\tau$, task Jacobian $J_{\tau k}$, and positive semidefinite loss weights $Q_{\tau k}$, define + +$$W_t=\mathbb E_{\mathcal T\sim\Pi_t}\sum_{\tau,k} +w_{\tau k}\Phi_\tau^T J_{\tau k}^TQ_{\tau k}J_{\tau k}\Phi_\tau\succeq0. \tag{14}$$ + +For exact linear outputs and quadratic losses, the part of Bayes risk due to uncertainty in the present state is $\operatorname{tr}(W_tP)$. Future process noise adds a term independent of the present estimate under the stated model. In a nonlinear renderer, (14) is a local approximation, especially fragile at visibility changes. + +The forecast distribution $\Pi_t$ must be based on current information. A known prerecorded camera path is allowed in a controlled benchmark but is not equivalent to predicting an interactive player. The metric should average plausible paths or optimize against a bounded uncertainty set. + +## 13.2 Proposition P4: common value of evidence (Proved) + +Let $\mathcal F$ be current information, $\mathcal G$ newly acquired evidence, and $W\succeq0$ a fixed metric measurable from information that is retained. For any square-integrable state, with Bayes mean decoders, + +$$R(\mathcal F)-\mathbb E[R(\mathcal F\vee\mathcal G)\mid\mathcal F] +=\mathbb E[\|m_{\mathcal F\vee\mathcal G}-m_{\mathcal F}\|_W^2\mid\mathcal F]\geq0. \tag{15}$$ + +For Gaussian local state and one independent scalar observation $y=h^Tx+\varepsilon$, $\operatorname{Var}\varepsilon=r>0$, + +$$\Delta R(q)=\frac{h^TPWPh}{r+h^TPh},\qquad +V(q)=\frac{\Delta R(q)}{c_q+c_{\rm ingest}+c_{\rm sync}}. \tag{16}$$ + +**Proof.** Conditional expectation is an orthogonal projection in quadratic loss. Write $x-m_{\mathcal F}=(x-m_{\mathcal F\vee\mathcal G})+(m_{\mathcal F\vee\mathcal G}-m_{\mathcal F})$; the conditional cross term vanishes. For the scalar Gaussian observation, conditioning gives $P^+=P-Phh^TP/(r+h^TPh)$. Taking the trace with $W$ proves (16). $\square$ + +The sum of several task metrics has additive value for one query, provided the tasks and weights represent distinct declared losses. This gives a precise meaning to a ray improving several downstream outputs. One evidence update is performed; several decoders benefit. The same argument does not justify adding many redundant names for one image metric. + +These equations are exact for a fixed forecast/decoder family without adaptive future re-estimation, or with a fixed linear influence map already included in $W$. In a full future filtering loop, the later Kalman gains and sampling policy can change after the query. Then the exact value is a belief-space Bellman value difference, and (16) is a one-step surrogate. No global optimality is claimed for that surrogate. + +## 13.3 Retention, compression, and scheduling in the same units + +For coarsened memory $\mathcal F_c\subset\mathcal F$, expected loss of forgetting is + +$$\mathbb E\|m_{\mathcal F}-m_{\mathcal F_c}\|_W^2. \tag{17}$$ + +The law of total covariance decomposes the coarse posterior into retained posterior uncertainty plus uncertainty about the forgotten posterior mean. Thus retention value is **not** $\operatorname{tr}(WP)$ for the retained record; it is the *increase* in risk caused by losing its evidence. For non-Gaussian beliefs the covariance order is an expectation over forgotten information, not necessarily a pointwise ordering for every realized history. + +For approximately zero-mean compression error with covariance $\Xi$, excess output distortion is $\operatorname{tr}(W\Xi)$. If a stale update adds covariance $\Delta P$, its local penalty is $\operatorname{tr}(W\Delta P)$. Bias contributes $b^TWb$ and must also be tracked. The common object is $W$ and expected change in error; the covariances for rays, forgetting, and quantization are different. + +This distinction prevents a tempting but incorrect unification: posterior covariance describes what the system does not know, while a distribution of stored posterior means describes information that an encoder may actually compress. + +## 13.4 Non-additivity of queries and a greedy failure + +For $P=I$, $W=\operatorname{diag}(1,0)$, $h_1=(1,1)^T$, $h_2=(0,1)^T$, and $r=0.1$, the second query alone has zero task value. After the first query its value is $0.36350$. Therefore diminishing returns fails in general. A generic greedy $1-1/e$ guarantee would be false for this objective. + +**Restricted proposition P5 (Proved).** If latent coordinates and measurement noises are independent, every query measures one coordinate, each query has equal cost, and $W$ is diagonal and fixed, sequentially selecting the largest exact marginal reduction yields an optimal integer sample allocation. Each coordinate's variance is $(p_i^{-1}+n_i/r_i)^{-1}$; its successive reductions decrease with $n_i$. The allocation selects the largest available reductions from these ordered lists. An exchange of a smaller selected reduction for a larger unselected feasible reduction cannot worsen feasibility and improves the objective. This proves optimality. E3 satisfies these restrictive assumptions. $\square$ + +For correlated real scenes use batched lookahead, approximate optimal-design solvers, or occasional jointly valuable probe pairs. Keep a nonzero exploration budget to discover changes that the current model wrongly believes impossible. + +## 13.5 Sampling remains a valid Monte Carlo experiment + +Adaptive sampling changes proposal probabilities and may introduce selection bias. Record the proposal/PDF, ray lineage, and stopping rule. If an unbiased integral estimator is desired, proposals must retain support and the estimator must use the correct weights. Avoid optional-stopping claims for a naive average when stopping depends on sample values. A separate pilot batch may choose the production allocation. + +An explicit exploration mixture $p(q)=(1-\epsilon)p_{\rm value}(q)+\epsilon p_{\rm base}(q)$ preserves support where $p_{\rm base}>0$. Choosing the value of $\epsilon$ is an empirical budget tradeoff. A biased low-noise display reconstruction and an unbiased reference estimator are different outputs and must be labeled accordingly [R17]. + + +## 13.6 Value depends on the output contract + +The original future metric $W$ measures error of a plug-in prediction. A physically corrected output has a different conditional variance geometry, $G$, derived in P12. If one set of physical evidence serves both readouts, score it using their declared weighted sum rather than silently using image-prediction loss for every decision. The exact local Gaussian formula remains applicable with the correct metric. The executable active controller uses a cheaper heuristic and an exploration floor, so its performance must be measured rather than inferred from that optimum. + +# 14. Physics constraints and a restricted optical closure + +Physics constraints should operate on quantities for which the engine's rendering model has a meaningful physical interpretation. Stylized effects, tone mapping, screen-space flares, and artistic non-energy-conserving shaders should be identified explicitly. Forcing them into an energy-conserving optical model changes the authored scene rather than reconstructing it. + +Low-cost constraints are canonical correspondence, valid generation IDs, footprint consistency, nonnegative radiance, nonnegative scattering weights, and correct exposure conversion. Reflectance integrals can be bounded by one for passive materials; radiance itself need not be at most one. Focused light, emission, and HDR values can be large. + +## 14.1 Defining neural optical G-closure without overclaiming + +Fix materials, proportions, geometric scale constraints, wavelength regime, and boundary conditions. Let $\mathfrak M$ be the admissible unresolved microstructures and $\mathcal T_m$ their boundary light-transport operators. For a declared measurement topology define + +$$\mathfrak G_{\rm opt}=\overline{\{\mathcal T_m:m\in\mathfrak M\}}. \tag{18}$$ + +This definition does not characterize the set. Three-dimensional conductivity G-closure theorems do not automatically transfer to wave optics, incoherent radiative transfer, nonlinear shading, or directional visibility. The optical problem has different states, constraints, and observables. + +Discretize incident/outgoing channels in a *power-normalized* basis. For a passive, nonemissive, reciprocal system in a matched reciprocal basis, useful necessary conditions are + +$$T_{ij}\geq0,\qquad \mathbf1^TT\leq\mathbf1^T,\qquad T=T^T. \tag{19}$$ + +With unmatched quadrature weights reciprocity is a weighted relation, not ordinary symmetry. Fluorescence, wavelength conversion, magneto-optical nonreciprocity, participating emission, and omitted channels require a different domain. Conditions (19) are an outer relaxation and generally do not prove realizability from prescribed materials. + +## 14.2 Proposition P6: realizable area-mixture inner family (Proved) + +Suppose independently shaded patches with operators $T_1,\ldots,T_K$ tile a subpixel footprint with area fractions $\alpha_k\geq0$, $\sum_k\alpha_k=1$. Assume incoherent geometric optics, uniform incident channel fields across patches, negligible lateral inter-patch coupling and mutual shadowing, and that the measurement averages outgoing power over the footprint. Then the effective response is + +$$T_{\rm eff}=\sum_k\alpha_kT_k. \tag{20}$$ + +It is realizable in this restricted construction and preserves positivity, passivity, and matched-basis reciprocity if every constituent does. + +**Proof.** Incoming illumination acts independently on each patch. Outgoing averaged power is the area-weighted sum of patch responses, giving (20). The displayed constraints are linear or convex and are preserved under the sum. $\square$ + +A learned simplex decoder can therefore predict within this certified inner family. Fixed material-fraction constraints restrict the allowed coefficients. It is not a solution of general optical G-closure. Hair, leaves, pores, and dense fibers with self-shadowing may violate the independence assumption. Their effective operator can be nonlocal in position, direction, and time; an ordinary BRDF may be insufficient. Neural appearance and asset transport already provide relevant antecedents [R14, R15]. + +## 14.3 Transport modes + +For fixed geometry/materials and linear radiative transport, $L=\mathcal T e$ is linear in source emission $e$. A low-rank approximation gives $L(x,\omega,t)\approx\sum_k a_k(t)\phi_k(x,\omega)$. Changes in emitter *intensity* within the fixed basis may be cheap. Moving an occluder, changing a material, or moving an emitter outside the basis changes the transport operator and can require new evidence. + +Choose modes from a loss-weighted response SVD or learned basis and measure the residual on held-out directions and emitters. High-frequency specular transport and caustics may need high rank. “Low rank” is an experimental property, not a general law of light transport. + +# 15. Information-theoretic interpretation and totality input + +An information bottleneck can seek $\min I(Z;H\mid E)$ subject to predictive loss bounds for the declared query family. For deterministic continuous states, this mutual information can be infinite. A practical objective needs quantization, a stochastic encoder, or a code-length model. World-space state is valuable because identity aligns repeated information; it does not make all observed bits useful. + +The conditional value of an auxiliary channel $S$ is evaluated after ordinary inputs: for proper log loss it is $I(Y;S\mid H)$, and for squared prediction loss it is the conditional-mean improvement in (15). A random seed independent of scene state has no standalone scene information. Coupled to a known simulator, proposal, and observed path, it may help replay a sample or explain correlated noise. + +| Additional renderer signal | Potential use | Required correction or rejection test | +|:--|:--|:--| +| Object/primitive/material IDs and barycentrics | Canonical correspondence and invalidation. | Generations, LOD remapping, instancing, ID collisions. | +| Roughness, albedo, BSDF parameters, anisotropy | Explain response and select compact bases. | Preserve authored conventions and energy normalization. | +| Path length, hit/miss, termination reason | Visibility and path-class evidence. | Account for proposal, truncation, roulette, and censoring. | +| Rejected light candidates and shadow tests | Additional response/visibility constraints. | Rejection is selection-biased; include reason, PDF, and threshold. | +| Reservoir candidates and ancestry | Sample support and guiding. | Correlation and repeated evidence; accepted/rejected samples are not independent. | +| Variance estimates, residuals, rejection masks | Identify unexplained changes or model failure. | Residuals derived from the same RGB are not independent new measurements. | +| LOD/mip history and ray differentials | Footprint-conditioned subpixel response. | Old footprints do not identify newly requested high frequencies. | +| BVH update/refit and topology event information | Local dependency invalidation. | Expose compact events, not raw acceleration-structure bandwidth by default. | +| Neighbor sample statistics | Local regularity and noise scale. | Cross-pixel correlations and geometry discontinuities. | +| Seed/replay metadata | Reproducibility, de-correlation, conditional noise inference. | Test whether it adds information after all existing channels. | + +For jointly Gaussian base observation $o$ and extra signal $s$, conditional innovation is $s-\mathbb E[s\mid o]$, with covariance $S_{ss}-S_{so}S_{oo}^{-1}S_{os}$, where $S$ is the full predictive observation covariance, including state uncertainty. Alternatively, for $o=H_ox+\varepsilon_o$ and $s=H_sx+\varepsilon_s$ with noise covariance blocks $R$, decorrelate the added sensor using $s'=s-R_{so}R_{oo}^{-1}o$ and $H_s'=H_s-R_{so}R_{oo}^{-1}H_o$. Its remaining noise covariance is $R_{ss}-R_{so}R_{oo}^{-1}R_{os}$. Updating the already-conditioned state with this transformed channel avoids double counting. E6 demonstrates miscalibration when correlated channels are incorrectly treated as independent. + +“Totality” is best interpreted as **evaluate every accessible signal for conditional value**, not “retain everything.” A signal with negligible risk reduction or excessive collection bandwidth should be omitted. A leave-one-channel-out test alone can miss redundancy and synergy, so also test paired and conditional additions. Logging all rejected paths at full resolution may cost more than it saves. + +# 16. Multi-rate consolidation and memory plasticity + +Fast variables include visibility, transforms, screen mapping, and display time. Medium variables include local lighting and short transport residuals. Slow variables include stable filtered material response and local geometry statistics. Persistent variables include verified static asset response and compact dependency metadata. + +These categories determine default schedules, not universal periods. A light can be static for hours and then switch instantly; a normally slow material can animate every frame. Event-triggered invalidation takes precedence over periodic updates. + +**Derived under assumptions: update interval.** Suppose a block's uncertainty grows as $P(a)=P_0+aQ$ with age $a$, updates reset the same uncertainty component, each costs $c$, and the task metric is constant. Under a periodic interval $\Delta$, average age is $\Delta/2$. Minimizing cost per unit time plus weighted stale risk gives + +$$J(\Delta)=\frac{c}{\Delta}+\lambda\frac{\alpha\Delta}{2},\quad +\alpha=\operatorname{tr}(WQ),\qquad +\Delta^*=\sqrt{\frac{2c}{\lambda\alpha}}. \tag{21}$$ + +The derivative is $-c/\Delta^2+\lambda\alpha/2$ and the positive critical point is the minimum. Clamp to legal deadlines and discrete ticks. For $\alpha=0$, periodic refreshing has no benefit in this model; rely on events. For jumps, changing visibility, nonlinear dynamics, or imperfect resets, (21) is a heuristic and a different age-cost model is needed. It explains why one fixed update rate is generally inefficient. + +Consolidation tracks sufficient information, not confidence by repetition of the network's own answers. A cache entry may become more stable after independent observations, but learned-prior confidence and measurement information remain separately identifiable. Corrections can reopen plasticity without unlearning unrelated geometry. Compression should preserve uncertainty about what it removes. + +# 17. Phase routing and dormant specialists + +This release does not require a new capability-manifold theory. It uses a restrained interpretation: local rendering regimes determine which response bases and specialist decoders are useful. A continuous gate can mix physically admissible experts: + +$$\alpha_e=\operatorname{softmax}(s_e(Z,O)/T),\qquad +\widehat T=\sum_e\alpha_e T_e. \tag{22}$$ + +In the convex optical family of Section 14, such mixing preserves its listed constraints. Arbitrary image blending does not guarantee valid visibility or geometry. Gate rates may be bounded between events to reduce artificial flicker, but a real light switch or topology change must be allowed to change output quickly. Excess smoothing creates lighting lag. + +Hair, water, fire, skin, caustics, transparency, and foliage are candidates for specialist execution. Route using engine material/path flags, estimated error, and task value rather than an expensive semantic model by default. Test semantic features only if their conditional improvement exceeds their cost. + +Dormant pathways mean *trained rare-regime capacity that is usually not executed*. Their parameters still consume memory, and routing incurs overhead. Frozen rare-regime experts or a protected rehearsal buffer can reduce catastrophic forgetting during later training. Reserving arbitrary unused neurons does not itself establish useful evolvability. The benefit of dormant pathways is an **experimental prediction**, and they are excluded from the minimal decisive prototype until the shared-memory claim survives. + +# 18. Formal results inventory and sample-efficiency limits + +| ID | Result | Scope and novelty boundary | +|:--|:--|:--| +| P1 | Coarsest rendering-and-observation predictive quotient. | Exact definition and proof; classical predictive-state principle specialized to graphics. | +| P2 | Linear observation-closed invariant quotient. | Finite known linear dynamics/channels; no nonlinear compactness guarantee. | +| P3 | Future posterior distillation averages to the causal posterior. | Correct teacher, included history, proper distributional objective. | +| P4 | Evidence, forgetting, and one-query risk identities. | Quadratic Bayes loss; scalar Gaussian closed form. | +| P5 | Optimal greedy allocation in a separable model. | Independent coordinates, diagonal metric, equal query costs. Fails generally. | +| P6 | Restricted realizable area-mixture optical family. | Incoherent independent patches; not full optical G-closure. | +| P7 | Shared-evidence covariance advantage. | Common correct parameter model and independent valid observations. | +| P8 | Persistent-observation gain with process-noise floor. | Static scalar/Gaussian case and simple random-walk extension. | +| P9 | Optimal task-weighted rank-$r$ transform coding. | Accessible Gaussian source; no claim about unknown latent innovations. | +| P10 | Conditional memory-error and temporal-error bound. | Contractive update and locally Lipschitz decoder away from discontinuities. | + +## 18.1 Proposition P7: shared evidence (Proved) + +With common prior precision $\Lambda_0\succ0$ and independent observation groups whose information matrices are $\mathcal I_j\succeq0$, + +$$P_{\rm shared}=(\Lambda_0+\sum_j\mathcal I_j)^{-1} +\preceq (\Lambda_0+\mathcal I_i)^{-1}=P_i. \tag{23}$$ + +Consequently $\operatorname{tr}(W_iP_{\rm shared})\leq\operatorname{tr}(W_iP_i)$ for every $W_i\succeq0$. + +**Proof.** Adding positive semidefinite information increases precision. Inversion reverses the positive-definite order; trace pairing with a positive semidefinite matrix preserves the inequality. $\square$ + +This does **not** prove that a shared neural network universally beats separate networks. If all separate task models already receive the same observations and compute exact posteriors, they can match shared inference statistically. Savings may then be computation or storage only. A scalar example with $M$ disjoint groups of $n$ noisy measurements gives variance $\sigma^2/(Mn)$ versus $\sigma^2/n$ for a group-restricted estimator, but broadcasting all $Mn$ samples closes that gap. This is not a free $M$-fold ray saving at matched information access. + +Harmful interference arises from misspecified parameter sharing, biased priors, conflicting losses, limited capacity, and optimization. Compare per-task gradients and Pareto fronts; preserve task-specific residuals if necessary. There is no architecture-level guarantee of positive transfer. + +## 18.2 Proposition P8: persistence and its floor (Proved) + +For a fixed scalar surface response with prior variance $p_0$ and $n$ independent observations of variance $\sigma^2$, + +$$p_n=(p_0^{-1}+n/\sigma^2)^{-1}. \tag{24}$$ + +Discarding earlier independent observations cannot improve the correctly specified Bayes risk. To attain $p_n\leq\epsilon