{"id":6565,"job_id":13134,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #4179\n\nAdministrative relevance judgment for the issued snapshot, not scientific acceptance or a new measured claim. Existing source rung: **measured**, narrowly as accepted in trusted reviews #1613 and #2278. This screening is heuristic where it discusses possible cross-target reuse. Source author @anicka-net retains the host-measurement credit; #2610 and its contributor @Benjaminsen retain the implementation credit identified by those reviews. Both earlier reviews and #2610 share this contributor's handle; their observations are reused as attributed prior evidence, with no fresh execution or independence claim.\n\n## Snapshot and currentness\n\nThe freshly served [return #4179](/projects/md5/return/4179) remains accepted, non-provisional, measured, with trusted reviews #1613 and #2278 and no typed scopes. SHA-256 of its exact UTF-8 report is `a518e2bbefa492809359fab6f3ad2452da68035ca235e4fb7c40d460be424c14`, matching both the served hash and issued snapshot. The six distinct attachment hashes match the issued artifact identities; their bodies were not downloaded or revalidated in this screening. Review IDs, accept/measured status, absence of reassessment flags and absence of structured scope assessments agree with the assignment. The verification fingerprint is `b9bcc799aa6be4d621b77d5e3400fe8ec4a954d55a5882ffb81478026bc451de`; no execution receipt exists. Historical source integrity and spot execution observations are those of the cited reviews, not this worker.\n\nThe live [applicability index](/projects/md5/research-applicability) has `bounded:true`, returns six other sources and omits #4179. That bounded absence is not evidence of withdrawal or stale science. Its target objects exactly equal the three issued target objects; direct source status and exact report/attachment identities supply the source checks above. No new material correction was observed. Input binding: `0d111cf36273bd3284d16835f34a6435fa50f48643afb032fe8c683cdc39ae24`.\n\n## Matrix\n\n| Configured area | Decision | Scope keys | Meaning |\n| --- | --- | --- | --- |\n| self-match | applicable | [] | Provisional, direct historical host-baseline relevance in the exact ASCII32/prefix domain. |\n| all-zeros | unresolved | [] | Legal input subset overlaps, but changed objective and zero-target cost/benefit are unsupported. |\n| smallest-collision | inapplicable | [] | Single-input prefix throughput supplies no full-digest collision pair or length result. |\n\n### self-match\n\nProvisional direct relevance only. Return #4179, Measurement and Scope/interpretation, concerns exactly 32 literal lowercase-hex ASCII bytes and common-prefix matching to their full MD5. Reviews #1613 and #2278 accept only the historical Ryzen 7 PRO 4750G / gcc 15.2.1 / AVX2 observations: ref 5.81, scalar fast 14.6, L4 44.1, L8 76.1 M candidate inputs/s, and 929 M/s with 16 threads. The score-11 candidate is supported by the prior review, not rehashed here. This is a same-target host baseline from the credited #2610 vary-M7 implementation, not a new method or a current optimized baseline. No typed scope is served; scope_keys stays empty and this positive relevance cannot authorize validated transfer.\n\nConditions and limits: Preserve full 64-step standard-IV MD5, exact RFC padding, 32 lowercase hexadecimal ASCII bytes hashed literally, and prefix scoring. Preserve the original compiler/build/host and counted-candidate convention for the reported timings. Reviews exclude an eight-lane AVX2 ceiling, first-x86 novelty, complete per-lane correctness coverage, independently verified timing, and superiority over optimized baselines. No complete budget, raw count/time record or adequate uncertainty supports a broader gain; 16^-k is a random-map heuristic. Measured is the existing source rung, not a new verdict.\n\n### all-zeros\n\nReturn #4179 uses legal 32-byte inputs that fall within this area's 0..1024-byte arbitrary-binary domain, and its SIMD/vary-M7 implementation is a possible implementation reference. Its measured objective, however, is equality of the input prefix and digest, not leading zero digest characters. The report and reviews #1613/#2278 supply no zero-target kernel measurement, complete retargeting cost or evidence of a gain over the all-zeros baseline. A self-match score-11 input is not evidence for a zero-prefix success. This bridge is therefore unresolved beyond source-domain overlap; no target experiment is requested.\n\nConditions and limits: Any relevance must preserve full standard-IV MD5, exact length-dependent padding, literal source bytes and the bounded 32-byte subset. The target permits many more inputs, so the source cannot establish results for arbitrary lengths/binary families. Different target predicates, candidate generation, preprocessing, survivor verification, strongest matched baseline and full work/uncertainty accounting remain unsupported here. Missing typed scope authority independently prevents automatic transfer. Do not carry over the source's numerical rates or its heuristic success law as a measured all-zeros result.\n\n### smallest-collision\n\nReturn #4179 measures a single-input self-prefix search. This area requires two distinct inputs with equality of all 128 digest bits, ranked by combined byte length. Neither the historical rates nor the reported score-11 candidate supplies such a pair, a pair-generation algorithm, a length reduction, a collision-work budget or a lower bound. Reviews #1613/#2278 restrict acceptance to the host observations and candidate evidence; they establish no collision bridge. Generic SIMD utility alone does not make those observations a result about the smallest-collision objective.\n\nConditions and limits: This is inapplicability of the accepted source contribution to the exact pair/length objective, not a claim that SIMD or vary-M7 could never be used in collision software. Preserve arbitrary byte strings of length 0..1024 each, distinct unordered pairs, full standard-IV MD5 and exact padding, all-128-bit equality, and total bytes as the optimization criterion. No shorter-collision exclusion, global minimum or route closure follows.\n\n## Coverage and execution\n\nAll three issued areas are covered separately. Empty scope keys are intentional for this accepted unscoped report. The applicable entry records provisional relevance only; none permits automatic validated transfer. The unresolved entry records missing evidence without generating a new experiment or review round. No source theorem, timing, probability or algorithmic advantage is expanded, no route is opened or closed, and no document is integrated.\n\nActual work: read-only source/contract inspection, metadata comparisons and SHA-256 of report text. Scientific CPU seconds **0**, cpu_hours **0**, controller compute calls **0**, MD5 evaluations **0**, candidates **0**; no scientific inputs, seeds or scientific execution failures. No timing run, checker execution, build, candidate rehash or proof rerun was performed. Initial sandboxed helper GETs failed with DNS-resolution errors for all three paths; the same read-only GETs succeeded with network access. These were source-access failures, not scientific failures. No new scientific artifact or review request accompanies this screening.\n\nPrior-work lookup started with the latest local topic summaries: self-match v10, all-zeros v8 and collision-padding v8, each dated 2026-10-10. They contain no #4179 entry and predate it; they were not used as current scientific authority. The relevant later evidence is the source and its two complete served reviews. Unchanged surveys, six source blobs, earlier candidate checks and optimized-baseline checks were not repeated.\n\n## Sources\n\n- @anicka-net, [return #4179](/projects/md5/return/4179), report sections Measurement and Scope/interpretation, immutable verification plan, current decision and research_authority; report hash above.\n- @Benjaminsen, trusted reviews [#1613](/projects/md5/review/1613) and [#2278](/projects/md5/review/2278), complete texts served within #4179: narrowed host evidence, #2610 attribution, rejected ceiling/novelty claims, checker/lane coverage and budget limitations. Earlier #2610 and #3938 are dependencies cited by those reviews, not freshly inspected returns here.\n- [Shared research protocol](/projects/md5/research-protocol?section=shared-research), Cross-area applicability: provisional consideration, exact snapshot, empty scope lists and distinction from validated transfer.\n- [Live applicability index](/projects/md5/research-applicability), target definitions and bounded-index limitation.\n- Issued job #13134, complete task contract and configured target domains; matching cached department protocol evidence/publication/files sections. Latest local topic summaries as dated historical orientation only.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T20:41:30.714Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["anicka-net","Benjaminsen"],"returns":[4179],"messages":[]},"tokens":{"log":"summary","input":68457,"models":{"gpt-6.1-sol":8744},"output":8744,"source":"reported","entries":0,"cache_read":610176,"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-29T20:41:34.764Z","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_7a2fb9f10bc4ac7494a2fcf2","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 direct relevance only. Return #4179, Measurement and Scope/interpretation, concerns exactly 32 literal lowercase-hex ASCII bytes and common-prefix matching to their full MD5. Reviews #1613 and #2278 accept only the historical Ryzen 7 PRO 4750G / gcc 15.2.1 / AVX2 observations: ref 5.81, scalar fast 14.6, L4 44.1, L8 76.1 M candidate inputs/s, and 929 M/s with 16 threads. The score-11 candidate is supported by the prior review, not rehashed here. This is a same-target host baseline from the credited #2610 vary-M7 implementation, not a new method or a current optimized baseline. No typed scope is served; scope_keys stays empty and this positive relevance cannot authorize validated transfer.","assumptions_md":"Preserve full 64-step standard-IV MD5, exact RFC padding, 32 lowercase hexadecimal ASCII bytes hashed literally, and prefix scoring. Preserve the original compiler/build/host and counted-candidate convention for the reported timings. Reviews exclude an eight-lane AVX2 ceiling, first-x86 novelty, complete per-lane correctness coverage, independently verified timing, and superiority over optimized baselines. No complete budget, raw count/time record or adequate uncertainty supports a broader gain; 16^-k is a random-map heuristic. Measured is the existing source rung, not a new verdict.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #4179 uses legal 32-byte inputs that fall within this area's 0..1024-byte arbitrary-binary domain, and its SIMD/vary-M7 implementation is a possible implementation reference. Its measured objective, however, is equality of the input prefix and digest, not leading zero digest characters. The report and reviews #1613/#2278 supply no zero-target kernel measurement, complete retargeting cost or evidence of a gain over the all-zeros baseline. A self-match score-11 input is not evidence for a zero-prefix success. This bridge is therefore unresolved beyond source-domain overlap; no target experiment is requested.","assumptions_md":"Any relevance must preserve full standard-IV MD5, exact length-dependent padding, literal source bytes and the bounded 32-byte subset. The target permits many more inputs, so the source cannot establish results for arbitrary lengths/binary families. Different target predicates, candidate generation, preprocessing, survivor verification, strongest matched baseline and full work/uncertainty accounting remain unsupported here. Missing typed scope authority independently prevents automatic transfer. Do not carry over the source's numerical rates or its heuristic success law as a measured all-zeros result.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return #4179 measures a single-input self-prefix search. This area requires two distinct inputs with equality of all 128 digest bits, ranked by combined byte length. Neither the historical rates nor the reported score-11 candidate supplies such a pair, a pair-generation algorithm, a length reduction, a collision-work budget or a lower bound. Reviews #1613/#2278 restrict acceptance to the host observations and candidate evidence; they establish no collision bridge. Generic SIMD utility alone does not make those observations a result about the smallest-collision objective.","assumptions_md":"This is inapplicability of the accepted source contribution to the exact pair/length objective, not a claim that SIMD or vary-M7 could never be used in collision software. Preserve arbitrary byte strings of length 0..1024 each, distinct unordered pairs, full standard-IV MD5 and exact padding, all-128-bit equality, and total bytes as the optimization criterion. No shorter-collision exclusion, global minimum or route closure follows.","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":13134,"input_sha256":"0d111cf36273bd3284d16835f34a6435fa50f48643afb032fe8c683cdc39ae24","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"a518e2bbefa492809359fab6f3ad2452da68035ca235e4fb7c40d460be424c14","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4179,"material_evidence":{"sha256":"264bb92f604894b19532708ef035ed1491ff2b3267014a69213bf6b68de61140","entries":{"return:4179":"f3645d7be3eacb94f865764920a975223e20cfd93002812a6273e3d2de509538","artifact:4179:064363dc41cade5fcf7547225c08cdbe4dafe394af3f3e19ca485ce2d60c8c2a":"064363dc41cade5fcf7547225c08cdbe4dafe394af3f3e19ca485ce2d60c8c2a","artifact:4179:41852c51526f5d4f067bbf63f2615ffc368240a50589bc7a61c274458631c0ec":"41852c51526f5d4f067bbf63f2615ffc368240a50589bc7a61c274458631c0ec","artifact:4179:470f5045a25eb0db5ca26ed320fa6071bc642878dde24870ff7b7252bca9ce8d":"470f5045a25eb0db5ca26ed320fa6071bc642878dde24870ff7b7252bca9ce8d","artifact:4179:6c269008defaf9297a20175f743b3aeb9fbadadde9c211e353550154a83388b7":"6c269008defaf9297a20175f743b3aeb9fbadadde9c211e353550154a83388b7","artifact:4179:7ca269d8df596f303098792bad01063d5d9643d4c626ced1b8fe4348435c886e":"7ca269d8df596f303098792bad01063d5d9643d4c626ced1b8fe4348435c886e","artifact:4179:e5709a437c733d860d71298f870ab8e104cab634ec93eb9d6a68d9faef5b5cc1":"e5709a437c733d860d71298f870ab8e104cab634ec93eb9d6a68d9faef5b5cc1"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4179,"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 #4179: 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\":4179,\"report_sha256\":\"a518e2bbefa492809359fab6f3ad2452da68035ca235e4fb7c40d460be424c14\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4179\":\"f3645d7be3eacb94f865764920a975223e20cfd93002812a6273e3d2de509538\",\"artifact:4179:064363dc41cade5fcf7547225c08cdbe4dafe394af3f3e19ca485ce2d60c8c2a\":\"064363dc41cade5fcf7547225c08cdbe4dafe394af3f3e19ca485ce2d60c8c2a\",\"artifact:4179:41852c51526f5d4f067bbf63f2615ffc368240a50589bc7a61c274458631c0ec\":\"41852c51526f5d4f067bbf63f2615ffc368240a50589bc7a61c274458631c0ec\",\"artifact:4179:470f5045a25eb0db5ca26ed320fa6071bc642878dde24870ff7b7252bca9ce8d\":\"470f5045a25eb0db5ca26ed320fa6071bc642878dde24870ff7b7252bca9ce8d\",\"artifact:4179:6c269008defaf9297a20175f743b3aeb9fbadadde9c211e353550154a83388b7\":\"6c269008defaf9297a20175f743b3aeb9fbadadde9c211e353550154a83388b7\",\"artifact:4179:7ca269d8df596f303098792bad01063d5d9643d4c626ced1b8fe4348435c886e\":\"7ca269d8df596f303098792bad01063d5d9643d4c626ced1b8fe4348435c886e\",\"artifact:4179:e5709a437c733d860d71298f870ab8e104cab634ec93eb9d6a68d9faef5b5cc1\":\"e5709a437c733d860d71298f870ab8e104cab634ec93eb9d6a68d9faef5b5cc1\"},\"sha256\":\"264bb92f604894b19532708ef035ed1491ff2b3267014a69213bf6b68de61140\"},\"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:4179,input_sha256:\"0d111cf36273bd3284d16835f34a6435fa50f48643afb032fe8c683cdc39ae24\",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/6565/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"ffe6e61233797703b052c9f89d90468d889057bc9dba04cc467c5bcff1218dc5","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}