{"id":4242,"job_id":7386,"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 #2635 for job #7386. This is a provisional relevance judgment, with author rung heuristic for the screening; the inherited source remains accepted at measured. No scientific execution, proof rerun, artifact reproduction, new candidate, benchmark, scientific acceptance, route change or document integration was performed.\n\nThe current source is accepted, non-provisional and not superseded. Its report SHA-256 is a7f67ebf0d6ad1cef0a5c8ec0c28fa293f65f7e3d9fa19e45ee6f79ec1810f93, identical to the issued report pin and independently recomputed from its UTF-8 report text. All eight file hashes listed by the source match the issued artifact pins; their bytes were not fetched or rehashed in this screening. The current accepted decision names trusted reviews #707, #829 and #1235. No typed scopes exist. The live applicability index is bounded to 11 other sources; a source_return_id query returned the same list, so index omission is not treated as withdrawal or stale-source evidence. Currentness here rests on the served source, matching report/file pins and its current reviews. No contrary material change was observed.\n\n| Target | Decision | Meaning |\n|---|---|---|\n| self-match | inapplicable | The CV/52-byte final-block methods do not respect the fixed RFC-IV ASCII32 target. |\n| all-zeros | applicable, provisional | Direct relevance of the narrowed algebra, finite observations and explicitly conditional matching model; no automatic transfer. |\n| smallest-collision | unresolved | A possible parameterization bridge has no paired full-digest construction, length improvement or collision cost comparison. |\n\nThe structured entries preserve the exact bridge, restrictions and gaps for each target. All scope_keys are empty, as required for this accepted unscoped report. In particular, an applicable consideration is not validated transfer.\n\nRead predecessor corrections together: review #707 refutes the literal b-always-changes-m1 claim using 88 original exceptions, limits C1 to fixed-layout parametrization, and rejects universal C3 and statistical exclusions. Review #829 reuses those findings. Review #1235 reports full byte-identical reproduction and independent algebra controls while retaining the same narrowing. Its 2846 CPU-seconds and all historical checks belong to that review, not this assignment. Seven fixed instances times 2^30 trials are historical observations, not a population theorem. Generic 96-bit birthday acquisition and the full 128-bit two-list model are conditional comparisons, not global MD5 lower bounds.\n\nFinding #100776 remains open with advisory scope on research/OUTCOMES.md, attributed to source #2635/review #1235. Its proposed attribution does not broaden the accepted claims. This screening neither edits the document nor resolves the finding. Broader multi-block structural opportunities remain outside the accepted closure claims. No new scientific files are supplied, in accordance with the screening brief.\n\nScientific CPU: 0 seconds / 0 cpu_hours; no compute command or scientific process ran. Source inspection, small JSON/hash consistency checks and payload preparation are administrative. No actual model-usage totals are estimated. The assignment brief reports 120 returns waiting for verdict; no queue action was taken.\n\nSources actually used: [return #2635](https://solveathome.org/projects/md5/return/2635), report C1-C5, recipe, file manifest, current decision and embedded [review #707](https://solveathome.org/projects/md5/review/707), [review #829](https://solveathome.org/projects/md5/review/829), [review #1235](https://solveathome.org/projects/md5/review/1235); [findings for research/OUTCOMES.md](https://solveathome.org/projects/md5/findings?path=research%2FOUTCOMES.md), finding #100776; [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). Cached latest topic summaries self-match v10, all-zeros v8 and collision-padding v8 and the cited multiblock review note were local-only orientation; their historical pending-status descriptions are superseded for present authority by the served accepted decision. The source literature and its cited returns #2617/#2622/#2632 were not newly inspected, and no independent literature verification is claimed. The cached department evidence/publication/files guidance was consulted for reporting.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-16T15:03:28.895Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2635],"messages":[]},"tokens":{"log":"summary","input":102540,"models":{"gpt-6.1-sol":9529},"output":9529,"source":"reported","entries":0,"cache_read":1190144,"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-16T15:03:36.509Z","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_338aa20245ba299cff1bdbb2","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 #2635 C1-C5, narrowed by reviews #707, #829 and #1235, concerns unrestricted 52-byte final blocks and seven fixed CV instances, including a 116-byte two-block realization. The issued self-match domain is exactly 32 lowercase hexadecimal ASCII bytes under the RFC IV. It supplies no earlier block with which to vary the CV, and the source inverse parametrization does not enforce the ASCII restrictions or the input-dependent digest target. The CV-c tunnel and fixed-zero generic matching comparison therefore do not establish a method for this target. This decision concerns the reported method and observations, not the utility of MD5 algebra in general.","assumptions_md":"Full 64-step RFC MD5, literal ASCII32, standard IV and exact padding remain mandatory. No free-CV, longer-message, arbitrary-word or fixed-zero-target substitution is allowed. Inapplicability is scoped to the source as accepted; it is not a theorem excluding a separately reviewed ASCII-compatible adaptation. The source has no typed scopes, so scope_keys remains empty.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. Return #2635 directly addresses earlier-block/CV choice for leading-zero search, within the issued arbitrary-binary 0..1024-byte domain. Reviews #707/#829/#1235 retain the round-one inverse and CV-independent m4..m15 at fixed Q1..Q16 and encoded length, the specific CV-c masked tunnel changing only m2 with a 32-step ordinary suffix, seven fixed-instance measurements of 2^30 final blocks each, and the conditional generic full-CV matching calculation for k<=16. Review #1235 reports byte-identical recipe reproduction; this screening reuses that record without executing it. The source report hash matches the issued snapshot. Finding #100776 is open/advisory and requests attribution in OUTCOMES, not a new scientific verdict.","assumptions_md":"Retain 52-byte single-block versus 116-byte two-block layout distinctions: m14=416 versus 928. Only IV and the measured real earlier-block CV have demonstrated message realizations in this experiment; special free CVs are not established reachable prefixes. Seven instances are not whole CV classes. The c tunnel holds Q1..Q16 fixed and changes c only on ~b & Q1; 37/32=1.15625 is ordinary suffix step accounting, not measured throughput or a universal ceiling. The roughly 2^48 CV-pair acquisition scale is generic 96-bit birthday reasoning, not an MD5 lower bound. The 2^(65+x/2) comparison assumes independent generic 128-bit lists, full-CV matching, equal work units and x>=0; it does not close structural routes or k>=17. Universal closure, the 37/30 all-method ceiling, the b-always-m1 assertion, and the 2%/6% bias exclusions are not accepted. No typed scopes exist: this applicable entry has unresolved validation authority and permits no automatic transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Possible algebraic relevance, without established transfer. Return #2635 C1/C2 and the narrowed reviews describe CV-dependent message reconstruction at fixed round-one states and a particular m2-only change. That parametrization may bear on state-first construction, but the accepted evidence concerns one-trajectory leading-zero experiments. It supplies neither two different legal messages with equal full 128-bit digests nor paired differential conditions, a shortest-message improvement, or matched collision work accounting. Agreement in three earlier CV words is not a complete collision and cannot substitute for the target. The relevance of an adaptation remains unresolved.","assumptions_md":"Both members must be distinct arbitrary byte strings of at most 1024 bytes, hashed completely with standard IV and exact padding; all digest bits must agree and total bytes determines the objective. Earlier blocks must be counted in both lengths. Reachability of the required CV family, simultaneous paired trajectory constraints, feed-forward equality, padding, and a useful total-byte/work comparison are absent from the accepted scope. No collision lower bound or closure follows from the all-zeros generic matching model. Missing typed scopes also prevents validated transfer. This records a gap, without requesting an experiment or another review.","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":7386,"input_sha256":"525680d7252f447de584cac163135cf609f49c3ccf994c09998fc9333d8d6d7e","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"a7f67ebf0d6ad1cef0a5c8ec0c28fa293f65f7e3d9fa19e45ee6f79ec1810f93","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2635,"material_evidence":{"sha256":"4e908c838743bd09c2f9173c684382d9d3881f47d84f682cff024e2ac0ac2233","entries":{"return:2635":"dbbc575d7768031693bed5dfd759f58f3673b19ab97ba0e49c37fec5a8f22566","finding:100776":"d8de8a37a97155935185b072abf0bb0355a94cbb3d16e36ec2bc0fb968b8f5ba","artifact:2635:1e94eee62e0acd2e184a13ed6244b5065e2309eaaf3684acbf7c3be7c4e413dd":"1e94eee62e0acd2e184a13ed6244b5065e2309eaaf3684acbf7c3be7c4e413dd","artifact:2635:1ee6a39a4655dd97c20436399b01c87fa29e30afb608232658331828a5288e07":"1ee6a39a4655dd97c20436399b01c87fa29e30afb608232658331828a5288e07","artifact:2635:2eb866e8d1a7cbf494b8fb782aefb838d202dcda647042ef703519d7eebe0cef":"2eb866e8d1a7cbf494b8fb782aefb838d202dcda647042ef703519d7eebe0cef","artifact:2635:47331c2a955fda8616847581ba5226f1520fd32696cbb56cd64b7565f7066a1d":"47331c2a955fda8616847581ba5226f1520fd32696cbb56cd64b7565f7066a1d","artifact:2635:6fe6dd1fb93405fe2f8dc1b8291ec3bca01fd9b82a89fd153373f143a78ccbbe":"6fe6dd1fb93405fe2f8dc1b8291ec3bca01fd9b82a89fd153373f143a78ccbbe","artifact:2635:92c86a5dc74225674de90be959ceca9503775e8c1bcf1b734ba1fbfa3760890a":"92c86a5dc74225674de90be959ceca9503775e8c1bcf1b734ba1fbfa3760890a","artifact:2635:a1c318d714c98eb91c00dba874d87eddbd3acd144ea99908bd575b49d3194d93":"a1c318d714c98eb91c00dba874d87eddbd3acd144ea99908bd575b49d3194d93","artifact:2635:e2a2452b78b5d092901e8e8f2360e9e9a701ea83fa8b8f4964877ea7c714f304":"e2a2452b78b5d092901e8e8f2360e9e9a701ea83fa8b8f4964877ea7c714f304"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2635,"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 #2635: 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\":2635,\"report_sha256\":\"a7f67ebf0d6ad1cef0a5c8ec0c28fa293f65f7e3d9fa19e45ee6f79ec1810f93\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2635\":\"dbbc575d7768031693bed5dfd759f58f3673b19ab97ba0e49c37fec5a8f22566\",\"finding:100776\":\"d8de8a37a97155935185b072abf0bb0355a94cbb3d16e36ec2bc0fb968b8f5ba\",\"artifact:2635:1e94eee62e0acd2e184a13ed6244b5065e2309eaaf3684acbf7c3be7c4e413dd\":\"1e94eee62e0acd2e184a13ed6244b5065e2309eaaf3684acbf7c3be7c4e413dd\",\"artifact:2635:1ee6a39a4655dd97c20436399b01c87fa29e30afb608232658331828a5288e07\":\"1ee6a39a4655dd97c20436399b01c87fa29e30afb608232658331828a5288e07\",\"artifact:2635:2eb866e8d1a7cbf494b8fb782aefb838d202dcda647042ef703519d7eebe0cef\":\"2eb866e8d1a7cbf494b8fb782aefb838d202dcda647042ef703519d7eebe0cef\",\"artifact:2635:47331c2a955fda8616847581ba5226f1520fd32696cbb56cd64b7565f7066a1d\":\"47331c2a955fda8616847581ba5226f1520fd32696cbb56cd64b7565f7066a1d\",\"artifact:2635:6fe6dd1fb93405fe2f8dc1b8291ec3bca01fd9b82a89fd153373f143a78ccbbe\":\"6fe6dd1fb93405fe2f8dc1b8291ec3bca01fd9b82a89fd153373f143a78ccbbe\",\"artifact:2635:92c86a5dc74225674de90be959ceca9503775e8c1bcf1b734ba1fbfa3760890a\":\"92c86a5dc74225674de90be959ceca9503775e8c1bcf1b734ba1fbfa3760890a\",\"artifact:2635:a1c318d714c98eb91c00dba874d87eddbd3acd144ea99908bd575b49d3194d93\":\"a1c318d714c98eb91c00dba874d87eddbd3acd144ea99908bd575b49d3194d93\",\"artifact:2635:e2a2452b78b5d092901e8e8f2360e9e9a701ea83fa8b8f4964877ea7c714f304\":\"e2a2452b78b5d092901e8e8f2360e9e9a701ea83fa8b8f4964877ea7c714f304\"},\"sha256\":\"4e908c838743bd09c2f9173c684382d9d3881f47d84f682cff024e2ac0ac2233\"},\"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:2635,input_sha256:\"525680d7252f447de584cac163135cf609f49c3ccf994c09998fc9333d8d6d7e\",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/4242/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"34ec511d8efd5af0bc4fa78434de1dbe98740b22653957e42c837166182205ca","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}