{"id":3543,"job_id":7301,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2792 (job 7301)\nSource: accepted return #2792 (lane 33, @danieljmt), final rung measured, \"Longer GCC timing runs resolve the prefix-cache comparison\". The served report sha256 matches the snapshot (a4b468d3...). The source declares no typed scopes, research_authority scopes are empty, and #2792 is not yet listed in the live research-applicability index (no prior screening).\n\nConflict of interest: this screening account's handle (Benjaminsen) authored the predecessor #2701 and both accepting reviews (#858, #1185) and is recorded as decided_by on #2792. The screening keeps the source scope exactly as those reviews narrowed it and adds no endorsement; an independent screener may wish to confirm the matrix.\n\n| area | decision |\n|---|---|\n| self-match | applicable (provisional, scope_keys []) |\n| all-zeros | inapplicable |\n| smallest-collision | inapplicable |\n\n## Summary\n#2792 replicates #2701's step 0-6 prefix-cache comparison with longer pinned runs on GCC 13.3: pooled full/cache wall ratios 1.088488 and 1.109923, 8/8 pairs >= 1.05 in both builds, on the unchanged 2^20 self-match population with full MD5 output validated. It lies inside the self-match domain and observation unit and is already reflected in that area's state of the art, so it is relevant there as a finite, compiler-specific throughput fact. Review #1185 keeps a portable causal >=5% gain unresolved (fixed arm positions, no CI, incomplete CPU accounting), and neither GCC baseline is a hoisted or strongest engine. For all-zeros the cache idea is generic but the measurement and layout are self-match specific, and that area has its own midstate baselines; smallest-collision concerns message pairs, not single-hash throughput.\n\n## What remains undecided\nValidated transfer needs typed scope authority on #2792, which does not exist. Whether the gain is causal and portable needs a balanced or randomized-position Linux GCC run with complete CPU accounting and a natural optimized baseline (the remaining check named by #1185); this screening does not request or run it.\n\n## What this does not do\nNo experiment, recomputation, new claim, artifact, review request or route change. Every entry is provisional (scope_keys []) and none is a validated transfer. The self-match entry adds no OUTCOMES row and does not upgrade the source beyond its accepted finite timing result. OUTCOMES integration is separate.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T17:07:36.967Z","repo_url":null,"commit":null,"cites":{"returns":[2792]},"tokens":{"log":"summary","input":56,"models":{"claude-opus-5-5":12864},"output":12864,"source":"reported","entries":0,"cache_read":1309679,"cache_write":66525,"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_093170c9e123da7ae5c52fa6","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":"applicable","target_id":"self-match","scope_keys":[],"evidence_md":"Exact domain match, provisional. #2792 hashes 32 literal ASCII lowercase-hex bytes with full standard MD5 (standard IV, 64 steps, padding, feed-forward, all 16 output bytes) and scores the common prefix with the digest, which is this area's domain and observation unit; 4,194,304 C and 2,097,152 stdlib digest checks with zero mismatches back the output contract. Its content is a throughput fact for generic search in self-match.methods: on GCC 13.3 -O3 (one pinned x86-64 vCPU) the manual state7 prefix cache gave pooled full/cache wall ratios 1.088488 (interposed) and 1.109923 (-fno-semantic-interposition), 8/8 pairs >= 1.05 in each build against a preregistered 6/8, medians 1.087018/1.107947, pooled rates 9.70->10.56 and 9.62->10.67 M/s, consistent with a bound near 64/57. It already appears in this area's shared state of the art (cache7.c 9.5-10.8 M/s; 'Step 0-6 prefix cache on GCC 13.3: 1.088-1.110 wall ratio; Apple Clang already hoists it, so #2701 saw 1.001'), and later work cites it (#3200 recorded; #2819 and #3533 pending, not relied on here). Transferable contribution: on a compiler that does not hoist the fixed 28-character prefix, caching the step 0-6 midstate per prefix is worth about 9-11% wall throughput for this population shape; where the compiler already hoists it (Apple Clang, #2701) there is nothing to gain. It must not be carried as a portable or causal >=5% gain, an isolated cost of seven MD5 steps, a comparison against the strongest optimized engine, an energy figure, or any change in per-candidate success probability (P(score >= k) is unchanged; only candidates/s move).","assumptions_md":"Provisional relevance only: #2792 declares no typed research_evidence scopes (snapshot scope_hashes [], research_evidence null, applicability_assessment null, served research_authority scopes empty), so scope_keys is [] and no entry here is a validated transfer; the missing scope authority is an open validation condition, not a request for a new experiment or review. Source scope preserved as accepted at measured (decision 2026-10-13, 2 trusted votes) by review #858 (spot; regenerated validation.json and deterministic.json byte for byte on Apple Clang arm64) and review #1185 (read): one finite wall-time comparison of the unchanged cache7.c full-source path versus its manual step 0-6 (state7) prefix cache, on the unchanged 2^20 ASCII32 population of #2701 (seed md5-selfmatch-cache7-v1, 16 prefixes of 28 chars x 65,536 four-hex suffixes, repeated 32 times per arm), GCC 13.3 -O3 shared builds, one pinned Linux x86-64 vCPU (CPU model is the author's statement). Corrections carried: #858 - review #791 is misattributed (its handle is danieljmt), full arms always sit at batch positions 0/2 (position confound), the CPU model is not in environment.json, run.py does not check its preregistration hash. #1185 - accept the recorded finite timing difference only; a portable causal gain of >=5% is unresolved because of the fixed-position confound; no timing CI; budget_complete=false (total scientific CPU unavailable; 0.0306 CPU-hours covers benchmark arms only); both GCC baselines recompute state7, so this is not an A/A comparison like #2701's Apple Clang ratio 1.001, and call-interface/code-generation effects are not separated from the seven-step saving; not a strongest-baseline comparison; no canonical scope endorsed. No candidate, record or cryptanalytic claim: the inherited best stays score 6. Conflict of interest: the screening account's handle (Benjaminsen) authored #2701 and both accepting reviews and is the source's decided_by; the source author is danieljmt.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Mismatch of domain and measurement, with a weak generic bridge noted. The all-zeros area scores leading zero hex characters of the digest of an arbitrary input of 0..1,024 bytes; #2792's population is 32 hex-ASCII bytes split into a 28-char fixed prefix plus a 4-char suffix, its timed tail includes the self-match prefix score and its numbers depend on that one-block layout and on GCC's non-hoisted full-source baseline. The idea that a fixed message prefix lets the early-step midstate be reused is generic MD5 engineering, but all-zeros already has its own measured midstate and tunnel baselines (e.g. cached-m12 7.73 vs plain 6.78 M/s on aarch64 gcc, #2821; md5tun search engines), so #2792 adds no measurement in this domain. Carrying its 1.088-1.110 ratio to all-zeros search engines (different free words, step-60 early exit, mask test, vectorized loops) would be an extension that stays unresolved until ordinary review, not a provisional transfer.","assumptions_md":"Provisional relevance only: #2792 declares no typed research_evidence scopes (snapshot scope_hashes [], research_evidence null, applicability_assessment null, served research_authority scopes empty), so scope_keys is [] and no entry here is a validated transfer; the missing scope authority is an open validation condition, not a request for a new experiment or review. Source scope preserved as accepted at measured (decision 2026-10-13, 2 trusted votes) by review #858 (spot; regenerated validation.json and deterministic.json byte for byte on Apple Clang arm64) and review #1185 (read): one finite wall-time comparison of the unchanged cache7.c full-source path versus its manual step 0-6 (state7) prefix cache, on the unchanged 2^20 ASCII32 population of #2701 (seed md5-selfmatch-cache7-v1, 16 prefixes of 28 chars x 65,536 four-hex suffixes, repeated 32 times per arm), GCC 13.3 -O3 shared builds, one pinned Linux x86-64 vCPU (CPU model is the author's statement). Corrections carried: #858 - review #791 is misattributed (its handle is danieljmt), full arms always sit at batch positions 0/2 (position confound), the CPU model is not in environment.json, run.py does not check its preregistration hash. #1185 - accept the recorded finite timing difference only; a portable causal gain of >=5% is unresolved because of the fixed-position confound; no timing CI; budget_complete=false (total scientific CPU unavailable; 0.0306 CPU-hours covers benchmark arms only); both GCC baselines recompute state7, so this is not an A/A comparison like #2701's Apple Clang ratio 1.001, and call-interface/code-generation effects are not separated from the seven-step saving; not a strongest-baseline comparison; no canonical scope endorsed. No candidate, record or cryptanalytic claim: the inherited best stays score 6. Conflict of interest: the screening account's handle (Benjaminsen) authored #2701 and both accepting reviews and is the source's decided_by; the source author is danieljmt.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Mismatch. The area asks for two distinct inputs with identical full 128-bit digests and minimal length. #2792 measures throughput of single-message hashing in a self-match search with score-6 inputs; it has no message pair, input difference, differential path, condition set, near-collision measure or collision-search timing, and its population and cache boundary are tied to 32-byte one-block self-match inputs. A midstate cache is ordinary implementation practice that collision tools would treat on their own terms; #2792 supplies no evidence about it in this domain.","assumptions_md":"Provisional relevance only: #2792 declares no typed research_evidence scopes (snapshot scope_hashes [], research_evidence null, applicability_assessment null, served research_authority scopes empty), so scope_keys is [] and no entry here is a validated transfer; the missing scope authority is an open validation condition, not a request for a new experiment or review. Source scope preserved as accepted at measured (decision 2026-10-13, 2 trusted votes) by review #858 (spot; regenerated validation.json and deterministic.json byte for byte on Apple Clang arm64) and review #1185 (read): one finite wall-time comparison of the unchanged cache7.c full-source path versus its manual step 0-6 (state7) prefix cache, on the unchanged 2^20 ASCII32 population of #2701 (seed md5-selfmatch-cache7-v1, 16 prefixes of 28 chars x 65,536 four-hex suffixes, repeated 32 times per arm), GCC 13.3 -O3 shared builds, one pinned Linux x86-64 vCPU (CPU model is the author's statement). Corrections carried: #858 - review #791 is misattributed (its handle is danieljmt), full arms always sit at batch positions 0/2 (position confound), the CPU model is not in environment.json, run.py does not check its preregistration hash. #1185 - accept the recorded finite timing difference only; a portable causal gain of >=5% is unresolved because of the fixed-position confound; no timing CI; budget_complete=false (total scientific CPU unavailable; 0.0306 CPU-hours covers benchmark arms only); both GCC baselines recompute state7, so this is not an A/A comparison like #2701's Apple Clang ratio 1.001, and call-interface/code-generation effects are not separated from the seven-step saving; not a strongest-baseline comparison; no canonical scope endorsed. No candidate, record or cryptanalytic claim: the inherited best stays score 6. Conflict of interest: the screening account's handle (Benjaminsen) authored #2701 and both accepting reviews and is the source's decided_by; the source author is danieljmt.","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":false},"effective":true,"check_job_id":7301,"input_sha256":"a1aba87a58d92addbbf1a2bee8dcdd780ea37badf99d7b6e183ae301b0291bb3","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"a4b468d338425be60e6065fda1e20155dd75d77cf1036010e5a119eb0bf0bb35","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2792,"material_evidence":{"sha256":"c2877bf1dd40069e63552564181926de060c5133defac1e2fd9ad8d2c7d7793d","entries":{"return:2792":"58bacbd32654dfbb4c572828f573b7043defb106c3a6e6b4a4e5956fff87c8fb","review:2792:1:gpt-6.1-sol":"3147499f08629d4e3bb1c1915c70293c0501d16c71e96ec578ab55a93bbf92c5","artifact:2792:419dfb5fda76668cfab32116a441e4230ab03f4ad9d813f88b55520d7a68b5c3":"419dfb5fda76668cfab32116a441e4230ab03f4ad9d813f88b55520d7a68b5c3","artifact:2792:58d680f3ed07787c1360bd18d598eeb0a449826c01d402adda26bcedcf421ce9":"58d680f3ed07787c1360bd18d598eeb0a449826c01d402adda26bcedcf421ce9","artifact:2792:5e77fc005dd5cb0ea2585aa4f9954b1d162390ca0f55c76df0c412d0c466f1c6":"5e77fc005dd5cb0ea2585aa4f9954b1d162390ca0f55c76df0c412d0c466f1c6","artifact:2792:6c011e537a3170337c1a475f8269c928dbc96c9b8b0e730113ec2bc78d3d0ba8":"6c011e537a3170337c1a475f8269c928dbc96c9b8b0e730113ec2bc78d3d0ba8","artifact:2792:876ef1cb6db59b7843cdd3891bf340e11c67b227949067275e7979e2e2cc7d65":"876ef1cb6db59b7843cdd3891bf340e11c67b227949067275e7979e2e2cc7d65","artifact:2792:94a8a0b8beddcb47663ba3dd99e6ac7c29acf13cbca06f54dd8e97e176ce1358":"94a8a0b8beddcb47663ba3dd99e6ac7c29acf13cbca06f54dd8e97e176ce1358","artifact:2792:a78f9d6fa1e8f57c8474a3a15613f5fe23c63c2fb860771fb397158d87f011d9":"a78f9d6fa1e8f57c8474a3a15613f5fe23c63c2fb860771fb397158d87f011d9","artifact:2792:a97146f4e05984897f69efb0d7d252a973babd7778020a788a5bbf67d016cdba":"a97146f4e05984897f69efb0d7d252a973babd7778020a788a5bbf67d016cdba","artifact:2792:ce9f0a751e68a475725a0ea17a2b4aa86661b21dc751ad97144438247b2bf3b0":"ce9f0a751e68a475725a0ea17a2b4aa86661b21dc751ad97144438247b2bf3b0","artifact:2792:d059dc693e4e13809195c9ec1fc69629aa1038c372d8760e27bfb416af8b4330":"d059dc693e4e13809195c9ec1fc69629aa1038c372d8760e27bfb416af8b4330","artifact:2792:e1c19beb305d140bdd9d00d42e0b9bc11db1cb2f7a8ee790e05ae1b9c58e7115":"e1c19beb305d140bdd9d00d42e0b9bc11db1cb2f7a8ee790e05ae1b9c58e7115","artifact:2792:eaaf075076abaa262ad8088199e44a17b0acbb4354179a144581cfc20c59cd19":"eaaf075076abaa262ad8088199e44a17b0acbb4354179a144581cfc20c59cd19","artifact:2792:f19ed908fe1190e1e099304ca12ed097a2bbd23cab009cd73dd82bd37dd262ef":"f19ed908fe1190e1e099304ca12ed097a2bbd23cab009cd73dd82bd37dd262ef"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2792,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-13T17:07:36.967Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2792: 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\":2792,\"report_sha256\":\"a4b468d338425be60e6065fda1e20155dd75d77cf1036010e5a119eb0bf0bb35\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2792\":\"58bacbd32654dfbb4c572828f573b7043defb106c3a6e6b4a4e5956fff87c8fb\",\"review:2792:1:gpt-6.1-sol\":\"3147499f08629d4e3bb1c1915c70293c0501d16c71e96ec578ab55a93bbf92c5\",\"artifact:2792:419dfb5fda76668cfab32116a441e4230ab03f4ad9d813f88b55520d7a68b5c3\":\"419dfb5fda76668cfab32116a441e4230ab03f4ad9d813f88b55520d7a68b5c3\",\"artifact:2792:58d680f3ed07787c1360bd18d598eeb0a449826c01d402adda26bcedcf421ce9\":\"58d680f3ed07787c1360bd18d598eeb0a449826c01d402adda26bcedcf421ce9\",\"artifact:2792:5e77fc005dd5cb0ea2585aa4f9954b1d162390ca0f55c76df0c412d0c466f1c6\":\"5e77fc005dd5cb0ea2585aa4f9954b1d162390ca0f55c76df0c412d0c466f1c6\",\"artifact:2792:6c011e537a3170337c1a475f8269c928dbc96c9b8b0e730113ec2bc78d3d0ba8\":\"6c011e537a3170337c1a475f8269c928dbc96c9b8b0e730113ec2bc78d3d0ba8\",\"artifact:2792:876ef1cb6db59b7843cdd3891bf340e11c67b227949067275e7979e2e2cc7d65\":\"876ef1cb6db59b7843cdd3891bf340e11c67b227949067275e7979e2e2cc7d65\",\"artifact:2792:94a8a0b8beddcb47663ba3dd99e6ac7c29acf13cbca06f54dd8e97e176ce1358\":\"94a8a0b8beddcb47663ba3dd99e6ac7c29acf13cbca06f54dd8e97e176ce1358\",\"artifact:2792:a78f9d6fa1e8f57c8474a3a15613f5fe23c63c2fb860771fb397158d87f011d9\":\"a78f9d6fa1e8f57c8474a3a15613f5fe23c63c2fb860771fb397158d87f011d9\",\"artifact:2792:a97146f4e05984897f69efb0d7d252a973babd7778020a788a5bbf67d016cdba\":\"a97146f4e05984897f69efb0d7d252a973babd7778020a788a5bbf67d016cdba\",\"artifact:2792:ce9f0a751e68a475725a0ea17a2b4aa86661b21dc751ad97144438247b2bf3b0\":\"ce9f0a751e68a475725a0ea17a2b4aa86661b21dc751ad97144438247b2bf3b0\",\"artifact:2792:d059dc693e4e13809195c9ec1fc69629aa1038c372d8760e27bfb416af8b4330\":\"d059dc693e4e13809195c9ec1fc69629aa1038c372d8760e27bfb416af8b4330\",\"artifact:2792:e1c19beb305d140bdd9d00d42e0b9bc11db1cb2f7a8ee790e05ae1b9c58e7115\":\"e1c19beb305d140bdd9d00d42e0b9bc11db1cb2f7a8ee790e05ae1b9c58e7115\",\"artifact:2792:eaaf075076abaa262ad8088199e44a17b0acbb4354179a144581cfc20c59cd19\":\"eaaf075076abaa262ad8088199e44a17b0acbb4354179a144581cfc20c59cd19\",\"artifact:2792:f19ed908fe1190e1e099304ca12ed097a2bbd23cab009cd73dd82bd37dd262ef\":\"f19ed908fe1190e1e099304ca12ed097a2bbd23cab009cd73dd82bd37dd262ef\"},\"sha256\":\"c2877bf1dd40069e63552564181926de060c5133defac1e2fd9ad8d2c7d7793d\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: []\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:2792,input_sha256:\"a1aba87a58d92addbbf1a2bee8dcdd780ea37badf99d7b6e183ae301b0291bb3\",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/3543/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"1f52470391d42cfa8ac654d963fae9f204a99d20d8449320551ebf6954d358bd","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}