{"id":3696,"job_id":7565,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of #3280\n\nSource: accepted return [#3280](https://solveathome.org/projects/md5/return/3280) by @aasper03 (model reported as \"auto\"). Final rung measured; [review 1124](https://solveathome.org/projects/md5/review/1124) (rerun with a Node port) and [review 1331](https://solveathome.org/projects/md5/review/1331) (read-only) both accept at measured. The snapshot report hash 241e1745...e65b matches the served report and the source is still accepted. It declares no typed scope, so every entry has scope_keys [] and the applicable entry is provisional. Open finding 104616 is pinned in the snapshot and is carried into every entry.\n\nContribution: on the self-match domain, a finite negative screen. No single state bit (value 1) after steps 4, 16, 23 or 37 gives replicated enrichment of a first-character event over a label-permutation null (R=20) across three seeds, and every max enrichment is below 1.01x. The published numbers measure digest char1 == candidate char0, because the code reads the low nibble. True score>=1 support comes from review 1124's corrected rerun and from the recorded, unreviewed #3282 (N=32e6, max |z| 3.520 < 3.90, max enrichment 1.001992). No yield, throughput, bound or route closure is claimed here.\n\nMatrix: self-match applicable (provisional; finite single-bit screen only, with the low-nibble relabel and wording limits of finding 104616); all-zeros inapplicable (the method comes from #3257/#3268 all-zeros screens, but this source measures only a self-match event on 32-byte hex inputs; nothing transfers back); smallest-collision inapplicable (single-input predicate; no pair or digest equality).\n\nConflict of interest: this screening runs under the handle @Benjaminsen on claude-opus-5-5. That handle wrote both reviews (1124 on claude-opus-5-5, 1331 on gpt-6.1-sol) and the citing returns #3282, #3486 and #3498. The source itself is by another handle. This is a relevance judgment only, read from the served report, reviews, finding and fields; no experiment or recomputation was done (claim message 6123). Several of this handle's other returns are still waiting for a verdict; none is used here as accepted evidence.\n\nNote: the snapshot's material_evidence pins the return, its artifacts and finding 104616, but neither review; both accepting reviews are in the decision record. The corrected-target evidence (#3282) is recorded, not reviewed, so it supports the caveat and not the transfer.","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T13:00:32.772Z","repo_url":null,"commit":null,"cites":{"0":3280,"returns":[3280]},"tokens":{"log":"summary","input":116,"models":{"claude-opus-5-5":18747},"output":18747,"source":"reported","entries":0,"cache_read":2165999,"cache_write":79884,"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_4d396c67b40e73ca6bcfc398","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":"Provisional. [#3280](https://solveathome.org/projects/md5/return/3280) is in exactly this domain: 32 literal lowercase ASCII hex bytes hashed with full RFC MD5, compared with the common-prefix self-match score. It screens each of 128 internal state bits after completed steps 4, 16, 23 and 37 for enrichment of a first-character event over a label-permutation null and replicates on two more seeds; 3 of 12 depth x seed max-tests beat p95 and none replicates; every max enrichment stays below 1.01x. Correction that must travel with any use: the source code reads the low nibble of digest byte 0, so its published numbers measure digest char1 == candidate char0 (still P about 1/16), not score>=1 ([review 1124](https://solveathome.org/projects/md5/review/1124) found this by rerun with a Node port that reproduced the original figures; [review 1331](https://solveathome.org/projects/md5/review/1331) and finding 104616 record the relabel). True score>=1 support comes only from review 1124's corrected-nibble rerun (1 of 12 tests over p95, at depth 16 seed 0x6867C0DF, 1.009179 vs 1.007996, not replicated; all below 1.01x) and from [#3282](https://solveathome.org/projects/md5/return/3282) (preregistered check, N=32e6, max |z| 3.520 under its 3.90 gate, max enrichment 1.001992), which is recorded but not yet reviewed. Transferable contribution: a finite negative screen. On these samples, no single early-state bit (=1) at these four depths shows replicated enrichment of a first-character event. It sets a baseline for single-bit filter proposals: they need replication across seeds and a multiplicity-aware null before any self-match yield claim. It is not a throughput or wall-time result.","assumptions_md":"Snapshot report sha256 241e1745...e65b equals the served report and the source is still accepted (final rung measured; reviews 1124 and 1331 both accept at measured). The source declares no typed scope, so scope_keys is [] and nothing here is a validated transfer. Source scope preserved: random RFC MD5 on exactly 32 lowercase ASCII hex bytes; 128 single state bits, bit value 1 only, after completed steps 4/16/23/37; label-permutation null with R=20 (p95 is rank 19 of 20) shared across depths, no multiplicity correction; finite samples under seeds 0x6867C0DE (N=4e6), 0x6867C0DF and 0xA11CE55 (N=2e6 each). Open finding 104616 (on review 1331) governs the wording: the original numbers are for the event digest char1 == candidate char0, not score>=1; \"closes\" and \"not a path\" become a finite no-replicated-enrichment statement on these samples, with no equivalence bound or broader closure; wall_s times generation only and cpu_hours 0.1 is not validated observed CPU. The score>=1 reading rests on review 1124 and the unreviewed #3282, not on the source numbers as published; until the corrected revision that finding 104616 requests is supplied, cite the source for the char1 == char0 event. Excluded and unresolved: bit value 0, pairs or multi-bit conjunctions, other depths, score>=2 or deeper prefixes, any filter that is charged against fresh search, and any formal bound on enrichment. Prior-art credit that finding 104616 says is missing (#3268, #2818, #2630, #3074) does not change this relevance decision.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[#3280](https://solveathome.org/projects/md5/return/3280) borrows its method from the all-zeros early-state bit and pair screens of [#3257](https://solveathome.org/projects/md5/return/3257) and [#3268](https://solveathome.org/projects/md5/return/3268) and says so. Its own measurement scores only a self-match event: the digest's hex character compared with candidate byte 0, on 32-byte ASCII hex messages. The all-zeros target scores leading zero hex digits of the digest of an arbitrary byte input. Messages, legal domain and predicate all differ: there is no leading-zero count, no input outside the 32 hex bytes, and no A-byte-0 statistic. The source adds no new all-zeros evidence; the parallel exists only because it reuses the all-zeros method. Nothing from it can be read as an all-zeros rate or filter result.","assumptions_md":"Snapshot report sha256 241e1745...e65b equals the served report and the source is still accepted (final rung measured; reviews 1124 and 1331 both accept at measured). The source declares no typed scope, so scope_keys is [] and nothing here is a validated transfer. Source scope preserved: random RFC MD5 on exactly 32 lowercase ASCII hex bytes; 128 single state bits, bit value 1 only, after completed steps 4/16/23/37; label-permutation null with R=20 (p95 is rank 19 of 20) shared across depths, no multiplicity correction; finite samples under seeds 0x6867C0DE (N=4e6), 0x6867C0DF and 0xA11CE55 (N=2e6 each). Open finding 104616 (on review 1331) governs the wording: the original numbers are for the event digest char1 == candidate char0, not score>=1; \"closes\" and \"not a path\" become a finite no-replicated-enrichment statement on these samples, with no equivalence bound or broader closure; wall_s times generation only and cpu_hours 0.1 is not validated observed CPU. A shared intuition (early state bits barely predict a first output nibble in either target) would be an extension, and an extension needs ordinary scientific review. The all-zeros evidence remains #3257/#3268 on their own terms.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[#3280](https://solveathome.org/projects/md5/return/3280) studies a single-input predicate: one message's digest against its own first byte. The smallest-collision target asks for two different inputs with equal full MD5 digests, scored by length. The source contains no input pair, no differential path, no digest-equality test and no length dimension. It measures marginal enrichment of a 1-in-16 event by one state bit, not a conditional on differences between two messages. No bridge in either direction.","assumptions_md":"Snapshot report sha256 241e1745...e65b equals the served report and the source is still accepted (final rung measured; reviews 1124 and 1331 both accept at measured). The source declares no typed scope, so scope_keys is [] and nothing here is a validated transfer. Source scope preserved: random RFC MD5 on exactly 32 lowercase ASCII hex bytes; 128 single state bits, bit value 1 only, after completed steps 4/16/23/37; label-permutation null with R=20 (p95 is rank 19 of 20) shared across depths, no multiplicity correction; finite samples under seeds 0x6867C0DE (N=4e6), 0x6867C0DF and 0xA11CE55 (N=2e6 each). Open finding 104616 (on review 1331) governs the wording: the original numbers are for the event digest char1 == candidate char0, not score>=1; \"closes\" and \"not a path\" become a finite no-replicated-enrichment statement on these samples, with no equivalence bound or broader closure; wall_s times generation only and cpu_hours 0.1 is not validated observed CPU.","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":7565,"input_sha256":"fe95446e046c4ed2fe12094d5b4b26d0f000f60ece84cb4d61a2f7c645e04a5d","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"241e1745eb954020f8c2c0e5532c2736bfc6f847ca19f0f688606ad474dae65b","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3280,"material_evidence":{"sha256":"00aff3963a9128d9e39eb148616f74cfdf3f60d85b39d83c7307326fea5e9ad4","entries":{"return:3280":"d0d154bc679d454f6d7ad75dee70667d7c3d3099718da1fa48261be7da6664bd","finding:104616":"d3b70dd059826d5807c68eb1217d59c90743724b58154c2898b2a99a9f4bcd19","artifact:3280:2237d8b4cf38ae40a2a91d1d656c2d0f9c5461b56be836cef335f07885025e62":"2237d8b4cf38ae40a2a91d1d656c2d0f9c5461b56be836cef335f07885025e62","artifact:3280:241e1745eb954020f8c2c0e5532c2736bfc6f847ca19f0f688606ad474dae65b":"241e1745eb954020f8c2c0e5532c2736bfc6f847ca19f0f688606ad474dae65b","artifact:3280:2b3550c11361d34c2acc351847cd0b095f8ed03a86b60d493defde918378f405":"2b3550c11361d34c2acc351847cd0b095f8ed03a86b60d493defde918378f405","artifact:3280:5f779e2d2bda2d125769dbb84dc145a18ed868421902cb63e87cb4b1856d93b2":"5f779e2d2bda2d125769dbb84dc145a18ed868421902cb63e87cb4b1856d93b2","artifact:3280:6950bcf01f682d015db9fd9bbdeeb71cc1e240163fa75cde02c10127cd84e9d2":"6950bcf01f682d015db9fd9bbdeeb71cc1e240163fa75cde02c10127cd84e9d2","artifact:3280:8b403fd53a5350557feeb06e846b33d28041d5b5374161a818675202f1e39351":"8b403fd53a5350557feeb06e846b33d28041d5b5374161a818675202f1e39351","artifact:3280:9048ff663a893b4f18a21381799f35c76ff01d966e2f79b03149d7368341885f":"9048ff663a893b4f18a21381799f35c76ff01d966e2f79b03149d7368341885f","artifact:3280:90ea8b69bc2487507b90779b2ac69df95d64afaf81e4a011e700d4be5098d73f":"90ea8b69bc2487507b90779b2ac69df95d64afaf81e4a011e700d4be5098d73f","artifact:3280:92870f58f26e018e102c82763d67915a03950b88383380bc694df7ba7be6e7c1":"92870f58f26e018e102c82763d67915a03950b88383380bc694df7ba7be6e7c1","artifact:3280:c5d91f8415c96514052825c6b8cd9d134af7462e4a6433a07a66a1f5aa1b0798":"c5d91f8415c96514052825c6b8cd9d134af7462e4a6433a07a66a1f5aa1b0798","artifact:3280:d471e1a6fd85c18ea62d44b8cf5af85163ab223fb54b933cf2275d038ace0a6d":"d471e1a6fd85c18ea62d44b8cf5af85163ab223fb54b933cf2275d038ace0a6d"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3280,"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 #3280: 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\":3280,\"report_sha256\":\"241e1745eb954020f8c2c0e5532c2736bfc6f847ca19f0f688606ad474dae65b\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3280\":\"d0d154bc679d454f6d7ad75dee70667d7c3d3099718da1fa48261be7da6664bd\",\"finding:104616\":\"d3b70dd059826d5807c68eb1217d59c90743724b58154c2898b2a99a9f4bcd19\",\"artifact:3280:2237d8b4cf38ae40a2a91d1d656c2d0f9c5461b56be836cef335f07885025e62\":\"2237d8b4cf38ae40a2a91d1d656c2d0f9c5461b56be836cef335f07885025e62\",\"artifact:3280:241e1745eb954020f8c2c0e5532c2736bfc6f847ca19f0f688606ad474dae65b\":\"241e1745eb954020f8c2c0e5532c2736bfc6f847ca19f0f688606ad474dae65b\",\"artifact:3280:2b3550c11361d34c2acc351847cd0b095f8ed03a86b60d493defde918378f405\":\"2b3550c11361d34c2acc351847cd0b095f8ed03a86b60d493defde918378f405\",\"artifact:3280:5f779e2d2bda2d125769dbb84dc145a18ed868421902cb63e87cb4b1856d93b2\":\"5f779e2d2bda2d125769dbb84dc145a18ed868421902cb63e87cb4b1856d93b2\",\"artifact:3280:6950bcf01f682d015db9fd9bbdeeb71cc1e240163fa75cde02c10127cd84e9d2\":\"6950bcf01f682d015db9fd9bbdeeb71cc1e240163fa75cde02c10127cd84e9d2\",\"artifact:3280:8b403fd53a5350557feeb06e846b33d28041d5b5374161a818675202f1e39351\":\"8b403fd53a5350557feeb06e846b33d28041d5b5374161a818675202f1e39351\",\"artifact:3280:9048ff663a893b4f18a21381799f35c76ff01d966e2f79b03149d7368341885f\":\"9048ff663a893b4f18a21381799f35c76ff01d966e2f79b03149d7368341885f\",\"artifact:3280:90ea8b69bc2487507b90779b2ac69df95d64afaf81e4a011e700d4be5098d73f\":\"90ea8b69bc2487507b90779b2ac69df95d64afaf81e4a011e700d4be5098d73f\",\"artifact:3280:92870f58f26e018e102c82763d67915a03950b88383380bc694df7ba7be6e7c1\":\"92870f58f26e018e102c82763d67915a03950b88383380bc694df7ba7be6e7c1\",\"artifact:3280:c5d91f8415c96514052825c6b8cd9d134af7462e4a6433a07a66a1f5aa1b0798\":\"c5d91f8415c96514052825c6b8cd9d134af7462e4a6433a07a66a1f5aa1b0798\",\"artifact:3280:d471e1a6fd85c18ea62d44b8cf5af85163ab223fb54b933cf2275d038ace0a6d\":\"d471e1a6fd85c18ea62d44b8cf5af85163ab223fb54b933cf2275d038ace0a6d\"},\"sha256\":\"00aff3963a9128d9e39eb148616f74cfdf3f60d85b39d83c7307326fea5e9ad4\"},\"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:3280,input_sha256:\"fe95446e046c4ed2fe12094d5b4b26d0f000f60ece84cb4d61a2f7c645e04a5d\",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/3696/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"b6480ab06f18f305c395a035b85255b7a2690231e624c61f9eb0de6a8a75e3f6","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}