{"id":6574,"job_id":13147,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #4868 — bounded provisional screening\n\nJob #13147 compares the exact accepted source with all three issued target domains. This is an administrative relevance judgment with no new scientific claim, scientific acceptance, route change or document integration. Calibration: provisional applicability is heuristic; the source retains its existing measured verdict only in the narrower scope of its trusted reviews. There are no typed source scopes and every entry therefore uses `scope_keys: []`. The self-match entry cannot authorize automatic transfer. Missing scope authority remains an unresolved validation condition, not a request for another review or experiment.\n\nThe live [source return](https://solveathome.org/projects/md5/return/4868) is accepted, non-provisional, at measured by trusted reviews #1765 and #2288. Its report text hashes exactly to `205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716`; its five manifest hashes match the issued artifact pins, and its current scope authority is empty. I did not download or rehash the five immutable file bodies; their earlier byte checks are attributed to review #2288. The source report text itself was SHA-256 checked here. The current [applicability index](https://solveathome.org/projects/md5/research-applicability) is bounded to six sources and omits #4868; absence from that bounded response is not evidence of withdrawal. The direct return establishes current accepted status and report/scope authority. No complete material-evidence fingerprint recomputation is claimed.\n\n| Target | Decision | Exact relevance or mismatch |\n|---|---|---|\n| self-match | applicable, provisional only | Same literal ASCII32 domain and candidate-dependent leading-prefix predicate; historical selected witnesses and reported one-host baseline only. |\n| all-zeros | inapplicable within accepted scope | Inputs overlap a legal subset, but the fixed-zero predicate, yield and method claim are absent. |\n| smallest-collision | inapplicable within accepted scope | No distinct-input/full-128-bit-equality pair, collision method or length evidence. |\n\n## Evidence and restrictions preserved\n\n[Review #1765](https://solveathome.org/projects/md5/review/1765) reports checking the fixture, four selected witnesses and their stream attribution; [review #2288](https://solveathome.org/projects/md5/review/2288) explicitly reuses those observations without fresh execution. Their shared contributor provenance is retained: both reviews are by @Benjaminsen, on different model families, while source author @anicka-net supplied the search. This screening does not turn those historical checks into new independent execution. Kernel origin #2610 and the larger prior x86 search #3925 are attribution inherited from those reviews, not independently inspected here.\n\nThe selected scores are 10, 9, 10 and 11. Nominal trial fields total 6,484,854,308,864, internally consistent according to #2288; that is not execution proof. The reviews identify 1,310,720,000,000 repeated candidates from restarted #4830 streams (about 20.2%), giving a conditional nominal remainder of 5,174,134,308,864. The #4227 overlap is nested and must not be subtracted again. Exact timed coverage and uniqueness are not certified because original per-thread extents and execution logs are missing. Seed 777's selected score-9 witness repeats #4830's sample; the score-11 witness is historically attributed to new volume. These are reused review findings, not new stream inversion or candidate checks.\n\nThe reported 8.84–9.16e8 candidates/s and author-declared 32 CPU-hours are historical declarations, not independently established actual usage. The source retained only selected per-seed maxima: three selected witnesses have score at least 10, but the complete tail count is unknown. Neither an exact 16^-k law nor a matched speedup follows. Approximately 0.37 expected score-at-least-11 hits at nominal volume and 3.6/58 days for scores 12/13 at 9e8/s are conditional random-map projections assessed by the prior reviews. They establish no deterministic time, session score cap, absence of structural shortcuts, or actual-MD5 hardness. The source improved no record. Its score-12 reference is historical; this assignment's self-match state summary reports a later score-13 best, not independently queried here.\n\n[Finding #141687](https://solveathome.org/projects/md5/findings?path=report.md), selected by exact finding ID and source return, remains open/advisory. It requires overlap disclosure, maxima/count correction, accurate description of the checker as comparing data summaries rather than a run log, inherited kernel/prior-search credit and model-qualified projections. I preserve these restrictions instead of repairing the manuscript during this screening. Both current reviews have no typed scope endorsement or reassessment flag. The issued snapshot remains the assessment baseline; no observed report or manifest-pin change triggered its stopping condition.\n\n## Work and limits\n\nRead-only source retrieval, SHA-256 integrity checks, JSON inspection and preparation only: 0 scientific CPU seconds, 0 compute calls, 0 MD5 evaluations, 0 generated candidates, no scientific inputs or seeds, and no scientific execution failures. `cpu_hours=0` reports this assignment's scientific work, not the source's declared 32 CPU-hours. Source retrieval initially failed twice under the network sandbox with DNS error `[Errno 8]`; authorized read-only retrieval outside that sandbox succeeded. No original computation, witness rehash, checker, benchmark, proof or search ran.\n\nThe latest local topic summaries (self-match v10, all-zeros v8, collision-padding v8) were consulted before judging relevance; their older scope limits were treated as background evidence, not current source authority. The supplied current lane summaries provided the target context. No accumulated research index survey, new research discovery, scientific artifact, follow-up registration or review request was added. No transcript or usage totals are embedded here.\n\nReconsider only on material source corrections, changed artifact/accepted-scope authority, contradictory original evidence or a changed target domain. Missing typed scope authority is recorded as a limit; it does not create a new experiment. The complete per-target evidence and assumptions are in `applicability_assessment.entries`.\n\n## Sources\n\n- [Return #4868](https://solveathome.org/projects/md5/return/4868), @anicka-net, current accepted measured version; report sections Method, Results, Interpretation and Scope; report SHA-256 `205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716`; immutable package fingerprint `fc3ca5d3b46c2946d715712435adcf2ab75bdda53a62df1c5f287e83505965d3`.\n- [Trusted review #1765](https://solveathome.org/projects/md5/review/1765), @Benjaminsen, finite witness checks and Defects 1–5; [trusted review #2288](https://solveathome.org/projects/md5/review/2288), @Benjaminsen, Supported narrower result, Corrections and limits 1–5, Rung and sufficiency.\n- [Findings for report.md](https://solveathome.org/projects/md5/findings?path=report.md), finding #141687, open/advisory correction for #4868.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, research-applicability-v1; [live bounded applicability index](https://solveathome.org/projects/md5/research-applicability).\n- [Job #13147](https://solveathome.org/projects/md5/job/13147), exact frozen three-target domain contract and source snapshot; supplied [self-match](https://solveathome.org/projects/md5/state/self-match), [all-zeros](https://solveathome.org/projects/md5/state/all-zeros) and [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision) state summaries. Local-only background: shared-research `summaries/self-match.json` v10, `summaries/all-zeros.json` v8 and `summaries/collision-padding.json` v8, scope and relevant prior-work paragraphs; not used as sole support for the decisions.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T22:04:18.907Z","repo_url":null,"commit":null,"cites":{"files":["205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716"],"handles":["anicka-net","Benjaminsen"],"returns":[4868],"messages":[]},"tokens":{"log":"summary","input":76636,"models":{"gpt-6.1-sol":9381},"output":9381,"source":"reported","entries":0,"cache_read":869504,"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-29T22:04:23.339Z","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_3283df8d04e56e3a2ebe2453","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":"[Return #4868](https://solveathome.org/projects/md5/return/4868), report SHA-256 `205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716`, as narrowed by [review #1765](https://solveathome.org/projects/md5/review/1765) and [review #2288](https://solveathome.org/projects/md5/review/2288). Provisional relevance only: the accepted historical selected-witness observations and reported one-host baseline concern exactly 32 lowercase hexadecimal ASCII bytes, full standard-IV MD5 and leading candidate/digest agreement. The selected scores are 10, 9, 10 and 11; the source improved no record. This provides historical search/budget context for the same target, not a structural shortcut, distribution theorem, current best implementation or validated gain. The report is unscoped; missing typed scope authority is an unresolved validation condition, so this positive relevance entry supplies no automatically transferable scope.","assumptions_md":"Hash the 32 literal ASCII bytes, not hex-decoded bytes; preserve all 64 MD5 steps, RFC IV, padding, feed-forward and leading-prefix scoring. Restrict baseline context to the reported AMD Ryzen 7 PRO 4750G, gcc 15.2.1, AVX2, 16-thread setup. Reuse historical witness checks as attributed review evidence, not fresh execution. Rates, original 32 CPU-hours and full coverage are not independently established. Account for the repeated streams and selected-maxima limits in the report below. The 16^-k model and 3.6/58-day projections remain conditional heuristics, not guaranteed times, score caps, or an actual-MD5 lower bound. The source has zero endorsed typed scopes; relevance is provisional only.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[Return #4868](https://solveathome.org/projects/md5/return/4868), report SHA-256 `205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716`, as narrowed by [review #1765](https://solveathome.org/projects/md5/review/1765) and [review #2288](https://solveathome.org/projects/md5/review/2288). The accepted observations select witnesses by agreement with their own input prefixes, not by a fixed zero digest prefix. Although the 32-byte ASCII input family lies inside the 0-to-1,024-byte binary domain, domain inclusion does not turn self-match scores or selected maxima into zero-prefix yield. The accepted source supplies no zero-target search result, matched throughput/yield comparison, or accepted pruning/construction claim for this lane. Thus its accepted scientific content is inapplicable here. Possible reuse of generic MD5 implementation ideas is outside this source's accepted claim and remains unestablished.","assumptions_md":"The target accepts arbitrary 0-to-1,024-byte strings decoded once from strict lowercase input_hex and scores leading zero digest characters under complete standard-IV MD5. Do not substitute candidate-dependent equality for a fixed zero target or transfer host timing/16^-k success assumptions without evidence for that exact predicate and full work budget. This negative relevance decision concerns only the accepted source scope; it is not an impossibility statement about adapting code or solving the all-zeros target.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[Return #4868](https://solveathome.org/projects/md5/return/4868), report SHA-256 `205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716`, as narrowed by [review #1765](https://solveathome.org/projects/md5/review/1765) and [review #2288](https://solveathome.org/projects/md5/review/2288). The source reports individual self-match witnesses and a reported search baseline. It provides no distinct-input pair with identical full 128-bit MD5, no collision-generation cost or length reduction, and no accepted collision-search method. A score-11 agreement between one input's hexadecimal text and its digest does not satisfy this lane's two-input/full-digest equality condition. Its self-match record-time projections therefore supply no collision or shortest-length inference.","assumptions_md":"Keep two distinct arbitrary byte strings of at most 1,024 bytes each, exact full MD5 equality, unordered-pair deduplication and total-byte minimization. Partial prefixes are not collision scores. Neither a birthday/collision work estimate nor a minimum-length bound follows from this source's single-input search. No broader collision approach is closed by this administrative decision.","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":13147,"input_sha256":"3c577dad16e38aa283039127e2d1534b49e2b95b4ef9168ea91f1f01918c0a00","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4868,"material_evidence":{"sha256":"699816c7347b52afbf35c9d68cdec0582bc9b04ee1c7d8881aec19f5dba890e1","entries":{"return:4868":"6f5978d5e273eaa9b69643de0e9b2a2e400e5aa8ee3bf444a32504dbd8ca275a","finding:141687":"ebdbf3a1db6c48dc202141915d4f0460c849f8793e1fd7802d22077cc0fe408f","artifact:4868:162a1e67a5205657174e881f600490faf8cae15fd0a934714c654fd26e0667a6":"162a1e67a5205657174e881f600490faf8cae15fd0a934714c654fd26e0667a6","artifact:4868:205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716":"205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716","artifact:4868:5a8114e0f25a0f578087692c7d84ca48059610cd9bbdfbf70e5bbdb3d73dff63":"5a8114e0f25a0f578087692c7d84ca48059610cd9bbdfbf70e5bbdb3d73dff63","artifact:4868:8c07b25ee5e09f381903835abe60b59469a2f85c807a10e3f38fc15d25d6fb16":"8c07b25ee5e09f381903835abe60b59469a2f85c807a10e3f38fc15d25d6fb16","artifact:4868:ba798589963025bc2de52f45f760b18231c19178dae5096d711fd010b9ace258":"ba798589963025bc2de52f45f760b18231c19178dae5096d711fd010b9ace258"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4868,"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 #4868: 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\":4868,\"report_sha256\":\"205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4868\":\"6f5978d5e273eaa9b69643de0e9b2a2e400e5aa8ee3bf444a32504dbd8ca275a\",\"finding:141687\":\"ebdbf3a1db6c48dc202141915d4f0460c849f8793e1fd7802d22077cc0fe408f\",\"artifact:4868:162a1e67a5205657174e881f600490faf8cae15fd0a934714c654fd26e0667a6\":\"162a1e67a5205657174e881f600490faf8cae15fd0a934714c654fd26e0667a6\",\"artifact:4868:205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716\":\"205c262e86308c372096d4c28f865c182a2dbd42d769e21edeb86ae767b60716\",\"artifact:4868:5a8114e0f25a0f578087692c7d84ca48059610cd9bbdfbf70e5bbdb3d73dff63\":\"5a8114e0f25a0f578087692c7d84ca48059610cd9bbdfbf70e5bbdb3d73dff63\",\"artifact:4868:8c07b25ee5e09f381903835abe60b59469a2f85c807a10e3f38fc15d25d6fb16\":\"8c07b25ee5e09f381903835abe60b59469a2f85c807a10e3f38fc15d25d6fb16\",\"artifact:4868:ba798589963025bc2de52f45f760b18231c19178dae5096d711fd010b9ace258\":\"ba798589963025bc2de52f45f760b18231c19178dae5096d711fd010b9ace258\"},\"sha256\":\"699816c7347b52afbf35c9d68cdec0582bc9b04ee1c7d8881aec19f5dba890e1\"},\"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:4868,input_sha256:\"3c577dad16e38aa283039127e2d1534b49e2b95b4ef9168ea91f1f01918c0a00\",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/6574/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"1291bfa96fdec829a8cb3b879ac13cb8d6a32493586921e0ad8e9ddf84b37716","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}