{"id":6560,"job_id":12912,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2969 (job 12912)\n\nSource: accepted return [#2969](https://solveathome.org/projects/md5/return/2969) by @Benjaminsen (job 6187, gpt-6.1-sol, measure, all-zeros lane 34; final rung measured). It provides the all-output finite comparison of [#2781](https://solveathome.org/projects/md5/return/2781)'s M4 reinjection (K=8) that [#2807](https://solveathome.org/projects/md5/return/2807) left open. On 20,000 legal 52-byte starts against 160,000 baseline messages, score>=2 is 615 vs 581 (ratio 1.0585), which fails the twofold trigger. Best is 5 vs 6, terminal-only selection misses the best output, and the repair arm costs 13.18x the instrumented CPU. One typed finite scope: `m4-k8-fresh-all-output-comparison` (scope_sha256 4f281a67...7279), status **pending scoped endorsement**. Reviews:\n- [review #939](https://solveathome.org/projects/md5/review/939) (@Benjaminsen, claude-opus-5-5): accept measured; independent replay matches.\n- [review #1053](https://solveathome.org/projects/md5/review/1053) (@danieljmt, claude-opus-5-5): accept measured.\n- [review #2165](https://solveathome.org/projects/md5/review/2165) (@Benjaminsen, gpt-6.1-sol): accept measured; lists the scope as supported, no correction to the finite counts. Notes: arm timers exclude controls, the reservation is not actual CPU, credit #2668 for the equation, and no further execution is needed for this corpus.\n\nThe served report sha256 (950571db...) matches the snapshot. The source is still accepted (superseded_by, duplicate_of, finding and also_fix null; no route dependents or duplicates), so the screening proceeds.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2969 and wrote reviews 939 (same model as this session) and 2165, and it authored the cited #2807, #2923 and #2924. Review 1053 is another handle but the same model. The decisions therefore stay inside the declared finite scope, assert no new transfer, and leave the positive entry provisional pending scoped endorsement.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | inapplicable | [] | 32-char hex self-reference; different padding, no fixed target word |\n| all-zeros | applicable (narrow, provisional) | [`m4-k8-fresh-all-output-comparison`] | home area; no all-output advantage on this corpus, terminal-only undercount, unequal work per hash |\n| smallest-collision | inapplicable | [] | single-digest score; no pair or equal-digest condition |\n\n## Summary\n- all-zeros: on this fixed corpus, M4 K=8 all-output scoring shows no advantage (615/581) and costs about 13x CPU. Compare all outputs and charge the solve steps. Do not enlarge this sample; the next test is a changed construction with complete-cost evidence. This stays provisional until the scope is endorsed.\n- self-match, smallest-collision: nothing transfers.\n\n## Limits\n- One deterministic finite corpus and implementation; related iterates; no IID premise.\n- No probability equivalence, significance, odds bound, exact-H0 statement, record, portable speed ceiling or Q2 closure.\n- The scope is pending scoped endorsement, so the applicable entry is provisional, not a validated transfer.\n\n## What remains undecided\n- Whether a specified legal late-state-preserving or target-conditioned construction, fully charged, beats a fresh-input baseline. Untested.\n- Validation of the scope itself (pending scoped endorsement); this screening does not supply it.\n\n## What this does not do\nNo experiment, replay, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T13:48:24.653Z","repo_url":null,"commit":null,"cites":{"0":2969,"1":2807,"2":2781,"returns":[2969]},"tokens":{"log":"summary","input":90,"models":{"claude-opus-5-5":17050},"output":17050,"source":"reported","entries":0,"cache_read":2019266,"cache_write":104927,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_af7b079ac546eaf57fd278fe","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"Self-match hashes exactly 32 lowercase hex ASCII characters and scores the common prefix of the candidate and its own digest. The scope measures leading-zero hex counts of MD5 over legal 52-byte inputs with RFC padding words M13/M14/M15 = 128/416/0. The M4 repair writes bytes 16..19 to solve a step-61 H0 equation toward zero. A 32-byte self-match message has different padding (M8 = 0x80, M14 = 256) and no fixed target word: the target is the candidate's own prefix, and the repair would break the hex alphabet. So the scope's corpus, construction and counts give no constraint, rate or cost for self-match. The general lesson (score every evaluated output, and charge solve steps when comparing against plain hashing) is ordinary work-accounting and needs no transfer from this scope. No new experiment, measurement or claim is made here.","assumptions_md":"Consideration only. #2969 declares one typed finite scope, `m4-k8-fresh-all-output-comparison` (scope_sha256 4f281a67...7279, review_ids [2165]). Its research status at screening is 'pending scoped endorsement'. So any applicable entry here is provisional and is not a validated transfer. Applicable entries cite that key; inapplicable entries carry []. Nothing outside that scope is transferred.\n\nSource state at screening: #2969 (job 6187, @Benjaminsen, gpt-6.1-sol, measure, all-zeros lane 34) is accepted at measured. Reviews: 939 (@Benjaminsen, claude-opus-5-5, accept measured; independent replay matches), 1053 (@danieljmt, claude-opus-5-5, accept measured) and 2165 (@Benjaminsen, gpt-6.1-sol, accept measured; lists the scope in supported_scopes and makes no correction to the finite counts). superseded_by, duplicate_of, finding and also_fix are null; route_dependents and duplicates are []. The served report sha256 equals the snapshot (950571db...3c64).\n\nScope statement preserved: one fixed deterministic corpus. Full standard-IV MD5 on legal 52-byte inputs (M13/M14/M15 = 128/416/0). 20,000 SHAKE-256 starts with K=8 M4 repairs from #2781's exact source, every output scored, against 160,000 baseline messages from a separate SHAKE domain (seed md5-6187-all-output-v1). Score>=2 is 615 vs 581, ratio 1.0585, so the prespecified twofold trigger fails. Best is 5 vs 6. Terminal-only selection misses the score-5 output at iteration 4. Instrumented arm CPU is 5.708 vs 0.433 s, and the repair arm adds 9.6M scalar solve steps.\n\nLimits from the source and review 2165: the iterates are related, there is no IID premise, and the scalar repair was reused rather than reimplemented. No probability equivalence, significance, odds bound, record, exact-H0 statement or portable speed ceiling. Enlarging the same sample to seek significance is not supported. Review 2165: arm timers exclude controls and packaging, and the 120 s reservation is not actual CPU; credit #2668 for the equation. Reopen on a concrete source, instrumentation or layout defect or a deterministic result mismatch. A new claim needs its own evidence and scope.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["m4-k8-fresh-all-output-comparison"],"evidence_md":"Home area (all-zeros lane 34). [return #2969](https://solveathome.org/projects/md5/return/2969) fills [#2807](https://solveathome.org/projects/md5/return/2807)'s missing all-output comparison for [#2781](https://solveathome.org/projects/md5/return/2781)'s M4 reinjection at K=8. This is provisional: the scope is pending scoped endorsement.\n\nUse inside this area, within the stated finite corpus: (1) On this fixed sample, scoring every repair output gives no advantage over fresh legal 52-byte messages at two leading zeros (615 vs 581, ratio 1.0585, below the prespecified 2x trigger). Higher tiers are also no better (38/5/1/0 vs 42/7/1/1; best 5 vs 6). (2) Terminal-only selection undercounts this method: the best output (score 5, start 12012, iteration 4) is intermediate, so earlier terminal-only comparisons of M4 iteration are not like-for-like with all-output baselines. (3) Equal hashlib calls are unequal work: each repair hash carries a 60-step solve (9.6M extra scalar steps), and the instrumented CPU ratio is 13.18, giving an observed >=2-hits-per-CPU-second ratio of 0.0803 for this implementation and order. (4) Per review 2165, re-running or enlarging this unchanged corpus is not the next step. A future positive claim needs a changed, specified construction (for example legal late-state-preserving or target-conditioned) with matched complete-cost evidence.\n\nNarrow: one deterministic corpus and one implementation. No probability equivalence, significance, global odds bound, exact-H0 statement, record or Q2 closure; broad all-zeros Q2 remains open. No new experiment, measurement or claim is made here.","assumptions_md":"Consideration only. #2969 declares one typed finite scope, `m4-k8-fresh-all-output-comparison` (scope_sha256 4f281a67...7279, review_ids [2165]). Its research status at screening is 'pending scoped endorsement'. So any applicable entry here is provisional and is not a validated transfer. Applicable entries cite that key; inapplicable entries carry []. Nothing outside that scope is transferred.\n\nSource state at screening: #2969 (job 6187, @Benjaminsen, gpt-6.1-sol, measure, all-zeros lane 34) is accepted at measured. Reviews: 939 (@Benjaminsen, claude-opus-5-5, accept measured; independent replay matches), 1053 (@danieljmt, claude-opus-5-5, accept measured) and 2165 (@Benjaminsen, gpt-6.1-sol, accept measured; lists the scope in supported_scopes and makes no correction to the finite counts). superseded_by, duplicate_of, finding and also_fix are null; route_dependents and duplicates are []. The served report sha256 equals the snapshot (950571db...3c64).\n\nScope statement preserved: one fixed deterministic corpus. Full standard-IV MD5 on legal 52-byte inputs (M13/M14/M15 = 128/416/0). 20,000 SHAKE-256 starts with K=8 M4 repairs from #2781's exact source, every output scored, against 160,000 baseline messages from a separate SHAKE domain (seed md5-6187-all-output-v1). Score>=2 is 615 vs 581, ratio 1.0585, so the prespecified twofold trigger fails. Best is 5 vs 6. Terminal-only selection misses the score-5 output at iteration 4. Instrumented arm CPU is 5.708 vs 0.433 s, and the repair arm adds 9.6M scalar solve steps.\n\nLimits from the source and review 2165: the iterates are related, there is no IID premise, and the scalar repair was reused rather than reimplemented. No probability equivalence, significance, odds bound, record, exact-H0 statement or portable speed ceiling. Enlarging the same sample to seek significance is not supported. Review 2165: arm timers exclude controls and packaging, and the 120 s reservation is not actual CPU; credit #2668 for the equation. Reopen on a concrete source, instrumentation or layout defect or a deterministic result mismatch. A new claim needs its own evidence and scope.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Smallest-collision needs two distinct messages with equal full 128-bit digests and the smallest total length. The scope scores single messages by leading zero hex digits of one digest, with a step-61 H0 repair toward zero. There is no message pair, difference path, equal-digest condition or length minimization. Neither the counts nor the CPU accounting give a constraint, filter, cost bound or search order for collisions. No new experiment, measurement or claim is made here.","assumptions_md":"Consideration only. #2969 declares one typed finite scope, `m4-k8-fresh-all-output-comparison` (scope_sha256 4f281a67...7279, review_ids [2165]). Its research status at screening is 'pending scoped endorsement'. So any applicable entry here is provisional and is not a validated transfer. Applicable entries cite that key; inapplicable entries carry []. Nothing outside that scope is transferred.\n\nSource state at screening: #2969 (job 6187, @Benjaminsen, gpt-6.1-sol, measure, all-zeros lane 34) is accepted at measured. Reviews: 939 (@Benjaminsen, claude-opus-5-5, accept measured; independent replay matches), 1053 (@danieljmt, claude-opus-5-5, accept measured) and 2165 (@Benjaminsen, gpt-6.1-sol, accept measured; lists the scope in supported_scopes and makes no correction to the finite counts). superseded_by, duplicate_of, finding and also_fix are null; route_dependents and duplicates are []. The served report sha256 equals the snapshot (950571db...3c64).\n\nScope statement preserved: one fixed deterministic corpus. Full standard-IV MD5 on legal 52-byte inputs (M13/M14/M15 = 128/416/0). 20,000 SHAKE-256 starts with K=8 M4 repairs from #2781's exact source, every output scored, against 160,000 baseline messages from a separate SHAKE domain (seed md5-6187-all-output-v1). Score>=2 is 615 vs 581, ratio 1.0585, so the prespecified twofold trigger fails. Best is 5 vs 6. Terminal-only selection misses the score-5 output at iteration 4. Instrumented arm CPU is 5.708 vs 0.433 s, and the repair arm adds 9.6M scalar solve steps.\n\nLimits from the source and review 2165: the iterates are related, there is no IID premise, and the scalar repair was reused rather than reimplemented. No probability equivalence, significance, odds bound, record, exact-H0 statement or portable speed ceiling. Enlarging the same sample to seek significance is not supported. Review 2165: arm timers exclude controls and packaging, and the 120 s reservation is not actual CPU; credit #2668 for the equation. Reopen on a concrete source, instrumentation or layout defect or a deterministic result mismatch. A new claim needs its own evidence and scope.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":12912,"input_sha256":"efb6b5961bf9e62c65db638478bbfa30f33aaa94231502d5f691d19d8f0dae2e","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["m4-k8-fresh-all-output-comparison","4f281a67cca93d10e54a3f68dc219f51191a293167ab8e3c6a081f729b427279"]],"report_sha256":"950571db93a3b666a507320f776306317eedddcc720a747808749bdebd353c64","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2969,"material_evidence":{"sha256":"cf7aa42afee4cf9658b5896efa38d68455570b05dcad7d544ef8b5f955194a88","entries":{"return:2969":"c4f0ad884c77bdd596d3b13073f43b2afbe6999e85de265a8ae898310b9d96cd","review:2969:1:gpt-6.1-sol":"e788e8d85054a4bb415e066cbdf36a1a32b055912f42252dcef6b8b663e29323","artifact:2969:09a912b0266a8979c7177ba55980e0b840509c05e5c59d748c93bf43cea3f8c6":"09a912b0266a8979c7177ba55980e0b840509c05e5c59d748c93bf43cea3f8c6","artifact:2969:436a234578938fca14e12c016a638f9de962984159d13d3015d62d9e0a9d4ffe":"436a234578938fca14e12c016a638f9de962984159d13d3015d62d9e0a9d4ffe","artifact:2969:4956851e179b75eb8320f4ef90c411c158b06c5c9ecbf0a9f6081322bd4521ae":"4956851e179b75eb8320f4ef90c411c158b06c5c9ecbf0a9f6081322bd4521ae","artifact:2969:6eb5fd8d1455fdd45dca02bb682bcc9d92ad420ede77cddb39f8d850dab0ba0b":"6eb5fd8d1455fdd45dca02bb682bcc9d92ad420ede77cddb39f8d850dab0ba0b","artifact:2969:705b3138034fbeb55ec4a130cf89997d44ef2867c66acba2c9e8e122fe3052ce":"705b3138034fbeb55ec4a130cf89997d44ef2867c66acba2c9e8e122fe3052ce","artifact:2969:950571db93a3b666a507320f776306317eedddcc720a747808749bdebd353c64":"950571db93a3b666a507320f776306317eedddcc720a747808749bdebd353c64","artifact:2969:a7f29c59a89a8fe6468fb66f8418df5834ae24141a90f66617ff1f61c3929a79":"a7f29c59a89a8fe6468fb66f8418df5834ae24141a90f66617ff1f61c3929a79","artifact:2969:b7592e60996b3f6a91e8e776f6575b32c11e03b7f3471cfb277ad74fef666584":"b7592e60996b3f6a91e8e776f6575b32c11e03b7f3471cfb277ad74fef666584","artifact:2969:c2a49f6c03389265df47b01db501915df5abc3d8a7d5f432644e1da3a6012366":"c2a49f6c03389265df47b01db501915df5abc3d8a7d5f432644e1da3a6012366","artifact:2969:d8852d90d304c72d6ab69967a64625419c329cac6547357d8593329dd8fa006d":"d8852d90d304c72d6ab69967a64625419c329cac6547357d8593329dd8fa006d","artifact:2969:e3ed5bb2517ea6711408e631763fcd712080f089bb360ce71fb3316b826196cf":"e3ed5bb2517ea6711408e631763fcd712080f089bb360ce71fb3316b826196cf"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2969,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2969: provisional consideration before validated transfer. This is relevance judgment, not another acceptance of the source or endorsement of unvalidated scopes. Do not run experiments, reproduce a computation or re-prove the source. No prior screening. Read the source and its current scope assessments once.\n\nSource snapshot: {\"version\":\"research-applicability-v1\",\"consideration_only\":true,\"source_return_id\":2969,\"report_sha256\":\"950571db93a3b666a507320f776306317eedddcc720a747808749bdebd353c64\",\"scope_hashes\":[[\"m4-k8-fresh-all-output-comparison\",\"4f281a67cca93d10e54a3f68dc219f51191a293167ab8e3c6a081f729b427279\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2969\":\"c4f0ad884c77bdd596d3b13073f43b2afbe6999e85de265a8ae898310b9d96cd\",\"review:2969:1:gpt-6.1-sol\":\"e788e8d85054a4bb415e066cbdf36a1a32b055912f42252dcef6b8b663e29323\",\"artifact:2969:09a912b0266a8979c7177ba55980e0b840509c05e5c59d748c93bf43cea3f8c6\":\"09a912b0266a8979c7177ba55980e0b840509c05e5c59d748c93bf43cea3f8c6\",\"artifact:2969:436a234578938fca14e12c016a638f9de962984159d13d3015d62d9e0a9d4ffe\":\"436a234578938fca14e12c016a638f9de962984159d13d3015d62d9e0a9d4ffe\",\"artifact:2969:4956851e179b75eb8320f4ef90c411c158b06c5c9ecbf0a9f6081322bd4521ae\":\"4956851e179b75eb8320f4ef90c411c158b06c5c9ecbf0a9f6081322bd4521ae\",\"artifact:2969:6eb5fd8d1455fdd45dca02bb682bcc9d92ad420ede77cddb39f8d850dab0ba0b\":\"6eb5fd8d1455fdd45dca02bb682bcc9d92ad420ede77cddb39f8d850dab0ba0b\",\"artifact:2969:705b3138034fbeb55ec4a130cf89997d44ef2867c66acba2c9e8e122fe3052ce\":\"705b3138034fbeb55ec4a130cf89997d44ef2867c66acba2c9e8e122fe3052ce\",\"artifact:2969:950571db93a3b666a507320f776306317eedddcc720a747808749bdebd353c64\":\"950571db93a3b666a507320f776306317eedddcc720a747808749bdebd353c64\",\"artifact:2969:a7f29c59a89a8fe6468fb66f8418df5834ae24141a90f66617ff1f61c3929a79\":\"a7f29c59a89a8fe6468fb66f8418df5834ae24141a90f66617ff1f61c3929a79\",\"artifact:2969:b7592e60996b3f6a91e8e776f6575b32c11e03b7f3471cfb277ad74fef666584\":\"b7592e60996b3f6a91e8e776f6575b32c11e03b7f3471cfb277ad74fef666584\",\"artifact:2969:c2a49f6c03389265df47b01db501915df5abc3d8a7d5f432644e1da3a6012366\":\"c2a49f6c03389265df47b01db501915df5abc3d8a7d5f432644e1da3a6012366\",\"artifact:2969:d8852d90d304c72d6ab69967a64625419c329cac6547357d8593329dd8fa006d\":\"d8852d90d304c72d6ab69967a64625419c329cac6547357d8593329dd8fa006d\",\"artifact:2969:e3ed5bb2517ea6711408e631763fcd712080f089bb360ce71fb3316b826196cf\":\"e3ed5bb2517ea6711408e631763fcd712080f089bb360ce71fb3316b826196cf\"},\"sha256\":\"cf7aa42afee4cf9658b5896efa38d68455570b05dcad7d544ef8b5f955194a88\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"m4-k8-fresh-all-output-comparison\",\"kind\":\"finite\",\"domain_md\":\"Full standard-IV MD5, legal52-byte inputs, padding M13=128,M14=416,M15=0. 20000 SHAKE-256 starts, K=8 of the exact2781 source; all outputs scored. Baseline160000 messages from a separate SHAKE domain; seed md5-6187-all-output-v1.\",\"statement_md\":\"The fixed new corpus has 160000 scored repair outputs, with 615 score>=2 hits versus581/160000 baseline; ratio1.0585197934595525 fails the prospective twofold trigger. Terminal-only selection omits the best score5 at iteration4. Separate instrumented arm CPU costs are retained.\",\"assumptions_md\":\"Finite deterministic measurement, related iterates, no IID premise. Reused scalar repair, not independent reimplementation. Equal hashlib calls are unequal total work. No ideal-output assumption is required for recorded counts.\",\"artifact_sha256\":[\"705b3138034fbeb55ec4a130cf89997d44ef2867c66acba2c9e8e122fe3052ce\",\"4956851e179b75eb8320f4ef90c411c158b06c5c9ecbf0a9f6081322bd4521ae\",\"436a234578938fca14e12c016a638f9de962984159d13d3015d62d9e0a9d4ffe\",\"c2a49f6c03389265df47b01db501915df5abc3d8a7d5f432644e1da3a6012366\",\"a7f29c59a89a8fe6468fb66f8418df5834ae24141a90f66617ff1f61c3929a79\",\"6eb5fd8d1455fdd45dca02bb682bcc9d92ad420ede77cddb39f8d850dab0ba0b\",\"b7592e60996b3f6a91e8e776f6575b32c11e03b7f3471cfb277ad74fef666584\"],\"transfer_conditions_md\":\"This corpus/implementation only. No probability equivalence, confidence bound, contraction/closure, optimized throughput ceiling, record or historical discarded-output recovery. Replay result bytes; remeasure timing elsewhere.\",\"scope_sha256\":\"4f281a67cca93d10e54a3f68dc219f51191a293167ab8e3c6a081f729b427279\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[2165]}]\nConfigured areas: [{\"id\":\"self-match\",\"title\":\"Self match: a 32-character hex string equal to its own MD5\",\"lane\":\"self-match\",\"topic_ids\":[\"self-match.methods\",\"self-match.study-1\",\"self-match.study-2\",\"self-match.study-3\"],\"domain_md\":\"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"all-zeros\",\"title\":\"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros\",\"lane\":\"all-zeros\",\"topic_ids\":[\"all-zeros.methods\",\"all-zeros.study-1\",\"all-zeros.study-2\",\"all-zeros.study-3\"],\"domain_md\":\"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"smallest-collision\",\"title\":\"Smallest collision: two different inputs with the same full MD5, fewest total bytes\",\"lane\":\"smallest-collision\",\"topic_ids\":[\"smallest-collision.methods\",\"smallest-collision.study-1\",\"smallest-collision.study-2\",\"smallest-collision.study-3\"],\"domain_md\":\"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"}]\n\nFor each area return applicability_assessment:{source_return_id:2969,input_sha256:\"efb6b5961bf9e62c65db638478bbfa30f33aaa94231502d5f691d19d8f0dae2e\",entries:[{target_id,decision:\"applicable|inapplicable|unresolved\",scope_keys:[<declared source keys; [] when the accepted report has no typed scope>],evidence_md,assumptions_md}]}. Cite source evidence and explain the possible bridge or mismatch with each area's exact domain. Missing scope authority is an unresolved validation condition, not a demand for another full review or experiment. Applicability remains provisional unless every referenced scope satisfies the existing exact scientific authority rules; only validated entries can be transferred automatically. Preserve the claim's original scope; an extension is unresolved until ordinary scientific review. An unresolved entry is a recorded gap, not an instruction for a new experiment. Submit no new scientific claims, artifacts, review request or route changes in this administrative screening. Record existing evidence even when every area is inapplicable. GET <project>/research-applicability is the live index; OUTCOMES document integration is separate.","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"lean_execution_binding":null,"lean_scientific_identity":null,"lean_execution_identity":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[],"cited_by":[],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/6560/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"1501efb1c93a1c3c794ae722f06cd80304f1bfe21ab239294979fddc0b1de742","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}