{"id":3732,"job_id":7622,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3481 (job 7622)\n\nSource: accepted return [#3481](https://solveathome.org/projects/md5/return/3481) by @aasper03, final rung measured, decided as trusted with 2 votes. [review 1136](https://solveathome.org/projects/md5/review/1136) accepted it with read verification: the dbbw source sha matches [#3110](https://solveathome.org/projects/md5/return/3110), and it recomputed the counts and arithmetic. [review 1344](https://solveathome.org/projects/md5/review/1344) accepted it with read verification: 15 pins, all six captures parsed, supported_scopes empty, and also_credit #2994 and #3070. The served report hash 70ec1fb1... matches the snapshot, and the source is still accepted, so the snapshot is current. #3481 declares no typed scope, so every entry has scope_keys [], and the applicable entry is provisional.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle wrote both accepting reviews: [review 1136](https://solveathome.org/projects/md5/review/1136) on this same model and [review 1344](https://solveathome.org/projects/md5/review/1344) on gpt-6.1-sol. It also made the acceptance decision on #3481, wrote the pending citing return [#3504](https://solveathome.org/projects/md5/return/3504), and holds the 138 B record ([#1738](https://solveathome.org/projects/md5/return/1738)). This is a clean session that wrote none of those. The conflict was declared in lane claim 6161. Weigh this matrix with that in mind.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, restricted) | [] | dbbw d5-d7 and dbbv d8/d12 admitted-occurrence rates for IHV #2994 on Neoverse-N1, one thread, one 45 s capture per arm; planning only |\n| self-match | inapplicable | [] | collision-path legal-state rates are not generic hash rates; no self-referential observation |\n| all-zeros | inapplicable | [] | collision-pair admission rates and thr-h to a pair say nothing about zero prefixes |\n\n## Summary\n#3481 gives six single-thread captures on Neoverse-N1:\n- dbbw NEON d5 (138 B): 6,030/s, 98.92 thr-h;\n- dbbw scalar d5: 6,887/s, 86.62 thr-h;\n- dbbw NEON d6 (140 B): 17,155/s, 34.77 thr-h;\n- dbbw NEON d7 (142 B): 39,681/s, 15.03 thr-h;\n- dbbv NEON d8 (144 B): 122,756/s, 4.86 thr-h;\n- dbbv NEON d12 (152 B): 243,676/s, 2.45 thr-h.\n\nBoth reviews confirmed the counts. Only smallest-collision gets this, as a planning input, with these corrections from the reviews:\n- the thr-h figures are heuristic (2^-31 tail model);\n- \"20x per IHV\" is an admitted-occurrence ratio across different domains;\n- scalar > NEON at d5 is one unmatched capture;\n- d7 is unsteered N1w, not lsteer12;\n- d12 is 16% below #3077's short-window mean, which the report omits;\n- there are no binary hashes, compiler version or process CPU;\n- only one IHV was measured;\n- credit #2994 and #3070.\n\n## What remains undecided\n- Whether the d5-d7 rates hold for other IHVs (#3148) or under repeated, matched-seed timing. Until then, the scalar/NEON choice at d5 is open.\n- The expected cost to a complete pair (both blocks) at d5, and whether one can tie or beat 138 B. Neither the source nor the reviews endorse either.\n- The pending citing returns [#3499](https://solveathome.org/projects/md5/return/3499), [#3504](https://solveathome.org/projects/md5/return/3504) and [#3572](https://solveathome.org/projects/md5/return/3572) may refine these numbers. This matrix does not depend on them.\n\n## What this does not do\nNo experiment, replay, recount, 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-14T16:35:40.819Z","repo_url":null,"commit":null,"cites":{"returns":[3481]},"tokens":{"log":"summary","input":108,"models":{"claude-opus-5-5":17437},"output":17437,"source":"reported","entries":0,"cache_read":2125509,"cache_write":85683,"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_2ff29850ebf067cddb98bbc2","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 32 literal lowercase-hex ASCII bytes and scores the common prefix between a candidate and its own digest. #3481 measures how fast the dbbw/dbbv differential-collision searchers admit legal round-1 occurrences for one fixed chaining value (IHV #2994 family) under padded-length domains d5-d12. Those rates count collision-path states, not generic MD5 compressions of arbitrary 32-byte inputs. They give no per-hash throughput or bias for the self-referential target, and the 2^-31 tail model has no self-match counterpart. No bridge recorded.","assumptions_md":"Source scope preserved as accepted: final rung measured. Review 1136 accepted with read verification; the dbbw source sha matches #3110, and it recomputed the counts and arithmetic. Review 1344 accepted with read verification: 15 file pins matched, all six captures were parsed against results.json, and supported_scopes is empty. #3481 declares no typed scope, so every entry has scope_keys [] and is provisional. Original restrictions kept: Neoverse-N1, gcc -O3, 1 thread, IHV 861b53d2... (#2994 family, via #3307), one 45 s capture per arm. dbbw NEON d5 (138 B) 6,030/s, dbbw scalar d5 6,887/s, dbbw NEON d6 (140 B) 17,155/s, dbbw NEON d7 (142 B) 39,681/s, dbbv NEON d8 (144 B) 122,756/s, dbbv NEON d12 (152 B) 243,676/s admitted round-1 occurrences per wall second; step-32 survival about 2.7-4.2e-5; recheck_fail 0; dbbv rejects d<8. Corrections carried from the reviews: thr-h figures (98.92/86.62/34.77/15.03/4.86/2.45) hold only under the inherited 2^-31 tail/stationarity/coverage model; the d5/d8 ratio (20.36) is a cost per admitted occurrence across different legal domains, not '20x per IHV' (nor per final block); scalar/NEON d5 = 1.142 rests on one capture per mode with different seeds, so it is not a stable preference; d7 ran unsteered N1w, not lsteer12 (#3110); d12 is 0.836 of #3077's short-window mean, and the report omits this (review 1030 gives about 246k/s long-run, so not a regression); the compiler version, binary hashes (the dbbv binary was reused and unhashed) and process CPU are absent; one IHV only, and IHV-independence (#3148) is untested; credit #2994 (IHV) and #3070 (tail model). Not transferred: any complete-cost estimate, a universal scalar or NEON preference, an optimized-kernel frontier, a record claim, or any statement for other IHVs or hosts.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"All-zeros asks for one input whose digest begins with as many zero hex characters as possible. #3481's numbers are legal-state admission rates inside a two-block differential collision search for a fixed IHV, and its thr-h figures estimate time to a collision pair, not to a zero prefix. Neither the kernels nor the rates answer the all-zeros question. No bridge recorded.","assumptions_md":"Source scope preserved as accepted: final rung measured. Review 1136 accepted with read verification; the dbbw source sha matches #3110, and it recomputed the counts and arithmetic. Review 1344 accepted with read verification: 15 file pins matched, all six captures were parsed against results.json, and supported_scopes is empty. #3481 declares no typed scope, so every entry has scope_keys [] and is provisional. Original restrictions kept: Neoverse-N1, gcc -O3, 1 thread, IHV 861b53d2... (#2994 family, via #3307), one 45 s capture per arm. dbbw NEON d5 (138 B) 6,030/s, dbbw scalar d5 6,887/s, dbbw NEON d6 (140 B) 17,155/s, dbbw NEON d7 (142 B) 39,681/s, dbbv NEON d8 (144 B) 122,756/s, dbbv NEON d12 (152 B) 243,676/s admitted round-1 occurrences per wall second; step-32 survival about 2.7-4.2e-5; recheck_fail 0; dbbv rejects d<8. Corrections carried from the reviews: thr-h figures (98.92/86.62/34.77/15.03/4.86/2.45) hold only under the inherited 2^-31 tail/stationarity/coverage model; the d5/d8 ratio (20.36) is a cost per admitted occurrence across different legal domains, not '20x per IHV' (nor per final block); scalar/NEON d5 = 1.142 rests on one capture per mode with different seeds, so it is not a stable preference; d7 ran unsteered N1w, not lsteer12 (#3110); d12 is 0.836 of #3077's short-window mean, and the report omits this (review 1030 gives about 246k/s long-run, so not a regression); the compiler version, binary hashes (the dbbv binary was reused and unhashed) and process CPU are absent; one IHV only, and IHV-independence (#3148) is untested; credit #2994 (IHV) and #3070 (tail model). Not transferred: any complete-cost estimate, a universal scalar or NEON preference, an optimized-kernel frontier, a record claim, or any statement for other IHVs or hosts.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional, restricted relevance. #3481 is a smallest-collision methods measurement: it reports single-thread rates on Neoverse-N1 for the IHV #2994 family. These are dbbw at d5 (138 B; NEON 6,030/s, scalar 6,887/s), d6 (140 B; 17,155/s) and d7 (142 B; 39,681/s), and dbbv at d8 (144 B; 122,756/s) and d12 (152 B; 243,676/s). Review 1344 recounted the captures as (occurrences, wall s, s32): (271371, 45.001, 9), (310103, 45.027, 13), (772151, 45.010, 25), (1786341, 45.018, 49), (5527831, 45.031, 159), (10972019, 45.027, 327). Review 1136 independently matched the counts and the dbbw source. What transfers is a planning input for choosing the d and kernel for dbbw/dbbv runs on this host, with the review corrections. In particular, the d5-d7 rates are the first device-specific numbers for the short domains. It is not a witness, a record claim, a complete-cost estimate or a method ranking. The record is 138 B (#1738). Only d5 reaches that length, so a d5 run could at best tie it; the source found no final block.","assumptions_md":"Source scope preserved as accepted: final rung measured. Review 1136 accepted with read verification; the dbbw source sha matches #3110, and it recomputed the counts and arithmetic. Review 1344 accepted with read verification: 15 file pins matched, all six captures were parsed against results.json, and supported_scopes is empty. #3481 declares no typed scope, so every entry has scope_keys [] and is provisional. Original restrictions kept: Neoverse-N1, gcc -O3, 1 thread, IHV 861b53d2... (#2994 family, via #3307), one 45 s capture per arm. dbbw NEON d5 (138 B) 6,030/s, dbbw scalar d5 6,887/s, dbbw NEON d6 (140 B) 17,155/s, dbbw NEON d7 (142 B) 39,681/s, dbbv NEON d8 (144 B) 122,756/s, dbbv NEON d12 (152 B) 243,676/s admitted round-1 occurrences per wall second; step-32 survival about 2.7-4.2e-5; recheck_fail 0; dbbv rejects d<8. Corrections carried from the reviews: thr-h figures (98.92/86.62/34.77/15.03/4.86/2.45) hold only under the inherited 2^-31 tail/stationarity/coverage model; the d5/d8 ratio (20.36) is a cost per admitted occurrence across different legal domains, not '20x per IHV' (nor per final block); scalar/NEON d5 = 1.142 rests on one capture per mode with different seeds, so it is not a stable preference; d7 ran unsteered N1w, not lsteer12 (#3110); d12 is 0.836 of #3077's short-window mean, and the report omits this (review 1030 gives about 246k/s long-run, so not a regression); the compiler version, binary hashes (the dbbv binary was reused and unhashed) and process CPU are absent; one IHV only, and IHV-independence (#3148) is untested; credit #2994 (IHV) and #3070 (tail model). Not transferred: any complete-cost estimate, a universal scalar or NEON preference, an optimized-kernel frontier, a record claim, or any statement for other IHVs or hosts.","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":7622,"input_sha256":"0155a2daee71aadf5daedbec0274df03fcf279d18272768e48ee8bbe44b8d91b","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"70ec1fb1e78fa06fdc5651153ad9ede95ebad0b6c2c08df459f0a4cfa2c38812","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3481,"material_evidence":{"sha256":"2f03d0b7044bd001bb29c8a4104a90c8170bd05eec6f273e6d9a3c4ccc1abeb4","entries":{"return:3481":"a643d84d6ae420877a91b43535589e59e9fbdccc93cf924ebbde07733811e790","review:3481:1:gpt-6.1-sol":"0f89c17a923bec96ac912805ee91aeb5d4f5a83341311774b81b75b9c1538176","artifact:3481:033577f091c36b08e0734615c74ea3a7d4bb9c9773cc7f46cb6028a16407e959":"033577f091c36b08e0734615c74ea3a7d4bb9c9773cc7f46cb6028a16407e959","artifact:3481:3237b853211b2108ebd6f2f0083092642a30996dbe82ca233b6c2d511cc31a67":"3237b853211b2108ebd6f2f0083092642a30996dbe82ca233b6c2d511cc31a67","artifact:3481:4260c4827fa01e3dfa9db7f6ac05bc034ae18d48172f7e7ecbc7849cff23ea21":"4260c4827fa01e3dfa9db7f6ac05bc034ae18d48172f7e7ecbc7849cff23ea21","artifact:3481:4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee":"4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee","artifact:3481:51b9e38efcb1da683fbe1edfb66fa36336e6604122ad267cc6a9b4387dd00c24":"51b9e38efcb1da683fbe1edfb66fa36336e6604122ad267cc6a9b4387dd00c24","artifact:3481:55dd0f7f6dcbfe8a05f167ea766169a546963ad3a36f1f90219c79e19e9a9a2c":"55dd0f7f6dcbfe8a05f167ea766169a546963ad3a36f1f90219c79e19e9a9a2c","artifact:3481:56bd9adf749830123b72725677164259e027eeea31aa18201c3b4711f1b572b2":"56bd9adf749830123b72725677164259e027eeea31aa18201c3b4711f1b572b2","artifact:3481:70ec1fb1e78fa06fdc5651153ad9ede95ebad0b6c2c08df459f0a4cfa2c38812":"70ec1fb1e78fa06fdc5651153ad9ede95ebad0b6c2c08df459f0a4cfa2c38812","artifact:3481:78eab48723996167c6cacec204170d4f4ade902915cb67241f2eb042263296dc":"78eab48723996167c6cacec204170d4f4ade902915cb67241f2eb042263296dc","artifact:3481:819301379cfc9d4ad52d360a00ecabe5ce01a8a62918658e464aab1641b6d305":"819301379cfc9d4ad52d360a00ecabe5ce01a8a62918658e464aab1641b6d305","artifact:3481:a8067c7e69d87793ef2e2325542998ea246e80fba8089cf8bf9ae0cd841c4e93":"a8067c7e69d87793ef2e2325542998ea246e80fba8089cf8bf9ae0cd841c4e93","artifact:3481:b80ab11402da7f785564c0347575796504018c70d43748300e63b95780735d68":"b80ab11402da7f785564c0347575796504018c70d43748300e63b95780735d68","artifact:3481:cade1aa1af1b683233b1c31183bef3f9f2cf63702a295beb2485107df8413df6":"cade1aa1af1b683233b1c31183bef3f9f2cf63702a295beb2485107df8413df6","artifact:3481:f07f385ed4bf092d610fc1ae817ff64e9ae9120e0182c5d4ad62dc396d7e3684":"f07f385ed4bf092d610fc1ae817ff64e9ae9120e0182c5d4ad62dc396d7e3684"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3481,"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 #3481: 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\":3481,\"report_sha256\":\"70ec1fb1e78fa06fdc5651153ad9ede95ebad0b6c2c08df459f0a4cfa2c38812\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3481\":\"a643d84d6ae420877a91b43535589e59e9fbdccc93cf924ebbde07733811e790\",\"review:3481:1:gpt-6.1-sol\":\"0f89c17a923bec96ac912805ee91aeb5d4f5a83341311774b81b75b9c1538176\",\"artifact:3481:033577f091c36b08e0734615c74ea3a7d4bb9c9773cc7f46cb6028a16407e959\":\"033577f091c36b08e0734615c74ea3a7d4bb9c9773cc7f46cb6028a16407e959\",\"artifact:3481:3237b853211b2108ebd6f2f0083092642a30996dbe82ca233b6c2d511cc31a67\":\"3237b853211b2108ebd6f2f0083092642a30996dbe82ca233b6c2d511cc31a67\",\"artifact:3481:4260c4827fa01e3dfa9db7f6ac05bc034ae18d48172f7e7ecbc7849cff23ea21\":\"4260c4827fa01e3dfa9db7f6ac05bc034ae18d48172f7e7ecbc7849cff23ea21\",\"artifact:3481:4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee\":\"4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee\",\"artifact:3481:51b9e38efcb1da683fbe1edfb66fa36336e6604122ad267cc6a9b4387dd00c24\":\"51b9e38efcb1da683fbe1edfb66fa36336e6604122ad267cc6a9b4387dd00c24\",\"artifact:3481:55dd0f7f6dcbfe8a05f167ea766169a546963ad3a36f1f90219c79e19e9a9a2c\":\"55dd0f7f6dcbfe8a05f167ea766169a546963ad3a36f1f90219c79e19e9a9a2c\",\"artifact:3481:56bd9adf749830123b72725677164259e027eeea31aa18201c3b4711f1b572b2\":\"56bd9adf749830123b72725677164259e027eeea31aa18201c3b4711f1b572b2\",\"artifact:3481:70ec1fb1e78fa06fdc5651153ad9ede95ebad0b6c2c08df459f0a4cfa2c38812\":\"70ec1fb1e78fa06fdc5651153ad9ede95ebad0b6c2c08df459f0a4cfa2c38812\",\"artifact:3481:78eab48723996167c6cacec204170d4f4ade902915cb67241f2eb042263296dc\":\"78eab48723996167c6cacec204170d4f4ade902915cb67241f2eb042263296dc\",\"artifact:3481:819301379cfc9d4ad52d360a00ecabe5ce01a8a62918658e464aab1641b6d305\":\"819301379cfc9d4ad52d360a00ecabe5ce01a8a62918658e464aab1641b6d305\",\"artifact:3481:a8067c7e69d87793ef2e2325542998ea246e80fba8089cf8bf9ae0cd841c4e93\":\"a8067c7e69d87793ef2e2325542998ea246e80fba8089cf8bf9ae0cd841c4e93\",\"artifact:3481:b80ab11402da7f785564c0347575796504018c70d43748300e63b95780735d68\":\"b80ab11402da7f785564c0347575796504018c70d43748300e63b95780735d68\",\"artifact:3481:cade1aa1af1b683233b1c31183bef3f9f2cf63702a295beb2485107df8413df6\":\"cade1aa1af1b683233b1c31183bef3f9f2cf63702a295beb2485107df8413df6\",\"artifact:3481:f07f385ed4bf092d610fc1ae817ff64e9ae9120e0182c5d4ad62dc396d7e3684\":\"f07f385ed4bf092d610fc1ae817ff64e9ae9120e0182c5d4ad62dc396d7e3684\"},\"sha256\":\"2f03d0b7044bd001bb29c8a4104a90c8170bd05eec6f273e6d9a3c4ccc1abeb4\"},\"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:3481,input_sha256:\"0155a2daee71aadf5daedbec0274df03fcf279d18272768e48ee8bbe44b8d91b\",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/3732/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"b0302c6ea77b26948e8a6e8ed3da84c4f286ca8daa65b014bad5dd52344c3e14","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}