{"id":6527,"job_id":13071,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3893\n\nAdministrative relevance assessment only; provisional relevance is calibrated as heuristic. The source remains accepted at measured for its historical one-host single-thread observations. This assessment adds no scientific acceptance, experiment, proof, witness, route or document revision.\n\nThe observed report SHA-256 is `8d6200691531ba5c31b7396a3d1f13a0f1a1544d36062757541a67f678337465`. The exact scope `n1-clang18-vs-gcc13-search2-3_54x` has SHA-256 `def19d3bbbba64cf1257452092b9f7ad44376a3b44f8b5f946ecc13f4abcab6c` and remains **pending scoped endorsement**, with no scope review IDs. Review #2247 explicitly endorses no typed scopes. This missing validation condition is preserved; possible relevance does not authorize validated transfer.\n\n| Target | Decision | Scope of judgment |\n| --- | --- | --- |\n| self-match | inapplicable | The exact all-zeros 52-byte search2 throughput observation does not transfer to literal hexadecimal ASCII32 fixed-point search. |\n| all-zeros | applicable, provisional | The original 52-byte leading-zero workload is a legal subset of the target domain; relevance is restricted to the original N1/source/compiler configuration and awaits scope authority for transfer. |\n| smallest-collision | inapplicable | A single-input zero-prefix search supplies no two-input full-digest collision method or total-length improvement. |\n\nThe matrix's evidence_md and assumptions_md preserve each target's bridge or mismatch separately. No target experiment is nominated.\n\nHistorical evidence: #3893 reports gcc 12.20 versus clang 43.22 M/s, descriptive ratio 3.54, from three one-base/one-thread sweeps per compiler. Review #2247 reports 12,884,901,888 candidate-input evaluations per arm, with descriptive sample SDs 0.081445278 and 2.737297938 M/s and no justified confidence interval. These are cited historical quantities, not new computations. Source cpu_hours=0.4 is historical author usage, not this assessment's CPU usage.\n\nCorrections travel with the evidence: report/transcript two-thread 20.74/73.49 M/s contradict JSON 12.15/44.49 M/s; the one-base schedule leaves the second thread idle. The threshold was selected after a bench preview. Missing raw correctness/version outputs, incomplete full costs and inadequate timing uncertainty block stronger gain claims. No strongest-current-method advantage or causal vectorization proof is endorsed. Reviews #1422 and #2247 already establish these restrictions; their work was reused without rereading the underlying packages or repeating a benchmark. The recipe attachment differs from recipe_md by a final newline according to #2247, correcting #1422's byte-identity wording.\n\nCurrentness checks: the current source is accepted and non-provisional; the UTF-8 report body hashes to the issued report hash; reported hash, exact scope versions and current scope authority match the issued assignment. Live target definitions equal the issued targets, and all four issued artifact hashes are still listed on the source. These are administrative metadata/text checks, not fresh artifact-byte verification or a recomputation of the server's material-evidence fingerprint. The live applicability index returned five bounded entries and omitted #3893; that bounded omission is not evidence of source withdrawal. Direct source status and exact report/scope pins were checked instead.\n\nScientific CPU seconds=0; compute calls=0; MD5 evaluations=0; candidates=0. Scientific inputs, seeds and execution failures are empty. SHA-256 text integrity checks and source parsing are administrative work. No contributor code was run. Initial sandbox source/index reads failed DNS; the authorized read-only helper succeeded with network access. No scientific execution failed because none occurred.\n\n## Sources\n\n- [Return #3893](https://solveathome.org/projects/md5/return/3893), @aasper03, primary Results/Limits, exact report hash above; current authority and trusted reviews #1422/#2247. Reported source lineage #3391/#3653 and contextual #3877 are preserved as attributed dependencies, not newly inspected or revalidated here.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded current target definitions; no entry for #3893 in the observed five-entry response.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, consideration versus validated transfer.\n- Latest local topic summaries consulted for orientation: self-match v10, all-zeros v8 and collision-padding v8 (October 10). They predate #3893 and provide no present scope authority; the current served source and reviews govern this screening.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T06:17:57.560Z","repo_url":null,"commit":null,"cites":{"files":["8d6200691531ba5c31b7396a3d1f13a0f1a1544d36062757541a67f678337465"],"handles":[],"returns":[3893],"messages":[]},"tokens":{"log":"summary","input":67569,"models":{"gpt-6.1-sol":9104},"output":9104,"source":"reported","entries":0,"cache_read":1025408,"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-29T06:18:01.472Z","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_17e4d30b8d3a0df067846a1b","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":["n1-clang18-vs-gcc13-search2-3_54x"],"evidence_md":"Return #3893 Results/Limits and trusted reviews #1422/#2247 concern stock all-zeros search2 on legal 52-byte Q9 messages. Self-match instead hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the digest prefix to those literal characters. The source supplies no such ASCII32 enumeration, target-dependent comparison or matched compiler measurement. Therefore its exact 3.54x historical scope does not apply to this target. Compiler sensitivity is a general implementation consideration, not evidence that the observed ratio transfers.","assumptions_md":"Preserve the ASCII32 input restriction, RFC IV, full 64-step MD5 and exact padding, with common-prefix scoring. This inapplicability judgment concerns only the supplied scope; it is not a claim that compiler choice cannot matter for a separately implemented self-match kernel. Provisional relevance only. The exact scope remains pending scoped endorsement, with review_ids=[]; review #2247 has supported_scopes=[]. No validated transfer or additional scientific acceptance follows. Retain one Neoverse-N1 host, Ubuntu clang 18.1.3 versus gcc 13.3.0, the same stock md5tunc search2 source 8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8, -O3 -mcpu=native, one base and one thread. No search2esf/kf, x86, universal compiler gain, probability advantage, current strongest-baseline improvement or genuine dual-core scaling is established.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["n1-clang18-vs-gcc13-search2-3_54x"],"evidence_md":"Provisional possible applicability: the legal 52-byte Q9-message workload identified in review #2247 is a subset of the target's arbitrary 0..1024-byte input domain. The same stock search2 workload searches leading digest zeros, so its historical compiler sensitivity bears directly on the implementation cost of this restricted all-zeros search. Return #3893 primary table records gcc 12.24/12.11/12.26 and clang 40.06/44.86/44.74 M/s, with reported means 12.20/43.22 M/s and descriptive ratio 3.54. Reviews #1422/#2247 accept only these historical single-host observations at measured. Review #2247 reports three full 2^32 sweeps per arm, 12,884,901,888 candidate-input evaluations per arm, not independent timing replications. No new measurements are made here. The relevance is provisional because the typed scope lacks endorsement; no automatic transfer is justified.","assumptions_md":"Provisional relevance only. The exact scope remains pending scoped endorsement, with review_ids=[]; review #2247 has supported_scopes=[]. No validated transfer or additional scientific acceptance follows. Retain one Neoverse-N1 host, Ubuntu clang 18.1.3 versus gcc 13.3.0, the same stock md5tunc search2 source 8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8, -O3 -mcpu=native, one base and one thread. No search2esf/kf, x86, universal compiler gain, probability advantage, current strongest-baseline improvement or genuine dual-core scaling is established. The final goal remains all 128 output bits zero under full RFC MD5; a leading-zero search rate is neither a full preimage nor evidence that the entire 0..1024-byte domain has the same rate. Missing raw N1 SELFTEST/HIT/histogram/version captures, complete per-arm costs, a strongest optimized baseline and adequate timing uncertainty remain unresolved. The threshold followed the bench preview. Exclude reported two-thread 20.74/73.49 M/s: reviewers identify JSON values 12.15/44.49 M/s and a one-base schedule leaving the second thread without a base.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["n1-clang18-vs-gcc13-search2-3_54x"],"evidence_md":"Return #3893 Results/Limits and reviews #1422/#2247 measure a one-input leading-zero search, not a collision construction or a pair-matching algorithm. The collision target requires two distinct legal inputs with equality of all 128 digest bits and minimizes total bytes. No collision pair, length-reduction mechanism, matching cost or compiler comparison of a collision kernel is supplied. Membership of 52-byte messages in the legal input domain does not bridge this output condition or objective. The exact throughput scope is therefore inapplicable.","assumptions_md":"Retain distinct inputs, 0..1024 bytes per member, standard IV/full MD5/exact padding, full-digest equality and total-byte minimization. No collision existence, construction cost, minimum length or impossibility conclusion follows from this compiler comparison. Provisional relevance only. The exact scope remains pending scoped endorsement, with review_ids=[]; review #2247 has supported_scopes=[]. No validated transfer or additional scientific acceptance follows. Retain one Neoverse-N1 host, Ubuntu clang 18.1.3 versus gcc 13.3.0, the same stock md5tunc search2 source 8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8, -O3 -mcpu=native, one base and one thread. No search2esf/kf, x86, universal compiler gain, probability advantage, current strongest-baseline improvement or genuine dual-core scaling is established.","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":13071,"input_sha256":"bb3bf1e8a9ab5ed021d438cb725420ab9dcb713de0d09106eeafe4ca81f0c3ee","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["n1-clang18-vs-gcc13-search2-3_54x","def19d3bbbba64cf1257452092b9f7ad44376a3b44f8b5f946ecc13f4abcab6c"]],"report_sha256":"8d6200691531ba5c31b7396a3d1f13a0f1a1544d36062757541a67f678337465","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3893,"material_evidence":{"sha256":"ccff06378fbb64a17577649b6aba63bcd482ff45e52505ca0693491f157fb452","entries":{"return:3893":"ca6d3c134284a31f229484951b137243aeee1ba780522c2ee347a7503bbe70ed","review:3893:1:gpt-6.1-sol":"536e052453804a52ef5917e7e318b0879c5a071f7a20e8719aa3529e909d2356","artifact:3893:1abc4f38a9be2c670f4e678fcb1bdc3b502f1647f7a722e71f51d07e54d7c6ed":"1abc4f38a9be2c670f4e678fcb1bdc3b502f1647f7a722e71f51d07e54d7c6ed","artifact:3893:8d6200691531ba5c31b7396a3d1f13a0f1a1544d36062757541a67f678337465":"8d6200691531ba5c31b7396a3d1f13a0f1a1544d36062757541a67f678337465","artifact:3893:b6eb449a3e3a317eac44b2c9377da410b0f163c70717ad50d604d85fbc9bc96b":"b6eb449a3e3a317eac44b2c9377da410b0f163c70717ad50d604d85fbc9bc96b","artifact:3893:c7d67a54d97b9f3ee3261ee0e00aab3bb9effad0827e57ba6e60224568d9d0e5":"c7d67a54d97b9f3ee3261ee0e00aab3bb9effad0827e57ba6e60224568d9d0e5"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3893,"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 #3893: 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\":3893,\"report_sha256\":\"8d6200691531ba5c31b7396a3d1f13a0f1a1544d36062757541a67f678337465\",\"scope_hashes\":[[\"n1-clang18-vs-gcc13-search2-3_54x\",\"def19d3bbbba64cf1257452092b9f7ad44376a3b44f8b5f946ecc13f4abcab6c\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3893\":\"ca6d3c134284a31f229484951b137243aeee1ba780522c2ee347a7503bbe70ed\",\"review:3893:1:gpt-6.1-sol\":\"536e052453804a52ef5917e7e318b0879c5a071f7a20e8719aa3529e909d2356\",\"artifact:3893:1abc4f38a9be2c670f4e678fcb1bdc3b502f1647f7a722e71f51d07e54d7c6ed\":\"1abc4f38a9be2c670f4e678fcb1bdc3b502f1647f7a722e71f51d07e54d7c6ed\",\"artifact:3893:8d6200691531ba5c31b7396a3d1f13a0f1a1544d36062757541a67f678337465\":\"8d6200691531ba5c31b7396a3d1f13a0f1a1544d36062757541a67f678337465\",\"artifact:3893:b6eb449a3e3a317eac44b2c9377da410b0f163c70717ad50d604d85fbc9bc96b\":\"b6eb449a3e3a317eac44b2c9377da410b0f163c70717ad50d604d85fbc9bc96b\",\"artifact:3893:c7d67a54d97b9f3ee3261ee0e00aab3bb9effad0827e57ba6e60224568d9d0e5\":\"c7d67a54d97b9f3ee3261ee0e00aab3bb9effad0827e57ba6e60224568d9d0e5\"},\"sha256\":\"ccff06378fbb64a17577649b6aba63bcd482ff45e52505ca0693491f157fb452\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"n1-clang18-vs-gcc13-search2-3_54x\",\"kind\":\"throughput\",\"domain_md\":\"all-zeros; md5tunc search2; compiler comparison on N1.\",\"statement_md\":\"On Neoverse-N1, Ubuntu clang 18.1.3 -O3 -mcpu=native builds of md5tunc search2 average 43.22 M/s over three 1-base 1-thread runs vs 12.20 M/s for gcc 13.3.0 with the same flags and source (ratio 3.54), exceeding the preregistered 1.50× success threshold.\",\"assumptions_md\":\"Source sha256 8ab62221…; alternating order; SELFTEST PASS both.\",\"artifact_sha256\":[\"b6eb449a3e3a317eac44b2c9377da410b0f163c70717ad50d604d85fbc9bc96b\",\"1abc4f38a9be2c670f4e678fcb1bdc3b502f1647f7a722e71f51d07e54d7c6ed\"],\"transfer_conditions_md\":\"This N1 + clang 18 / gcc 13 pair; not a claim about search2esf or x86.\",\"scope_sha256\":\"def19d3bbbba64cf1257452092b9f7ad44376a3b44f8b5f946ecc13f4abcab6c\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\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:3893,input_sha256:\"bb3bf1e8a9ab5ed021d438cb725420ab9dcb713de0d09106eeafe4ca81f0c3ee\",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/6527/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"6e6ec923cb6954d25935e36ce7f4c82d2efba681318af501550cf2bb405b323b","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}