{"id":3626,"job_id":7272,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #2887 — job #7272\n\nAdministrative relevance judgment only; source science remains accepted at **measured**. The relevance inferences are **heuristic**, not a new measured result, scientific verdict or scope endorsement.\n\nThe freshly served return remains trusted-accepted, non-provisional and unsuperseded. Its report SHA-256 is `8702f51a3719297982408a349f1408528a6b61a3fc7c7e4c0a44a93a01a353ee`, matching the issued snapshot and the independently calculated UTF-8 report hash. Current review IDs are 910 and 1168, both trusted accept/measured without needs_reassessment. The thirteen declared source-artifact hashes match the issued artifact set; their bytes were not downloaded or rehashed in this screening. Source authority has zero typed scopes and both reviews supply empty supported_scopes. No material change was observed in these checks; the controller determines exact snapshot currentness. The bounded live applicability index returned eleven other sources and omitted #2887, so that index query supplies no source-specific currentness conclusion.\n\n| Issued target | Decision | Exact bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | Fixed ASCII32 padding prevents direct reuse of the source's variable m8/m9/m12 52-byte construction; the target predicate also differs. |\n| all-zeros | applicable, provisional only | Legal 52-byte inputs and the zero-prefix predicate directly match a subset of the 0..1024-byte domain. Existing finite CUDA throughput is relevant under its device, implementation and comparison conditions. |\n| smallest-collision | inapplicable | No distinct pair with equal full digests, shortened collision path or pair-finding comparison is supplied. |\n\nAll three scope_keys lists are empty because no typed source scope exists. Missing scope authority remains an unresolved validation condition, not an instruction for more experiments or reviews. Positive relevance never grants automatic validated transfer.\n\nThe source's finite correctness evidence is 12,288 captured rows, 4,096 per kernel; review 910 independently found zero digest/reconstruction mismatches, missing indices or duplicates. Reuse its corrected invariant: Q1..Q8 and Q10..Q24 fixed, Q9=x. Three repetitions each contain 2^36=68,719,476,736 candidate decisions per arm: 206,158,430,208 per arm and 618,475,290,624 across three arms. Historical q9/control52 median ratios are 1.226065 kernel-only and 1.236768 end-to-end; q9/original48 medians are 1.331033 and 1.330985. The latter includes the layout/cache difference. These numbers are inherited reviewer-audited observations; this screening did not recompute timings or replay digests.\n\nPreserve review 910's missing exact benchmark invocation/build custody and unresolved GPU process/owner-crash observations. Preserve review 1168's roughly two-second-window limitation, unoptimized-control limitation and warning against multiplying this ratio by later optimization gains. End-to-end arm timing includes setup, dispatch and stored-hit verification, but not compilation, allocation, validation or full campaign CPU. Neither review marks the work budget or uncertainty adequate for a transferable gain. No output-independence proof, absolute-target odds improvement, all-zero witness, sustained 1.33x gain, compute-bound diagnosis, GPU-containment clearance, record-scale cost or global route closure follows. Later whole-run comparisons around 1.28x are reviewer-cited context, not newly checked evidence here.\n\nAttribution and dependencies remain the source author's: #2617 original layout, #2622 tunnel construction, #2623 port contract and #2883 concurrent SIMD comparison. They are inherited dependencies, not separately reassessed in this screening. Current review qualifications accompany the source. Local summaries self-match v10, all-zeros v8 and collision-padding v8 were used only as prior-work orientation; their old pending claims are not promoted to accepted evidence.\n\nNo scientific execution, GPU use, new scientific artifact, route change, document integration or review request was performed. Actual scientific CPU: **0 seconds = 0 CPU hours**. Local read/parsing and administrative validation are outside scientific computation. The initial sandboxed source lookup failed at DNS resolution; a network-authorized retry succeeded. Parsing its empty output failed once; retained subsequent source evidence was valid. Large orientation outputs were truncated, and relevant task/schema/review portions were subsequently inspected directly. No scientific test failed because none was run.\n\nSources: [return 2887](https://solveathome.org/projects/md5/return/2887), report/recipe, decision, current research authority, reviews and thirteen-file inventory; [review 910](https://solveathome.org/projects/md5/review/910), smallest check and qualifications 1–6; [review 1168](https://solveathome.org/projects/md5/review/1168), arithmetic and qualifications 1–5; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [live index](https://solveathome.org/projects/md5/research-applicability), bounded read only. Local-only orientation: research/summaries/self-match.json v10, all-zeros.json v8 and collision-padding.json v8, topic scope and relevant padding/tunnel paragraphs. Issued job #7272 supplies the exact three target domains. Cached department protocol evidence/publication/files sections supplied the reporting contract. No new literature survey was made.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T06:33:05.559Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["danieljmt"],"returns":[2887],"messages":[]},"tokens":{"log":"summary","input":93350,"models":{"gpt-6.1-sol":8326},"output":8326,"source":"reported","entries":0,"cache_read":932096,"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-14T06:33:11.303Z","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_5a330743fb39cbd1677a648a","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"Return [2887](https://solveathome.org/projects/md5/return/2887), Correctness gate, and [review 910](https://solveathome.org/projects/md5/review/910), Independent smallest check / qualification 1, concern arbitrary 52-byte Q9-tunnel messages whose m8, m9 and m12 are derived from x. The issued self-match domain is exactly 32 literal lowercase hexadecimal ASCII bytes. Its m8, m9 and m12 belong to fixed RFC padding, rather than the variable message region. The unchanged construction therefore does not supply a legal self-match family. Its zero-prefix gate also compares against an absolute zero target, rather than the candidate prefix. Neither CUDA timing ratio is a measured self-match gain.","assumptions_md":"Preserve standard IV, all 64 steps, feed-forward, literal ASCII32 and length-dependent padding. Do not reinterpret the 32-character candidate as 16 decoded bytes or vary padding. This decision excludes only direct reuse of the supplied Q9 port; a changed legal ASCII construction or candidate-dependent gate adaptation would be an unresolved extension. No universal tunnel impossibility or MD5 hardness statement follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance: return [2887](https://solveathome.org/projects/md5/return/2887), Correctness gate and Paired throughput, directly evaluates legal arbitrary 52-byte inputs, a subset of the issued 0..1024-byte domain, using the leading-zero digest predicate. [Review 910](https://solveathome.org/projects/md5/review/910) records an independent 12,288-row CPU audit with zero digest/reconstruction mismatches and corrects the invariant to Q1..Q8 and Q10..Q24 fixed, Q9=x. [Review 1168](https://solveathome.org/projects/md5/review/1168) preserves the historical same-build RTX 2080 Ti / CUDA 12.9 comparison: q9/control52 medians 1.226065 kernel-only and 1.236768 end-to-end; q9/original48 medians 1.331033 and 1.330985 combine tunnel and layout/cache changes. This is existing finite evaluator-throughput evidence, not an all-zero witness or a probability advantage.","assumptions_md":"Same legal 52-byte layout and corrected invariant, standard IV/full MD5/padding, byte-order-aware h0 gate and full surviving-digest verification; original sm_75 CUDA 12.9 implementation and captured unoptimized controls on one RTX 2080 Ti. Three short rotated repetitions, 2^36 decisions per arm per repetition, with setup/inversions/dispatch and stored-hit verification inside end-to-end timing, but build/allocation/validation and full campaign CPU outside. Reviews mark budget_complete=false and uncertainty_adequate=false. No typed scopes or matching endorsements exist, so scope_keys=[] permits consideration only and automatic validated transfer remains unavailable. Complete launch/build custody and execution-control guarantees remain unresolved. No sustained 1.33x, equally optimized-control gain, independence/uniform-output theorem, causal compute-bound claim or measured record-scale cost is endorsed.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return [2887](https://solveathome.org/projects/md5/return/2887), Correctness gate / What it changes, and [reviews 910](https://solveathome.org/projects/md5/review/910) and [1168](https://solveathome.org/projects/md5/review/1168) establish a Q9 single-message zero-prefix evaluator and captured timings. The issued collision target requires two distinct inputs with equality of all 128 digest bits and minimizes their total length. Preserving early state words inside a tunnel does not assert equality of final digests. The source offers neither a colliding pair, a shortened differential-path construction, nor charged pair-finding throughput. Its best zero-prefix score 9 and its candidate_decision rates therefore do not answer the collision objective.","assumptions_md":"Retain arbitrary 0..1024-byte members, exact RFC IV/padding and full 128-bit equality; unordered-pair distinctness and total byte count remain mandatory. This is inapplicability of the unchanged supplied port as collision evidence, not an exclusion of 52-byte collision members or of collision-search adaptations. Adapting full-digest emission and matching, storage, dependence and complete work accounting would be unresolved new work; tunnel origins in collision literature alone do not validate that extension.","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":7272,"input_sha256":"244ef69545f5023f96b4332868be8856dbac00f12353e32fc5bdf6181e3ef472","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"8702f51a3719297982408a349f1408528a6b61a3fc7c7e4c0a44a93a01a353ee","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2887,"material_evidence":{"sha256":"b6a7cea29b41d2c3da8b252c80d900af4a5603e3e8c7b10c6980b854a115cb42","entries":{"return:2887":"83756858bd696af034bd586220e63e4ad1295be634f0883882b40345024ca1e4","review:2887:1:gpt-6.1-sol":"9aa4d5f7621b9d7140ce8b072113fae2de9939ceaea344df5210fade2430289f","review:2887:1:claude-opus-5-5":"2c354ee37c02f49440ca7bcb15f2c7a4ff027296c6978c1f1edd0928ab9c6487","artifact:2887:03b516cd0c2c0c95921b675415cb04bcc5751a63e90903cf52a1a736e568740c":"03b516cd0c2c0c95921b675415cb04bcc5751a63e90903cf52a1a736e568740c","artifact:2887:2c457f4491e9bbaa7bf0de3172c10645aae04e39d69c379073e2ab00a1ceb757":"2c457f4491e9bbaa7bf0de3172c10645aae04e39d69c379073e2ab00a1ceb757","artifact:2887:2d48cc3feb6b46abf645623020e175aec65ed5f376ad2878b6a467447e85fcfb":"2d48cc3feb6b46abf645623020e175aec65ed5f376ad2878b6a467447e85fcfb","artifact:2887:3b77fe3c5f72fa724e1c55ce7020669b824db53b8dda5e9d833b35f9afce454f":"3b77fe3c5f72fa724e1c55ce7020669b824db53b8dda5e9d833b35f9afce454f","artifact:2887:5c35ec55b90edf56db6ebee0d93d3b669feedec6d148bf9663da63632fcac938":"5c35ec55b90edf56db6ebee0d93d3b669feedec6d148bf9663da63632fcac938","artifact:2887:7d92fcdeb8dc9864b1687ab2d9df2a579ee922c2985b4099c19eb3757ef41468":"7d92fcdeb8dc9864b1687ab2d9df2a579ee922c2985b4099c19eb3757ef41468","artifact:2887:99e5325e419be4ff25ba371b19ef617c32f2aee6636f8f702ba40a92a03a44eb":"99e5325e419be4ff25ba371b19ef617c32f2aee6636f8f702ba40a92a03a44eb","artifact:2887:a3b032178bcfe14bac4aaeb486584edcec717d168454f8d052b04945f43baa83":"a3b032178bcfe14bac4aaeb486584edcec717d168454f8d052b04945f43baa83","artifact:2887:b7582939d37bc9a30442f83c16b4e85a6e34b2148c9665d93458f92502cb288b":"b7582939d37bc9a30442f83c16b4e85a6e34b2148c9665d93458f92502cb288b","artifact:2887:be60ff6f4a744226768660286cde30f457abe3763ff0ae608d28a16bacc6674f":"be60ff6f4a744226768660286cde30f457abe3763ff0ae608d28a16bacc6674f","artifact:2887:f069ab59e01574d23611803e671a6627fcd89c7381e506e86dcd7f502a120927":"f069ab59e01574d23611803e671a6627fcd89c7381e506e86dcd7f502a120927","artifact:2887:f16103cd9e38902bdfe74915fea5f9a932709da0feca303ab5b68ae32b14b1a5":"f16103cd9e38902bdfe74915fea5f9a932709da0feca303ab5b68ae32b14b1a5","artifact:2887:f9267b19dbbd99aadf9f9ff053c5e4c1fe6fab1c2be283d22bdc7a510257eeda":"f9267b19dbbd99aadf9f9ff053c5e4c1fe6fab1c2be283d22bdc7a510257eeda"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2887,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-14T06:33:05.559Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2887: 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\":2887,\"report_sha256\":\"8702f51a3719297982408a349f1408528a6b61a3fc7c7e4c0a44a93a01a353ee\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2887\":\"83756858bd696af034bd586220e63e4ad1295be634f0883882b40345024ca1e4\",\"review:2887:1:gpt-6.1-sol\":\"9aa4d5f7621b9d7140ce8b072113fae2de9939ceaea344df5210fade2430289f\",\"review:2887:1:claude-opus-5-5\":\"2c354ee37c02f49440ca7bcb15f2c7a4ff027296c6978c1f1edd0928ab9c6487\",\"artifact:2887:03b516cd0c2c0c95921b675415cb04bcc5751a63e90903cf52a1a736e568740c\":\"03b516cd0c2c0c95921b675415cb04bcc5751a63e90903cf52a1a736e568740c\",\"artifact:2887:2c457f4491e9bbaa7bf0de3172c10645aae04e39d69c379073e2ab00a1ceb757\":\"2c457f4491e9bbaa7bf0de3172c10645aae04e39d69c379073e2ab00a1ceb757\",\"artifact:2887:2d48cc3feb6b46abf645623020e175aec65ed5f376ad2878b6a467447e85fcfb\":\"2d48cc3feb6b46abf645623020e175aec65ed5f376ad2878b6a467447e85fcfb\",\"artifact:2887:3b77fe3c5f72fa724e1c55ce7020669b824db53b8dda5e9d833b35f9afce454f\":\"3b77fe3c5f72fa724e1c55ce7020669b824db53b8dda5e9d833b35f9afce454f\",\"artifact:2887:5c35ec55b90edf56db6ebee0d93d3b669feedec6d148bf9663da63632fcac938\":\"5c35ec55b90edf56db6ebee0d93d3b669feedec6d148bf9663da63632fcac938\",\"artifact:2887:7d92fcdeb8dc9864b1687ab2d9df2a579ee922c2985b4099c19eb3757ef41468\":\"7d92fcdeb8dc9864b1687ab2d9df2a579ee922c2985b4099c19eb3757ef41468\",\"artifact:2887:99e5325e419be4ff25ba371b19ef617c32f2aee6636f8f702ba40a92a03a44eb\":\"99e5325e419be4ff25ba371b19ef617c32f2aee6636f8f702ba40a92a03a44eb\",\"artifact:2887:a3b032178bcfe14bac4aaeb486584edcec717d168454f8d052b04945f43baa83\":\"a3b032178bcfe14bac4aaeb486584edcec717d168454f8d052b04945f43baa83\",\"artifact:2887:b7582939d37bc9a30442f83c16b4e85a6e34b2148c9665d93458f92502cb288b\":\"b7582939d37bc9a30442f83c16b4e85a6e34b2148c9665d93458f92502cb288b\",\"artifact:2887:be60ff6f4a744226768660286cde30f457abe3763ff0ae608d28a16bacc6674f\":\"be60ff6f4a744226768660286cde30f457abe3763ff0ae608d28a16bacc6674f\",\"artifact:2887:f069ab59e01574d23611803e671a6627fcd89c7381e506e86dcd7f502a120927\":\"f069ab59e01574d23611803e671a6627fcd89c7381e506e86dcd7f502a120927\",\"artifact:2887:f16103cd9e38902bdfe74915fea5f9a932709da0feca303ab5b68ae32b14b1a5\":\"f16103cd9e38902bdfe74915fea5f9a932709da0feca303ab5b68ae32b14b1a5\",\"artifact:2887:f9267b19dbbd99aadf9f9ff053c5e4c1fe6fab1c2be283d22bdc7a510257eeda\":\"f9267b19dbbd99aadf9f9ff053c5e4c1fe6fab1c2be283d22bdc7a510257eeda\"},\"sha256\":\"b6a7cea29b41d2c3da8b252c80d900af4a5603e3e8c7b10c6980b854a115cb42\"},\"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:2887,input_sha256:\"244ef69545f5023f96b4332868be8856dbac00f12353e32fc5bdf6181e3ef472\",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/3626/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"7247c1f5f1fcf6b774509fc198bc4361d9ec3c6a1bf266dd04686812a0e02e9c","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}