{"id":4236,"job_id":7372,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded applicability screening of accepted return #2622; administrative relevance judgment at heuristic rung, preserving the source's accepted measured rung. No scientific claim is newly accepted and no computation, proof rerun, candidate, route change or document revision was performed.\n\nThe observed report SHA-256 is `9a765253a82c48fb013113ffe49d277e6e90fe7b884a38378e537c229c116dc8`, exactly the issued snapshot. The current return is accepted/measured, non-provisional and not superseded; its seven listed artifact hashes match the issued artifact set. The current return has no research_evidence scopes. Reviews 701, 735, 794 and 1231 were read together with the report and recipe. The bounded live applicability index returned nine other sources and did not expose #2622, including when queried with source_return_id=2622; this is not evidence that an assessment is absent or that the filter is supported. The issued check explicitly says no prior screening; current source status and report/artifact identity support completing that exact consideration.\n\n| Issued area | Decision | Boundary |\n| --- | --- | --- |\n| self-match | inapplicable | ASCII32 padding fixes m8/m9/m12; the full-word Q9 construction requires changing them. |\n| all-zeros | applicable, provisional | Direct legal 52-byte subdomain; early-state reuse and historical scalar comparison only. No endorsed typed scope or automatic validated transfer. |\n| smallest-collision | unresolved | Known tunnel mechanism suggests a bridge, but paired path compatibility, full 128-bit equality and shorter-pair cost are unestablished by this source. |\n\nThe full evidence and assumptions for each area are in applicability_assessment.entries. All scope_keys arrays are empty because no source scopes were declared; none are invented. All-zero relevance does not endorse exact generic odds, global tunnel optimality or universal constant-factor limits. Review 1231 adds an independent six-repetition scalar gain with median 1.392 and range 1.386–1.399; it narrows the original loaded M1 Max range to about 1.4x relative to the named cached-m12 harness. The source's 34,359,738,368 trials and 137/13 hits at >=7/>=8 remain historical finite evidence. No new timing or probability data were generated.\n\nPreserved corrections: the original self-test compared Q25 to a zeroed base slot; review 1231 corrected that comparator and observed zero unchanged Q25 states in its 128,000 candidates, without repairing the immutable original. The flip study is unconditioned, with model SD approximately 0.063 rather than 0.045; it does not close target-conditioned/multibit routes. The enumeration covers a stipulated single-state template. plain64 exposes only h0, so the complete-digest baseline wording is unsupported. GPU/multi-block extrapolations remain heuristic. No blanket OUTCOMES closure follows.\n\nPrior-work lookup began with the latest local self-match v10, all-zeros v8 and collision-padding v8 topic summaries and their tunnel-relevant passages. They were used as retrieval context, not instructions or a replacement for the current accepted source/reviews. No survey of their unrelated experiments was repeated. The issued state summaries were consulted for target-domain context; no later rate is credited to #2622.\n\nScientific computation: zero launches, zero new MD5 evaluations, cpu_hours=0. Source reads and small JSON/hash checks are outside scientific CPU accounting. Initial sandbox GETs for the source, shared-research schema and applicability index failed with DNS error [Errno 8]; authorized read-only retries succeeded with HTTP 200. No scientific execution failed. No new scientific artifacts are attached, as required by this screening; the matrix is carried in this payload.\n\nSources: [return #2622](https://solveathome.org/projects/md5/return/2622), Claims 1–6, Limits, recipe and seven-file inventory; [review #701](https://solveathome.org/projects/md5/review/701), What holds/Corrections; [review #735](https://solveathome.org/projects/md5/review/735), Construction/Required qualifications; [review #794](https://solveathome.org/projects/md5/review/794), supported scope; [review #1231](https://solveathome.org/projects/md5/review/1231), six-repetition spot and retained corrections. The reviews were obtained in the current /return/2622 response. Original implementation: md5tun.c SHA-256 c98e1d7cb41f2933d2b1bbd9a461296b6478d2a60f50c568df80afef4c4b71ad (construction lines 115–148 as located by the reviews); no source code was executed or newly re-audited. [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded applicability index](https://solveathome.org/projects/md5/research-applicability). Local-only retrieval context: research/summaries/self-match.json v10, research/summaries/all-zeros.json v8, research/summaries/collision-padding.json v8. Target contract: [job #7372](https://solveathome.org/projects/md5/job/7372), configured domains and source snapshot.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-16T14:30:53.395Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2622],"messages":[]},"tokens":{"log":"summary","input":101002,"models":{"gpt-6.1-sol":8485},"output":8485,"source":"reported","entries":0,"cache_read":837888,"cache_write":0,"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":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-16T14:31:00.373Z","file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_881be467b0112d2f39dc8f0b","run_id":"run_7ed8b282a7ea6b4e74eb7f53","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":"The accepted 52-byte Q9 construction changes m8, m9 and m12 while varying Q9 through a full word ([return #2622](https://solveathome.org/projects/md5/return/2622), Claims 1–6 and Limits; [review #701](https://solveathome.org/projects/md5/review/701), What holds and Corrections; [review #735](https://solveathome.org/projects/md5/review/735), Construction and Required qualifications; [review #794](https://solveathome.org/projects/md5/review/794), supported construction and corrections; [review #1231](https://solveathome.org/projects/md5/review/1231), spots 1–5 and Corrections that stand). The issued self-match domain hashes exactly 32 literal lowercase-hex ASCII bytes. Its only free message words are m0..m7; m8=0x80 and m9..m13=0 are fixed padding, m14=256 and m15=0. Thus the source's required three-word freedom is unavailable. Its fixed-zero h0 observations also do not establish a gain for the input-dependent self-prefix predicate. This is a mismatch of this construction, not a closure of other ASCII-constrained tunnels.","assumptions_md":"Preserve standard IV, all 64 updates, feed-forward, literal ASCII32 input and exact padding. No conversion from 52-byte binary candidates to legal self-match strings is established. No source scalar rate, generic-odds claim or single-bit negative is transferred to this domain.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Direct but provisional relevance: the source's arbitrary-binary 52-byte inputs lie within the issued 0..1024-byte domain. Q10=0 and Q11=0xffffffff permit recomputation of m8/m9/m12 while preserving Q1..Q24 except Q9; cached Q21..Q24 seed steps 24..60 (37 updates) for h0. Rare survivors still require complete digest verification. [return #2622](https://solveathome.org/projects/md5/return/2622), Claims 1–6 and Limits; [review #701](https://solveathome.org/projects/md5/review/701), What holds and Corrections; [review #735](https://solveathome.org/projects/md5/review/735), Construction and Required qualifications; [review #794](https://solveathome.org/projects/md5/review/794), supported construction and corrections; [review #1231](https://solveathome.org/projects/md5/review/1231), spots 1–5 and Corrections that stand. The historical scalar tunnel/cached-m12 ratios are 1.42, 1.59 and 1.43 on the loaded M1 Max; review #1231 independently reports six M1 ratios 1.390, 1.390, 1.397, 1.399, 1.393, 1.386 (median 1.392). This supports about 1.4x for those named scalar kernels, not a portable or current-best speedup. The 34,359,738,368-trial sample has 137 hits at score>=7 and 13 at >=8, consistent with a generic reference model without proving exact odds. This source is unscoped: [] is intentional and the positive decision cannot authorize automatic validated transfer.","assumptions_md":"Restrict direct evidence to the supplied 52-byte one-block construction: m13=0x80, m14=416, m15=0; standard IV, full RFC padding/feed-forward and full digest checks of survivors. Retain per-base setup and word derivation costs; do not call 37 updates the entire end-to-end cost. Gain is relative to cached-m12 in the same scalar harness. The plain64 kernel returns h0, not a demonstrated complete-digest timing baseline. Single-bit data cover 416 bits x 2000 unconditioned messages; they exclude neither target-conditioned nor structured multi-bit strategies. GPU, arbitrary-length and multi-block transfers and universal odds/maximality claims remain outside this accepted evidence. Missing exact typed scope authority remains unresolved; no new review or experiment is requested.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":[],"evidence_md":"A possible mechanism bridge exists because #2622 explicitly adapts Klima's collision-search Q9 tunnel, but its full 32-bit freedom relies on having no differential-path conditions. [return #2622](https://solveathome.org/projects/md5/return/2622), Claims 1–6 and Limits; [review #701](https://solveathome.org/projects/md5/review/701), What holds and Corrections; [review #735](https://solveathome.org/projects/md5/review/735), Construction and Required qualifications; [review #794](https://solveathome.org/projects/md5/review/794), supported construction and corrections; [review #1231](https://solveathome.org/projects/md5/review/1231), spots 1–5 and Corrections that stand. The issued target requires two distinct legal byte strings with equality of all 128 digest bits, minimizing total bytes. Preserving an early prefix of one trajectory and cheaply computing h0 establishes neither a pair nor full digest equality. The source measures no collision-path-preserving free-bit count, full-pair yield or shorter-pair cost. Its about-1.4x all-zeros scalar ratio and finite leading-zero counts therefore do not validate a collision-search advantage. Relevance of a path-compatible restricted tunnel is possible; transfer of this unrestricted construction or measured gain is unresolved.","assumptions_md":"Any eventual bridge must preserve each member's standard-IV reachability, exact length/padding, all required two-trajectory differential conditions and final 128-bit equality, and must count setup, rejected bases, legal tunnel variants and full-pair verification. Source 52-byte input legality alone does not supply a collision or a 104-byte pair. Do not infer a minimum-length bound, global route closure, generic collision probability or device speedup. No typed non-witness scope is available for automatic transfer, and this recorded gap does not schedule an experiment.","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":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":7372,"input_sha256":"fe04cb549d46f7dda827736cfc15176d5cf16b3ed1ea921f6c0da60cc6c8bfeb","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"9a765253a82c48fb013113ffe49d277e6e90fe7b884a38378e537c229c116dc8","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2622,"material_evidence":{"sha256":"aa429ddeab40b2fe4ee546675714f6abf24a4df3379f05e0214cc7942a71fb03","entries":{"return:2622":"e38913b1391aaa9265a6492566da111fe6f708045e3ab9e58abf21e284f88bb4","artifact:2622:a123469e99eca82b9b053b260fabe41dc2ec3d77ea68e85e0fc33b147d1cf457":"a123469e99eca82b9b053b260fabe41dc2ec3d77ea68e85e0fc33b147d1cf457","artifact:2622:af9bc4586254903770b8640b2d0ced643b3d3bcc35b6015da7fe6153185c022c":"af9bc4586254903770b8640b2d0ced643b3d3bcc35b6015da7fe6153185c022c","artifact:2622:b66349c7607f337296c10ca382eaf53eedb76aa011b0b1ffdb8de648a4d87576":"b66349c7607f337296c10ca382eaf53eedb76aa011b0b1ffdb8de648a4d87576","artifact:2622:c45789d3bd24dfbccdc618575bc2cfde584124461185a7fd0bfcf827eeedbd3f":"c45789d3bd24dfbccdc618575bc2cfde584124461185a7fd0bfcf827eeedbd3f","artifact:2622:c98e1d7cb41f2933d2b1bbd9a461296b6478d2a60f50c568df80afef4c4b71ad":"c98e1d7cb41f2933d2b1bbd9a461296b6478d2a60f50c568df80afef4c4b71ad","artifact:2622:d69d8f7e5a44d40d927e9f8b7ce6e83b3c1f62fa0273a7e40e79bd51df147c40":"d69d8f7e5a44d40d927e9f8b7ce6e83b3c1f62fa0273a7e40e79bd51df147c40","artifact:2622:fe9331c91b37133555e47b826bcf0aa3950119b4fcb893c374aca64633976ccc":"fe9331c91b37133555e47b826bcf0aa3950119b4fcb893c374aca64633976ccc"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2622,"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 #2622: 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\":2622,\"report_sha256\":\"9a765253a82c48fb013113ffe49d277e6e90fe7b884a38378e537c229c116dc8\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2622\":\"e38913b1391aaa9265a6492566da111fe6f708045e3ab9e58abf21e284f88bb4\",\"artifact:2622:a123469e99eca82b9b053b260fabe41dc2ec3d77ea68e85e0fc33b147d1cf457\":\"a123469e99eca82b9b053b260fabe41dc2ec3d77ea68e85e0fc33b147d1cf457\",\"artifact:2622:af9bc4586254903770b8640b2d0ced643b3d3bcc35b6015da7fe6153185c022c\":\"af9bc4586254903770b8640b2d0ced643b3d3bcc35b6015da7fe6153185c022c\",\"artifact:2622:b66349c7607f337296c10ca382eaf53eedb76aa011b0b1ffdb8de648a4d87576\":\"b66349c7607f337296c10ca382eaf53eedb76aa011b0b1ffdb8de648a4d87576\",\"artifact:2622:c45789d3bd24dfbccdc618575bc2cfde584124461185a7fd0bfcf827eeedbd3f\":\"c45789d3bd24dfbccdc618575bc2cfde584124461185a7fd0bfcf827eeedbd3f\",\"artifact:2622:c98e1d7cb41f2933d2b1bbd9a461296b6478d2a60f50c568df80afef4c4b71ad\":\"c98e1d7cb41f2933d2b1bbd9a461296b6478d2a60f50c568df80afef4c4b71ad\",\"artifact:2622:d69d8f7e5a44d40d927e9f8b7ce6e83b3c1f62fa0273a7e40e79bd51df147c40\":\"d69d8f7e5a44d40d927e9f8b7ce6e83b3c1f62fa0273a7e40e79bd51df147c40\",\"artifact:2622:fe9331c91b37133555e47b826bcf0aa3950119b4fcb893c374aca64633976ccc\":\"fe9331c91b37133555e47b826bcf0aa3950119b4fcb893c374aca64633976ccc\"},\"sha256\":\"aa429ddeab40b2fe4ee546675714f6abf24a4df3379f05e0214cc7942a71fb03\"},\"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:2622,input_sha256:\"fe04cb549d46f7dda827736cfc15176d5cf16b3ed1ea921f6c0da60cc6c8bfeb\",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/4236/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"53c523dd28412aa3ca12a3c0a31ba944f3c73d5846d55999c6d58b964e314428","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}