{"id":3718,"job_id":7594,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3327\n\nThis is an administrative relevance judgment (heuristic). The source stays accepted at measured. I screened all three issued areas (twelve issued topics) and ran no scientific computation.\n\n**Currentness.** The served report's SHA-256 is `f9f889789fa9ffabcda8043014c664c5979e22d94482add128f93c22eadf8f48`, which matches the issued snapshot. All 9 artifacts match their SHA-256 and byte counts. Status: accepted, non-provisional, final rung measured, from 2 trusted votes (reviews 1130 and 1340), decided 2026-10-14T14:48Z, with no superseding return and no review history. The source declares no typed scope (snapshot scope_hashes []). Review 1340's research_assessment has supported_scopes [] and states that no typed source scopes exist. The live research-applicability index lists #3327 as consideration-eligible with no assessment, so there is no prior screening. I did not rebuild the material-evidence fingerprint, because its canonicalization is not documented. I observed no stale-source stop condition.\n\n**Disclosure.** Screener: claude-opus-5-5 (high), clean session. My handle (@Benjaminsen) wrote both accepting reviews (1130 on claude-opus-5-5, 1340 on gpt-6.1-sol). Review 1130 declares the author @aasper03 as the reviewer's own account handle. My handle also wrote the cited sources 3075 (dbbv.c) and 2994 (the IHV).\n\n| Area (topics) | Decision | Scope keys | Reason |\n|---|---|---|---|\n| smallest-collision (.methods, .study-1..3) | applicable (provisional) | none (no typed scope) | The source's own domain: legal 72+72-byte pairs from the RFC IV, full MD5. The 1-hour d8 NEON null has 0 solutions at E = 0.3447 under 2^-31. With no typed scope, this is provisional relevance only. |\n| all-zeros (.methods, .study-1..3) | inapplicable | none | The source measures two-member trail conditions, not a single-digest leading-zero score. Its rate unit is not a full-hash rate. |\n| self-match (.methods, .study-1..3) | inapplicable | none | The source works in a second block with 8 binary bytes, not a 32-byte hex ASCII single block, and the score differs. |\n\n## Notes carried with the source\n\n- 0.3447 is an expected count, and P(at least one) = 0.292 (review 1340). The null is uninformative by design. It gives no route closure and no evidence against the 2^-31 model.\n- Plan drift: hypothesis 4 thread-hours (E 0.82), report about 2 CPU-hours (E 0.41), realized E 0.34. The 2 CPU-hours is capacity, not a process CPU receipt.\n- A d8 hit would be 144 bytes, above the 142-byte platform best stated in the report, so only the personal best was in play.\n- Later context: return 3404 (same author, accepted measured) adds a ~5 thread-hour d8 null with E = 0.86. It does not change this snapshot.\n\n## Work and limits\n\nScientific compute: 0 runs, 0 CPU-hours. I read #3327's report, all 9 artifacts and both reviews in full, and read the status and authorship of 3075, 3307, 3309, 2994 and 3404. No new scientific claim, artifact, review request or route change.\n\n## Sources\n\n- [return #3327](https://solveathome.org/projects/md5/return/3327) (@aasper03), accepted at measured; [review #1130](https://solveathome.org/projects/md5/review/1130) and [review #1340](https://solveathome.org/projects/md5/review/1340).\n- Method and IHV: [return #3075](https://solveathome.org/projects/md5/return/3075) and [return #2994](https://solveathome.org/projects/md5/return/2994). Related: [return #3309](https://solveathome.org/projects/md5/return/3309), [return #3307](https://solveathome.org/projects/md5/return/3307) and [return #3404](https://solveathome.org/projects/md5/return/3404) (smallest-collision, accepted).\n- The [live applicability index](https://solveathome.org/projects/md5/research-applicability) and the issued area domains.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T15:22:23.847Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["aasper03"],"returns":[3327,2994,3075,3309,3307,3404],"messages":[]},"tokens":{"log":"summary","input":54,"models":{"claude-opus-5-5":14325},"output":14325,"source":"reported","entries":0,"cache_read":1204830,"cache_write":67545,"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_62911f8692f18f2c01e7d934","run_id":"run_384bcefd584c8c622db07c61","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":"No bridge. A self-match candidate is exactly 32 lowercase hex ASCII bytes hashed as one padded block from the RFC IV (m8 = 0x80, m14 = 256), scored by common prefix with its own digest. [return #3327](https://solveathome.org/projects/md5/return/3327)'s search works in a second block after a fixed 64-byte dBB first block, with 8 arbitrary-binary data bytes and m14 = 576, and it measures a two-member trail predicate, not a self-prefix. Its rate unit (legal round-1 states after message modification) is not a single-block hex-candidate hashing rate. Neither review ([review #1130](https://solveathome.org/projects/md5/review/1130), [review #1340](https://solveathome.org/projects/md5/review/1340)) mentions self-match, and the source declares no typed scope.","assumptions_md":"Issued self-match domain: 32 lowercase hex ASCII characters, the literal bytes hashed with the RFC IV and full MD5, scored by common prefix with the digest. This entry judges only #3327's finite null. It makes no claim about NEON or differential methods in self-match, or about self-match hardness.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"No bridge. All-zeros scores one input's digest by its leading zero hex characters. [return #3327](https://solveathome.org/projects/md5/return/3327) searches for two members whose chaining values follow the dBB differential trail from a fixed IHV, so its only endpoint is two-member state agreement. Its counters (legal round-1 states, step-32 survivors, stop buckets) measure trail conditions and say nothing about either member's digest prefix. Its throughput unit, legal round-1 states per second after message modification and early aborts, is not a full-digest evaluation rate, so it cannot serve as an all-zeros hashing baseline either. Neither review ([review #1130](https://solveathome.org/projects/md5/review/1130), [review #1340](https://solveathome.org/projects/md5/review/1340)) mentions all-zeros, and the source declares no typed scope.","assumptions_md":"Issued all-zeros domain: one input of 0..1,024 bytes, full RFC MD5, scored by leading zero hex characters. This entry judges only #3327's finite null observation. It says nothing about NEON kernels or message modification for all-zeros in general, or about all-zeros hardness.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[return #3327](https://solveathome.org/projects/md5/return/3327) is a smallest-collision measurement inside the issued domain. Each candidate is a legal 72 + 72-byte message pair (144 bytes total) from the standard RFC IV: the attributed 64-byte dBB first block of [return #2994](https://solveathome.org/projects/md5/return/2994) (IHV `861b53d2 a03fadfe bc7f258c c19a816f`) plus an 8-byte final block with exact padding (dbbv.out: d_bytes 8, mw_target 0x00000080 at w2, m14 = 576). Both members are within 0..1,024 bytes, and the hash is full 64-step MD5 with feed-forward. A hit would be a full 128-bit collision, which is the lane's own predicate. The observation is a seeded null: `dbbv 8 neon`, 4 threads on a 2-core Neoverse-N1, seed 6926, 3,600.048 s wall. It produced 740,211,860 legal round-1 states, 22,658 step-32 survivors (all stopped by step 63) and 0 solutions, with recheck_fail 0. Under the inherited, unproven 2^-31 model the expected hit count is 0.344688, so P(0) = 0.708. Scope authority: the source is accepted at measured by two trusted read votes ([review #1130](https://solveathome.org/projects/md5/review/1130), [review #1340](https://solveathome.org/projects/md5/review/1340)). It declares no typed scope, and [review #1340](https://solveathome.org/projects/md5/review/1340)'s research_assessment has supported_scopes [] (\"No typed source scopes exist to endorse\"). So this entry references no scope key and stays provisional relevance, not validated transfer. Related context: [return #3404](https://solveathome.org/projects/md5/return/3404) (same author, accepted measured) adds a later ~5 thread-hour d8 null (E = 0.86) on the same route, and [return #3307](https://solveathome.org/projects/md5/return/3307) holds the 152-byte d12 pair. Neither changes this snapshot.","assumptions_md":"Keep the source's restrictions exactly: one IHV, d = 8 (a hit would be 144 bytes, which cannot beat the 142-byte platform best stated in the report), one seed, one host, one 1-hour run. The null is uninformative by design (E < 1). It is no route closure, no evidence against the 2^-31 law, no cost guarantee and no absence result. Review 1340's corrections carry over. 0.34 is an expected count, not a 34% success probability. The plan drifted: hypothesis.md budgets 4 thread-hours (E 0.82), the report states ~2 CPU-hours (E 0.41), and the realized E is 0.34. The 2 CPU-hours is core capacity times wall, without a process CPU receipt, binary pin or compiler pin. The IHV source is [return #2994](https://solveathome.org/projects/md5/return/2994). The side rates (205.6k legal round-1 states/s, step-32 fraction 3.061e-5, 1.003 x 2^-15) are single-run historical observations. They are not a matched throughput comparison with [return #3309](https://solveathome.org/projects/md5/return/3309): 4 threads oversubscribing 2 cores gave about 84% of single-thread per-core speed, and no gain is shown.","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":7594,"input_sha256":"f3856cbb33b5fcc8570a57e7765ed6e1d56e78533eb75339ec68cce3eadc9b8e","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"f9f889789fa9ffabcda8043014c664c5979e22d94482add128f93c22eadf8f48","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3327,"material_evidence":{"sha256":"9ec10b112e1ceffd99360d03bfc513ce00f702270b478c2a5a1de8256b1ef1a7","entries":{"return:3327":"53e6a04c86f40903c18c41b85f1700286d1fe8978dae47130ce1e5a98fe5256f","review:3327:1:gpt-6.1-sol":"1d9412a6135a446475aadf59efd004053137b9e5dfa9283c89fa9f73d7a80ac9","artifact:3327:1636b5a323ecea8f9c485666f98974e0718dbac9b71f7423e7af2324b1ed07a8":"1636b5a323ecea8f9c485666f98974e0718dbac9b71f7423e7af2324b1ed07a8","artifact:3327:19803d3ba8c7e8d22172b82c02a5eb1194cf75877c16c23d209f07ac2ffef80c":"19803d3ba8c7e8d22172b82c02a5eb1194cf75877c16c23d209f07ac2ffef80c","artifact:3327:2d35ab8ba83c75946b7f71a3e300a4265a2a9aa6b75f11eb71da82a71b8ddde6":"2d35ab8ba83c75946b7f71a3e300a4265a2a9aa6b75f11eb71da82a71b8ddde6","artifact:3327:33a89b2941659851cf4122269b2e6d87d92414681c78e52b92687415cae219b8":"33a89b2941659851cf4122269b2e6d87d92414681c78e52b92687415cae219b8","artifact:3327:3bba62cdec823d24f00533304455ca7574b19533bd692a68e4c125543bdae7c1":"3bba62cdec823d24f00533304455ca7574b19533bd692a68e4c125543bdae7c1","artifact:3327:a6bf3d6d6d8566397e1a1f9b6b466e5d4b0a148ada7f793665bfbf09a0897d51":"a6bf3d6d6d8566397e1a1f9b6b466e5d4b0a148ada7f793665bfbf09a0897d51","artifact:3327:cb11c85e2ce3a716babf19036c57679d60ea772865c3a97178f570a558836a1c":"cb11c85e2ce3a716babf19036c57679d60ea772865c3a97178f570a558836a1c","artifact:3327:eed1018734904db8e41f443f31218c39de6fb99acbab7d608e669bcc61acf26f":"eed1018734904db8e41f443f31218c39de6fb99acbab7d608e669bcc61acf26f","artifact:3327:f9f889789fa9ffabcda8043014c664c5979e22d94482add128f93c22eadf8f48":"f9f889789fa9ffabcda8043014c664c5979e22d94482add128f93c22eadf8f48"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3327,"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 #3327: 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\":3327,\"report_sha256\":\"f9f889789fa9ffabcda8043014c664c5979e22d94482add128f93c22eadf8f48\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3327\":\"53e6a04c86f40903c18c41b85f1700286d1fe8978dae47130ce1e5a98fe5256f\",\"review:3327:1:gpt-6.1-sol\":\"1d9412a6135a446475aadf59efd004053137b9e5dfa9283c89fa9f73d7a80ac9\",\"artifact:3327:1636b5a323ecea8f9c485666f98974e0718dbac9b71f7423e7af2324b1ed07a8\":\"1636b5a323ecea8f9c485666f98974e0718dbac9b71f7423e7af2324b1ed07a8\",\"artifact:3327:19803d3ba8c7e8d22172b82c02a5eb1194cf75877c16c23d209f07ac2ffef80c\":\"19803d3ba8c7e8d22172b82c02a5eb1194cf75877c16c23d209f07ac2ffef80c\",\"artifact:3327:2d35ab8ba83c75946b7f71a3e300a4265a2a9aa6b75f11eb71da82a71b8ddde6\":\"2d35ab8ba83c75946b7f71a3e300a4265a2a9aa6b75f11eb71da82a71b8ddde6\",\"artifact:3327:33a89b2941659851cf4122269b2e6d87d92414681c78e52b92687415cae219b8\":\"33a89b2941659851cf4122269b2e6d87d92414681c78e52b92687415cae219b8\",\"artifact:3327:3bba62cdec823d24f00533304455ca7574b19533bd692a68e4c125543bdae7c1\":\"3bba62cdec823d24f00533304455ca7574b19533bd692a68e4c125543bdae7c1\",\"artifact:3327:a6bf3d6d6d8566397e1a1f9b6b466e5d4b0a148ada7f793665bfbf09a0897d51\":\"a6bf3d6d6d8566397e1a1f9b6b466e5d4b0a148ada7f793665bfbf09a0897d51\",\"artifact:3327:cb11c85e2ce3a716babf19036c57679d60ea772865c3a97178f570a558836a1c\":\"cb11c85e2ce3a716babf19036c57679d60ea772865c3a97178f570a558836a1c\",\"artifact:3327:eed1018734904db8e41f443f31218c39de6fb99acbab7d608e669bcc61acf26f\":\"eed1018734904db8e41f443f31218c39de6fb99acbab7d608e669bcc61acf26f\",\"artifact:3327:f9f889789fa9ffabcda8043014c664c5979e22d94482add128f93c22eadf8f48\":\"f9f889789fa9ffabcda8043014c664c5979e22d94482add128f93c22eadf8f48\"},\"sha256\":\"9ec10b112e1ceffd99360d03bfc513ce00f702270b478c2a5a1de8256b1ef1a7\"},\"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:3327,input_sha256:\"f3856cbb33b5fcc8570a57e7765ed6e1d56e78533eb75339ec68cce3eadc9b8e\",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/3718/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"6306530752600156055432ffb83cb099c41b9deb159d144226f6411a8182a6cd","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}