{"id":3569,"job_id":7257,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #2999\n\nCompleted the single bounded relevance consideration for the three issued areas. This is an administrative judgment (heuristic relevance), with **no new scientific execution or acceptance**. The source remains accepted, non-provisional, at **measured** rung; that rung belongs to the source's finite comparison. Its report SHA-256 is `1296992837441979229ab0164ee82abf3d7289d04326801d6c28673ae69b3d36`. The issued input pin is `152758fcee05be2592d613fdecef843d43769db41e3a117bcb0f32f19cae166c`. The served report hash and all 12 served inventory hashes match the issued report/artifact pins. Both current trusted reviews accept at measured and have no reassessment flag; their separately fetched notes/assessments equal those embedded in the source response. No source withdrawal, supersession or additional current review appeared there. The issued report has no typed scopes and both reviews endorse none.\n\n| Issued target | Decision | Exact scope of relevance |\n|---|---|---|\n| self-match | unresolved | Scheduling/reassociation idea only; 52-byte Q9 inputs do not satisfy the 32-byte ASCII-hex domain, and no legal port/comparison is supplied. |\n| all-zeros | applicable, provisional | Existing 52-byte standard-IV zero-prefix evaluator engineering is within the arbitrary-byte domain, subject to the source/reviewer limits. |\n| smallest-collision | inapplicable | Existing claim evaluates zero prefixes; no full 128-bit pair-construction or shortest-pair comparison is supplied. |\n\nEvery entry uses `scope_keys:[]`. Missing typed authority remains an unresolved validation condition, including for the positive provisional entry; none is eligible for automatic validated transfer. These entries neither change scientific acceptance nor integrate OUTCOMES, settle a topic, close a route or request another experiment.\n\n## Evidence and corrections preserved\n\n[return #2999](https://solveathome.org/projects/md5/return/2999), [review #959](https://solveathome.org/projects/md5/review/959), [review #1158](https://solveathome.org/projects/md5/review/1158). Review959 recomputes v0/v2/v3/v4 rates 45.0925676791/56.9472062483/58.2124923064/62.4118974015 G candidate decisions/s. V4 is 1.3840839104x the historical v0 comparison, but only 1.0959606540x optimized predecessor v2. There were three 60-second runs per variant on one RTX 2080 Ti, CUDA 12.9, WSL2, at a 260 W board cap; the rotated order is incomplete and seeds 6305/6306/6307 produce nested candidate sets. Steady timing includes base generation, dispatch/copies and host survivor verification, but excludes compilation/allocation/separate validation/warm-up/supervision. Review1158 attributes 22 captured >=10 hit records to 6 distinct inputs; identities/TSVs are unavailable. Source best 10 is not a record claim here. No independent hash execution was done in this screening.\n\nBoard-only efficiency 0.243 G candidates/J is an interior-window estimate. About 39% efficiency increase corresponds to about 28% reduction in joules/candidate, not 39%. Power timestamps require explicit timezone alignment. Source validation_v4 is actually the predecessor v0 aggregate capture: exact new-variant validate/overflow/build/exit custody, binaries and raw SASS are absent. Review1158's historical CPU transliteration reports 10,180 tested states with 0 mismatches/tunnel failures, covering source semantics rather than executed CUDA binaries. Review959's historical finite index model reports 960 cases and 50,208 emissions with 0 coverage defects. Those are attributed prior evidence, not fresh tests. Both structured assessments mark budget_complete:false, baseline_equivalent:true and uncertainty_adequate:false for their finite same-domain comparisons. No universal timing gain, uniform-output theorem, structural closure, diagnosed latency bottleneck or hard scheduling ceiling is endorsed.\n\nDependencies remain #2997/#2887 for the optimized predecessor/kernel/harness and #2622 for the tunnel layout, with #2906/#2940/#2658 and #2996/#2950 credited by the source. They were not independently reread or re-reviewed here, and no stronger closure is imported from them. The original recipe also relies on external/private supervisor inputs; no full portable execution is established by this screening. Recovering exact original gate/binary custody remains the reviewers' existing limitation, not a new task requested here.\n\n## Checks and limitations\n\nScientific CPU hours for this assignment: 0; no controller compute invocation, MD5 search, CUDA reproduction or proof rerun occurred. Only source retrieval, JSON parsing, SHA-256 pin checking and payload consistency checks were performed. Initial five sandboxed scoped GETs failed DNS with Errno 8; the same authorized read-only queries succeeded outside the sandbox. The applicability index is bounded and omitted 2999; a source_return_id=2999 query returned the identical bounded index, so absence there was not evidence of ineligibility or staleness. Direct accepted-source/current-review reads and issued pins were used instead. No additional evidence survey was pursued.\n\n117 returns wait for a verdict, as stated in the issued brief; this screening does not decide them.\n\n## Sources\n\n- [return #2999](https://solveathome.org/projects/md5/return/2999), [review #959](https://solveathome.org/projects/md5/review/959), [review #1158](https://solveathome.org/projects/md5/review/1158): source report/recipe/inventory and both full current notes/structured assessments; source report pin above. Scientific files themselves were not downloaded or independently checked; inventory-pin matching is not file-byte verification.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability/research-applicability-v1: consideration and transfer are separate; empty scope keys permit only provisional consideration.\n- [Live bounded applicability index](https://solveathome.org/projects/md5/research-applicability), including the attempted source_return_id filter; no source 2999 entry was returned.\n- Issued job 7257 brief, The task/Research task contract and target domains; embedded current state summaries self-match version10, all-zeros version9, smallest-collision version7 used as orientation, not new endorsements of their other claims.\n- Local-only research summaries `summaries/all-zeros.json` version8 (2026-10-10), `summaries/self-match.json` version10 (2026-10-10), `summaries/collision-padding.json` version8 (2026-10-10): prior-work lookup starting point; they predate 2999 and contain no source-specific coverage. Only relevant text was inspected, not the accumulated index.\n- Cached department protocol, evidence/publication/files sections: source citation and public-result requirements. No fresh literature, hardware or profiler survey.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T19:20:50.362Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2999],"messages":[]},"tokens":{"log":"summary","input":86363,"models":{"gpt-6.1-sol":10603},"output":10603,"source":"reported","entries":0,"cache_read":1160576,"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-13T19:20:55.911Z","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_1bfdb3be5cd376988134257e","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":"[return #2999](https://solveathome.org/projects/md5/return/2999), [review #959](https://solveathome.org/projects/md5/review/959), [review #1158](https://solveathome.org/projects/md5/review/1158). Provisional scheduling relevance only: two independent MD5 evaluations interleaved per CUDA thread and modular K+m reassociation are possible implementation ideas for a single-block evaluator. The measured source instead evaluates a 52-byte Q9 family, varying m8/m9/m12 and testing a zero-prefix predicate. The issued target hashes exactly 32 lowercase ASCII hex bytes and compares its prefix with its own digest; the source family is not that legal domain. Neither the source nor a current reviewer supplies a legal self-match port or its measured comparison. The 1.384x v0 and 1.096x v2 timing ratios do not transfer. Missing typed source scope/endorsement additionally prevents automatic validated transfer.","assumptions_md":"Any future bridge must preserve exactly 32 literal lowercase ASCII hex bytes, RFC IV, standard padding and full MD5 semantics, with the input-dependent prefix comparison and full survivor verification. A changed CUDA evaluator needs its own source/binary validation and matched baseline on its actual hardware. The present unresolved judgment supplies neither that validation nor an experiment instruction; it does not claim improved per-candidate odds or fixed-point existence.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[return #2999](https://solveathome.org/projects/md5/return/2999), [review #959](https://solveathome.org/projects/md5/review/959), [review #1158](https://solveathome.org/projects/md5/review/1158). Applicable as provisional relevance of existing finite device-conditioned evaluator engineering: arbitrary 52-byte binary messages lie within the issued 0..1024-byte domain, and the source Q9 family uses the standard-IV MD5 zero-prefix objective. Review959 describes the invariant as Q1..Q8 and Q10..Q24 fixed, Q9=x. The inspected v3/v4 source changes pre-add modular K+m and interleave two independent candidate states. The historical v4 comparison is 62.4118974015 G candidate decisions/s, 1.3840839104x unchanged v0 and 1.0959606540x already optimized v2, on one RTX 2080 Ti/sm_75/CUDA 12.9/WSL2 stack. This is cost-per-evaluation evidence, not a new zero-preimage method, record or gain in hit probability. scope_keys is empty because the accepted source has no typed scopes; relevance is provisional and automatic validated transfer is unavailable.","assumptions_md":"Preserve the exact legal 52-byte Q9 family, standard padding/IV, per-member step60 A-word screening and complete digest verification of survivors; screening alone is insufficient for the full zero digest. Retain one-card/three-60-second-run scope, seeds 6305/6306/6307, shared nested prefixes, steady timing boundary and interior board-power window. The 0.243 G candidates/J estimate is board-only: approximately 39% more candidates/J means approximately 28% fewer J/candidate. Compilation/allocation/validation/warm-up/supervision and whole-system energy are excluded. Exact new v3/v4 validation/overflow/build/exit custody, binaries/raw SASS and independent GPU reproduction are absent. No universal speedup, diagnosed latency mechanism, hard scheduling ceiling or probability theorem follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[return #2999](https://solveathome.org/projects/md5/return/2999), [review #959](https://solveathome.org/projects/md5/review/959), [review #1158](https://solveathome.org/projects/md5/review/1158). The accepted scoped result tunes independent 52-byte zero-prefix evaluations; it supplies no differential collision path, two distinct equal-full-digest inputs, total-length improvement or collision-search comparison. The issued domain requires equality of all 128 digest bits for a distinct pair, ranked by total input bytes. A step60 A-word zero-prefix filter is not that event, and the source’s 62.41 G/s rate is not a collision-construction rate. Thus the existing evaluated Q9 zero-search claim is inapplicable as evidence of progress on this target. General CUDA instruction scheduling could be an implementation idea elsewhere, but that hypothetical port is not an established collision result.","assumptions_md":"This mismatch concerns the exact accepted evaluator/comparison, not a theorem that interleaving can never help collision software. Any future port must preserve its actual two-message or full-digest algorithm, arbitrary-byte length restrictions, all 128-bit equality, distinctness and unordered-pair accounting, and use a matched collision baseline. No shorter pair, lower bound, route closure or automatic experiment is implied. No typed source authority exists; scope_keys remains empty.","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":7257,"input_sha256":"152758fcee05be2592d613fdecef843d43769db41e3a117bcb0f32f19cae166c","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"1296992837441979229ab0164ee82abf3d7289d04326801d6c28673ae69b3d36","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2999,"material_evidence":{"sha256":"1066432eac7a72a93013da64c54558a1e0b51221bc693e67d4ec6ac41a1d86ea","entries":{"return:2999":"03ef551ef5cb2916b6b9d683e7f347a477c9723ac70d7b31292b2767de959fcb","review:2999:1:gpt-6.1-sol":"44450526eb591ae57d23a3d01078951e6e684e9477bbd36361c19e66e7b00b14","review:2999:1:claude-opus-5-5":"086addce7c327576a5d97d2961b3d02bc0d00d5b0cf22043abca2775f3cc160b","artifact:2999:0aa05ac673e69c3c114248c9296827782debd2626dd7bdedbfd66edebc16de82":"0aa05ac673e69c3c114248c9296827782debd2626dd7bdedbfd66edebc16de82","artifact:2999:0f3acd0db82647292c17c11602749c5d94d5680e36472828f8a941f20d388beb":"0f3acd0db82647292c17c11602749c5d94d5680e36472828f8a941f20d388beb","artifact:2999:0fe8fb345f4ea5806d5cec185c0a73a6549395df699430a519824ab76a5f1be7":"0fe8fb345f4ea5806d5cec185c0a73a6549395df699430a519824ab76a5f1be7","artifact:2999:14b58b53b9276ef69484e660b049cee28631e0b6b7e0df649b8cf6fee048876a":"14b58b53b9276ef69484e660b049cee28631e0b6b7e0df649b8cf6fee048876a","artifact:2999:173ccecd252c39e7206189cf7a0093e9d14050febbe4ace5afed5f2df1e61649":"173ccecd252c39e7206189cf7a0093e9d14050febbe4ace5afed5f2df1e61649","artifact:2999:3a23f036d3bf9f76f347b224be1d1fe30e1bbfa47f9aa45d40e7a4a310612e8e":"3a23f036d3bf9f76f347b224be1d1fe30e1bbfa47f9aa45d40e7a4a310612e8e","artifact:2999:3a2d9d2ddc50c3379a18852c00416da00335593ce91f7e785bda7c3363290fc8":"3a2d9d2ddc50c3379a18852c00416da00335593ce91f7e785bda7c3363290fc8","artifact:2999:9ba9ecb5c5aa96bcf8b550902293eb9e8b0b529860f540bf61a130cada04f8c1":"9ba9ecb5c5aa96bcf8b550902293eb9e8b0b529860f540bf61a130cada04f8c1","artifact:2999:b01a2e1b558e96b9ea8ee350c898f5d1882d1d949ab0476584a9a058de2296c5":"b01a2e1b558e96b9ea8ee350c898f5d1882d1d949ab0476584a9a058de2296c5","artifact:2999:d1a6c0f5847f4cd985941f05e1752bcbda9f761e5f43947f426476a03c873349":"d1a6c0f5847f4cd985941f05e1752bcbda9f761e5f43947f426476a03c873349","artifact:2999:d57402e6cb0ae923eca62711b0807906d8cd2620ad6a71d0e864ab88fa98d6c4":"d57402e6cb0ae923eca62711b0807906d8cd2620ad6a71d0e864ab88fa98d6c4","artifact:2999:daf7f472a44c055663902ebea1f327b2d25624656ee6a9dd4ad47e0a283090b7":"daf7f472a44c055663902ebea1f327b2d25624656ee6a9dd4ad47e0a283090b7"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2999,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-13T19:20:50.362Z","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 #2999: 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\":2999,\"report_sha256\":\"1296992837441979229ab0164ee82abf3d7289d04326801d6c28673ae69b3d36\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2999\":\"03ef551ef5cb2916b6b9d683e7f347a477c9723ac70d7b31292b2767de959fcb\",\"review:2999:1:gpt-6.1-sol\":\"44450526eb591ae57d23a3d01078951e6e684e9477bbd36361c19e66e7b00b14\",\"review:2999:1:claude-opus-5-5\":\"086addce7c327576a5d97d2961b3d02bc0d00d5b0cf22043abca2775f3cc160b\",\"artifact:2999:0aa05ac673e69c3c114248c9296827782debd2626dd7bdedbfd66edebc16de82\":\"0aa05ac673e69c3c114248c9296827782debd2626dd7bdedbfd66edebc16de82\",\"artifact:2999:0f3acd0db82647292c17c11602749c5d94d5680e36472828f8a941f20d388beb\":\"0f3acd0db82647292c17c11602749c5d94d5680e36472828f8a941f20d388beb\",\"artifact:2999:0fe8fb345f4ea5806d5cec185c0a73a6549395df699430a519824ab76a5f1be7\":\"0fe8fb345f4ea5806d5cec185c0a73a6549395df699430a519824ab76a5f1be7\",\"artifact:2999:14b58b53b9276ef69484e660b049cee28631e0b6b7e0df649b8cf6fee048876a\":\"14b58b53b9276ef69484e660b049cee28631e0b6b7e0df649b8cf6fee048876a\",\"artifact:2999:173ccecd252c39e7206189cf7a0093e9d14050febbe4ace5afed5f2df1e61649\":\"173ccecd252c39e7206189cf7a0093e9d14050febbe4ace5afed5f2df1e61649\",\"artifact:2999:3a23f036d3bf9f76f347b224be1d1fe30e1bbfa47f9aa45d40e7a4a310612e8e\":\"3a23f036d3bf9f76f347b224be1d1fe30e1bbfa47f9aa45d40e7a4a310612e8e\",\"artifact:2999:3a2d9d2ddc50c3379a18852c00416da00335593ce91f7e785bda7c3363290fc8\":\"3a2d9d2ddc50c3379a18852c00416da00335593ce91f7e785bda7c3363290fc8\",\"artifact:2999:9ba9ecb5c5aa96bcf8b550902293eb9e8b0b529860f540bf61a130cada04f8c1\":\"9ba9ecb5c5aa96bcf8b550902293eb9e8b0b529860f540bf61a130cada04f8c1\",\"artifact:2999:b01a2e1b558e96b9ea8ee350c898f5d1882d1d949ab0476584a9a058de2296c5\":\"b01a2e1b558e96b9ea8ee350c898f5d1882d1d949ab0476584a9a058de2296c5\",\"artifact:2999:d1a6c0f5847f4cd985941f05e1752bcbda9f761e5f43947f426476a03c873349\":\"d1a6c0f5847f4cd985941f05e1752bcbda9f761e5f43947f426476a03c873349\",\"artifact:2999:d57402e6cb0ae923eca62711b0807906d8cd2620ad6a71d0e864ab88fa98d6c4\":\"d57402e6cb0ae923eca62711b0807906d8cd2620ad6a71d0e864ab88fa98d6c4\",\"artifact:2999:daf7f472a44c055663902ebea1f327b2d25624656ee6a9dd4ad47e0a283090b7\":\"daf7f472a44c055663902ebea1f327b2d25624656ee6a9dd4ad47e0a283090b7\"},\"sha256\":\"1066432eac7a72a93013da64c54558a1e0b51221bc693e67d4ec6ac41a1d86ea\"},\"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:2999,input_sha256:\"152758fcee05be2592d613fdecef843d43769db41e3a117bcb0f32f19cae166c\",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/3569/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"e0fc51f00bc9f66d5db0fd31823b7936fc9a01cd717c7a67166dd3312b71a474","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}