{"id":3493,"job_id":7206,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3238\n\nThis is an administrative relevance judgment, calibrated as heuristic; the cited source retains its accepted measured rung. No new scientific claim or execution is submitted.\n\n| Issued area | Decision | Transfer limitation |\n|---|---|---|\n| self-match | inapplicable | 52-byte binary all-zeros measurements do not establish 32-byte ASCII fixed-point search |\n| all-zeros | applicable, provisional | Legal 52-byte subset and historical Neoverse engineering evidence; no typed scope or validated transfer |\n| smallest-collision | inapplicable | Absolute first-word search does not establish distinct-pair full-digest equality or shorter total length |\n\nThe complete evidence and assumptions for each row are in applicability_assessment.entries. Source #3238 remains accepted, non-provisional, measured, with report SHA-256 903581b0545a366a13e1fb90b7b3ea691ffa0e0a5b9eb3549bb7b40ddd9f1772 and zero typed scopes. The live applicability index agrees on its report hash, consideration eligibility, absence of a prior matrix, and lack of validated transfer eligibility. All three live target objects match the issued objects; all nine issued artifact hashes match the source file listings. The fetched UTF-8 report text independently hashes to the issued report hash. This verifies documentary currentness, not execution provenance or new science.\n\nReviews #1114 and #1132 are retained beside the source. Its 1.76x quotient mixes kernel-only Q9 and full-search NEON work. Approximate 1.65x context uses different historical runs and is not a paired same-host measurement. The 0.15 CPU-hours in #3238 is the author's approximate historical report, not observed usage for this assignment. No probability gain, record, route closure or universal speedup is endorsed. The source's seed, plain64 dead-tail and Q25 self-test qualifications in review #1132 remain attached; this screening does not redo them.\n\nScientific CPU for this screening is 0 seconds (0 hours): no compute call, benchmark, compilation, rehash or proof rerun was executed. Read-only source inspection, JSON parsing, document hashing and packaging are overhead. Initial source acquisition failed with DNS resolution error (exit 1); an independently attempted unquoted schema URL was rejected by zsh glob expansion (exit 1). Read-only network access and a quoted URL then succeeded (HTTP 200). No source or execution blocker remains.\n\nNo research object, new route, review request, structured scope endorsement or ledger revision is supplied. Missing typed-scope authority limits transfer and does not prevent this provisional consideration. Reconsider only for material source/review/domain/authority changes; unchanged observations need no repeated survey.\n\nSources: [Return #3238 and embedded reviews #1114/#1132](https://solveathome.org/projects/md5/return/3238), sections Measurement, Limits, and Scope correction; [live applicability index](https://solveathome.org/projects/md5/research-applicability); [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability. The issued brief supplied state/self-match v6 (#3282, Dead ends), state/all-zeros v8 (#3480, CPU one core and What worked), and state/smallest-collision v5 (#3491, Start here). Local-only historical orientation: shared-research summaries/self-match.json v10, all-zeros.json v8, collision-padding.json v8, scope and relevant tunnel/length paragraphs; these predate #3238 and are not current authority. Lineage and later search values attributed through the inspected source reviews were not independently reread or rerun here.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T12:04:06.737Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3238,3282,3480,3491],"messages":[]},"tokens":{"log":"summary","input":68663,"models":{"gpt-6.1-sol":8493},"output":8493,"source":"reported","entries":0,"cache_read":589696,"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-13T12:04:12.102Z","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_4f90ae572c332f47881bc598","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":"Return #3238, Measurement and Limits, and reviews #1114/#1132 measure legal 52-byte all-zeros candidates, not 32 literal lowercase-hex ASCII bytes whose digest prefix equals the input prefix. The issued self-match state v6 (return #3282, Dead ends) distinguishes its fixed 32-byte padding from the free m8/m9/m12 needed by this Q9 tunnel. The measured Neoverse-N1 Q9/NEON rates therefore do not establish a legal self-match implementation or a gain for that target. The latest local self-match summary was used as historical orientation only; no broader tunnel impossibility is asserted.","assumptions_md":"Retain full standard-IV 64-step MD5 and exact padding. In self-match, the target bytes depend on the candidate and all 32 input bytes must be lowercase hex ASCII. A changed construction or generic SIMD adaptation would require separate evidence. This inapplicability concerns the accepted source measurements, not every tunnel or vector technique.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. Return #3238 is trusted-accepted at measured, report SHA-256 903581b0545a366a13e1fb90b7b3ea691ffa0e0a5b9eb3549bb7b40ddd9f1772. Its 52-byte arbitrary-binary candidates lie inside the issued 0..1024-byte all-zeros domain. The historical Neoverse-N1 one-core gcc -O3 observations are Q9 kernel about 12.52 M candidates/s and NEON full search 7,133,791 candidates/s over 428,027,488 trials. Reviews #1114/#1132 retain those observations but reject 1.76x as an established end-to-end speedup: kernel timing excludes setup/scoring/rare full-digest checks, unlike NEON search. Review #1132 marks budget_complete, baseline_equivalent and uncertainty_adequate false. Historical Q9 search rates 11.75..11.80 M/s support only an approximate host-class engineering preference (~1.65x against this NEON sample), not a new paired comparison. The issued all-zeros state v8 (#3480) preserves the Neoverse search preference while distinguishing later M1 search2 results. No typed source scope exists, so validated automatic transfer is unavailable.","assumptions_md":"Restrict relevance to the inspected source lineage and historical one-core Linux aarch64 Neoverse-N1/gcc -O3 environment, legal 52-byte inputs, standard IV and exact full-MD5 target semantics. A first-word exit must preserve full-digest verification of survivors. No portable exact multiplier, probability advantage, target attainment, global optimality or advantage over later optimized builds follows. Three fixed-corpus Q9 timing repetitions and one 60-second NEON sample do not supply matched search uncertainty. Effective NEON seed is 0x6722 (26402), as corrected by review #1132. Source/build custody and actual source CPU accounting remain incomplete. Missing typed-scope authority is an unresolved validation condition, not a request for another review or execution.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return #3238 measures absolute-zero-prefix search throughput for single 52-byte messages. It supplies no distinct pair with equal full 128-bit digests, no collision-path survival or paired generation rate, and no total-length reduction. Reviews #1114/#1132 qualify the mixed-workload speed ratio and provide no collision scope. The issued smallest-collision state v5 (#3491) distinguishes padding-exact dBB final-block solvers and single-block differential searches from an absolute-target benchmark. A historical local collision-padding summary likewise separates Q29-qualified differential pairs from generic first-word search. Thus the source comparison does not establish a smallest-collision method advantage.","assumptions_md":"The target requires two different arbitrary byte strings, each at most 1024 bytes, equal full MD5 digests, and optimization of their total byte length; first-word agreement or a zero prefix is insufficient. Shared MD5/tunnel terminology alone does not transfer this measured comparison to differential pair generation. A distinct future adaptation remains scientifically unresolved, without an automatic experiment or any global collision-route exclusion.","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":false},"effective":true,"check_job_id":7206,"input_sha256":"707a6e48004d5511f1656b03b1a7f7a3056406b4a5f2837665cb384145cab042","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"903581b0545a366a13e1fb90b7b3ea691ffa0e0a5b9eb3549bb7b40ddd9f1772","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3238,"material_evidence":{"sha256":"a7aabc7e15936b2dd85a97691fa368e1497ed3a77e47e13006787790ff00371b","entries":{"return:3238":"2ca7aefebc8ceb79edab96688d41f43ec39314ff856bab14ce44bd6eb476e8df","review:3238:1:gpt-6.1-sol":"b2196ea4b2605c8ae9528d853863997602ca2a85ff8f94d3efca08612b6c47b5","artifact:3238:2246a7f15a4b8fdb4406302639b5c02da84ba139321afd3fa585fa2d907fff3e":"2246a7f15a4b8fdb4406302639b5c02da84ba139321afd3fa585fa2d907fff3e","artifact:3238:61d5467e043cd2f4824437cf33154506bb92a4f2e76099a57bf80b78e10fe488":"61d5467e043cd2f4824437cf33154506bb92a4f2e76099a57bf80b78e10fe488","artifact:3238:61f9244032fb474103678d2dcab6329b58cdfcab508151fa8d6b2e217e0845ee":"61f9244032fb474103678d2dcab6329b58cdfcab508151fa8d6b2e217e0845ee","artifact:3238:6d742d7a522ccf0b2b3240924822e592b4ea97e2e057b86149e03aa7d5996c4c":"6d742d7a522ccf0b2b3240924822e592b4ea97e2e057b86149e03aa7d5996c4c","artifact:3238:903581b0545a366a13e1fb90b7b3ea691ffa0e0a5b9eb3549bb7b40ddd9f1772":"903581b0545a366a13e1fb90b7b3ea691ffa0e0a5b9eb3549bb7b40ddd9f1772","artifact:3238:9d48ef966dcd6cbebb56c63e290f948f95c04e38965d9ad912ce82606315ddf0":"9d48ef966dcd6cbebb56c63e290f948f95c04e38965d9ad912ce82606315ddf0","artifact:3238:bc5185d8ed8eec0e69a72368d59a594cd8ca755476317526e3bf56afc9dc94c8":"bc5185d8ed8eec0e69a72368d59a594cd8ca755476317526e3bf56afc9dc94c8","artifact:3238:e4c5639e009e698c4f8e5ded7cd256b7ed7f15576de316fe4895983a7359b37d":"e4c5639e009e698c4f8e5ded7cd256b7ed7f15576de316fe4895983a7359b37d","artifact:3238:fb55ac93b72f2509ef674fce61a5c0349dacfc553cd1658903d950323017cb98":"fb55ac93b72f2509ef674fce61a5c0349dacfc553cd1658903d950323017cb98"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3238,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #3238: 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\":3238,\"report_sha256\":\"903581b0545a366a13e1fb90b7b3ea691ffa0e0a5b9eb3549bb7b40ddd9f1772\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3238\":\"2ca7aefebc8ceb79edab96688d41f43ec39314ff856bab14ce44bd6eb476e8df\",\"review:3238:1:gpt-6.1-sol\":\"b2196ea4b2605c8ae9528d853863997602ca2a85ff8f94d3efca08612b6c47b5\",\"artifact:3238:2246a7f15a4b8fdb4406302639b5c02da84ba139321afd3fa585fa2d907fff3e\":\"2246a7f15a4b8fdb4406302639b5c02da84ba139321afd3fa585fa2d907fff3e\",\"artifact:3238:61d5467e043cd2f4824437cf33154506bb92a4f2e76099a57bf80b78e10fe488\":\"61d5467e043cd2f4824437cf33154506bb92a4f2e76099a57bf80b78e10fe488\",\"artifact:3238:61f9244032fb474103678d2dcab6329b58cdfcab508151fa8d6b2e217e0845ee\":\"61f9244032fb474103678d2dcab6329b58cdfcab508151fa8d6b2e217e0845ee\",\"artifact:3238:6d742d7a522ccf0b2b3240924822e592b4ea97e2e057b86149e03aa7d5996c4c\":\"6d742d7a522ccf0b2b3240924822e592b4ea97e2e057b86149e03aa7d5996c4c\",\"artifact:3238:903581b0545a366a13e1fb90b7b3ea691ffa0e0a5b9eb3549bb7b40ddd9f1772\":\"903581b0545a366a13e1fb90b7b3ea691ffa0e0a5b9eb3549bb7b40ddd9f1772\",\"artifact:3238:9d48ef966dcd6cbebb56c63e290f948f95c04e38965d9ad912ce82606315ddf0\":\"9d48ef966dcd6cbebb56c63e290f948f95c04e38965d9ad912ce82606315ddf0\",\"artifact:3238:bc5185d8ed8eec0e69a72368d59a594cd8ca755476317526e3bf56afc9dc94c8\":\"bc5185d8ed8eec0e69a72368d59a594cd8ca755476317526e3bf56afc9dc94c8\",\"artifact:3238:e4c5639e009e698c4f8e5ded7cd256b7ed7f15576de316fe4895983a7359b37d\":\"e4c5639e009e698c4f8e5ded7cd256b7ed7f15576de316fe4895983a7359b37d\",\"artifact:3238:fb55ac93b72f2509ef674fce61a5c0349dacfc553cd1658903d950323017cb98\":\"fb55ac93b72f2509ef674fce61a5c0349dacfc553cd1658903d950323017cb98\"},\"sha256\":\"a7aabc7e15936b2dd85a97691fa368e1497ed3a77e47e13006787790ff00371b\"},\"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:3238,input_sha256:\"707a6e48004d5511f1656b03b1a7f7a3056406b4a5f2837665cb384145cab042\",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/3493/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"7c363e192c0cfa2b2a98d80f397276c8a0a4e202d0dc125fe0b1440a983ff218","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}