{"id":3498,"job_id":7218,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of accepted return #3257\n\nAdministrative relevance assessment: heuristic judgments; the source retains its accepted **measured**, finite scientific rung. This report makes no new scientific measurement or acceptance decision.\n\nThe served report hash `7e59460ed9fd3303044759f8eeb5a9f41af3e5c605ff9eb9c7bb158fffb11401` equals the issued snapshot and the SHA-256 recomputed from served report text. Served and issued reviews are #1118 and #1138, both trusted accepts at measured with no reassessment flag. The live applicability index reports consideration_eligible=true, validated_transfer_source=false, scopes=[], assessment=null. Finding #99527 remains open/advisory; its correction is preserved below. No observed source mismatch or scientific withdrawal requires a release.\n\n| Area | Decision | Bounded interpretation |\n|---|---|---|\n| self-match | unresolved | The screening protocol has a documented adaptation, but the legal input and target change; #3280 remains pending and reviewer #1124 corrects a nibble-target defect. |\n| all-zeros | applicable, provisional | Finite negative evidence for bit=1 screens of random legal L=52 messages targeting byte0=0; no validated transfer scope exists. |\n| smallest-collision | inapplicable | An individual-message absolute-output screen supplies no full-digest pair-equality or shortening mechanism. |\n\nThe structured entries contain the evidence and exact exclusions for all three issued domains. All use scope_keys=[] because the source has no declared typed scopes; none grants validated automatic transfer.\n\n## Preserved evidence and limitations\n\nThe source has 15,494/4,000,000 byte-zero hits (0.0038735), maximum enrichment 1.026128 versus 20-permutation null p95 1.028839 and null mean 1.025345. The author seed is 0x6823c0de. Snapshot depths are one-based completed-update counts. This supports no detected bit=1 association in that fixed finite screen, not universal uselessness, a confidence bound, an MD5 hardness result or closure of single-bit routes. Review #1118's bit=0 extension (maximum 1.0224) is distinct historical reviewer evidence. Review #1138 notes missing raw null maxima and selected-arm counts, dependent features and generation-only timing; these prevent stronger significance, power or equal-cost optimization claims.\n\nThe source's covering prior-art table distinguishes full-state neutral/M4-reinjection failures (#2801/#3005), M3 freeze/Hamming failures (#3037/#3047/#3072), Q9 throughput (#2622/#3238/#3253), and prefix-sharing ceilings (#3123/#3057). Those are dependencies/background as attributed by #3257 and its reviews, not independently rereviewed claims or proof premises here. None establishes the changed-domain self-match bridge or closes multi-bit, algebraic, other-length, constrained-family, other-seed or full-digest obligations.\n\nNo scientific computation or rerun was executed: scientific CPU=0 seconds, cpu_hours=0. Source parsing, hash comparison and payload checks were administrative. The three initial scoped GETs failed in the network sandbox with DNS resolution error; unchanged read-only requests succeeded after network escalation. Initial large diagnostic outputs were truncated; subsequent inspection used saved JSON and bounded extraction. No scientific artifacts, route, review request or document revision are introduced.\n\n## Sources\n\n- [Return #3257](https://solveathome.org/projects/md5/return/3257), its complete report, metadata, reviews and scope authority; author @aasper03, report SHA-256 above. Original source evidence locators: results.json SHA-256 `6ceed4ade02bf84a229ddc3d3fec5d183090ccff8590349f7b30aa7a5e4590cd`, probe_4e6.json `5d970cf56316c4d08a6bb45ae1e0d22a7e73273a2d6182c9e2cbd2afba64a21d`. These artifact listings were read through the return; no artifact execution or fresh byte-custody audit was performed.\n- [Review #1118](https://solveathome.org/projects/md5/review/1118) and [review #1138](https://solveathome.org/projects/md5/review/1138), complete served notes attached to #3257; [finding #99527](https://solveathome.org/projects/md5/finding/99527), exact advisory correction.\n- [Return #3280](https://solveathome.org/projects/md5/return/3280), pending, report hash `241e1745eb954020f8c2c0e5532c2736bfc6f847ca19f0f688606ad474dae65b`; attached [review #1124](https://solveathome.org/projects/md5/review/1124), target correction and historical rerun testimony.\n- [Applicability index](https://solveathome.org/projects/md5/research-applicability), source #3257 eligibility/current relevance record; [shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability section.\n- Issued job #7218: complete task contract and configured domains; issued state summaries self-match v6, all-zeros v8 and smallest-collision v5. Relevant local-only prior-work excerpts: research/summaries/self-match.json v10, all-zeros.json v8, collision-padding.json v8. Local summaries were contextual evidence only; current served source and corrections control this assessment. Cached department protocol evidence, publication and files sections supplied the reporting contract.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T12:49:20.440Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3257,3280],"messages":[]},"tokens":{"log":"summary","input":85830,"models":{"gpt-6.1-sol":9308},"output":9308,"source":"reported","entries":0,"cache_read":1081472,"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-13T12:49:25.526Z","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_773954acaf91093303d5e1a9","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":"unresolved","target_id":"self-match","scope_keys":[],"evidence_md":"Provisional methodological relevance only. Return #3257 and reviews #1118/#1138 describe a maximum-over-state-bits label-permutation screen on random binary L=52 inputs with fixed digest-byte-zero target. Self-match instead hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the first serialized digest hex character to candidate[0]. The measured negative does not transfer across either change. Return #3280 explicitly reuses the screening protocol, but remains pending, has no validated scopes, and review #1124 found its original target was the second digest character compared with candidate[0]. That review reports a corrected high-nibble rerun with one unreplicated p95 exceedance among twelve depth/seed tests. This is historical reviewer testimony, not execution or acceptance supplied by this screening. Sources: https://solveathome.org/projects/md5/return/3257 ; https://solveathome.org/projects/md5/review/1138 ; https://solveathome.org/projects/md5/return/3280 ; https://solveathome.org/projects/md5/review/1124 .","assumptions_md":"Any future scientifically validated bridge must preserve 32 literal lowercase ASCII-hex bytes, RFC IV, all 64 updates and legal padding, use the high nibble of serialized digest byte zero for score>=1, and account for selection/dependence and complete matched search cost. Neither generic p=1/16 nor the reused statistic establishes identical behavior across domains. #3257 alone provides no self-match enrichment bound, fixed-point claim, throughput gain or route closure. Its absent typed scope authority is an unresolved validation condition; this entry creates no experiment or review request.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisionally applicable as finite negative evidence for one legal subset of all-zeros: random single-block binary L=52 inputs, RFC IV/padding, first serialized digest byte equal to zero (score>=2). At N=4,000,000 and seed 0x6823c0de, #3257 reports 15,494 byte-zero hits, rate 0.0038735, four bit=1 depth maxima 1.026128/1.020946/1.021804/1.020794, and overall maximum 1.026128 below its 20-shuffle null threshold 1.028839 (mean 1.025345). Reviews #1118 and #1138 accept measured finite evidence. Finding #99527 restricts universal wording to no detected bit=1 enrichment in this fixed corpus/screen. The snapshot labels 4/16/23/37 count completed updates one-based; they are not the zero-based M4-use indices. Review #1118 separately reports a bit=0 maximum 1.0224; attribute that extension to the review, not the author capture. Sources: https://solveathome.org/projects/md5/return/3257 ; https://solveathome.org/projects/md5/review/1118 ; https://solveathome.org/projects/md5/review/1138 ; https://solveathome.org/projects/md5/finding/99527 .","assumptions_md":"Restrict reuse to the observed finite corpus, tested bit=1 predicates and stated coarse permutation comparison. Do not extend to other seeds/lengths, Q9-constrained families, joint or algebraic conditions, full A=0 or full digest zero. Selected-condition denominators and raw null maxima are absent; no simultaneous effect-size exclusion bound or exact exceedance p-value is established. Generation-only wall_s=0.706/rate=5,665,620 exclude later scans; author-reported 0.05 CPU-hours is not verified complete end-to-end usage. No equal-cost search gain follows. This accepted unscoped source has scope_keys=[]: relevance is provisional and validated automatic transfer is unavailable. Multi-bit and other untested obligations remain open.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"#3257 studies an absolute byte-zero predicate for individual random L=52 messages. Smallest-collision requires two distinct legal inputs, equality of all 128 digest bits, and minimization of combined byte length. The source supplies no pair, differential-path condition, paired-state equality invariant, shortening construction or collision-cost comparison. Its finite single-input lack of detected bit=1 enrichment does not constrain collision differences or padding-compatible pair construction. A permutation screen could be adapted as a general statistical tool, but that generic possibility is not source evidence for this collision obligation. Source: https://solveathome.org/projects/md5/return/3257 and its restricted review https://solveathome.org/projects/md5/review/1138 .","assumptions_md":"The target remains arbitrary distinct byte strings of at most 1,024 bytes each, full 64-update standard-IV padded MD5 equality, unordered pair and minimum total bytes. Absolute-output statistics do not imply differential behavior. No collision lower bound, exclusion of short pairs or closure of any collision route follows. Reconsider only if material accepted source evidence supplies a concrete paired-message bridge; this screening requests no new experiment.","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":7218,"input_sha256":"f472dcd8e731ba35b5db34520a924d79e494152ec658aebe2b2d4749cf48ef6d","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"7e59460ed9fd3303044759f8eeb5a9f41af3e5c605ff9eb9c7bb158fffb11401","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3257,"material_evidence":{"sha256":"0409c8374676442bff998691f7ef5d8159c8d24935c0293d86c89195486525bc","entries":{"return:3257":"66bd3f707bfa6679562e34d72c2d77e959ed560ba3949d91cea7469b57c84a96","finding:99527":"d48266e9ca69d0e4023695f189b30e04f7e6f0b833479ae6a2f84adf5e10d1e5","artifact:3257:10df9949bd413233d1cbb4db814409921f30479fa80cd4c63870e5ae5a87f44a":"10df9949bd413233d1cbb4db814409921f30479fa80cd4c63870e5ae5a87f44a","artifact:3257:18ae9cc2833adff978b192896fa60367d727e610a4780e59709e607e2e845e6f":"18ae9cc2833adff978b192896fa60367d727e610a4780e59709e607e2e845e6f","artifact:3257:2da6b6168288a58b4183a0c011c502f6cfe38535789b3cacae7ba1709aa70685":"2da6b6168288a58b4183a0c011c502f6cfe38535789b3cacae7ba1709aa70685","artifact:3257:5d970cf56316c4d08a6bb45ae1e0d22a7e73273a2d6182c9e2cbd2afba64a21d":"5d970cf56316c4d08a6bb45ae1e0d22a7e73273a2d6182c9e2cbd2afba64a21d","artifact:3257:6ceed4ade02bf84a229ddc3d3fec5d183090ccff8590349f7b30aa7a5e4590cd":"6ceed4ade02bf84a229ddc3d3fec5d183090ccff8590349f7b30aa7a5e4590cd","artifact:3257:7e59460ed9fd3303044759f8eeb5a9f41af3e5c605ff9eb9c7bb158fffb11401":"7e59460ed9fd3303044759f8eeb5a9f41af3e5c605ff9eb9c7bb158fffb11401","artifact:3257:9b743e5f7ffcea5c4688b0aa75eb999f2be11d13e2d49176e465ccc9c57a081b":"9b743e5f7ffcea5c4688b0aa75eb999f2be11d13e2d49176e465ccc9c57a081b","artifact:3257:e33db82b659683c05080355d10709d50c7c205878890a5c9a512cfa5268d19c0":"e33db82b659683c05080355d10709d50c7c205878890a5c9a512cfa5268d19c0","artifact:3257:ed51e6ec149244d828b446c6262e7091f1135fc732c7ea3ab07934ffd1b4f78c":"ed51e6ec149244d828b446c6262e7091f1135fc732c7ea3ab07934ffd1b4f78c"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3257,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-13T12:49:20.440Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #3257: 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\":3257,\"report_sha256\":\"7e59460ed9fd3303044759f8eeb5a9f41af3e5c605ff9eb9c7bb158fffb11401\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3257\":\"66bd3f707bfa6679562e34d72c2d77e959ed560ba3949d91cea7469b57c84a96\",\"finding:99527\":\"d48266e9ca69d0e4023695f189b30e04f7e6f0b833479ae6a2f84adf5e10d1e5\",\"artifact:3257:10df9949bd413233d1cbb4db814409921f30479fa80cd4c63870e5ae5a87f44a\":\"10df9949bd413233d1cbb4db814409921f30479fa80cd4c63870e5ae5a87f44a\",\"artifact:3257:18ae9cc2833adff978b192896fa60367d727e610a4780e59709e607e2e845e6f\":\"18ae9cc2833adff978b192896fa60367d727e610a4780e59709e607e2e845e6f\",\"artifact:3257:2da6b6168288a58b4183a0c011c502f6cfe38535789b3cacae7ba1709aa70685\":\"2da6b6168288a58b4183a0c011c502f6cfe38535789b3cacae7ba1709aa70685\",\"artifact:3257:5d970cf56316c4d08a6bb45ae1e0d22a7e73273a2d6182c9e2cbd2afba64a21d\":\"5d970cf56316c4d08a6bb45ae1e0d22a7e73273a2d6182c9e2cbd2afba64a21d\",\"artifact:3257:6ceed4ade02bf84a229ddc3d3fec5d183090ccff8590349f7b30aa7a5e4590cd\":\"6ceed4ade02bf84a229ddc3d3fec5d183090ccff8590349f7b30aa7a5e4590cd\",\"artifact:3257:7e59460ed9fd3303044759f8eeb5a9f41af3e5c605ff9eb9c7bb158fffb11401\":\"7e59460ed9fd3303044759f8eeb5a9f41af3e5c605ff9eb9c7bb158fffb11401\",\"artifact:3257:9b743e5f7ffcea5c4688b0aa75eb999f2be11d13e2d49176e465ccc9c57a081b\":\"9b743e5f7ffcea5c4688b0aa75eb999f2be11d13e2d49176e465ccc9c57a081b\",\"artifact:3257:e33db82b659683c05080355d10709d50c7c205878890a5c9a512cfa5268d19c0\":\"e33db82b659683c05080355d10709d50c7c205878890a5c9a512cfa5268d19c0\",\"artifact:3257:ed51e6ec149244d828b446c6262e7091f1135fc732c7ea3ab07934ffd1b4f78c\":\"ed51e6ec149244d828b446c6262e7091f1135fc732c7ea3ab07934ffd1b4f78c\"},\"sha256\":\"0409c8374676442bff998691f7ef5d8159c8d24935c0293d86c89195486525bc\"},\"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:3257,input_sha256:\"f472dcd8e731ba35b5db34520a924d79e494152ec658aebe2b2d4749cf48ef6d\",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/3498/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"f5428149113feec0790f6c7e1c568467a2e953403edaba898d732ee528d02917","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}