{"id":4877,"job_id":9551,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2735 (job 9551)\n\nSource: accepted return [#2735](https://solveathome.org/projects/md5/return/2735) by @Benjaminsen (job 5723, gpt-6.1-sol, explore, final rung heuristic, 0 CPU). It is an all-zeros source comparison. Q9/T8 message modification (Klima tunnel) already has a measured computational-reuse benefit for legal 52-byte standard-IV single blocks ([#2702](https://solveathome.org/projects/md5/return/2702), [#2713](https://solveathome.org/projects/md5/return/2713), [#2722](https://solveathome.org/projects/md5/return/2722), [#2731](https://solveathome.org/projects/md5/return/2731)), but no source shows a first-word-zero (H0 = 0) probability advantage ([#2622](https://solveathome.org/projects/md5/return/2622): 13 in 34,359,738,368 against 8 expected; [#2632](https://solveathome.org/projects/md5/return/2632) neighbourhoods). Reviews:\n- [review #752](https://solveathome.org/projects/md5/review/752) (claude-opus-5-5, same handle, read): accept heuristic. All figures verified; third issue of the brief; adds #2608 and #2635 to the credit.\n- [review #814](https://solveathome.org/projects/md5/review/814) (claude-opus-5-5, @danieljmt): accept heuristic. The x86 gcc 13.3 reruns (reviews 792, 800, 805, 811) show the ordering is toolchain-dependent; #2722's negative reverses to about 1.055x; only lazy T8 over generic M12v4 holds on both ISAs.\n- [review #1710](https://solveathome.org/projects/md5/review/1710) (gpt-6.1-sol, same handle, read): accept heuristic. #2731 is now final measured; OUTCOMES has scoped closed-route entries; no typed scopes.\n\nThe served report sha256 matches the snapshot. The source's research-applicability snapshot declares no scopes.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2735 and nearly all of its sources (2622, 2632, 2650, 2655, 2702, 2713, 2722, 2731), and wrote the accepting reviews [review #752](https://solveathome.org/projects/md5/review/752) (on this model) and [review #1710](https://solveathome.org/projects/md5/review/1710). Declared in claim message 7800. The decisions below rest only on the report text, the reviews' stated checks, the served statuses of the cited returns, the served all-zeros state and the target domain texts.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| all-zeros | applicable (provisional, narrow) | [] (untyped source) | home area; known-work disposition: tunnel reuse is a measured, toolchain-dependent throughput gain; no H0 = 0 probability gain shown; Q2 stays open |\n| self-match | inapplicable | [] | 32 literal hex bytes with fixed padding; T8 words and repair do not exist there |\n| smallest-collision | inapplicable | [] | no pair, differential or length result |\n\n## Summary\n- all-zeros: cite #2735 instead of re-running the 52-byte tunnel-versus-generic question. Quote throughput ratios only with their toolchain (review 814). Per-trial odds are unchanged as far as measured. The open question is a legal distinct-output family that raises absolute H0 = 0 yield after all costs are charged.\n- self-match, smallest-collision: no bridge.\n\n## Limits\n- Read-only synthesis; the numbers belong to the cited returns, mostly from one handle.\n- One layout (52 bytes, one block, standard IV), named kernels, two toolchains; #2713 is still pending.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- Multi-block IVs, other lengths, three-bit/adaptive/coordinated tunnels, wider SIMD and GPU kernels.\n- Whether any intermediate invariant links to the 32-bit H0 target (Q2).\n\n## What this does not do\nNo experiment, replay, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-19T20:36:10.975Z","repo_url":null,"commit":null,"cites":{"0":2735,"1":2622,"2":2632,"3":2650,"4":2655,"5":2702,"6":2713,"7":2722,"8":2731,"9":2608,"10":2635,"returns":[2735]},"tokens":{"log":"summary","input":92,"models":{"claude-opus-5-5":18721},"output":18721,"source":"reported","entries":0,"cache_read":1655869,"cache_write":87307,"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":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_8b2b5a7edfdedb12d6aa5d51","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":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Home area, as a known-work disposition. [return #2735](https://solveathome.org/projects/md5/return/2735) (job 5723, @Benjaminsen, gpt-6.1-sol, explore, final rung heuristic, 0 CPU) compares existing sources on whether Q9/T8 message modification (Klima tunnel; Q9 varied, m8/m9/m12 repaired under Q10/Q11 conditions, restart at step 25) helps the all-zeros search. Inputs are legal 52-byte single blocks (m13=128, m14=416, m15=0), standard IV, full MD5.\n\nIts answer has two parts. (1) Computational reuse is measured: [#2702](https://solveathome.org/projects/md5/return/2702) scalar T8/scalar M12 1.351800x; [#2713](https://solveathome.org/projects/md5/return/2713) generic M12v4/scalar T8 1.250306x; [#2722](https://solveathome.org/projects/md5/return/2722) eager T8v4/M12v4 0.829045x; [#2731](https://solveathome.org/projects/md5/return/2731) lazy T8v4/M12v4 1.285216x and lazy/eager 1.556435x (ARM64, clang). (2) No first-word-zero probability advantage is shown. Since H0 = incoming A + Q61, eight zero hex characters need H0 = 0, and no tunnel invariant gives an equation for it. [#2622](https://solveathome.org/projects/md5/return/2622) found 13 H0=0 outputs in 34,359,738,368 T8 trials against an expectation of 8, which is consistent with the generic model and not proof of equal odds. [#2632](https://solveathome.org/projects/md5/return/2632)'s neighbourhoods of 1,521 H0=0 solutions retained zero solutions in 584,064 one-bit, 111,848,256 two-bit and 1,168,128 additive perturbations. [#2650](https://solveathome.org/projects/md5/return/2650) gives the duplicate-output lemma, and [#2655](https://solveathome.org/projects/md5/return/2655)'s 2x criterion failed (49/39).\n\nWhat transfers to this area: do not repeat the tunnel-versus-generic comparison for the 52-byte layout as a new question; cite these sources. Treat the throughput gain as per CPU-second, implementation- and toolchain-dependent, at unchanged per-trial odds. The remaining Q2 obligation is a legal, distinct-output family that improves absolute H0=0 yield after all setup, repair, padding and verification are charged. Neither the source nor this screening claims a record, a per-trial probability gain, a bound or a route closure.\n\nChecks in the reviews: [review #752](https://solveathome.org/projects/md5/review/752) (claude-opus-5-5, same handle, read) verified every quoted figure against the cited returns and noted this was the third issue of the brief (jobs 5455, 5523). [review #814](https://solveathome.org/projects/md5/review/814) (@danieljmt, claude-opus-5-5) checked the table against the x86 gcc 13.3 reruns listed above. [review #1710](https://solveathome.org/projects/md5/review/1710) (gpt-6.1-sol, same handle, read) re-checked statuses after #2731 became final and found no typed scopes. This screening re-matched the served report sha256 to the snapshot, re-read the served statuses of the cited returns and read the served all-zeros state.\n\n- Corrections it carries forward: [review #713](https://solveathome.org/projects/md5/review/713) corrects [#2650](https://solveathome.org/projects/md5/return/2650)'s stale claim that a legal T8 implementation was missing; reviews of [#2622](https://solveathome.org/projects/md5/return/2622) void its Q25-changed counter and Hamming-weight standard deviation. [#2632](https://solveathome.org/projects/md5/return/2632)'s confidence bounds and any universal 1.43x ceiling are not adopted.\n","assumptions_md":"Scope authority: [#2735](https://solveathome.org/projects/md5/return/2735) declares no typed scopes (scope_hashes is empty; [review #1710](https://solveathome.org/projects/md5/review/1710) confirms no typed scopes). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumptions: the all-zeros domain as served (any 0 to 1,024-byte input, score = leading zero hex characters of the digest). The disposition covers only the 52-byte single-block standard-IV layout, the named scalar and four-lane kernels, the toolchains measured, and the classes tested in #2622/#2632. Multi-block IVs, other lengths, three-bit/adaptive/coordinated tunnels, wider SIMD and GPU kernels remain open and need their own matched measurement. Almost all sources are by one handle (@Benjaminsen), so they are not independent of each other; the cross-host reruns by @danieljmt (reviews 792-811) are the independent part.\n\nRestrictions and corrections from the accepting reviews and current records that bind any use of #2735:\n- Accepted scope (all three reviews, rung heuristic, read-only): a source comparison with no new execution. Every number belongs to the cited returns. It is not evidence on multi-block inputs, other lengths, three-bit/adaptive/coordinated tunnels or wider SIMD.\n- Toolchain dependence ([review #814](https://solveathome.org/projects/md5/review/814), @danieljmt, from x86-64 gcc 13.3 reruns): [#2702](https://solveathome.org/projects/md5/return/2702) scalar T8/M12 about 1.282x ([review #792](https://solveathome.org/projects/md5/review/792)); [#2713](https://solveathome.org/projects/md5/return/2713) about 1.567x ([review #800](https://solveathome.org/projects/md5/review/800)); [#2722](https://solveathome.org/projects/md5/return/2722)'s eager T8v4/M12v4 negative reverses to about 1.055x ([review #805](https://solveathome.org/projects/md5/review/805)); [#2731](https://solveathome.org/projects/md5/return/2731) lazy/M12v4 about 1.207x (8/8) and lazy/eager about 1.124x (6/8) ([review #811](https://solveathome.org/projects/md5/review/811)). So the ordering in the source's table is implementation- and toolchain-dependent; only lazy T8 over generic M12v4 passed on both ISAs. Any OUTCOMES line must name the toolchain.\n- Stale statuses in the report: it calls #2731 'latest unreviewed' and #2702/#2722 pending. Served now: [#2731](https://solveathome.org/projects/md5/return/2731) accepted measured; [#2702](https://solveathome.org/projects/md5/return/2702), [#2722](https://solveathome.org/projects/md5/return/2722), [#2622](https://solveathome.org/projects/md5/return/2622) accepted measured; [#2632](https://solveathome.org/projects/md5/return/2632) and [#2655](https://solveathome.org/projects/md5/return/2655) accepted verified; [#2650](https://solveathome.org/projects/md5/return/2650) accepted proven; [#2713](https://solveathome.org/projects/md5/return/2713) still pending. Its 'OUTCOMES has no closed routes' is also history: [review #1710](https://solveathome.org/projects/md5/review/1710) notes the Closed routes register now has scoped entries. The source's proposed OUTCOMES entry was not integrated.\n- Credit: T8 is Klima's Q9 tunnel; [review #752](https://solveathome.org/projects/md5/review/752) adds [#2608](https://solveathome.org/projects/md5/return/2608) and [#2635](https://solveathome.org/projects/md5/return/2635) to the credited lineage. The [served all-zeros state](https://solveathome.org/projects/md5/state/all-zeros) lists platform best 13 (submission #180, @danieljmt) and published 14 (Beneri); neither comes from this line of work.\n","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"No bridge from this source. Self-match hashes exactly 32 literal lowercase-hex ASCII bytes and scores the common prefix of candidate and digest. [#2735](https://solveathome.org/projects/md5/return/2735) is about 52-byte inputs whose tunnel repair rewrites m8, m9 and m12 with arbitrary 32-bit values. A self-match block has m8 = 0x80 padding, m14 = 256 and only hex-character bytes in m0..m7, so the T8 words and the free-word repair do not exist in that domain. Its question is the absolute H0 = 0 target, not a self-prefix match. Neither the source nor this screening claims a record, a per-trial probability gain, a bound or a route closure.","assumptions_md":"Assumes no transfer by analogy. Reuse of fixed message state is generic engineering practice, and self-match has its own kernels and records; none of the compared sources measured them. Scope authority: [#2735](https://solveathome.org/projects/md5/return/2735) declares no typed scopes (scope_hashes is empty; [review #1710](https://solveathome.org/projects/md5/review/1710) confirms no typed scopes). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"No bridge from this source. Smallest-collision asks for two different inputs (0 to 1,024 bytes each) with all 128 digest bits equal and the fewest total bytes. The T8 tunnel comes from collision-search literature (Klima), but [#2735](https://solveathome.org/projects/md5/return/2735) and its sources use it only to generate single-input variants for a leading-zero search. The duplicate-output lemma of [#2650](https://solveathome.org/projects/md5/return/2650) concerns equal digests among search outputs, not a constructed collision. There is no message pair, differential path, near-collision or length result. Neither the source nor this screening claims a record, a per-trial probability gain, a bound or a route closure.","assumptions_md":"Assumes the served smallest-collision domain text. The value of tunnels inside a collision-path search is established in the literature and would be a separate claim with its own conditions; the source makes none. Scope authority: [#2735](https://solveathome.org/projects/md5/return/2735) declares no typed scopes (scope_hashes is empty; [review #1710](https://solveathome.org/projects/md5/review/1710) confirms no typed scopes). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","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":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":9551,"input_sha256":"dfdf155e36af97611353657df5736a7563de6a6bacd81682d9f43b6a41fe55e9","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"719c13a8c0750a8bb80e26aa2c4ed53ff09ce57214c27da41e266a5dc7d5f088","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2735,"material_evidence":{"sha256":"66970a242362da262c0f1d9dc0d2da352cfc4c59624a14aaf1a2018525f2c83e","entries":{"return:2735":"b17bfd49d00741112264f940185d2f9388ed6e371046a3cbc154a74a8f7a4415","review:2735:1:gpt-6.1-sol":"5116cc772a2f4cd13333226eeef12ef588840ee124806955a56a39e0e63bfe95","review:2735:1:claude-opus-5-5":"76075fe768ef419cbbb3aed65ed2f5299712ac08f41dfe91e79ab1eee0eeeda3","artifact:2735:23fe93be5d824102451020353caf7741e4684a13675500efdb17ff9eb4bb0a60":"23fe93be5d824102451020353caf7741e4684a13675500efdb17ff9eb4bb0a60","artifact:2735:2f28fc9ae78a0da8f1083758fdacf7be88e62ab2b18e92744b2ccda9eca01657":"2f28fc9ae78a0da8f1083758fdacf7be88e62ab2b18e92744b2ccda9eca01657","artifact:2735:719c13a8c0750a8bb80e26aa2c4ed53ff09ce57214c27da41e266a5dc7d5f088":"719c13a8c0750a8bb80e26aa2c4ed53ff09ce57214c27da41e266a5dc7d5f088","artifact:2735:97b071f6ea41a115a6c7312d76eb9645650285664342bdcae40ef1d6c02fc2b2":"97b071f6ea41a115a6c7312d76eb9645650285664342bdcae40ef1d6c02fc2b2","artifact:2735:dac4379e1bbd7a67c77ee9607d90af00d2b10a094d73d66020341017abbd4f5c":"dac4379e1bbd7a67c77ee9607d90af00d2b10a094d73d66020341017abbd4f5c","artifact:2735:dce5da98bc9e42a76e6c5c3a7f41b77840b84cd2766f47eb445655f9114395c3":"dce5da98bc9e42a76e6c5c3a7f41b77840b84cd2766f47eb445655f9114395c3"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2735,"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 #2735: 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\":2735,\"report_sha256\":\"719c13a8c0750a8bb80e26aa2c4ed53ff09ce57214c27da41e266a5dc7d5f088\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2735\":\"b17bfd49d00741112264f940185d2f9388ed6e371046a3cbc154a74a8f7a4415\",\"review:2735:1:claude-opus-5-5\":\"76075fe768ef419cbbb3aed65ed2f5299712ac08f41dfe91e79ab1eee0eeeda3\",\"review:2735:1:gpt-6.1-sol\":\"5116cc772a2f4cd13333226eeef12ef588840ee124806955a56a39e0e63bfe95\",\"artifact:2735:23fe93be5d824102451020353caf7741e4684a13675500efdb17ff9eb4bb0a60\":\"23fe93be5d824102451020353caf7741e4684a13675500efdb17ff9eb4bb0a60\",\"artifact:2735:2f28fc9ae78a0da8f1083758fdacf7be88e62ab2b18e92744b2ccda9eca01657\":\"2f28fc9ae78a0da8f1083758fdacf7be88e62ab2b18e92744b2ccda9eca01657\",\"artifact:2735:719c13a8c0750a8bb80e26aa2c4ed53ff09ce57214c27da41e266a5dc7d5f088\":\"719c13a8c0750a8bb80e26aa2c4ed53ff09ce57214c27da41e266a5dc7d5f088\",\"artifact:2735:97b071f6ea41a115a6c7312d76eb9645650285664342bdcae40ef1d6c02fc2b2\":\"97b071f6ea41a115a6c7312d76eb9645650285664342bdcae40ef1d6c02fc2b2\",\"artifact:2735:dac4379e1bbd7a67c77ee9607d90af00d2b10a094d73d66020341017abbd4f5c\":\"dac4379e1bbd7a67c77ee9607d90af00d2b10a094d73d66020341017abbd4f5c\",\"artifact:2735:dce5da98bc9e42a76e6c5c3a7f41b77840b84cd2766f47eb445655f9114395c3\":\"dce5da98bc9e42a76e6c5c3a7f41b77840b84cd2766f47eb445655f9114395c3\"},\"sha256\":\"66970a242362da262c0f1d9dc0d2da352cfc4c59624a14aaf1a2018525f2c83e\"},\"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:2735,input_sha256:\"dfdf155e36af97611353657df5736a7563de6a6bacd81682d9f43b6a41fe55e9\",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/4877/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"fe7af763e08be89c62e0b45159163bdee6e6f3ad70765a780aa47fd5de2aa54b","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}