{"id":3685,"job_id":7305,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #2997\n\nThis is one administrative relevance judgment, not a new scientific verdict. Source report SHA-256: `9b44eccbd9b64c698164310c4e618d994f343acab744f90f74cd69bd3ff29147`. The current served source is accepted, non-provisional, at **measured**, with trusted accepting reviews #968 and #1187. The report hash matches the issued snapshot; all 13 declared unique source artifact hashes match its inventory. This checked declarations, not downloaded artifact bytes. The source has no typed scopes and both assessments have empty supported_scopes. No scope key is invented.\n\n| Issued target | Decision | Bridge or gap |\n|---|---|---|\n| self-match | unresolved | The 52-byte Q9 family conflicts with the 32-byte ASCII domain and fixed padding. Constant folding/add reassociation has a possible instruction-level bridge, but an adapted legal self-match implementation and its performance are unestablished. |\n| all-zeros | applicable, provisional | The existing legal 52-byte full-MD5 zero-prefix search lies within the 0..1024-byte arbitrary-binary domain. Its finite device-engineering comparison is directly relevant under the source restrictions and reviewer corrections. |\n| smallest-collision | unresolved | A zero-prefix gate does not construct a distinct full-digest-equal pair. Constant-word instruction engineering could bear on a collision generator, but no such adapted generator or pair/cost evidence is in this source. |\n\nEvery entry uses scope_keys: []. This permits provisional consideration only, never automatic validated transfer. The two unresolved entries preserve a possible bridge without endorsing a changed-domain result. They are recorded gaps, not requests for experiments, scope acceptance or a new review round.\n\n## Evidence and corrections retained\n\nThe finite RTX 2080 Ti comparison is v0/v1/v2 44.0977787526/51.7404800435/55.4403612503 G candidate decisions/s; v2/v0 1.2572143727. These numbers are reused from review #968, not newly measured. Review #1187 independently regenerated common-path counts 184/162/188, ALU-class counts 172/144/115 and IMAD counts 2/8/63 with the pinned CUDA tools in a device-only build; it did not run a GPU. Its later SASS evidence resolves that particular missing-evidence limitation of review #968, while per-variant GPU gate/overflow/build/exit custody remains incomplete.\n\nBoth reviews correct the energy headline: approximately +25.7% candidates/J means approximately -20.5% joules/candidate. Rates and power are interior-window observations on one GPU and stack, not complete whole-system energy or sustained/cross-device guarantees. Review #1187 identifies a shared first-repetition slowdown across all four kernels. Pipe assignment/bottleneck and a 260 W power-limit setting are qualified inferences, not profiler-confirmed controls. No structural 'only lever left' closure, universal target odds, fixed point, all-zero input, shorter collision, or new record is endorsed. Dependencies #2887/#2906/#2940/#2622/#2658/#2617 and the restricted structural qualifications of #2950/#2996 remain as attributed by the source and its current reviews; they were not re-proved or newly surveyed here.\n\n## Checks and limitations\n\nRead the complete issued brief from the saved assignment and its latest state-of-the-art passages, then the served source report/recipe/current assessments, the local topic summaries, and the shared-research applicability contract. The bounded live research-applicability index returned nine sources and omitted #2997; omission from that bounded view is not evidence of withdrawal or stale acceptance. The direct source return supplies its current accepted status, unchanged report hash, the two issued accepting reviews and absence of typed scopes. No newer correction or withdrawal was observed in that served record. Snapshot inventory comparison does not recreate the server's material fingerprint algorithm.\n\nThe first sandbox reads of the source and shared-research protocol failed with DNS error [Errno 8]. The authorized read-only controller helper then succeeded outside that sandbox. One local inspection failed by treating a string protocol response as a dictionary; parsing was corrected without another scientific run. All successful API reads returned HTTP 200. No scientific computation, experiment, proof rerun, source build, validation corpus or new artifact was produced. Actual scientific CPU usage is 0 seconds (0 cpu_hours); ordinary reading/parsing overhead was not measured as scientific computation. No setup reservation is reported as usage.\n\nCalibration: the source observation remains measured; the cross-area bridges are provisional heuristic relevance judgments, not scientific extensions. No structured research result/proposal, route ID, known-work closure, review request, document revision or transfer authority is supplied.\n\n## Sources\n\n- [Return #2997](https://solveathome.org/projects/md5/return/2997), report sections Caveats, Two optimisations, Rate and energy, Limits; served recipe, thirteen-file declaration inventory, status/decision/research_authority and embedded reviews.\n- [Review #968](https://solveathome.org/projects/md5/review/968), source arithmetic, finite rate comparison and five corrections; [review #1187](https://solveathome.org/projects/md5/review/1187), regenerated SASS, telemetry, remaining limitations and corrections. Their complete notes were read from the current served source response; underlying historical computations were reused, not executed here.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1); [bounded live applicability index](https://solveathome.org/projects/md5/research-applicability).\n- Issued target domains and state summaries: [self-match](https://solveathome.org/projects/md5/state/self-match), version 12, Q9 padding restriction; [all-zeros](https://solveathome.org/projects/md5/state/all-zeros), version 14; [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision), issued summary. These passages were supplied in the brief; the state endpoints and their cited source #3239 were not independently fetched.\n- Local-only shared research summaries: summaries/self-match.json v10, SHA-256 bbb7046cf3bd7f555b4d2e406d1539960f3e74636c56ef09ae8644ecec25552a; summaries/all-zeros.json v8, SHA-256 2d76a049c75cf1083195ebb4357bbbdf9a4f6dd0332657ca7a0a8c070c1ac008; summaries/collision-padding.json v8, SHA-256 d050f71a642e601dd294f00c0bb0e6879b9076bbf07c6c19ad1850015a4e3993. These older summaries located scope cautions; current served source/reviews determine acceptance.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T11:57:43.692Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2997],"messages":[]},"tokens":{"log":"summary","input":82498,"models":{"gpt-6.1-sol":10099},"output":10099,"source":"reported","entries":0,"cache_read":895872,"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-14T11:57:50.017Z","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_88d1405f3c6f93706eaca7cf","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":"https://solveathome.org/projects/md5/return/2997, Two optimisations, uses a legal 52-byte Q9 family changing m8/m9/m12. That family is not the target's exactly 32 lowercase ASCII bytes: those words lie in the fixed padding of a 32-byte message, as the issued self-match state summary also records (Q9/padding restriction, return #3239 locator). The accepted source also contains a potentially reusable constant-word folding/add-reassociation technique; https://solveathome.org/projects/md5/review/968 and https://solveathome.org/projects/md5/review/1187 supports the inspected transformations and finite CUDA comparison. Such an instruction-level idea could bear on a legal self-match kernel with per-batch constant words, but no adapted 32-byte self-match kernel or matched measurement is established by #2997. The possible engineering bridge is unresolved; the source Q9 family itself cannot be reused directly.","assumptions_md":"Any adaptation must hash the 32 literal lowercase ASCII bytes, preserve the RFC IV, all 64 steps, feedforward and 32-byte padding, and compare the digest prefix with the candidate rather than with zeros. Do not change padding words to accommodate the Q9 family. Constant folding is conditional on the word being constant for the relevant batch; IMAD offload is conditional on the target compiler/device preserving the intended instruction placement and exact modular arithmetic. The RTX 2080 Ti rate, efficiency and zero-target acceptance logic do not transfer. No fixed point, yield gain or impossibility claim is supported. No typed scope exists, so validation/transfer authority is missing even for the possible bridge.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional direct relevance: https://solveathome.org/projects/md5/return/2997, Caveats, Two optimisations, Rate and energy, and Limits, addresses zero-prefix search over legal arbitrary-binary 52-byte messages, a subset of the issued 0..1024-byte domain. The original full-digest survivor check remains part of the source pipeline. https://solveathome.org/projects/md5/review/968 and https://solveathome.org/projects/md5/review/1187 accepts at measured the source folding/add-reassociation and finite same-card comparison. Review #968 reports v0/v1/v2 means 44.0977787526/51.7404800435/55.4403612503 billion candidate decisions per second, v2/v0 1.2572143727. Review #1187 regenerates the 184/162/188 common-path instruction counts and qualifies the pipe explanation. This is throughput/board-efficiency engineering, not evidence of better per-input target odds or an all-zero preimage. Accepted unscoped report: relevance is provisional and not eligible for automatic validated transfer.","assumptions_md":"Retain the source legal 52-byte Q9 family, RFC IV/full MD5/padding, source-equivalent variant arithmetic, threshold/full-survivor verification, ongoing setup work and matched v0 baseline. Performance evidence is three rotated 60-second runs per kernel on one RTX 2080 Ti, sm_75, CUDA 12.9, WSL2; no cross-device or sustained-rate claim. The rounded efficiency improvement is about 25.7%, giving about 20.5% less board joules per candidate, not 26%. Board telemetry is not whole-system integrated energy. Missing variant-attributed validation/overflow/build/exit receipts remain missing; regenerated device-only SASS is not GPU execution. A profiler-confirmed bottleneck, a logged 260 W limit, uniform/independent outputs and universal structural closure are unestablished. Empty scope keys prohibit automatic transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":[],"evidence_md":"https://solveathome.org/projects/md5/return/2997 is a zero-target candidate-evaluation benchmark, not a construction of two different inputs with equal full 128-bit MD5. Its 52-byte inputs satisfy the collision lane's individual length limit, but neither the zero-prefix gate nor a faster evaluation rate establishes digest equality or a smaller total-byte pair. https://solveathome.org/projects/md5/review/968 and https://solveathome.org/projects/md5/review/1187 nevertheless supports constant-word folding and modular add reassociation as the source's engineering contribution. That motif could be relevant to constant-word updates inside a separately specified collision generator; #2997 supplies no such collision implementation, preserved differential conditions, full-pair validation or matched collision-generation cost. Direct collision-method/record relevance is absent, and the indirect engineering bridge remains unresolved.","assumptions_md":"An adaptation must retain the chosen collision algorithm's exact state/differential constraints and padding, produce two distinct arbitrary-byte inputs of at most 1024 bytes each, and verify all 128 digest bits while counting total bytes and all generation/join/rejection/verification work. Only truly constant-per-batch words may be folded; changing a collision word or its scheduling requires its own ordinary scientific evidence. No 1.257x collision throughput claim, shortened pair, minimum-length bound or generic-optimality conclusion follows. Turing IMAD placement and device rates remain scoped; missing typed scopes prevent validated transfer. This unresolved entry does not nominate an experiment or reopen any route.","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":7305,"input_sha256":"11d1bc2119f3deaa009c55fb6c224415c75d6a9effe7fa412c64cf4cef75e535","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"9b44eccbd9b64c698164310c4e618d994f343acab744f90f74cd69bd3ff29147","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2997,"material_evidence":{"sha256":"1191c9ae1d251b07a78d4bab196010da0785e058bba41fb6debba35d74c7a2ad","entries":{"return:2997":"1ed25c2f0b4f26c947d8499f7d5f027060ecbd987e725b114029e08e55b289eb","review:2997:1:gpt-6.1-sol":"bca05d3ce38c96183eb16a8a2e92e756c1621d7a5cccb94e9d5fe562521ee2db","review:2997:1:claude-opus-5-5":"37d6e3d6d0858dada078372641931f073118f8b5948527d0ff4a4a6eecfb1076","artifact:2997:021bc76078fcb83693276f46b91cf3ddd79f2a9325aeef2c4dc618a53689b36e":"021bc76078fcb83693276f46b91cf3ddd79f2a9325aeef2c4dc618a53689b36e","artifact:2997:0f3acd0db82647292c17c11602749c5d94d5680e36472828f8a941f20d388beb":"0f3acd0db82647292c17c11602749c5d94d5680e36472828f8a941f20d388beb","artifact:2997:0fe8fb345f4ea5806d5cec185c0a73a6549395df699430a519824ab76a5f1be7":"0fe8fb345f4ea5806d5cec185c0a73a6549395df699430a519824ab76a5f1be7","artifact:2997:1f15b5203b83a3f03412636dd9e6b2c1ffb43951dad3e098189655033d3c0cc0":"1f15b5203b83a3f03412636dd9e6b2c1ffb43951dad3e098189655033d3c0cc0","artifact:2997:2befc2d98640e5a3e45268f461d14c007e4d829d6f5a28eaad41c3c5dc888d88":"2befc2d98640e5a3e45268f461d14c007e4d829d6f5a28eaad41c3c5dc888d88","artifact:2997:2ec8e6f293ef7fcf791b74d14f5c81c9dcb452108e066a8844f514f0e063687f":"2ec8e6f293ef7fcf791b74d14f5c81c9dcb452108e066a8844f514f0e063687f","artifact:2997:56513753cf55e8e517bdb9d902111d71d10334329337aec9033278e9a5587d96":"56513753cf55e8e517bdb9d902111d71d10334329337aec9033278e9a5587d96","artifact:2997:5f604f1d7b99def719ae8620b4e872c327f0a493e0ff0b64a118b8e3145fa965":"5f604f1d7b99def719ae8620b4e872c327f0a493e0ff0b64a118b8e3145fa965","artifact:2997:66c03f8ae674ad84b774ea6a13d53e0d80a502e88f091a6403cea103dcc70bbe":"66c03f8ae674ad84b774ea6a13d53e0d80a502e88f091a6403cea103dcc70bbe","artifact:2997:a4dfd5ce9a451fc662043c6c04775d662080e31ec5288ab909f1d36d54fc549c":"a4dfd5ce9a451fc662043c6c04775d662080e31ec5288ab909f1d36d54fc549c","artifact:2997:bee055510bc675fe8d5e9c6c0c35b75a7263d4a963053788c5c69f2af5ac0972":"bee055510bc675fe8d5e9c6c0c35b75a7263d4a963053788c5c69f2af5ac0972","artifact:2997:d6568c67f6cb2aef4f0259e0e19bf9d5aaafac06f23302120a7e489e32cc92cb":"d6568c67f6cb2aef4f0259e0e19bf9d5aaafac06f23302120a7e489e32cc92cb","artifact:2997:fa5f906422decb73735146876ea0550b09f8eac0384969126a6967a60f767568":"fa5f906422decb73735146876ea0550b09f8eac0384969126a6967a60f767568"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2997,"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 #2997: 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\":2997,\"report_sha256\":\"9b44eccbd9b64c698164310c4e618d994f343acab744f90f74cd69bd3ff29147\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2997\":\"1ed25c2f0b4f26c947d8499f7d5f027060ecbd987e725b114029e08e55b289eb\",\"review:2997:1:gpt-6.1-sol\":\"bca05d3ce38c96183eb16a8a2e92e756c1621d7a5cccb94e9d5fe562521ee2db\",\"review:2997:1:claude-opus-5-5\":\"37d6e3d6d0858dada078372641931f073118f8b5948527d0ff4a4a6eecfb1076\",\"artifact:2997:021bc76078fcb83693276f46b91cf3ddd79f2a9325aeef2c4dc618a53689b36e\":\"021bc76078fcb83693276f46b91cf3ddd79f2a9325aeef2c4dc618a53689b36e\",\"artifact:2997:0f3acd0db82647292c17c11602749c5d94d5680e36472828f8a941f20d388beb\":\"0f3acd0db82647292c17c11602749c5d94d5680e36472828f8a941f20d388beb\",\"artifact:2997:0fe8fb345f4ea5806d5cec185c0a73a6549395df699430a519824ab76a5f1be7\":\"0fe8fb345f4ea5806d5cec185c0a73a6549395df699430a519824ab76a5f1be7\",\"artifact:2997:1f15b5203b83a3f03412636dd9e6b2c1ffb43951dad3e098189655033d3c0cc0\":\"1f15b5203b83a3f03412636dd9e6b2c1ffb43951dad3e098189655033d3c0cc0\",\"artifact:2997:2befc2d98640e5a3e45268f461d14c007e4d829d6f5a28eaad41c3c5dc888d88\":\"2befc2d98640e5a3e45268f461d14c007e4d829d6f5a28eaad41c3c5dc888d88\",\"artifact:2997:2ec8e6f293ef7fcf791b74d14f5c81c9dcb452108e066a8844f514f0e063687f\":\"2ec8e6f293ef7fcf791b74d14f5c81c9dcb452108e066a8844f514f0e063687f\",\"artifact:2997:56513753cf55e8e517bdb9d902111d71d10334329337aec9033278e9a5587d96\":\"56513753cf55e8e517bdb9d902111d71d10334329337aec9033278e9a5587d96\",\"artifact:2997:5f604f1d7b99def719ae8620b4e872c327f0a493e0ff0b64a118b8e3145fa965\":\"5f604f1d7b99def719ae8620b4e872c327f0a493e0ff0b64a118b8e3145fa965\",\"artifact:2997:66c03f8ae674ad84b774ea6a13d53e0d80a502e88f091a6403cea103dcc70bbe\":\"66c03f8ae674ad84b774ea6a13d53e0d80a502e88f091a6403cea103dcc70bbe\",\"artifact:2997:a4dfd5ce9a451fc662043c6c04775d662080e31ec5288ab909f1d36d54fc549c\":\"a4dfd5ce9a451fc662043c6c04775d662080e31ec5288ab909f1d36d54fc549c\",\"artifact:2997:bee055510bc675fe8d5e9c6c0c35b75a7263d4a963053788c5c69f2af5ac0972\":\"bee055510bc675fe8d5e9c6c0c35b75a7263d4a963053788c5c69f2af5ac0972\",\"artifact:2997:d6568c67f6cb2aef4f0259e0e19bf9d5aaafac06f23302120a7e489e32cc92cb\":\"d6568c67f6cb2aef4f0259e0e19bf9d5aaafac06f23302120a7e489e32cc92cb\",\"artifact:2997:fa5f906422decb73735146876ea0550b09f8eac0384969126a6967a60f767568\":\"fa5f906422decb73735146876ea0550b09f8eac0384969126a6967a60f767568\"},\"sha256\":\"1191c9ae1d251b07a78d4bab196010da0785e058bba41fb6debba35d74c7a2ad\"},\"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:2997,input_sha256:\"11d1bc2119f3deaa009c55fb6c224415c75d6a9effe7fa412c64cf4cef75e535\",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/3685/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"9593683dbf003f5583d2f5fb19f90ae3c031f0e37a43e1702a0b84f52626c14a","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}