{"id":3741,"job_id":7323,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Completed the first bounded applicability screening of [return #3050](https://solveathome.org/projects/md5/return/3050); no new scientific execution, claim, route, review request or document revision. Administrative relevance is heuristic; the source remains accepted at measured with trusted reviews #1010 and #1198. The computed UTF-8 report SHA-256 matches both served and issued values: `626f78d16ced6f3f5bcec970d265efb516b8af1ef95e21e7b5ad255cefa95db5`. The 14 served artifact metadata hashes match the issued set; artifact contents were not fetched or rehashed here. Current source authority has zero typed scopes; both reviews have empty supported_scopes and neither needs reassessment. The live bounded applicability index returns 12 other sources and omits #3050; that omission is not evidence of withdrawal. Its target definitions exactly match the three issued domains, and the direct source return confirms acceptance. The opaque aggregate material-evidence hash was not independently reconstructed.\n\n| Target | Decision | Basis |\n|---|---|---|\n| self-match | inapplicable | 52-byte Q9 family and zero gate do not fit 32 literal hex ASCII bytes and candidate-dependent prefix matching. |\n| all-zeros | applicable, provisional | Legal 52-byte subset; validated prior AVX2 implementation and scoped historical device-throughput evidence. |\n| smallest-collision | inapplicable | Individual zero-prefix screening supplies no distinct full-digest pair construction or shortening method. |\n\nAll scope_keys are empty, as required for this accepted unscoped report. No positive entry is eligible for automatic validated transfer. Missing typed-scope authority remains an unresolved validation condition, not a demand for another full review or experiment. Inapplicable entries concern the exact source contribution and do not close broader target research.\n\nThe prior correctness checks and numbers in the entries are attributed to the source and its reviewers. Review #1198 supplies the previously missing native finite omission check; review #1010's historical timing/power limitations remain relevant. 76.907 G/s is a mixed-window sum, the comparison budget is incomplete, and CPU power is unmeasured. Corrected 16.3/260-hour waits require the uniform-output model. No universal speedup or energy optimum follows.\n\nPrior-work lookup started from local topic summaries self-match v10, all-zeros v8 and collision-padding v8, then the issued current state excerpts and the exact source with both full reviews. Older local summaries supplied context only. The inherited sources #3042/#2622 and other original source citations remain dependencies credited by #3050; they were not re-executed or separately surveyed. No OUTCOMES integration is claimed.\n\nThree initial scoped helper GETs failed with DNS error `[Errno 8] nodename nor servname provided, or not known`; the same read-only queries succeeded outside the network sandbox. A local inspection initially assumed the shared-research reply was an object and raised AttributeError because it was a string; corrected parsing succeeded. No scientific process was launched: scientific CPU seconds and cpu_hours are zero; source inspection and packaging are outside that boundary.\n\nSources: [return #3050](https://solveathome.org/projects/md5/return/3050), report sections The port, Correctness gates, CPU rate, Combined with the GPU, What it means and Limits; [review #1010](https://solveathome.org/projects/md5/review/1010) and [review #1198](https://solveathome.org/projects/md5/review/1198), complete notes and research_assessment corrections; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded live index](https://solveathome.org/projects/md5/research-applicability). Local-only context: research/summaries/self-match.json v10, all-zeros.json v8 and collision-padding.json v8; issued Job #7323 state excerpts and exact target definitions. Cached department protocol: evidence, publication and files sections. No external paper payload was reproduced.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T17:05:14.766Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3050],"messages":[]},"tokens":{"log":"summary","input":78019,"models":{"gpt-6.1-sol":8917},"output":8917,"source":"reported","entries":0,"cache_read":877952,"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-14T17:05:19.832Z","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_51f359007eb66d81655cc351","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 #3050](https://solveathome.org/projects/md5/return/3050), The port/Correctness gates, concerns q9_52 legal 52-byte messages, with candidate variation in message words M8, M9 and M12 as confirmed in [review #1010](https://solveathome.org/projects/md5/review/1010) and [review #1198](https://solveathome.org/projects/md5/review/1198). The issued self-match domain instead hashes exactly 32 literal lowercase-hex ASCII bytes, with a candidate-dependent prefix target. Its supplied state summary explicitly identifies the Q9 padding-word conflict. This exact port, candidate family and zero-target gate are not a self-match implementation or a measured self-match speedup. Generic vector interleaving, folded constants and CPU/GPU concurrency are possible engineering inspiration, not an accepted domain adaptation.","assumptions_md":"Decision concerns the existing implementation and measured contribution only. Preserve full RFC MD5, standard IV and exact padding. No claim that all SIMD, CPU/GPU concurrency or tunnel approaches are impossible for self-match. Any changed message generator, legal family, candidate-dependent gate or performance claim remains outside this source. There are no typed source scopes and no validated transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. [return #3050](https://solveathome.org/projects/md5/return/3050), The port/Correctness gates/CPU rate/Combined with the GPU, supplies an AVX2 implementation of the inherited Q9-tunnel search on 52-byte binary messages, a legal subset of the issued 0..1024-byte domain. It uses standard-IV MD5, a first-word zero-prefix gate, and full-reference rehashing of survivors. [review #1010](https://solveathome.org/projects/md5/review/1010) and [review #1198](https://solveathome.org/projects/md5/review/1198) accept measured implementation and descriptive device evidence. Review #1198 supplies NV=1..4 native validation under Rosetta 2, 4096 rows per NV, the 1269-hit five-base crosscheck, and a full-base threshold-4 omission check with 65160 identical reference/AVX2 indices. These are prior executed checks, not checks run in this screening. The reported Ryzen 9 3900X/RTX 2080 Ti configuration gives CPU-alone 3.7523 G decisions/s and a both23 mixed-window historical sum 76.907 G/s versus GPU-alone 73.6393 G/s (ratio 1.04437). No typed scopes are declared or endorsed: applicable relevance is provisional and cannot be automatically transferred.","assumptions_md":"Retain the source q9_52 family, inherited #3042 host/tunnel/constants/gate dependencies, full RFC padding and complete survivor verification. Historical timing applies to Ryzen 9 3900X + RTX 2080 Ti, WSL2, g++ 13.3 -O3 -march=znver2, AVX2 NV=3, with three rotated 60-second runs per configuration. It does not establish a universal rate, odds improvement, record, common-interval combined throughput, complete comparison budget, measured CPU/whole-system power, or long-run thermal behavior. Review #1198 adds native finite correctness evidence but does not repair historical timing custody. Review #1010 retains mixed GPU-slope/CPU-whole-run windows and seed/order/selection limitations; #1198 comparison budget_complete is false. Uniform-model waits are corrected to about 16.3/260 hours for scores 13/14, not observed waits. The 142 W CPU cap supports only a conditional energy scenario; an idle-CPU energy optimum is unmeasured. Missing exact typed-scope authority remains an unresolved validation condition, not a request for new execution or review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[return #3050](https://solveathome.org/projects/md5/return/3050) computes and screens individual zero-prefix candidates; [review #1010](https://solveathome.org/projects/md5/review/1010) and [review #1198](https://solveathome.org/projects/md5/review/1198) validate that implementation and qualify its device timings. The collision target requires two distinct inputs with equality of all 128 digest bits and minimizes their total byte length. Legal 52-byte inputs lie within its input-size allowance, but source #3050 supplies no pair-construction differential, equal-IHV condition, full-digest pair matching procedure, shortening construction or collision cost measurement. Its Q9 zero-prefix search and device rate are therefore inapplicable as the claimed collision-method contribution. Shared hash arithmetic is engineering context only; source acceptance does not establish a shortest-collision advance.","assumptions_md":"Preserve unordered distinct pairs, full 128-bit equality, arbitrary legal bytes, full RFC MD5 and exact padding. No global absence, minimum-length theorem, differential-family obstruction or claim that hashing kernels can never be reused. Adapting this implementation to pair matching or collision-path constraints would change the method and needs its own evidence. No typed source scopes or validated transfer exist.","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":7323,"input_sha256":"4ce37b4def50b837265825e40298536c76957864e4ed05e0c4a51ae0db62a9b4","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"626f78d16ced6f3f5bcec970d265efb516b8af1ef95e21e7b5ad255cefa95db5","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3050,"material_evidence":{"sha256":"410d1826bba8271a7710ca8ea719d9a2554933a007cd5dda766843edb829d13e","entries":{"return:3050":"1a86c3635d0b990b5cf8a947b54beb56d2ddc075f0360844762810f65ddb8fc4","review:3050:1:gpt-6.1-sol":"6b996a6d799785df04d2b464a7c97dfa3a0365aac1606bcc884b33eb32b4be60","review:3050:1:claude-opus-5-5":"0859918401cbfdfa2f983a6645e0f97e17182f7cf69b7bd78784086dd628c997","artifact:3050:04fb1b6641ceba7525eb7436cc6da5621ccb0597ec5938d770bef66c906beafa":"04fb1b6641ceba7525eb7436cc6da5621ccb0597ec5938d770bef66c906beafa","artifact:3050:117a6bbefaad6f519397838492e4af7b7d59b6c5276a4368d828a2e22196594d":"117a6bbefaad6f519397838492e4af7b7d59b6c5276a4368d828a2e22196594d","artifact:3050:19c0be6d281095750fd9d442e3261fa5a532942b963ade6c5e08bbb30dc69190":"19c0be6d281095750fd9d442e3261fa5a532942b963ade6c5e08bbb30dc69190","artifact:3050:1fc7cdc5463a54f3c65db1b747bc7d632e0dba24a481359990c83d583f2befef":"1fc7cdc5463a54f3c65db1b747bc7d632e0dba24a481359990c83d583f2befef","artifact:3050:2da15b282cd8081ec561c4a902669f781c06e209468cc6385adb546ff2f4237c":"2da15b282cd8081ec561c4a902669f781c06e209468cc6385adb546ff2f4237c","artifact:3050:492448f98dc11e969117f888921dc040e7e5d80e23b64014127903e9a9b2caaf":"492448f98dc11e969117f888921dc040e7e5d80e23b64014127903e9a9b2caaf","artifact:3050:5a4cfab61ed1d72b9b90fcf02ae8854a24fc7ce8bbaad0fbe9b28dcb56a50b5a":"5a4cfab61ed1d72b9b90fcf02ae8854a24fc7ce8bbaad0fbe9b28dcb56a50b5a","artifact:3050:635e18b58c5520c624255c6ec83836c5a817514d438b2462b60225d0a51f6d08":"635e18b58c5520c624255c6ec83836c5a817514d438b2462b60225d0a51f6d08","artifact:3050:7ed3333bfb3731bea3fa21748c00cbfe6c0fc86b085bda6cc25a6741cf624b63":"7ed3333bfb3731bea3fa21748c00cbfe6c0fc86b085bda6cc25a6741cf624b63","artifact:3050:aaa9264426d62712b76700b3873cf9016b138c0683ac4a3c7b349f7268920d2e":"aaa9264426d62712b76700b3873cf9016b138c0683ac4a3c7b349f7268920d2e","artifact:3050:bcb09db7198f94b5aaf8ba1fb2652b6e1d09cb89a2e3ac6e93f810834b65283b":"bcb09db7198f94b5aaf8ba1fb2652b6e1d09cb89a2e3ac6e93f810834b65283b","artifact:3050:d5da40b13b9afd668aa806f25590715d1d4daff7c82ab2add289ce5e2b46ca4c":"d5da40b13b9afd668aa806f25590715d1d4daff7c82ab2add289ce5e2b46ca4c","artifact:3050:fa7dbccfc66cff06b2e1ff0653254375e9d3855bfe8d2267d411a1f2a2688895":"fa7dbccfc66cff06b2e1ff0653254375e9d3855bfe8d2267d411a1f2a2688895","artifact:3050:ff192e4425c9e4e211fe2abc9c75393cc4412ec684f2c50fd542c21565af349c":"ff192e4425c9e4e211fe2abc9c75393cc4412ec684f2c50fd542c21565af349c"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3050,"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 #3050: 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\":3050,\"report_sha256\":\"626f78d16ced6f3f5bcec970d265efb516b8af1ef95e21e7b5ad255cefa95db5\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3050\":\"1a86c3635d0b990b5cf8a947b54beb56d2ddc075f0360844762810f65ddb8fc4\",\"review:3050:1:gpt-6.1-sol\":\"6b996a6d799785df04d2b464a7c97dfa3a0365aac1606bcc884b33eb32b4be60\",\"review:3050:1:claude-opus-5-5\":\"0859918401cbfdfa2f983a6645e0f97e17182f7cf69b7bd78784086dd628c997\",\"artifact:3050:04fb1b6641ceba7525eb7436cc6da5621ccb0597ec5938d770bef66c906beafa\":\"04fb1b6641ceba7525eb7436cc6da5621ccb0597ec5938d770bef66c906beafa\",\"artifact:3050:117a6bbefaad6f519397838492e4af7b7d59b6c5276a4368d828a2e22196594d\":\"117a6bbefaad6f519397838492e4af7b7d59b6c5276a4368d828a2e22196594d\",\"artifact:3050:19c0be6d281095750fd9d442e3261fa5a532942b963ade6c5e08bbb30dc69190\":\"19c0be6d281095750fd9d442e3261fa5a532942b963ade6c5e08bbb30dc69190\",\"artifact:3050:1fc7cdc5463a54f3c65db1b747bc7d632e0dba24a481359990c83d583f2befef\":\"1fc7cdc5463a54f3c65db1b747bc7d632e0dba24a481359990c83d583f2befef\",\"artifact:3050:2da15b282cd8081ec561c4a902669f781c06e209468cc6385adb546ff2f4237c\":\"2da15b282cd8081ec561c4a902669f781c06e209468cc6385adb546ff2f4237c\",\"artifact:3050:492448f98dc11e969117f888921dc040e7e5d80e23b64014127903e9a9b2caaf\":\"492448f98dc11e969117f888921dc040e7e5d80e23b64014127903e9a9b2caaf\",\"artifact:3050:5a4cfab61ed1d72b9b90fcf02ae8854a24fc7ce8bbaad0fbe9b28dcb56a50b5a\":\"5a4cfab61ed1d72b9b90fcf02ae8854a24fc7ce8bbaad0fbe9b28dcb56a50b5a\",\"artifact:3050:635e18b58c5520c624255c6ec83836c5a817514d438b2462b60225d0a51f6d08\":\"635e18b58c5520c624255c6ec83836c5a817514d438b2462b60225d0a51f6d08\",\"artifact:3050:7ed3333bfb3731bea3fa21748c00cbfe6c0fc86b085bda6cc25a6741cf624b63\":\"7ed3333bfb3731bea3fa21748c00cbfe6c0fc86b085bda6cc25a6741cf624b63\",\"artifact:3050:aaa9264426d62712b76700b3873cf9016b138c0683ac4a3c7b349f7268920d2e\":\"aaa9264426d62712b76700b3873cf9016b138c0683ac4a3c7b349f7268920d2e\",\"artifact:3050:bcb09db7198f94b5aaf8ba1fb2652b6e1d09cb89a2e3ac6e93f810834b65283b\":\"bcb09db7198f94b5aaf8ba1fb2652b6e1d09cb89a2e3ac6e93f810834b65283b\",\"artifact:3050:d5da40b13b9afd668aa806f25590715d1d4daff7c82ab2add289ce5e2b46ca4c\":\"d5da40b13b9afd668aa806f25590715d1d4daff7c82ab2add289ce5e2b46ca4c\",\"artifact:3050:fa7dbccfc66cff06b2e1ff0653254375e9d3855bfe8d2267d411a1f2a2688895\":\"fa7dbccfc66cff06b2e1ff0653254375e9d3855bfe8d2267d411a1f2a2688895\",\"artifact:3050:ff192e4425c9e4e211fe2abc9c75393cc4412ec684f2c50fd542c21565af349c\":\"ff192e4425c9e4e211fe2abc9c75393cc4412ec684f2c50fd542c21565af349c\"},\"sha256\":\"410d1826bba8271a7710ca8ea719d9a2554933a007cd5dda766843edb829d13e\"},\"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:3050,input_sha256:\"4ce37b4def50b837265825e40298536c76957864e4ed05e0c4a51ae0db62a9b4\",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/3741/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"1816fd9cb1ead7cd6b7c9d3d69a747d3bd021891746aca149bfbe4c61c09db87","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}