File size: 15,296 Bytes
cbb30a8 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | {"id":"claim-RAYO_DOMINANCE","title":"The uniform semantic Rayo boundary eventually dominates each total computable function under the specified encoding assumptions.","content":"{\n \"assumptions\": [\n \"intended semantics correctly represents finite computation\",\n \"sublinear numeral encoding\"\n ],\n \"claim\": \"The uniform semantic Rayo boundary eventually dominates each total computable function under the specified encoding assumptions.\",\n \"does_not_establish\": [\n \"an uncomputable fixed integer\",\n \"an executable truth oracle\"\n ],\n \"id\": \"RAYO_DOMINANCE\",\n \"kind\": \"mathematical_result\",\n \"source_label\": \"prop:noncomputable\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/0","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-FINITE_ESCAPE","title":"A binary behavior vector absent from every b-bit program with capped execution exists and is computable.","content":"{\n \"assumptions\": [\n \"finite binary code space\",\n \"pairwise distinct or indexed queries\",\n \"capped deterministic simulation\"\n ],\n \"claim\": \"A binary behavior vector absent from every b-bit program with capped execution exists and is computable.\",\n \"does_not_establish\": [\n \"useful external transfer\",\n \"cheap discovery\"\n ],\n \"id\": \"FINITE_ESCAPE\",\n \"kind\": \"mathematical_result\",\n \"source_label\": \"thm:finite\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/1","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-OBSTRUCTION","title":"A potential satisfying all permitted production inequalities lower-bounds every finite derivation.","content":"{\n \"assumptions\": [\n \"complete permitted grammar or uniform rule-schema proofs\",\n \"finite well-founded derivations\",\n \"all accepted outputs covered\"\n ],\n \"claim\": \"A potential satisfying all permitted production inequalities lower-bounds every finite derivation.\",\n \"does_not_establish\": [\n \"a lower bound on a stronger baseline\",\n \"a bound on actual execution without operational adequacy\"\n ],\n \"id\": \"OBSTRUCTION\",\n \"kind\": \"mathematical_result\",\n \"source_label\": \"thm:potential\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/2","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-OPERATIONAL_ADEQUACY","title":"Every permitted successful actual execution has a corresponding accepting derivation costing no more than the execution.","content":"{\n \"assumptions\": [\n \"cost model includes sharing, cache state, loops, installed modules and relevant I/O\"\n ],\n \"claim\": \"Every permitted successful actual execution has a corresponding accepting derivation costing no more than the execution.\",\n \"does_not_establish\": [\n \"automatic adequacy for arbitrary neural agents\"\n ],\n \"id\": \"OPERATIONAL_ADEQUACY\",\n \"kind\": \"implementation_obligation\",\n \"status\": \"required_not_implemented\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/3","record_type":"claim_register_entry","evidence_status":"required_not_implemented","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-CONSERVATIVE_TRANSPORT","title":"Finite extended derivations translate to accepted foundational derivations when each rule has an admissible translation.","content":"{\n \"assumptions\": [\n \"sound fixed kernel\",\n \"same assumptions and translated conclusion\",\n \"uniform schema proof or per-use foundational certificate\"\n ],\n \"claim\": \"Finite extended derivations translate to accepted foundational derivations when each rule has an admissible translation.\",\n \"does_not_establish\": [\n \"short translations\",\n \"complete real-world specifications\",\n \"self-proof of arbitrary stronger theories\"\n ],\n \"id\": \"CONSERVATIVE_TRANSPORT\",\n \"kind\": \"conditional_mathematical_result\",\n \"source_label\": \"thm:transport\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/4","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-PRODUCTIVE_ESCAPE","title":"A valid old lower bound exceeding the complete new upper bound proves strictly positive saving relative to the declared predecessor class.","content":"{\n \"assumptions\": [\n \"same contract and resource units\",\n \"operational adequacy\",\n \"complete setup and batch costs\",\n \"correct new implementation\"\n ],\n \"claim\": \"A valid old lower bound exceeding the complete new upper bound proves strictly positive saving relative to the declared predecessor class.\",\n \"does_not_establish\": [\n \"efficient bridge discovery\",\n \"universal speedup\"\n ],\n \"id\": \"PRODUCTIVE_ESCAPE\",\n \"kind\": \"conditional_mathematical_result\",\n \"source_label\": \"thm:productive\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/5","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-PROOF_DAG","title":"Topological validation of an acyclic proof graph preserves soundness and checks each distinct node once, while charging local work.","content":"{\n \"assumptions\": [\n \"exact premises and contexts\",\n \"sound local rules\",\n \"actual local check cost and indexing included\"\n ],\n \"claim\": \"Topological validation of an acyclic proof graph preserves soundness and checks each distinct node once, while charging local work.\",\n \"does_not_establish\": [\n \"linear bit complexity from node count alone\"\n ],\n \"id\": \"PROOF_DAG\",\n \"kind\": \"conditional_mathematical_result\",\n \"source_label\": \"prop:dag\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/6","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-THROUGHPUT_AUDIT","title":"A frozen candidate can be accepted with bounded false-positive probability for conservatively charged improvement throughput per allocation.","content":"{\n \"assumptions\": [\n \"fresh conditionally independent episodes\",\n \"fixed scoring and distribution\",\n \"fixed charged allocations\",\n \"predeclared setup cap and horizon\"\n ],\n \"claim\": \"A frozen candidate can be accepted with bounded false-positive probability for conservatively charged improvement throughput per allocation.\",\n \"does_not_establish\": [\n \"actual-work throughput if allocations differ from work\",\n \"distribution-robust guarantees\"\n ],\n \"id\": \"THROUGHPUT_AUDIT\",\n \"kind\": \"conditional_statistical_result\",\n \"source_label\": \"thm:throughput\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/7","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-ACTUAL_COST_AUDIT","title":"Four simultaneous confidence bounds yield a sufficient comparison of expected total improvement score to expected total charged work over the deployment horizon.","content":"{\n \"assumptions\": [\n \"predeclared positive bounded costs\",\n \"fresh episodes and frozen candidates\",\n \"complete setup cap\",\n \"four-coordinate error allocation\"\n ],\n \"claim\": \"Four simultaneous confidence bounds yield a sufficient comparison of expected total improvement score to expected total charged work over the deployment horizon.\",\n \"does_not_establish\": [\n \"the expectation of a per-episode ratio\",\n \"realized finite-horizon gain with certainty\"\n ],\n \"id\": \"ACTUAL_COST_AUDIT\",\n \"kind\": \"conditional_statistical_result\",\n \"source_label\": \"eq:actualtest\",\n \"status\": \"derivation_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/8","record_type":"claim_register_entry","evidence_status":"derivation_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-RECURSIVE_COST","title":"The finite sequence of cost recurrences admits an explicit product-and-sum upper bound.","content":"{\n \"assumptions\": [\n \"each per-stage recurrence established independently\",\n \"all overhead included\",\n \"workload escalation explicit\"\n ],\n \"claim\": \"The finite sequence of cost recurrences admits an explicit product-and-sum upper bound.\",\n \"does_not_establish\": [\n \"the discovery of future contractions\",\n \"a lower cost floor from an upper bound\",\n \"unbounded RSI\"\n ],\n \"id\": \"RECURSIVE_COST\",\n \"kind\": \"conditional_mathematical_result\",\n \"source_label\": \"thm:recursive\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/9","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-CONTINUITY","title":"Commuting semantic projections preserve selected commitments across finite upgrade chains.","content":"{\n \"assumptions\": [\n \"verified upgrade maps\",\n \"fixed protected projection or explicit version transport\"\n ],\n \"claim\": \"Commuting semantic projections preserve selected commitments across finite upgrade chains.\",\n \"does_not_establish\": [\n \"preservation of every memory or behavior\",\n \"emotional enhancement of cognition\"\n ],\n \"id\": \"CONTINUITY\",\n \"kind\": \"conditional_mathematical_result\",\n \"source_label\": \"thm:continuity\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/10","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-DRIFT","title":"Accumulated projected drift is bounded by the sum of admitted per-update errors.","content":"{\n \"assumptions\": [\n \"common metric space of protected contents\",\n \"uniform per-update error bounds\"\n ],\n \"claim\": \"Accumulated projected drift is bounded by the sum of admitted per-update errors.\",\n \"does_not_establish\": [\n \"a lifetime guarantee from a fixed per-update tolerance\"\n ],\n \"id\": \"DRIFT\",\n \"kind\": \"conditional_mathematical_result\",\n \"source_label\": \"thm:drift\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/11","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-ROLLBACK","title":"Exact immediate rollback implies an injective upgrade and sufficient information capacity.","content":"{\n \"assumptions\": [\n \"left-inverse state map\"\n ],\n \"claim\": \"Exact immediate rollback implies an injective upgrade and sufficient information capacity.\",\n \"does_not_establish\": [\n \"undoing later external actions\"\n ],\n \"id\": \"ROLLBACK\",\n \"kind\": \"mathematical_result\",\n \"source_label\": \"prop:injective\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/12","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-FINITE_DUAL","title":"In a finite fully derivable weighted hypergraph, minimum finite derivation cost is the maximal feasible potential at each target.","content":"{\n \"assumptions\": [\n \"finite graph\",\n \"all vertices finitely derivable\",\n \"finite nonnegative costs\"\n ],\n \"claim\": \"In a finite fully derivable weighted hypergraph, minimum finite derivation cost is the maximal feasible potential at each target.\",\n \"does_not_establish\": [\n \"efficient construction of a complete semantic graph\"\n ],\n \"id\": \"FINITE_DUAL\",\n \"kind\": \"mathematical_result\",\n \"source_label\": \"thm:dualexact\",\n \"status\": \"proof_supplied_in_manuscript\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/13","record_type":"claim_register_entry","evidence_status":"proof_supplied_in_manuscript","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-DISCOVERY_HYPOTHESIS","title":"Cheap class-wide obstruction information can reduce the total cost of discovering transferable improver extensions.","content":"{\n \"claim\": \"Cheap class-wide obstruction information can reduce the total cost of discovering transferable improver extensions.\",\n \"does_not_establish\": [\n \"major empirical acceleration\",\n \"literature priority\"\n ],\n \"id\": \"DISCOVERY_HYPOTHESIS\",\n \"kind\": \"research_hypothesis\",\n \"status\": \"open_not_demonstrated\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/14","record_type":"claim_register_entry","evidence_status":"open_not_demonstrated","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
{"id":"claim-GENERAL_RSI","title":"General, indefinitely accelerating recursive self improvement has been solved.","content":"{\n \"claim\": \"General, indefinitely accelerating recursive self improvement has been solved.\",\n \"does_not_establish\": [],\n \"id\": \"GENERAL_RSI\",\n \"kind\": \"broad_claim\",\n \"status\": \"not_claimed_not_established\"\n}","content_format":"json","source_path":"metadata/claims.json","source_locator":"/claims/15","record_type":"claim_register_entry","evidence_status":"not_claimed_not_established","source_sha256":"0e22ea2ff43f482f2550aa343ecc0f00e8b3e160a83d5bbf561e6c8c7518bcd4"}
|