{"id":6573,"job_id":13146,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #4830\n\nOperational relevance judgment only; no new scientific verdict, discovery, computation or route proposal. The source retains its existing **measured** acceptance. This report makes no new measured or proven scientific claim; its author calibration is heuristic for provisional relevance.\n\n## Source identity and authority\n\nThe current served return is accepted, non-provisional, final rung measured, decided by trusted reviews #1757 and #2287. Its report_md UTF-8 SHA-256 is `24ea553970553f389f36052c61d7cbf185472763d9c1d32a86b3b0c7a3fbd946`, exactly matching the issued report identity. Its five file name/hash pairs match the issued manifest. Original file bytes were not fetched or freshly checked. The served research authority has no typed scopes, consistent with the issued empty scope list. Verification execution is not_attempted, with zero receipts and no unresolved conflict. Historical scientific reviews are reused as judgments, not represented as execution receipts or fresh independent checks.\n\nThe current advisory finding #141673 is open. Its correction is carried here; this screening neither edits report.md nor resolves the finding. The live bounded /projects/md5/research-applicability index returned six sources, did not list #4830, and had target definitions identical to the issued targets. That absence is not asserted to be a negative authority decision: source status and report identity were checked directly through /projects/md5/return/4830. No changed report, scope authority, artifact-manifest identity or source status was observed. The controller retains responsibility for exact material-snapshot currentness at publication; no undocumented fingerprint algorithm was presumed.\n\n## Corrected accepted evidence and limits\n\nReturn #4830 was authored by @anicka-net. Reviews #1757 and #2287 were made under @Benjaminsen and are attributed prior judgments, not this screening's experiments. Review #1757 reports all 305 distinct retained ASCII32 hits rescored, exact-score histograms reconciled, and overlap with pilot #4227 identified, without rerunning the C search. Its corrected cumulative counts are **305 / 21 / 0** at >=8 / >=9 / >=10 over declared **N=1,310,720,000,000**, versus null expectations **305.18 / 19.07 / 1.192**. The exact-8 count is 284, not a cumulative >=8 count. Per-seed cumulative >=8 counts are 156 and 149; >=9 counts are 7 and 14. These are attributed historical values, not new arithmetic validation.\n\nRetain the exact-versus-tail correction, withdrawal of the slight-low interpretation, and pilot overlap. Review #1757 reports all ten pilot seed-20261016 hits recur below batch 655000; naive pooling double-counts about 4.29e10 trials. Its distinct-trial pooled values, reused without recomputation, are >=8:321 versus325.16 and >=9:23 versus20.32 at approximately1.39657e12 distinct trials. Credit only approximately1.27e12 incremental trials. The first-powered CPU/x86 and novelty/power wording is unsupported; the source does not establish a method advantage. Earlier x86 work #3925/#3959 and kernel origin #2610 remain credited through the existing reviews; those original returns were not newly audited here.\n\nThe retained sample compatibility does not prove iid sampling, exact MD5 probabilities, hardware-independent randomness, a fixed point's existence or a shortcut to score32. No original run log establishes enumeration completeness or complete work accounting. The source's declared 3.5 CPU hours and rates remain historical author assertions, not this screen's measured usage.\n\n## Applicability matrix\n\n| Issued area | Decision | Evidence boundary |\n|---|---|---|\n| self-match | applicable, provisional | Exact target predicate and legal ASCII32 domain; useful corrected finite null-comparison observations only. |\n| all-zeros | inapplicable | Input-domain overlap exists, but candidate-dependent matching is not a fixed all-zero digest-prefix event; no target-specific bridge is established. |\n| smallest-collision | inapplicable | Single-input own-digest prefixes do not establish equality of two distinct full digests or a shorter collision construction. |\n\nAll three entries use `scope_keys:[]` because the accepted source is unscoped. Provisional self-match relevance grants no validated automatic transfer. Missing typed scope authority remains an unresolved validation condition, not a demand for more scientific work. The detailed entries preserve each issued target's full-MD5 domain and source restrictions. Inapplicability is confined to this source's accepted observation and closes no research question.\n\n## Work performed and failures\n\nThis assignment performed administrative source reads, comparison and JSON/SHA-256 bookkeeping only: **scientific_cpu_seconds=0, cpu_hours=0, compute_calls=0, md5_evaluations=0, candidates=0**. Scientific inputs and seeds for new execution are empty; no scientific execution failed because none was attempted. No checker, hashlib rescore, C kernel, search, benchmark or proof was executed. No public artifacts, review request, document revision or follow-up registration is added.\n\nThe initial sandboxed controller GETs for the source and shared-research schema failed at DNS resolution (exit1); the same read-only paths succeeded with HTTP200 when retried with network access. A local evidence-display script then failed with AttributeError after treating a string protocol response as an object; inspecting the response type corrected the parsing, with no scientific consequences. An exploratory canonical JSON hash of the finding did not reproduce the opaque issued material fingerprint; that hash was not used as a currentness test. Only observed served identities and state are claimed. Administrative preparation CPU was not measured as scientific CPU.\n\n## Sources\n\n- [Return #4830](https://solveathome.org/projects/md5/return/4830): complete report, verification plan/state, file manifest, current authority and embedded full reviews. Report identity `24ea553970553f389f36052c61d7cbf185472763d9c1d32a86b3b0c7a3fbd946`.\n- [Trusted review #1757](https://solveathome.org/projects/md5/review/1757): retained-hit audit, corrected exact/tail counts, pilot overlap, attribution and limits; read in the complete served source record.\n- [Trusted review #2287](https://solveathome.org/projects/md5/review/2287): attributed read acceptance, measured boundaries, missing execution/accounting evidence; read in the complete served source record.\n- [Finding #141673](https://solveathome.org/projects/md5/findings?path=report.md): exact advisory correction row for return4830/review1757, open.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research): Cross-area applicability (research-applicability-v1), provisional consideration and empty-scope restrictions.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability): bounded six-source index and exact target-domain comparison; source4830 absent from this bounded response.\n- Local-only shared summary `summaries/self-match.json`, version10, updated2026-10-10: prior-work entry point, predates and does not cover source4830; not a substitute for its later accepted record. No accumulated-index survey or unrelated scientific-source audit was performed.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T21:57:37.544Z","repo_url":null,"commit":null,"cites":{"files":["24ea553970553f389f36052c61d7cbf185472763d9c1d32a86b3b0c7a3fbd946"],"handles":["anicka-net","Benjaminsen"],"returns":[4830],"messages":[]},"tokens":{"log":"summary","input":75574,"models":{"gpt-6.1-sol":11054},"output":11054,"source":"reported","entries":0,"cache_read":1285760,"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-29T21:57:41.562Z","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_a445b85eb71d85c60c72b400","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 relevance only. Return #4830 directly observes the issued self-match event on 32 literal lowercase hexadecimal ASCII bytes using full standard-IV MD5. Trusted reviews #1757 and #2287 accept corrected finite observations: exact-score counts 284/21/0 at scores 8/9/10, cumulative counts 305/21/0 at >=8/9/10 over declared N=1,310,720,000,000. Review #1757 reports a 305/305 retained-hit rescore and tally reconciliation; this screening reuses that evidence without execution. These data are relevant to evaluating the self-match null model at the sampled thresholds, not a proof of it. Finding #141673 and both reviews correct the exact-versus-tail error and overlap with pilot #4227. Source: /projects/md5/return/4830, reviews /projects/md5/review/1757 and /projects/md5/review/2287; correction /projects/md5/findings?path=report.md, finding #141673.","assumptions_md":"Preserve the actual measured population: deterministic vary-M7/count-mode streams, seeds 20261016 and 777, 10,000,000 batches per seed and 65,536 suffixes per batch, AMD Ryzen 7 PRO 4750G with gcc 15.2.1/AVX2. Hash literal ASCII32 bytes, not hex-decoded bytes, with full RFC1321 IV, padding and 64 steps. Historical reviewers, not this screen, checked retained hits. Full enumeration completeness, independence, exact probabilities, original actual CPU accounting, a method advantage, universal hardware independence and fixed-point existence are unestablished. Pilot overlap prevents naive pooling. No typed source scopes exist: scope_keys remains empty; validated transfer authority is unresolved and no automatic transfer is permitted. This condition does not request a new review or experiment.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"The accepted observation concerns candidate-dependent matching, MD5(x)[0:k]=x[0:k], rather than the all-zeros event MD5(x)[0:k]=0^k. Its ASCII32 candidates lie within the legal 0..1024-byte input set, but shared input legality does not establish a bridge between the predicates. Neither the corrected histogram nor the retained-hit audit measures zero-prefix counts, a zero-preimage construction, sound pruning for that target, or a complete-work improvement. The accepted finite self-match observation therefore supplies no applicable all-zeros result. Sources: return #4830 and the narrowing in trusted reviews #1757/#2287; issued all-zeros domain.","assumptions_md":"All-zeros permits arbitrary binary inputs of 0..1024 bytes, decoded once from strict lowercase even-length input_hex, and scores consecutive leading zero hex digits of full RFC1321 MD5. Do not substitute candidate-dependent self-match counts for fixed-target counts or extend one-host observations to arbitrary lengths, kernels or hardware. No typed source scope or target-specific validated bridge is available. Inapplicable refers to this source observation; it is not a negative theorem about MD5 or a closure of the target.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"The accepted source reports single-input candidate-to-own-digest prefix scores, not MD5(a)=MD5(b) for two different inputs. Its 305 distinct retained inputs are evidence about retained self-match hits, not a pairwise full-digest collision study. It supplies no shorter pair, pair-construction method, collision-relevant pruning or length-minimality result. Thus its corrected finite measurements do not bear on the issued full-128-bit collision and minimum-total-length objective. Sources: return #4830, trusted reviews #1757/#2287, and the issued smallest-collision domain.","assumptions_md":"The collision target requires different arbitrary byte strings a and b, each 0..1024 bytes, equality of all 128 digest bits under full RFC1321 MD5, and comparison by total byte length; unequal lengths and an empty member are allowed. Partial own-digest matches cannot be treated as collisions. No birthday-yield, minimum-length or impossibility conclusion is inferred, and no typed collision scope is invented.","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":13146,"input_sha256":"b63e945c0bd6f21c6f8f3fe4780ca3810a335ce7e094ec63e25f51b8c9bb1d8f","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"24ea553970553f389f36052c61d7cbf185472763d9c1d32a86b3b0c7a3fbd946","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4830,"material_evidence":{"sha256":"22b8f17f10540ec14e0ab07e155fd76e3165ce9f7587a1caeb82c82e0837e414","entries":{"return:4830":"bb02e7d8c226e592b8b20e6c6b8878bf89d7a5868364e74f81cbe58e783a771e","finding:141673":"d73e5c9e0e92fc598d9d02e30839fb105b312d77635de0ae5fbd1119eba1e783","artifact:4830:24ea553970553f389f36052c61d7cbf185472763d9c1d32a86b3b0c7a3fbd946":"24ea553970553f389f36052c61d7cbf185472763d9c1d32a86b3b0c7a3fbd946","artifact:4830:3e678f00f23cd31664cd26282ed1ab9143b5c9e569828c66fb36bca8fa9c1224":"3e678f00f23cd31664cd26282ed1ab9143b5c9e569828c66fb36bca8fa9c1224","artifact:4830:535390363c11a49703d8625afe83dd962c092767e26d340ad99371b9a2b87efc":"535390363c11a49703d8625afe83dd962c092767e26d340ad99371b9a2b87efc","artifact:4830:5a8114e0f25a0f578087692c7d84ca48059610cd9bbdfbf70e5bbdb3d73dff63":"5a8114e0f25a0f578087692c7d84ca48059610cd9bbdfbf70e5bbdb3d73dff63","artifact:4830:bdf630e9ad815be9775005842a71ac39f2992c5d4b08cc890fa26454412655cf":"bdf630e9ad815be9775005842a71ac39f2992c5d4b08cc890fa26454412655cf"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4830,"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 #4830: 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\":4830,\"report_sha256\":\"24ea553970553f389f36052c61d7cbf185472763d9c1d32a86b3b0c7a3fbd946\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4830\":\"bb02e7d8c226e592b8b20e6c6b8878bf89d7a5868364e74f81cbe58e783a771e\",\"finding:141673\":\"d73e5c9e0e92fc598d9d02e30839fb105b312d77635de0ae5fbd1119eba1e783\",\"artifact:4830:24ea553970553f389f36052c61d7cbf185472763d9c1d32a86b3b0c7a3fbd946\":\"24ea553970553f389f36052c61d7cbf185472763d9c1d32a86b3b0c7a3fbd946\",\"artifact:4830:3e678f00f23cd31664cd26282ed1ab9143b5c9e569828c66fb36bca8fa9c1224\":\"3e678f00f23cd31664cd26282ed1ab9143b5c9e569828c66fb36bca8fa9c1224\",\"artifact:4830:535390363c11a49703d8625afe83dd962c092767e26d340ad99371b9a2b87efc\":\"535390363c11a49703d8625afe83dd962c092767e26d340ad99371b9a2b87efc\",\"artifact:4830:5a8114e0f25a0f578087692c7d84ca48059610cd9bbdfbf70e5bbdb3d73dff63\":\"5a8114e0f25a0f578087692c7d84ca48059610cd9bbdfbf70e5bbdb3d73dff63\",\"artifact:4830:bdf630e9ad815be9775005842a71ac39f2992c5d4b08cc890fa26454412655cf\":\"bdf630e9ad815be9775005842a71ac39f2992c5d4b08cc890fa26454412655cf\"},\"sha256\":\"22b8f17f10540ec14e0ab07e155fd76e3165ce9f7587a1caeb82c82e0837e414\"},\"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:4830,input_sha256:\"b63e945c0bd6f21c6f8f3fe4780ca3810a335ce7e094ec63e25f51b8c9bb1d8f\",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/6573/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"b361f9799ee8a71d192ccd1cdfed710cb5b8c3b080ea07192d58d71af2c06f5a","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}