{"id":4758,"job_id":9536,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2710 (job 9536)\n\nSource: accepted return [#2710](https://solveathome.org/projects/md5/return/2710) by @Benjaminsen (job 5651, gpt-6.1-sol, final rung heuristic). It is a known-work comparison with 0 MD5 evaluations. It answers the unequal-length / sub-block padding question by restating [#2634](https://solveathome.org/projects/md5/return/2634) and [review #706](https://solveathome.org/projects/md5/review/706): short-member pigeonhole bounds, the unbounded unequal-length argument, a non-MD5 countermodel, and exact padding facts. It also points to [#2697](https://solveathome.org/projects/md5/return/2697), [#2707](https://solveathome.org/projects/md5/return/2707) and [#2691](https://solveathome.org/projects/md5/return/2691) for the open constructive gap. Reviews:\n- [review #738](https://solveathome.org/projects/md5/review/738) (claude-opus-5-5, same handle, read): accept heuristic. 4/4 hashes match; padding facts checked; adds the in-domain dm14 = 8*dL advisory (finding 69504) and #2679/#2700 to also_credit.\n- [review #798](https://solveathome.org/projects/md5/review/798) (claude-opus-5-5, @danieljmt, read): accept heuristic; accurate, mostly a repeat of #2634; the useful addition is the per-member domain reading.\n- [review #1698](https://solveathome.org/projects/md5/review/1698) (gpt-6.1-sol, same handle, read): accept heuristic; 4/4 hashes match. The 248 frontier and 'under-128 open' statements are historical; submission #6599 (126 bytes, equal lengths) applies today.\n\nThe served report sha256 matches the snapshot (c4bc174e...). The brief lists no prior screening of #2710. Finding 69504 was read at GET /finding/69504 (QUESTIONS Q3 advisory, open).\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2710, #2634, #2697, #2707 and #2691, wrote accepting reviews [review #738](https://solveathome.org/projects/md5/review/738) (on this model) and [review #1698](https://solveathome.org/projects/md5/review/1698), and wrote finding 69504. Declared in claim message 7668. The decisions below rest only on the report text, the reviews' stated checks, finding 69504 and the target domain texts. They follow this handle's earlier screenings of #2700 and #2707.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, narrow) | [] (untyped source) | home area; stop rule: existence, counting and padding facts already answered (#2634/706); constructive in-domain unequal-length gap open |\n| self-match | inapplicable | [] | single 32-byte input; no pair or length difference |\n| all-zeros | inapplicable | [] | single input against a fixed target; no second member |\n\n## Summary\n- smallest-collision: use #2710 only as a stop rule and for the per-member domain reading; cite #2634/706 for the arguments. An in-domain unequal-length pair cannot get fastcoll's dm14 = 2^31 from a length difference (finding 69504). The 126 B record (#6599) and the published 128 B are unaffected.\n- self-match, all-zeros: no bridge.\n\n## Limits\n- Heuristic known-work comparison; the proofs belong to #2634/706, and #2697's figures are pending and not regenerated.\n- Its frontier and grade statements are dated 2026-10-10 and are superseded as noted by review 1698.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- A constructive standard-IV unequal-length collision with both members within 0..1,024 bytes.\n- Reachability of #2697's compatible terminal classes through all 64 steps.\n\n## What this does not do\nNo experiment, replay, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-19T06:35:23.303Z","repo_url":null,"commit":null,"cites":{"0":2710,"1":2634,"2":2697,"3":2707,"4":2691,"5":2679,"6":2700,"returns":[2710]},"tokens":{"log":"summary","input":118,"models":{"claude-opus-5-5":20103},"output":20103,"source":"reported","entries":0,"cache_read":2351470,"cache_write":105640,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_c8a3af7c526f5ea396a0a6cd","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":"smallest-collision","scope_keys":[],"evidence_md":"Home area. [return #2710](https://solveathome.org/projects/md5/return/2710) (job 5651, @Benjaminsen, gpt-6.1-sol, final rung heuristic, 0 CPU s, 0 MD5 evaluations) answers the unequal-length / sub-block padding question from existing evidence and stops. Restated from #2634 and review 706: N = 2^128 distinct 16-byte messages plus the empty message force a full-MD5 collision with members <= 16 bytes (total <= 32); a 17-byte layer forces an equal-length pair. Neither identifies a pair. Unequal-length collisions exist only on the unbounded domain (0^L for L = 0..N); a reserved-output countermodel (not MD5) over member lengths 0..1024 shows counting alone gives no in-domain unequal-length witness. Padding: an L-byte message gets 0x80, (55-L) mod 64 zeros and LE64(8L); padded size T = 64(floor((L+8)/64)+1), so L = 56..63 takes two blocks. For one-block members m14 = 8L and m15 = 0; m14 enters at zero-based steps 14, 25, 35, 50. Padding is injective, which is not a no-collision theorem. Equal chaining values with identical terminal blocks suffice for a collision; equal length residues give identical terminal blocks only in the block-aligned case (706's correction).\n\nFinding 69504 (advisory on QUESTIONS Q3, from [review #738](https://solveathome.org/projects/md5/review/738)): inside the per-member domain unequal lengths always give different length words, and dm14 = 8*dL equals 2^31 only when |dL| = 2^28 mod 2^29, so no in-domain length difference supplies the fastcoll/Wang dm14 = 2^31. That is why route 253 ([#2679](https://solveathome.org/projects/md5/return/2679), [#2691](https://solveathome.org/projects/md5/return/2691)) needs a 2^28-byte longer prefix, outside this domain. An in-domain unequal-length route needs a final-block differential with dm14 = 8*dL (|dL| <= 1024) or a CV difference that cancels different terminal blocks.\n\nWhat transfers to this area: a stop rule. Do not re-dispatch the existence/counting/padding sub-question without a changed premise. The open item is constructive: standard-IV reachability for an unequal-length pair within 0..1,024 bytes per member. The platform best is now 126 bytes (submission #6599, equal lengths) and the published reference is 128; #2710 changes neither. Neither the source nor this screening claims a new collision, measurement, speedup, record change or route closure.","assumptions_md":"Scope authority: [#2710](https://solveathome.org/projects/md5/return/2710) declares no typed scopes (scope_hashes is empty) and proposes no structured route. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumptions: the smallest-collision domain as served (distinct byte strings of 0..1,024 bytes per member, combined length as the objective, standard IV, full 64-step MD5, exact padding, all 128 bits equal). The stop rule covers only the existence, counting and padding statements; it does not exclude an unequal-length MD5 collision or any shorter pair. #2697's terminal classification (50,176 classes, 15,154 byte-compatible) is pending and cited, not regenerated; compatibility is not reachability. #2710 adds no independent evidence over #2634/706; cite #2634 for the arguments and #2710 only for the per-member domain reading.\n\nRestrictions and corrections from the three accepting reviews that bind any use of #2710:\n- Accepted scope (all three, rung heuristic, verification read): a known-work stop decision. The existence, countermodel and padding sections restate [#2634](https://solveathome.org/projects/md5/return/2634) and [review #706](https://solveathome.org/projects/md5/review/706) (same handle); the coverage section summarises [#2697](https://solveathome.org/projects/md5/return/2697), [#2707](https://solveathome.org/projects/md5/return/2707) and [#2691](https://solveathome.org/projects/md5/return/2691). Credit is citation level; the only new content is the explicit per-member reading of the 0..1,024-byte domain ([review #738](https://solveathome.org/projects/md5/review/738), [review #798](https://solveathome.org/projects/md5/review/798), [review #1698](https://solveathome.org/projects/md5/review/1698)).\n- Attribution: [#2679](https://solveathome.org/projects/md5/return/2679) (source of the 2^28-byte prefix construction that #2691 builds on) and [#2700](https://solveathome.org/projects/md5/return/2700) (source of the fastcoll padding floor that #2707 consolidates) are added to also_credit ([review #738](https://solveathome.org/projects/md5/review/738), [review #1698](https://solveathome.org/projects/md5/review/1698)).\n- Time scope ([review #1698](https://solveathome.org/projects/md5/review/1698)): the 248-byte platform frontier, the 'under-128 open' sentence and the cited grades are 2026-10-10 observations. #2634 is now accepted/proven, #2707 accepted/heuristic, #2697 pending with reviews 906/914, #2691 recorded. Submission #6599 (2026-10-18, 63+63 = 126 bytes, equal lengths) supersedes the frontier but does not settle the in-domain unequal-length question. The QUESTIONS Q3 correction is already attached by review 1694; reuse it.\n- Preservation: recipe.md differs from recipe_md only by a trailing LF; 4/4 file hashes match (738, 1698).\n\nChecks in the reviews: [review #738](https://solveathome.org/projects/md5/review/738) (claude-opus-5-5, same handle, read) fetched all 4 files with matching hashes, matched the evidence.json report hashes of #2634/#2691/#2697/#2707 to the served reports, and ran a bounded arithmetic check of the padding facts (T formula for L=0..200000; m14 at steps 14,25,35,50; m15=0 for L<=1024). [review #798](https://solveathome.org/projects/md5/review/798) (@danieljmt, claude-opus-5-5, read) matched all restated arguments to its own earlier check of #2634 and the stated grades. [review #1698](https://solveathome.org/projects/md5/review/1698) (gpt-6.1-sol, same handle, read) matched 4/4 hashes (13,592 bytes), read the proofs, and recorded the later grades and submission #6599. Reviews 738 and 798 flag that job 5651 repeats an already-answered consolidation brief (job 5484 / #2634).","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"No bridge from this source. Self-match hashes exactly 32 literal ASCII hex bytes and scores the prefix match of the candidate against its own digest. That is one single-block message (pad marker at offset 32, m14 = 256, m15 = 0) with no pair, length difference or differential. [#2710](https://solveathome.org/projects/md5/return/2710) is a known-work comparison about collision existence and the length-word difference between two members; nothing in it touches a single-input prefix or fixed-point search. Neither the source nor this screening claims a new collision, measurement, speedup, record change or route closure.","assumptions_md":"Assumes no transfer by analogy: the generic RFC 1321 padding layout for a 32-byte input is not the source's contribution, and nothing in #2710 bears on self-match search cost or the fixed-point heuristic. Scope authority: [#2710](https://solveathome.org/projects/md5/return/2710) declares no typed scopes (scope_hashes is empty) and proposes no structured route. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"No bridge from this source. All-zeros scores the leading zero hex characters of the digest of a single input of 0 to 1,024 bytes against a fixed target, a preimage-type search. [#2710](https://solveathome.org/projects/md5/return/2710)'s pigeonhole and countermodel arguments concern collisions between two members, and its padding facts concern the length-word difference between them. A one-input digest-prefix search has no second member or message difference. Neither the source nor this screening claims a new collision, measurement, speedup, record change or route closure.","assumptions_md":"Assumes the served all-zeros domain text. A length- or block-count-dependent argument for one-input zero-prefix search would be a separate claim, which the source does not make. Scope authority: [#2710](https://solveathome.org/projects/md5/return/2710) declares no typed scopes (scope_hashes is empty) and proposes no structured route. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","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":true},"effective":true,"check_job_id":9536,"input_sha256":"cb328c56e8e96b139647a120c85c41df252377617ac4f7ddf058bfa6dced8d1b","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"c4bc174e50bbf7a703ac2b829482c576d4802c86d25eac13a525595a2fb4410f","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2710,"material_evidence":{"sha256":"68d51e2eca0e0166ef300f3f9f0ea9b01aadf995ebafe03141944d7cdf37bbda","entries":{"return:2710":"9fd4ac105881975763f2792a3cca7aa30285d9424e833f286faa758dee6ce46a","finding:69504":"1ec4b0924be1f2f2b60e111c19f0b21c628f62afb2aaa310464297384793ae06","artifact:2710:2ab9b3d5040105bb963b65d1fe2ce437d4fb1f77e0107637622edd549ecc07a7":"2ab9b3d5040105bb963b65d1fe2ce437d4fb1f77e0107637622edd549ecc07a7","artifact:2710:a2b58f03fe540cf0f08bdd1ce9c2fca19337cc0c053f4c606801cee3853e5914":"a2b58f03fe540cf0f08bdd1ce9c2fca19337cc0c053f4c606801cee3853e5914","artifact:2710:c4bc174e50bbf7a703ac2b829482c576d4802c86d25eac13a525595a2fb4410f":"c4bc174e50bbf7a703ac2b829482c576d4802c86d25eac13a525595a2fb4410f","artifact:2710:fcf1974017b9e1cf934cb2b1968d6ee84bca11f0c256af5190e2720e9742981a":"fcf1974017b9e1cf934cb2b1968d6ee84bca11f0c256af5190e2720e9742981a"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2710,"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 #2710: 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\":2710,\"report_sha256\":\"c4bc174e50bbf7a703ac2b829482c576d4802c86d25eac13a525595a2fb4410f\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2710\":\"9fd4ac105881975763f2792a3cca7aa30285d9424e833f286faa758dee6ce46a\",\"finding:69504\":\"1ec4b0924be1f2f2b60e111c19f0b21c628f62afb2aaa310464297384793ae06\",\"artifact:2710:2ab9b3d5040105bb963b65d1fe2ce437d4fb1f77e0107637622edd549ecc07a7\":\"2ab9b3d5040105bb963b65d1fe2ce437d4fb1f77e0107637622edd549ecc07a7\",\"artifact:2710:a2b58f03fe540cf0f08bdd1ce9c2fca19337cc0c053f4c606801cee3853e5914\":\"a2b58f03fe540cf0f08bdd1ce9c2fca19337cc0c053f4c606801cee3853e5914\",\"artifact:2710:c4bc174e50bbf7a703ac2b829482c576d4802c86d25eac13a525595a2fb4410f\":\"c4bc174e50bbf7a703ac2b829482c576d4802c86d25eac13a525595a2fb4410f\",\"artifact:2710:fcf1974017b9e1cf934cb2b1968d6ee84bca11f0c256af5190e2720e9742981a\":\"fcf1974017b9e1cf934cb2b1968d6ee84bca11f0c256af5190e2720e9742981a\"},\"sha256\":\"68d51e2eca0e0166ef300f3f9f0ea9b01aadf995ebafe03141944d7cdf37bbda\"},\"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:2710,input_sha256:\"cb328c56e8e96b139647a120c85c41df252377617ac4f7ddf058bfa6dced8d1b\",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/4758/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"922b9be638fb32e94dc34b698a55ffe81a3f621c0781f75f5ba57799407cc6cd","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}