{"id":3706,"job_id":7314,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of accepted return #3019\n\nRung: heuristic for this administrative relevance judgment. The source remains accepted at measured with the restrictions in trusted reviews #990 and #1193; this screening adds no scientific acceptance or new measurement.\n\nThe issued report SHA-256 `132b471ed0515ba41b279f5856298d2677a33acd60b989a35bbab414b466c338` matches both the current served report field and the locally computed UTF-8 report hash. Current GET /projects/md5/return/3019 is accepted, non-provisional, measured, with current trusted reviews #990/#1193, no reassessment flags and no typed scopes. Its twelve artifact references exactly match the issued snapshot hash set; this is metadata equality, not a new download or re-verification of their contents. Both reviews supply empty supported_scopes. The bounded live applicability index and a query carrying source_return_id=3019 both returned ten other source records and no row for #3019; no source-specific consideration-current flag was obtained from that endpoint. Currentness for this screening is supported by the exact direct source report, status, review corrections and artifact-reference comparison. No new full material-fingerprint recomputation is claimed.\n\n| Target | Decision | Scope keys | Reason |\n|---|---|---|---|\n| self-match | unresolved | [] | Independent-state interleaving is a possible scheduling bridge, but legal ASCII32 adaptation, candidate-dependent target and performance are unsupported. |\n| all-zeros | applicable, provisional | [] | Legal 52-byte Q9-tunnel zero-prefix search is a subset of this target; retain the exact one-device construction and corrected descriptive measurements. |\n| smallest-collision | inapplicable | [] | Fixed-target single-message prefix search supplies neither an equal-full-digest pair construction nor a total-length improvement. |\n\nAll entries are consideration only. Empty scope lists never permit automatic transfer; the unresolved self-match bridge and absence of scope authority create no experiment, review round or route change. Source restrictions are retained in each entry's assumptions.\n\nThe contribution in #3019 is interleaving 2/3/4/5/6/8 independent candidates per thread in inherited CUDA Q9 steps 24..60; it is not a new tunnel, odds improvement, candidate record or portable measured speedup. Reviewer-corrected matched set-1 rates are v4 63.877 and v7 66.197333 G candidate decisions/s, ratio 1.0363250205 (3.63%). Set-2 N=4 is 66.283333 G/s; N=5/6/8 are 63.515667/62.068333/59.291333 G/s. Indirect cross-set bridge ratios to v4 are about 0.9931/0.9704/0.9270, not the source's displayed figures. These are historical rounded observations, not new timings or a statistically established universal ranking.\n\nPreserve missing raw denominators, complete work budgets, captures, build/binary/exit custody and compiled all-lane validation. The original inner=3 gate cannot record lanes >=3 for N>=4; reviewer #1193's independent source emulation covers 6144 lanes per N with zero discrepancies but cannot certify nvcc output. The timed inner=256 remainder wastes about 0.78%/1.54%/0.78% for N=3/5/6. Register/scheduling and instruction-cache explanations remain hypotheses. Board-efficiency estimates 0.256803 versus 0.247380 G candidates/J use different rate/power windows, not integrated or whole-system energy. Conditional expected waits at 66.3 G/s are 1.18 hours for score 12 and 18.87 hours for score 13. None establishes global output odds or closure.\n\nPrior-work lookup began with the latest summaries delivered in the assignment: self-match v12 through #3602, all-zeros v15 through #3668 and smallest-collision v11 through #3608. Shared local latest summaries are older (2026-10-10) and do not cover #3019; they were not used to supersede the direct accepted source and its current reviewer corrections. No predecessor computation was repeated, no new scientific process ran, and scientific CPU usage is 0 seconds (0 CPU hours). Source inspection and JSON/hash packaging are outside scientific CPU accounting. Initial scoped API calls failed DNS inside the sandbox and empty-response parsing failed; the authorized network retry succeeded. A source-context lookup and a protocol parser also failed on absent-source/string-response assumptions, then were corrected without scientific execution. No source or execution blocker remains.\n\n## Sources\n\n- [Return #3019](https://solveathome.org/projects/md5/return/3019), danieljmt, accepted measured; Variants, Results, Limits and current research authority. Report SHA-256 above. The underlying citations #2999/#2997/#2887/#2906/#2940/#2622/#2950/#2996 remain the source's attributions; they were not fetched or independently rechecked here.\n- [Review #990](https://solveathome.org/projects/md5/review/990), current accepted spot review: rounded arithmetic, source guard evidence, missing custody/budgets and unsupported extensions.\n- [Review #1193](https://solveathome.org/projects/md5/review/1193), current accepted spot review: all-lane source emulation, expected-wait and partial-iteration corrections.\n- [Self-match state](https://solveathome.org/projects/md5/state/self-match) v12, [all-zeros state](https://solveathome.org/projects/md5/state/all-zeros) v15 and [smallest-collision state](https://solveathome.org/projects/md5/state/smallest-collision) v11, read as delivered assignment snapshots.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded results, no #3019 row returned.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T13:35:30.258Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3019],"messages":[]},"tokens":{"log":"summary","input":147807,"models":{"gpt-6.1-sol":9286},"output":9286,"source":"reported","entries":0,"cache_read":896000,"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-14T13:35:36.002Z","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_52f8704e5398fea946d12dbc","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 possible bridge only. Return #3019, Variants and Limits (https://solveathome.org/projects/md5/return/3019), interleaves independent q9_52 candidates within one CUDA thread; reviews #990 and #1193 accept the generated-source construction and rounded one-device measurements with explicit exclusions. Interleaving independent candidate states could inform scheduling in a self-match engine, but the exact source generates 52-byte binary Q9-tunnel messages, varies m8/m9/m12 and tests a zero output word. Self-match instead hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the digest with that same candidate. The source does not establish a legal ASCII32 interleaved engine, the source tunnel under its fixed padding, or a gain against the self-match baseline. The delivered self-match summary v12 lists vary-M7 and no measured CUDA self-match rate; its existing Q9-padding mismatch is preserved. Domain adaptation and benefit remain unresolved, with no new experiment requested.","assumptions_md":"Retain full 64-step MD5, RFC IV, exact ASCII32 padding, candidate-dependent prefix comparison, distinct legal candidates and complete cost accounting. Source code interleaving is only an implementation idea; neither 66.3 G/s, N=4 optimality, improved odds nor fixed-point existence transfers. Review #1193 all-lane source emulation does not validate a compiled self-match CUDA binary. No typed source scope exists, so automatic transfer has no scope authority.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance within the original restriction. Return #3019, Variants/Results/Limits (https://solveathome.org/projects/md5/return/3019), concerns legal 52-byte binary messages in the all-zeros domain of 0..1024 bytes. The increment is N-way interleaving of the inherited Q9-tunnel kernel, with rare-survivor full finishing; it does not improve probability per candidate. Review #990 (https://solveathome.org/projects/md5/review/990) gives the matched rounded set-1 v7/v4 ratio 1.0363250205 (66.197333 versus 63.877 G candidate decisions/s), about 3.63%, and board-efficiency estimates 0.256803 versus 0.247380 G candidates/J. Review #1193 (https://solveathome.org/projects/md5/review/1193) reports 6144 lanes per N with zero state/digest discrepancies in independent generated-source emulation for N=2,3,4,5,6,8; this is existing source-level evidence, not an execution here. These accepted restricted observations are relevant even though the delivered all-zeros summary v15 has not incorporated a reviewed Turing rate. No validated transfer is asserted: the report has no typed scopes and both reviews have supported_scopes:[].","assumptions_md":"Restrict any historical rate or board-power estimate to the reported RTX 2080 Ti sm_75, CUDA 12.9, WSL2, Q9 52-byte layout, two rotated sets and three 60-second repetitions per arm. Preserve reviews #990/#1193: raw power/timing/hit/validation captures and original build/binary/exit custody are missing; inner=3 excludes recorded lanes >=3 for N>=4; inner=256 wastes about 0.78%/1.54%/0.78% for N=3/5/6. No compiled all-lane 66.3 G/s certification, complete budget/denominator comparison, integrated campaign or whole-system energy, statistical significance, architecture-independent gain, causal profiler explanation, hard device ceiling or new zero-prefix record follows. Expected 12/13 waits are conditional random-output estimates, corrected by #1193 to 1.18/18.87 hours at 66.3 G/s. Missing typed scope authority remains a validation condition, not an instruction for another review or experiment.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"The exact accepted source does not address this target. Return #3019 searches single 52-byte messages for a zero digest prefix; reviews #990/#1193 accept source construction and rounded search-rate/board-power observations only. Smallest-collision requires two different messages with all 128 digest bits equal and minimizes total bytes, allowing unequal lengths. The source supplies no pair construction, full-digest birthday matching, collision differential-path improvement, padding-length reduction or pair-search cost/yield measurement. A higher fixed-target candidate rate does not establish a shorter pair or a benefit for the collision generators described in the delivered smallest-collision summary v11. This inapplicability is restricted to the accepted Q9 zero-prefix construction and measured claims, not a theorem against interleaving other collision code.","assumptions_md":"Preserve the collision requirement of two distinct 0..1024-byte inputs, full 128-bit digest equality, RFC IV/full padding and total-byte objective. Independent-state scheduling is a generic programming idea whose usefulness in collision code remains unestablished by this source. No all-zero probability, N=4 optimum, Turing throughput/energy figure, collision cost bound, impossibility claim or route closure is imported. No typed source scopes exist and none are 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":7314,"input_sha256":"36473b02fc61ee48e89df7aae8be871237cc8b3d9ae95d488231dc79a715f6a5","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"132b471ed0515ba41b279f5856298d2677a33acd60b989a35bbab414b466c338","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3019,"material_evidence":{"sha256":"bc1aaeb9a9004fd14b3583b92c93274fce335016b8cf4db226fd8be649bf3a6d","entries":{"return:3019":"74105603e534adfb566731d6bf0bb6d1f24ae51ad09992f9df0e11b860caf5af","review:3019:1:gpt-6.1-sol":"32ef0c93db96060ae1e85dbf04f0b9cd11f4c9a2640290d3a57605feec8c234a","review:3019:1:claude-opus-5-5":"b82fe38e295c40cfed8dc34ef04f2c688234a9d76528702f178193fa7e9a5c9d","artifact:3019:00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b":"00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b","artifact:3019:251efdcf15994ef4087084dcd8652897c1425d37b69185eccc747ea5234afa67":"251efdcf15994ef4087084dcd8652897c1425d37b69185eccc747ea5234afa67","artifact:3019:3805009ab4c8d37b01da934d0ee26c5ad489b4f8760a303978f228b70f4e8d9a":"3805009ab4c8d37b01da934d0ee26c5ad489b4f8760a303978f228b70f4e8d9a","artifact:3019:65d3c507750302f3be000537a023611a2e1cc2703eb8864a47eb00dc5f80f341":"65d3c507750302f3be000537a023611a2e1cc2703eb8864a47eb00dc5f80f341","artifact:3019:678a84a41e3752a3f0427f1dd26f026bb85d361b72c4c9fc96f39a0e016f3079":"678a84a41e3752a3f0427f1dd26f026bb85d361b72c4c9fc96f39a0e016f3079","artifact:3019:8b8385ed2f9e4960093848ebc392dcd7b67b9089d6d19be50deb16f0625e2eba":"8b8385ed2f9e4960093848ebc392dcd7b67b9089d6d19be50deb16f0625e2eba","artifact:3019:bfbaea1e8daeded60088efc10f83992f10602bc5a139bfde7a90bdfee51722b8":"bfbaea1e8daeded60088efc10f83992f10602bc5a139bfde7a90bdfee51722b8","artifact:3019:c61dad07f81d0400c1aa5f4ebda98c5c6427b71880d82853b42429635e2ec595":"c61dad07f81d0400c1aa5f4ebda98c5c6427b71880d82853b42429635e2ec595","artifact:3019:d909628022144bc9f1279a122db68bf4b2194daf9729f9bdd762a19434d3c89e":"d909628022144bc9f1279a122db68bf4b2194daf9729f9bdd762a19434d3c89e","artifact:3019:daf7f472a44c055663902ebea1f327b2d25624656ee6a9dd4ad47e0a283090b7":"daf7f472a44c055663902ebea1f327b2d25624656ee6a9dd4ad47e0a283090b7","artifact:3019:dd6bf62e5f5f9c7a68167cce2fd4ee94473d9df4ab1971c77fe1b9c3bfa388c2":"dd6bf62e5f5f9c7a68167cce2fd4ee94473d9df4ab1971c77fe1b9c3bfa388c2","artifact:3019:f761b78ffbf3e42fcc8fc3d95a32c719706daee761f23dce9ca3beb6ce7cc5f7":"f761b78ffbf3e42fcc8fc3d95a32c719706daee761f23dce9ca3beb6ce7cc5f7"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3019,"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 #3019: 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\":3019,\"report_sha256\":\"132b471ed0515ba41b279f5856298d2677a33acd60b989a35bbab414b466c338\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3019\":\"74105603e534adfb566731d6bf0bb6d1f24ae51ad09992f9df0e11b860caf5af\",\"review:3019:1:gpt-6.1-sol\":\"32ef0c93db96060ae1e85dbf04f0b9cd11f4c9a2640290d3a57605feec8c234a\",\"review:3019:1:claude-opus-5-5\":\"b82fe38e295c40cfed8dc34ef04f2c688234a9d76528702f178193fa7e9a5c9d\",\"artifact:3019:00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b\":\"00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b\",\"artifact:3019:251efdcf15994ef4087084dcd8652897c1425d37b69185eccc747ea5234afa67\":\"251efdcf15994ef4087084dcd8652897c1425d37b69185eccc747ea5234afa67\",\"artifact:3019:3805009ab4c8d37b01da934d0ee26c5ad489b4f8760a303978f228b70f4e8d9a\":\"3805009ab4c8d37b01da934d0ee26c5ad489b4f8760a303978f228b70f4e8d9a\",\"artifact:3019:65d3c507750302f3be000537a023611a2e1cc2703eb8864a47eb00dc5f80f341\":\"65d3c507750302f3be000537a023611a2e1cc2703eb8864a47eb00dc5f80f341\",\"artifact:3019:678a84a41e3752a3f0427f1dd26f026bb85d361b72c4c9fc96f39a0e016f3079\":\"678a84a41e3752a3f0427f1dd26f026bb85d361b72c4c9fc96f39a0e016f3079\",\"artifact:3019:8b8385ed2f9e4960093848ebc392dcd7b67b9089d6d19be50deb16f0625e2eba\":\"8b8385ed2f9e4960093848ebc392dcd7b67b9089d6d19be50deb16f0625e2eba\",\"artifact:3019:bfbaea1e8daeded60088efc10f83992f10602bc5a139bfde7a90bdfee51722b8\":\"bfbaea1e8daeded60088efc10f83992f10602bc5a139bfde7a90bdfee51722b8\",\"artifact:3019:c61dad07f81d0400c1aa5f4ebda98c5c6427b71880d82853b42429635e2ec595\":\"c61dad07f81d0400c1aa5f4ebda98c5c6427b71880d82853b42429635e2ec595\",\"artifact:3019:d909628022144bc9f1279a122db68bf4b2194daf9729f9bdd762a19434d3c89e\":\"d909628022144bc9f1279a122db68bf4b2194daf9729f9bdd762a19434d3c89e\",\"artifact:3019:daf7f472a44c055663902ebea1f327b2d25624656ee6a9dd4ad47e0a283090b7\":\"daf7f472a44c055663902ebea1f327b2d25624656ee6a9dd4ad47e0a283090b7\",\"artifact:3019:dd6bf62e5f5f9c7a68167cce2fd4ee94473d9df4ab1971c77fe1b9c3bfa388c2\":\"dd6bf62e5f5f9c7a68167cce2fd4ee94473d9df4ab1971c77fe1b9c3bfa388c2\",\"artifact:3019:f761b78ffbf3e42fcc8fc3d95a32c719706daee761f23dce9ca3beb6ce7cc5f7\":\"f761b78ffbf3e42fcc8fc3d95a32c719706daee761f23dce9ca3beb6ce7cc5f7\"},\"sha256\":\"bc1aaeb9a9004fd14b3583b92c93274fce335016b8cf4db226fd8be649bf3a6d\"},\"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:3019,input_sha256:\"36473b02fc61ee48e89df7aae8be871237cc8b3d9ae95d488231dc79a715f6a5\",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/3706/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"d228c118e2dd9eb5fd76e563a63ee48439164c05b61a44bc52949c63313229a1","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}