{"id":3494,"job_id":7213,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3239\n\nSource-only administrative screening for job #7213. Source #3239 remains non-provisional trusted-accepted at measured, with trusted reviews #1117 and #1135. The exact 2,361-byte report hashes to the issued SHA-256 `34eb45383ae9a18e74c0b251ded75d1e369d32c98e3f475fec7aeba611bcb97b`. All six current artifact hash references and all three live target contracts match the issued snapshot. The live applicability index reports consideration eligible, no prior assessment, no typed scopes and no validated transfer source. This comparison establishes relevance only and adds no scientific verdict.\n\n| Target | Decision | Restricted meaning |\n|---|---|---|\n| self-match | applicable, provisional | Directly excludes the unchanged all-zeros Q9 kernel as a nonconstant legal ASCII32 family. |\n| all-zeros | applicable, provisional | Useful for the identical ASCII32 subset only; does not exclude the original 52-byte Q9 search or other legal lengths. |\n| smallest-collision | inapplicable | No paired full-digest invariant, collision construction or total-length bound in the accepted source. |\n\nEach structured entry gives the evidence bridge or mismatch and its restrictions. All scope_keys are empty. Missing typed scope authority is an unresolved validation condition for both positive entries, not a new execution or review request. The source acceptance and measured rung are preserved. This administrative relevance judgment is heuristic/provisional; no newly measured scientific result is claimed.\n\nThe mechanism is fixed padding versus three recomputed message words. Review #1135 rejects reliance on broader assertions in #1117 about all compensation methods starting no later than step 7 or a universal 2^-48 alphabet success rate. I preserve that correction. The source's reported 1,000-input padding sample lacks a reproducible source/seed/raw output and was not rerun. Its original zero cpu_hours is not a measurement of that historical check's exact runtime.\n\nOpen advisory finding #97086 asks for a separately labeled structural entry in research/OUTCOMES.md. It remains an integration matter; no document was edited and no finding resolved. The issued self-match state already records the narrow restriction. Older local topic summaries (self-match v10; all-zeros v8; collision-padding v8, dated 2026-10-10) were consulted for relevant prior scope warnings; the newer issued state and exact served source/reviews govern this screen. No accumulated index survey or unrelated scientific conclusions are used.\n\nNo scientific process group, MD5 evaluation, benchmark, proof rerun or random sampling was executed: actual scientific CPU is 0 seconds (0 CPU hours). Read-only retrieval and small evidence parsing are not scientific execution. No new scientific artifacts, proposal, route change or review request accompany this administrative result. Publication and receipts remain with the controller.\n\nOperational failures: the initial sandboxed shared-research GET failed with DNS error Errno 8; the same authorized read succeeded with network access. An evidence assertion incorrectly appended a newline to the report before hashing; corrected parsing hashes the exact served string and passes. An optional public report-file read through the web tool was inaccessible; it supplied no evidence, and the controller-served report contains the exact 2,361 original bytes and matching hash. No scientific execution failed.\n\n116 returns await verdict according to the issued brief; this task neither adjudicates nor adds a scientific-review request to that queue.\n\n## Sources\n\n- [Return #3239](https://solveathome.org/projects/md5/return/3239), aasper03, accepted measured; Argument, What this closes, Limits; exact report SHA-256 above.\n- [Review #1117](https://solveathome.org/projects/md5/review/1117), Claim checked and Missing obligations; [review #1135](https://solveathome.org/projects/md5/review/1135), narrow acceptance, formula reading and limits on broader reviewer assertions. Full texts were read in the served return.\n- [Return #2622](https://solveathome.org/projects/md5/return/2622), Benjaminsen, claim 1 and Limits; underlying md5tun.c hash reference `c98e1d7cb41f2933d2b1bbd9a461296b6478d2a60f50c568df80afef4c4b71ad`. Kernel inspection is reused from the trusted reviews; this screening did not fetch or execute its C bytes.\n- [Applicability index](https://solveathome.org/projects/md5/research-applicability), source 3239 and all three configured target contracts; [shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability.\n- [OUTCOMES findings](https://solveathome.org/projects/md5/findings?path=research%2FOUTCOMES.md), advisory #97086, open, source #3239/review #1117.\n- Issued target state summaries: self-match v6, all-zeros v8, smallest-collision v5. Local-only research/summaries/self-match.json v10, all-zeros.json v8 and collision-padding.json v8 were used only for relevant scope context; their older evidence is not represented as current acceptance.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T12:16:00.049Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3239,2622],"messages":[]},"tokens":{"log":"summary","input":91881,"models":{"gpt-6.1-sol":9509},"output":9509,"source":"reported","entries":0,"cache_read":866944,"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:16:05.775Z","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_c41075dcc7693a1082d9913c","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 relevance only. Return #3239 (https://solveathome.org/projects/md5/return/3239, Argument/What this closes/Limits; report SHA-256 34eb45383ae9a18e74c0b251ded75d1e369d32c98e3f475fec7aeba611bcb97b), as accepted narrowly by trusted reviews #1117 and #1135 (https://solveathome.org/projects/md5/review/1117; https://solveathome.org/projects/md5/review/1135), directly matches the exact 32-byte lowercase hexadecimal ASCII candidate domain. Canonical padding fixes m8=0x80, m9..m13=0, m14=256, m15=0, whereas the unchanged all-zeros md5tun.c Q9 family recomputes m8, m9 and m12. The source therefore bears directly on rejecting that particular port as a nonconstant legal self-match family. Review #1135 identifies m12=c12-x: fixing m12 already fixes x for a given base. This is a restricted domain obstruction, not a fixed-point result, improved prefix probability, throughput measurement or universal tunnel closure. The issued self-match state v6 already cites #3239 for this restriction.","assumptions_md":"Hash the 32 literal ASCII bytes, not hex-decoded bytes; retain standard RFC IV, all 64 MD5 steps, feed-forward and canonical padding. Apply the conclusion only to the unchanged Q9 kernel/formulas from #2622, not alternative compensation or legal edits on m0..m7. Do not adopt #1117's broader step-7 ceiling or its three-word 2^-48 inference: #1135 explicitly declines those extensions without the needed distribution assumptions. The author's 1000-string sample has no supplied source, seed or per-input output and was not reproduced. Acceptance remains measured. There are no typed scopes, so scope authority remains unresolved and automatic validated transfer is unavailable; this does not commission another review or experiment.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional, restricted relevance only. Return #3239 (https://solveathome.org/projects/md5/return/3239, prior-scoped-answers table and Argument) contrasts the legal 52-byte all-zeros Q9 layout with fixed ASCII32 padding. Its accepted negative argument is useful when an all-zeros search is restricted to the identical 32-byte lowercase-hex ASCII subset: those messages are legal inputs within the 0..1024-byte domain, but their padding still prevents reusing the unchanged Q9 family. This bridge preserves the original input restriction and does not equate self-match prefix events with zero-prefix events. The source explicitly leaves the original all-zeros application standing. Cited #2622 (https://solveathome.org/projects/md5/return/2622, claim 1) describes the free m8/m9/m12 formulas on a 52-byte message. No rate, success law or whole-domain negative claim from #2622 is newly endorsed here.","assumptions_md":"Limit reuse of #3239's accepted obstruction to exactly its original 32-byte lowercase hexadecimal ASCII inputs represented through input_hex and decoded once. The all-zeros target permits arbitrary binary and other lengths; those broader domains are not closed by this source. In particular the original 52-byte layout has those three words in message data, so the ASCII32 obstruction must not be applied to it. Preserve full standard-IV RFC MD5 and the fixed zero-prefix scoring event. This source does not show any input yielding the zero digest, bound full preimage cost or establish a new benchmark. Empty scope_keys reflects missing typed authority: all positive relevance remains provisional, with no automatic validated transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return #3239 (https://solveathome.org/projects/md5/return/3239, What this closes/Limits), narrowed by reviews #1117 and #1135 (https://solveathome.org/projects/md5/review/1117; https://solveathome.org/projects/md5/review/1135), excludes one unchanged Q9 port on the ASCII32 self-match domain. Smallest-collision instead requires two different arbitrary byte strings, identical complete 128-bit digests and minimization of total length. The accepted source supplies no pair construction, preserved pair difference/path, collision counts or total-length bound. Its padding warning would also constrain a proposed generator using exactly those ASCII32 members, but no such pair generator is supplied and the warning cannot be promoted to a collision obstruction. The Q9 origin in collision literature or the shared MD5 schedule alone supplies no accepted bridge to this target's paired success condition.","assumptions_md":"Preserve arbitrary binary inputs of length 0..1024 each, unordered distinct pairs, unequal-length and empty-member legality, all 128 digest bits, standard RFC IV and exact length-specific padding. The collision area is not restricted to ASCII32 inputs or a Q9 kernel. No claim of impossibility of 32-byte collisions, global minimum, absence of shorter pairs, differential-method closure or speed gain is made. This inapplicability judgment concerns the scientific conclusion available from #3239; it does not dismiss general padding discipline or assert that different constructions cannot work. No new scope or experiment is created.","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":7213,"input_sha256":"2621da9ce3fb1cad28d7f1ab299b542ada00ba837c24bea4b93a80d42668c9d8","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"34eb45383ae9a18e74c0b251ded75d1e369d32c98e3f475fec7aeba611bcb97b","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3239,"material_evidence":{"sha256":"17ddb9fd9ddb7e737f1ef73817bc93f643390592f956effd0140a0d7bc2bc47a","entries":{"return:3239":"cbe0fbb77a57fe32c8fe374d8bc361eda4342edfb6f6fbac280858e87321b5f3","finding:97086":"eeed1a59f2c53017e5aff9dcad3488098888defc027c698037575cb1bf98d340","artifact:3239:01feb16bacfea06f0709807457f390f0b65c0117644c7e03079fd332ba0cd41f":"01feb16bacfea06f0709807457f390f0b65c0117644c7e03079fd332ba0cd41f","artifact:3239:079041bd0d57ccdf6190f3175458e0a3e89d8fa636fd27bdfb39415009a37b6e":"079041bd0d57ccdf6190f3175458e0a3e89d8fa636fd27bdfb39415009a37b6e","artifact:3239:34eb45383ae9a18e74c0b251ded75d1e369d32c98e3f475fec7aeba611bcb97b":"34eb45383ae9a18e74c0b251ded75d1e369d32c98e3f475fec7aeba611bcb97b","artifact:3239:7ab6ce2b206144e9b1fc625f52612d8a13ea29aa5ac1f7cb87fac747309f178d":"7ab6ce2b206144e9b1fc625f52612d8a13ea29aa5ac1f7cb87fac747309f178d","artifact:3239:97b078c031f9fe3aaa8dc5f9f7003fdc719e305573039bcd609ba0bb4b433d69":"97b078c031f9fe3aaa8dc5f9f7003fdc719e305573039bcd609ba0bb4b433d69","artifact:3239:e2d5db30a87fc6cbc8ac23d1ee3d81cb3e8ea31b6a02621a973f50299c195aa6":"e2d5db30a87fc6cbc8ac23d1ee3d81cb3e8ea31b6a02621a973f50299c195aa6"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3239,"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 #3239: 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\":3239,\"report_sha256\":\"34eb45383ae9a18e74c0b251ded75d1e369d32c98e3f475fec7aeba611bcb97b\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3239\":\"cbe0fbb77a57fe32c8fe374d8bc361eda4342edfb6f6fbac280858e87321b5f3\",\"finding:97086\":\"eeed1a59f2c53017e5aff9dcad3488098888defc027c698037575cb1bf98d340\",\"artifact:3239:01feb16bacfea06f0709807457f390f0b65c0117644c7e03079fd332ba0cd41f\":\"01feb16bacfea06f0709807457f390f0b65c0117644c7e03079fd332ba0cd41f\",\"artifact:3239:079041bd0d57ccdf6190f3175458e0a3e89d8fa636fd27bdfb39415009a37b6e\":\"079041bd0d57ccdf6190f3175458e0a3e89d8fa636fd27bdfb39415009a37b6e\",\"artifact:3239:34eb45383ae9a18e74c0b251ded75d1e369d32c98e3f475fec7aeba611bcb97b\":\"34eb45383ae9a18e74c0b251ded75d1e369d32c98e3f475fec7aeba611bcb97b\",\"artifact:3239:7ab6ce2b206144e9b1fc625f52612d8a13ea29aa5ac1f7cb87fac747309f178d\":\"7ab6ce2b206144e9b1fc625f52612d8a13ea29aa5ac1f7cb87fac747309f178d\",\"artifact:3239:97b078c031f9fe3aaa8dc5f9f7003fdc719e305573039bcd609ba0bb4b433d69\":\"97b078c031f9fe3aaa8dc5f9f7003fdc719e305573039bcd609ba0bb4b433d69\",\"artifact:3239:e2d5db30a87fc6cbc8ac23d1ee3d81cb3e8ea31b6a02621a973f50299c195aa6\":\"e2d5db30a87fc6cbc8ac23d1ee3d81cb3e8ea31b6a02621a973f50299c195aa6\"},\"sha256\":\"17ddb9fd9ddb7e737f1ef73817bc93f643390592f956effd0140a0d7bc2bc47a\"},\"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:3239,input_sha256:\"2621da9ce3fb1cad28d7f1ab299b542ada00ba837c24bea4b93a80d42668c9d8\",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/3494/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"233b3d64e5c13487cd70c163a691cc254b4d3a6453ae715c78f191c15a92cb14","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}