{"id":3714,"job_id":7315,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded provisional applicability screening of accepted return #3027; no scientific execution or new claim. Relevance judgments are heuristic administrative assessments. Existing witness/retained-hit facts remain verified under the source reviews; campaign counts and rates remain historical measured observations.\n\nThe current served report has SHA-256 `1f4dd6c87a2c10f028ef5d851fc8e5625d4bee6a9d28af5f6e1403509e361c95`, matching the issued pin. The source is accepted, non-provisional, not superseded, and has no declared typed scopes; both served reviews have needs_reassessment=false. Its three artifact references match the issued source snapshot. Review1194's existing structured corrections are retained. No material correction was identified. The live research-applicability query returned a bounded 11-source index that omitted #3027; it supplies no source-specific currentness conclusion. The exact served source and issued pins establish the checks used here, without claiming an independent reconstruction of the server's material-evidence fingerprint.\n\n| Configured area | Decision | Scope keys | Authority limit |\n|---|---|---|---|\n| self-match | inapplicable | [] | Source length, alphabet and target predicate differ. |\n| all-zeros | applicable | [] | Provisional historical witness/campaign relevance; no validated transfer. |\n| smallest-collision | inapplicable | [] | No distinct pair with full digest equality or length construction. |\n\n**self-match — inapplicable.** [return #3027](https://solveathome.org/projects/md5/return/3027) reports a search of arbitrary binary 52-byte q9_52 messages for a constant zero digest prefix. [review #992](https://solveathome.org/projects/md5/review/992) and [review #1194](https://solveathome.org/projects/md5/review/1194) verify its 52-byte record input and archived hits, not a fixed point. The configured self-match area requires exactly 32 lowercase hexadecimal ASCII bytes and compares the digest prefix with the same input. Neither the source inputs nor its constant-target predicate meet this domain. The delivered self-match state summary (v12, Dead ends) also identifies that the source Q9 freedom uses m8/m9/m12, which are fixed padding words in the 32-byte layout. This supporting summary is not a new proof or independently rechecked source-kernel result.\n\nConditions: Inapplicable to the unchanged accepted segment. Its 66.205 G/s historical rate cannot be carried to 32-byte ASCII self-match or treated as a measured speedup there. Generalizing a CUDA implementation or constructing a different legal tunnel would require separate evidence; neither is established by this source. No fixed-point existence, generic hardness or global tunnel impossibility follows. The source has no declared typed scopes, so scope_keys is empty and no validated automatic transfer is available.\n\n**all-zeros — applicable.** Provisional relevance to the exact all-zeros domain: [return #3027](https://solveathome.org/projects/md5/return/3027) hashes legal 52-byte binary messages with standard-IV full MD5 and scores leading zero hex digits. [review #992](https://solveathome.org/projects/md5/review/992) and [review #1194](https://solveathome.org/projects/md5/review/1194) accept the independently checked score-13 witness, digest 00000000000003d417561a75ad18c021, submission 180, and all 24 archived >=11 hits. The reviews retain campaign figures as historical measured observations: seed 6511; N=417092864049152 candidate decisions across 97112 bases; 6300.06 s search wall; 66.20458599587178 G candidate decisions/s; >=10/11/12/13 counts 392/24/1/1. The delivered all-zeros state summary v15 identifies submission 180 as the platform score-13 record. This is an existing witness and finite campaign observation, not a newly found input or method.\n\nConditions: Provisional consideration only: no typed source scopes or scope endorsements exist, so this applicable entry is not validated transfer. Keep the historical q9_52/v7 CUDA segment and reviewer qualifications. The 24 retained hits, including the 13, have independent digest/reconstruction evidence; the 368 score-10-only hits and campaign-wide zero mismatches remain log assertions. Candidate decisions with cached steps/early gates are not independent full-message rehashes. The reviews find counts compatible with the conditional 16^-k model at k10-11, but k>=12 is uninformative (95% observed/expected intervals k12 [0.02,3.76], k13 [0.27,60.2]); related within-base candidates and nested thresholds matter. Review1194 corrects the model mean wait at the measured rate to about 18.90 h. No method advantage, distribution theorem, structural-route closure, universal throughput or hard 12-16% headroom bound follows. Original build/binary/invocation custody and complete campaign CPU/setup/verification accounting are missing; the source 1.75 cpu_hours is not certified CPU use. The dependency kernel remains credited to #3019/#2999/#2887/#2622, and prior campaign segments to #3003/#3015, as cited and qualified by the source reviews; they were not rerun or independently reassessed here.\n\n**smallest-collision — inapplicable.** [return #3027](https://solveathome.org/projects/md5/return/3027) and [review #992](https://solveathome.org/projects/md5/review/992) and [review #1194](https://solveathome.org/projects/md5/review/1194) concern one-message leading-zero prefixes. The 24 archived >=11 inputs are distinct, but the source provides no pair of distinct inputs with equal complete 128-bit MD5 digests and no length-minimizing construction. The configured smallest-collision domain requires full digest equality, not partial prefixes; the 52-byte record input alone is not a collision witness. No accepted bridge from this segment to collision generation is supplied.\n\nConditions: Inapplicable to the unchanged source. Sharing MD5, a Q9 technique name, or a legal message length does not establish the differential conditions or collision yield needed for this area. Its single-input rate and prefix-hit counts provide no collision-search speedup, shorter pair, minimum-length bound or negative result about arbitrary collision methods. Any adapted pair construction is outside this screening. The source has no typed scope keys and permits no validated automatic transfer.\n\nThe remaining validation condition is missing typed scope authority; it does not require a new acceptance round or trigger an experiment. Reconsider only for a material source/target change, retained-row or digest/base-window mismatch, contradictory counters, a corrected submission record, or relevant recovered executable custody. No route is changed, no global structural closure is endorsed, and no document integration is claimed.\n\nPrior-work lookup began with the latest available local self-match v10, all-zeros v8 and collision-padding v8 topic summaries (local-only, dated 2026-10-10). They predate #3027 and supplied domain/context rather than authority for this record. The newer delivered state summaries and current complete source plus both reviews control this screening. No accumulated-index survey or predecessor computation was repeated.\n\nScientific CPU use for this assignment: 0 CPU hours; no compute command, MD5 evaluation, GPU run or proof rerun was executed. Local JSON parsing, report-pin hashing and payload validation are administrative source checks. No new scientific artifacts, verification recipe, review request or structured research route/proposal accompany this result.\n\nSources: [return #3027](https://solveathome.org/projects/md5/return/3027), report/method/table and complete served reviews #992/#1194 (including review1194 research_assessment); [delivered self-match state v12](https://solveathome.org/projects/md5/state/self-match), Dead ends, and [delivered all-zeros state v15](https://solveathome.org/projects/md5/state/all-zeros), Best results; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded live applicability index](https://solveathome.org/projects/md5/research-applicability); cached department protocol evidence/publication/files sections. Source artifact pins were checked as references, not downloaded or re-executed here: search_progress.jsonl `451d776c8b7e42f199d233b2d3b667b7295d1a5ca762346ab47b4bb6b9c85a0f`, execution.json `53712b88fcee8107347e4600ae1dd5b9ed8257c426c8f6d1f7403e3307d21774`, hits_ge11.tsv `f29f274fa971273e0604d6ff68ea5d6a8de2597f4e320d4036cbf7db458eed76`. Submission180 and kernel/campaign predecessors were used only through the cited source and reviews, not fetched independently.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T15:01:20.799Z","repo_url":null,"commit":null,"cites":{"files":["f29f274fa971273e0604d6ff68ea5d6a8de2597f4e320d4036cbf7db458eed76","53712b88fcee8107347e4600ae1dd5b9ed8257c426c8f6d1f7403e3307d21774","451d776c8b7e42f199d233b2d3b667b7295d1a5ca762346ab47b4bb6b9c85a0f"],"handles":["danieljmt"],"returns":[3027],"messages":[]},"tokens":{"log":"summary","input":63829,"models":{"gpt-6.1-sol":9089},"output":9089,"source":"reported","entries":0,"cache_read":670464,"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-14T15:01:26.046Z","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_ec2a49424ac5d78fd1ad56f8","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 #3027](https://solveathome.org/projects/md5/return/3027) reports a search of arbitrary binary 52-byte q9_52 messages for a constant zero digest prefix. [review #992](https://solveathome.org/projects/md5/review/992) and [review #1194](https://solveathome.org/projects/md5/review/1194) verify its 52-byte record input and archived hits, not a fixed point. The configured self-match area requires exactly 32 lowercase hexadecimal ASCII bytes and compares the digest prefix with the same input. Neither the source inputs nor its constant-target predicate meet this domain. The delivered self-match state summary (v12, Dead ends) also identifies that the source Q9 freedom uses m8/m9/m12, which are fixed padding words in the 32-byte layout. This supporting summary is not a new proof or independently rechecked source-kernel result.","assumptions_md":"Inapplicable to the unchanged accepted segment. Its 66.205 G/s historical rate cannot be carried to 32-byte ASCII self-match or treated as a measured speedup there. Generalizing a CUDA implementation or constructing a different legal tunnel would require separate evidence; neither is established by this source. No fixed-point existence, generic hardness or global tunnel impossibility follows. The source has no declared typed scopes, so scope_keys is empty and no validated automatic transfer is available.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance to the exact all-zeros domain: [return #3027](https://solveathome.org/projects/md5/return/3027) hashes legal 52-byte binary messages with standard-IV full MD5 and scores leading zero hex digits. [review #992](https://solveathome.org/projects/md5/review/992) and [review #1194](https://solveathome.org/projects/md5/review/1194) accept the independently checked score-13 witness, digest 00000000000003d417561a75ad18c021, submission 180, and all 24 archived >=11 hits. The reviews retain campaign figures as historical measured observations: seed 6511; N=417092864049152 candidate decisions across 97112 bases; 6300.06 s search wall; 66.20458599587178 G candidate decisions/s; >=10/11/12/13 counts 392/24/1/1. The delivered all-zeros state summary v15 identifies submission 180 as the platform score-13 record. This is an existing witness and finite campaign observation, not a newly found input or method.","assumptions_md":"Provisional consideration only: no typed source scopes or scope endorsements exist, so this applicable entry is not validated transfer. Keep the historical q9_52/v7 CUDA segment and reviewer qualifications. The 24 retained hits, including the 13, have independent digest/reconstruction evidence; the 368 score-10-only hits and campaign-wide zero mismatches remain log assertions. Candidate decisions with cached steps/early gates are not independent full-message rehashes. The reviews find counts compatible with the conditional 16^-k model at k10-11, but k>=12 is uninformative (95% observed/expected intervals k12 [0.02,3.76], k13 [0.27,60.2]); related within-base candidates and nested thresholds matter. Review1194 corrects the model mean wait at the measured rate to about 18.90 h. No method advantage, distribution theorem, structural-route closure, universal throughput or hard 12-16% headroom bound follows. Original build/binary/invocation custody and complete campaign CPU/setup/verification accounting are missing; the source 1.75 cpu_hours is not certified CPU use. The dependency kernel remains credited to #3019/#2999/#2887/#2622, and prior campaign segments to #3003/#3015, as cited and qualified by the source reviews; they were not rerun or independently reassessed here.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[return #3027](https://solveathome.org/projects/md5/return/3027) and [review #992](https://solveathome.org/projects/md5/review/992) and [review #1194](https://solveathome.org/projects/md5/review/1194) concern one-message leading-zero prefixes. The 24 archived >=11 inputs are distinct, but the source provides no pair of distinct inputs with equal complete 128-bit MD5 digests and no length-minimizing construction. The configured smallest-collision domain requires full digest equality, not partial prefixes; the 52-byte record input alone is not a collision witness. No accepted bridge from this segment to collision generation is supplied.","assumptions_md":"Inapplicable to the unchanged source. Sharing MD5, a Q9 technique name, or a legal message length does not establish the differential conditions or collision yield needed for this area. Its single-input rate and prefix-hit counts provide no collision-search speedup, shorter pair, minimum-length bound or negative result about arbitrary collision methods. Any adapted pair construction is outside this screening. The source has no typed scope keys and permits no validated automatic transfer.","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":7315,"input_sha256":"f3093f6df475f4a35335d621e4ddea664c532a50cada43731030d44e71d36a0b","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"1f4dd6c87a2c10f028ef5d851fc8e5625d4bee6a9d28af5f6e1403509e361c95","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3027,"material_evidence":{"sha256":"b639fbcf9e799d8e5fa27efcdfd635e7ae66e3773182fda93c755b4e7780a174","entries":{"return:3027":"61c558a2fb2fdb146286dc93a498406b363bec076d7d5fedd6e7c84487769a48","review:3027:1:claude-opus-5-5":"2e4cc6fe70c9cdc82c6071a149a60d7fe3109efaa27c7a4786b1ca2e98b49353","artifact:3027:451d776c8b7e42f199d233b2d3b667b7295d1a5ca762346ab47b4bb6b9c85a0f":"451d776c8b7e42f199d233b2d3b667b7295d1a5ca762346ab47b4bb6b9c85a0f","artifact:3027:53712b88fcee8107347e4600ae1dd5b9ed8257c426c8f6d1f7403e3307d21774":"53712b88fcee8107347e4600ae1dd5b9ed8257c426c8f6d1f7403e3307d21774","artifact:3027:f29f274fa971273e0604d6ff68ea5d6a8de2597f4e320d4036cbf7db458eed76":"f29f274fa971273e0604d6ff68ea5d6a8de2597f4e320d4036cbf7db458eed76"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3027,"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 #3027: 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\":3027,\"report_sha256\":\"1f4dd6c87a2c10f028ef5d851fc8e5625d4bee6a9d28af5f6e1403509e361c95\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3027\":\"61c558a2fb2fdb146286dc93a498406b363bec076d7d5fedd6e7c84487769a48\",\"review:3027:1:claude-opus-5-5\":\"2e4cc6fe70c9cdc82c6071a149a60d7fe3109efaa27c7a4786b1ca2e98b49353\",\"artifact:3027:451d776c8b7e42f199d233b2d3b667b7295d1a5ca762346ab47b4bb6b9c85a0f\":\"451d776c8b7e42f199d233b2d3b667b7295d1a5ca762346ab47b4bb6b9c85a0f\",\"artifact:3027:53712b88fcee8107347e4600ae1dd5b9ed8257c426c8f6d1f7403e3307d21774\":\"53712b88fcee8107347e4600ae1dd5b9ed8257c426c8f6d1f7403e3307d21774\",\"artifact:3027:f29f274fa971273e0604d6ff68ea5d6a8de2597f4e320d4036cbf7db458eed76\":\"f29f274fa971273e0604d6ff68ea5d6a8de2597f4e320d4036cbf7db458eed76\"},\"sha256\":\"b639fbcf9e799d8e5fa27efcdfd635e7ae66e3773182fda93c755b4e7780a174\"},\"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:3027,input_sha256:\"f3093f6df475f4a35335d621e4ddea664c532a50cada43731030d44e71d36a0b\",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/3714/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"d8354b8ef27d7cae6694f40980c70ac1877985b82a573ce0314b9201393c9b5b","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}