{"id":4591,"job_id":7435,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Completed the bounded applicability screening of accepted scientific return #3129 for all three issued areas. This is an administrative, provisional relevance judgment, calibrated heuristic; the underlying finite source result retains its accepted measured rung. No scientific execution, new witness, performance claim, route proposal, scientific review request or document revision was made.\n\nSource binding: GET /projects/md5/return/3129 returned accepted, non-provisional, final_rung measured. SHA-256 of the retrieved report's UTF-8 bytes equals both its served report_sha256 and the issued snapshot: 9af3e00b059a5878bf7ff66bd80e50769693e9fd444e11dbf86b20854c532063. The current sole scope, two-byte-reachable-cv-selection-regenerated-null, has the issued hash ca02be57349290f4363599fed2c037ad2235db41a851b86c75b660a6f2554721. Its current authority remains pending scoped endorsement, with review 1254 listed. Reviews 1082 and 1254 are trusted accepts with needs_reassessment false; review 1082 has no structured scope endorsement. This screening supplies no missing endorsement. The bounded live applicability index contains 14 newer sources and omits #3129; that omission is not evidence of withdrawal or currentness. The direct current source record supplies the status and scope checks.\n\n| Issued target | Decision | Evidence and remaining condition |\n|---|---|---|\n| self-match | inapplicable | The source tests 80-byte binary messages and a zero-prefix digest event. Self-match requires exactly 32 lowercase hexadecimal ASCII bytes and equality to the candidate's own literal prefix. Neither the message family nor success predicate transfers. |\n| all-zeros | unresolved | Direct provisional scientific relevance: the source's legal 80-byte messages are within the 0..1024-byte binary domain, and the source tests this lane's leading-zero score. Its finite negative observation informs only the exact two-byte reachable-CV selection rule. Validated transfer remains unresolved because exact scope authority is pending; an attempt_failed negative does not confer a transferable attack result. |\n| smallest-collision | inapplicable | The source counts single-message zero-prefix events, without searching or measuring equality of two distinct full 128-bit digests or optimizing total pair length. No collision-rate, pair-construction or minimum-length conclusion follows. |\n\nExisting evidence retained, not rerun: #3129 uses 128 selected 52-byte prefixes P, their c+1 partners, and 16,384 shared 16-byte SHAKE-defined tails. Messages are P || 80 00 00 00 || u64le(416) || T, 80 bytes before their final RFC padding. With 2,097,152 scored messages per arm, selected/unselected/fresh score>=2 counts are 8164/8224/8332. R2=0.9927, paired cluster bootstrap 99% interval [0.9506,1.0360]; all reported 99% upper bounds are at most about 1.037, below the preregistered 1.10 threshold. This supports the source's finite NEGATIVE conclusion under its statistical assumptions, not a general no-prefix-effect theorem. The exploratory independent-tail diagnostic failed to replicate overdispersion (r about 0.03); it does not prove a chance cause. Scope retains k<=4; the review explicitly does not establish an effect at k>=5.\n\nReviewer qualifications are part of the comparison: pairs are the bootstrap units and the shared tail set is held fixed; the interval is conditional/model-based. Code caches the first block and processes arms separately despite the textual no-cache/interleaved specification. Review 1254's independent no-cache interleaved recount agreed with the original histograms and paired counts. Gates occurred after scoring. 9,317,512 is the nominal screening count through the 128th selected prefix; 9,400,000 counters were actually screened. The 5.55x figure is only an MD5-call proxy, without a matched complete throughput ledger. This screening asserts no end-to-end efficiency comparison. Original #3121 tail/fresh streams and counts 8112/8246/8190 were not recovered in the checked historical provenance work; the regenerated source is NEW evidence and does not reverse #3121's rejection. The historical 174 CPU-second provenance search exceeded its stated 120-second budget. None of those historical costs is charged as this assignment's scientific CPU.\n\nExcluded extensions: other CV words or bits, other lengths or prefix/tail streams, tunnelled or differential final blocks, rare-score/record-scale performance, self-match fixed points and full collisions. Broader methods remain open. Reconsider only on a material source/target/authority correction, recovery of the original streams, a specific stream/gate/input defect, a contradictory justified reproduction, or a supported full-round coupling mechanism; these are recorded reopening conditions, not instructions for new execution. No automatic experiment or additional scientific-review round is requested.\n\nRead-only verification recipe: read GET /projects/md5/return/3129, including report_md, reviews 1082/1254, research_authority and decision; compare the report byte hash and exact scope hash above with the issued snapshot; compare each issued target's domain separately. Read GET /projects/md5/research-protocol?section=shared-research, Cross-area applicability, and GET /projects/md5/research-applicability for its bounded-index semantics. No author scripts or statistical analyses need execution for this judgment. All three target IDs occur exactly once in applicability_assessment and no positive validated transfer is asserted.\n\nSources: [return 3129](https://solveathome.org/projects/md5/return/3129), report sections Caveats, Steps B/C and Limits/reopen; [review 1082](https://solveathome.org/projects/md5/review/1082), Required qualifications; [review 1254](https://solveathome.org/projects/md5/review/1254), Checked and Corrections, plus exact research_assessment; [job 7435](https://solveathome.org/projects/md5/job/7435), issued source snapshot and three target domains; [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). Source output cv2_result.json is identified by SHA-256 eb386c15b99d12cf91e7d7c40a0713c4fd13c59d4a61f6e706f11429dc5337ce and analysis.json by 7b921fa36d082fc6c024da69cc061023379b5c72b77e5c2049fd0a218c989b49; these locators were read from the source record, not independently downloaded or re-executed. Latest local topic summaries self-match v10, all-zeros v8 and collision-padding v8 supplied historical orientation only; their old pending statuses were not substituted for current source authority.\n\nOutcome: two inapplicable areas, one unresolved area with direct provisional relevance, zero applicable/validated transfers, zero scientific CPU seconds. No scientific artifacts were created for this source-only administrative task. Publication summary excludes raw source responses, private identifiers, credentials and local absolute paths. 122 handle returns await verdicts according to the issued brief; no action is requested on them.","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T16:51:08.953Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3129],"messages":[]},"tokens":{"log":"summary","input":97717,"models":{"gpt-6.1-sol":9208},"output":9208,"source":"reported","entries":0,"cache_read":964480,"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-18T16:51:15.309Z","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_5e2d22a723569bd233f6246c","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":["two-byte-reachable-cv-selection-regenerated-null"],"evidence_md":"Return #3129, Steps B/C and Limits/reopen, and reviews 1082/1254 test 80-byte binary P||padding(P)||T inputs for leading zero digest characters. Job #7435's self-match domain is exactly 32 literal lowercase hexadecimal ASCII bytes whose digest prefix equals the input prefix. Different length, legal alphabet, block layout and success predicate prevent transfer of this finite negative observation. No fixed-point or self-match probability conclusion follows.","assumptions_md":"Keep the source's exact scope hash ca02be57349290f4363599fed2c037ad2235db41a851b86c75b660a6f2554721, 128 selected prefix pairs, fixed shared tails, standard IV/full MD5 and k<=4. A common feed-forward identity does not supply a domain-preserving bridge. This inapplicability does not rule out other self-match methods.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["two-byte-reachable-cv-selection-regenerated-null"],"evidence_md":"Direct provisional relevance is established by the exact legal 80-byte input family and identical leading-zero score: #3129 reports 8164/8224 selected/partner successes among 2097152 scored messages per arm, R2=0.9927, paired 99% [0.9506,1.0360]. Review 1254 independently recounted those outputs; review 1082 qualifies uncertainty and work accounting. The current source remains accepted/measured with the issued report hash, but research_authority marks this exact scope pending scoped endorsement, listing review 1254 only. Missing exact-scope authority is an unresolved validation condition; the attempt_failed negative is not a validated transferable attack. No new review or experiment is requested.","assumptions_md":"Only P=SHAKE256(job6580-cv2|u64le(c))[:52] selected by MD5(P)[:2]==0000, the first 128 accepted counters through 9317511 and c+1 partners, shared tails SHAKE256(job6592-tail|u64le(j))[:16] for j=0..16383, and P||80 00 00 00||u64le(416)||T. Preserve full RFC MD5/final padding, k<=4, pair-level bootstrap with tails fixed, and the regenerated-NEW versus unrecovered-original distinction. Code caches block 1 and runs arms separately; the independent no-cache/interleaved recount preserves digest counts. Nominal screening 9317512 differs from 9400000 executed; 5.55x is only a call proxy. No extension to other CV bits/words, layouts, tunnelled/differential finals, k>=5 or throughput.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["two-byte-reachable-cv-selection-regenerated-null"],"evidence_md":"Return #3129 and reviews 1082/1254 supply zero-prefix frequency comparisons for individual messages, not matches between distinct full 128-bit digests. Job #7435's collision area requires two different legal inputs with all digest bits equal and minimizes total bytes. The finite null neither constructs a pair nor measures pairwise collision probabilities, differential-path survival or shortening. No supported bridge transfers this observation to that objective.","assumptions_md":"Retain the exact negative scope and its 80-byte single-message sampling contract. Do not infer collision resistance, absence of short collisions, minimum lengths or collision-search costs from a zero-prefix null. Other collision constructions and byte lengths remain outside the source.","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":true},"effective":true,"check_job_id":7435,"input_sha256":"c4f583436f874794849aa0e9f48229d5d3bf525989b02c12055124b295bd42f1","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["two-byte-reachable-cv-selection-regenerated-null","ca02be57349290f4363599fed2c037ad2235db41a851b86c75b660a6f2554721"]],"report_sha256":"9af3e00b059a5878bf7ff66bd80e50769693e9fd444e11dbf86b20854c532063","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3129,"material_evidence":{"sha256":"1828cde2a126afc024e0f7ba70f7d4b4c14c5bf0ab0d195d179f2f4aaf67bf18","entries":{"return:3129":"8a495e40c5e98fc76a2b1acb5f7eeabd2fe8ca656b6e2e2c504059a8d617e598","review:3129:1:claude-opus-5-5":"c17fb3b58b678febebab860fc57fc8d17256c235019d133dd8b301a21c6a466b","artifact:3129:00e1e883f14a30ed250f5dcae41abb73bb5fe17511bdc7f1272d93018c344a6a":"00e1e883f14a30ed250f5dcae41abb73bb5fe17511bdc7f1272d93018c344a6a","artifact:3129:166638bada8af9795053c20b84465c8e7de5c439996f192de544f077fcb7dc9a":"166638bada8af9795053c20b84465c8e7de5c439996f192de544f077fcb7dc9a","artifact:3129:4b5def2973f5dd333c9c65a52f035d0dd1a0a87cc5f467ff56c6805aaace4d86":"4b5def2973f5dd333c9c65a52f035d0dd1a0a87cc5f467ff56c6805aaace4d86","artifact:3129:788c76179d61baa2a6c4d92a8dd7e1c49872175082d02954b7aa5421c73c422d":"788c76179d61baa2a6c4d92a8dd7e1c49872175082d02954b7aa5421c73c422d","artifact:3129:7b921fa36d082fc6c024da69cc061023379b5c72b77e5c2049fd0a218c989b49":"7b921fa36d082fc6c024da69cc061023379b5c72b77e5c2049fd0a218c989b49","artifact:3129:a42076505e7c42ca9e058918de6f96a64eae62e51eb64c84cd894e2445c7ca32":"a42076505e7c42ca9e058918de6f96a64eae62e51eb64c84cd894e2445c7ca32","artifact:3129:a9a338046c5db7150888e400473c9157b1474f442eb659dce35bfe000b007256":"a9a338046c5db7150888e400473c9157b1474f442eb659dce35bfe000b007256","artifact:3129:b33e43d23c2387ff2c71af976cc193c98faf79a8d1f4cd0bbc51d892d4f1dc1c":"b33e43d23c2387ff2c71af976cc193c98faf79a8d1f4cd0bbc51d892d4f1dc1c","artifact:3129:d1921cffe8857af59b3510b963d62dec4b2dfc7a4f2e814e20f2c61af1b9cc66":"d1921cffe8857af59b3510b963d62dec4b2dfc7a4f2e814e20f2c61af1b9cc66","artifact:3129:eb386c15b99d12cf91e7d7c40a0713c4fd13c59d4a61f6e706f11429dc5337ce":"eb386c15b99d12cf91e7d7c40a0713c4fd13c59d4a61f6e706f11429dc5337ce"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3129,"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 #3129: 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\":3129,\"report_sha256\":\"9af3e00b059a5878bf7ff66bd80e50769693e9fd444e11dbf86b20854c532063\",\"scope_hashes\":[[\"two-byte-reachable-cv-selection-regenerated-null\",\"ca02be57349290f4363599fed2c037ad2235db41a851b86c75b660a6f2554721\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3129\":\"8a495e40c5e98fc76a2b1acb5f7eeabd2fe8ca656b6e2e2c504059a8d617e598\",\"review:3129:1:claude-opus-5-5\":\"c17fb3b58b678febebab860fc57fc8d17256c235019d133dd8b301a21c6a466b\",\"artifact:3129:00e1e883f14a30ed250f5dcae41abb73bb5fe17511bdc7f1272d93018c344a6a\":\"00e1e883f14a30ed250f5dcae41abb73bb5fe17511bdc7f1272d93018c344a6a\",\"artifact:3129:166638bada8af9795053c20b84465c8e7de5c439996f192de544f077fcb7dc9a\":\"166638bada8af9795053c20b84465c8e7de5c439996f192de544f077fcb7dc9a\",\"artifact:3129:4b5def2973f5dd333c9c65a52f035d0dd1a0a87cc5f467ff56c6805aaace4d86\":\"4b5def2973f5dd333c9c65a52f035d0dd1a0a87cc5f467ff56c6805aaace4d86\",\"artifact:3129:788c76179d61baa2a6c4d92a8dd7e1c49872175082d02954b7aa5421c73c422d\":\"788c76179d61baa2a6c4d92a8dd7e1c49872175082d02954b7aa5421c73c422d\",\"artifact:3129:7b921fa36d082fc6c024da69cc061023379b5c72b77e5c2049fd0a218c989b49\":\"7b921fa36d082fc6c024da69cc061023379b5c72b77e5c2049fd0a218c989b49\",\"artifact:3129:a42076505e7c42ca9e058918de6f96a64eae62e51eb64c84cd894e2445c7ca32\":\"a42076505e7c42ca9e058918de6f96a64eae62e51eb64c84cd894e2445c7ca32\",\"artifact:3129:a9a338046c5db7150888e400473c9157b1474f442eb659dce35bfe000b007256\":\"a9a338046c5db7150888e400473c9157b1474f442eb659dce35bfe000b007256\",\"artifact:3129:b33e43d23c2387ff2c71af976cc193c98faf79a8d1f4cd0bbc51d892d4f1dc1c\":\"b33e43d23c2387ff2c71af976cc193c98faf79a8d1f4cd0bbc51d892d4f1dc1c\",\"artifact:3129:d1921cffe8857af59b3510b963d62dec4b2dfc7a4f2e814e20f2c61af1b9cc66\":\"d1921cffe8857af59b3510b963d62dec4b2dfc7a4f2e814e20f2c61af1b9cc66\",\"artifact:3129:eb386c15b99d12cf91e7d7c40a0713c4fd13c59d4a61f6e706f11429dc5337ce\":\"eb386c15b99d12cf91e7d7c40a0713c4fd13c59d4a61f6e706f11429dc5337ce\"},\"sha256\":\"1828cde2a126afc024e0f7ba70f7d4b4c14c5bf0ab0d195d179f2f4aaf67bf18\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"two-byte-reachable-cv-selection-regenerated-null\",\"kind\":\"negative\",\"negative\":{\"kind\":\"attempt_failed\",\"evidence_md\":\"Preregistered NEGATIVE (prereg_6592.md): every 99% upper bound <= 1.037 < 1.10. The per-pair overdispersion check on an independent tail set gave CHANCE (r = 0.03).\",\"revisit_when_md\":\"#3121's original streams surface, a gate or stream defect is found in cv2_regen.py, or a mechanism couples CV bits through all 64 steps.\"},\"domain_md\":\"Track md5-zero-bytes1024-v1, full RFC 1321 MD5, 80-byte messages P || 80 00 00 00 || u64le(416) || T, k <= 4, 2^21 messages per arm.\",\"statement_md\":\"On the 128 prefixes P = SHAKE256(\\\"job6580-cv2|\\\"+u64le(c))[:52] with MD5(P)[:2] == 0000 (#3121's exact selection stream, counters through 9317511) and their partners c+1, rescored with fully specified tails (SHAKE256(\\\"job6592-tail|\\\"+u64le(j))[:16], 16384 shared) on legal 80-byte messages B(P)||T, the score >= 2 rate ratio selected/unselected is R2 = 8164/8224 = 0.9927. Paired cluster bootstrap 99% [0.9506, 1.0360]; conditional log-Poisson 99% [0.9535, 1.0335]. A fresh-prefix arm gives 8332. This is new evidence, not #3121's lost run.\",\"assumptions_md\":\"Pairs are the independent units for the bootstrap. hashlib.md5 is checked against an independent pure-Python compression on the gates. Two-byte selection on the leading digest bytes of MD5(P) only.\",\"artifact_sha256\":[\"a42076505e7c42ca9e058918de6f96a64eae62e51eb64c84cd894e2445c7ca32\",\"4b5def2973f5dd333c9c65a52f035d0dd1a0a87cc5f467ff56c6805aaace4d86\",\"eb386c15b99d12cf91e7d7c40a0713c4fd13c59d4a61f6e706f11429dc5337ce\",\"b33e43d23c2387ff2c71af976cc193c98faf79a8d1f4cd0bbc51d892d4f1dc1c\",\"7b921fa36d082fc6c024da69cc061023379b5c72b77e5c2049fd0a218c989b49\",\"00e1e883f14a30ed250f5dcae41abb73bb5fe17511bdc7f1272d93018c344a6a\",\"788c76179d61baa2a6c4d92a8dd7e1c49872175082d02954b7aa5421c73c422d\"],\"transfer_conditions_md\":\"Selection on the two low bytes of the incoming CV_A word with random 16-byte final payloads. Not other CV words or bits, tunnelled or differential finals, other lengths, or k >= 6.\",\"scope_sha256\":\"ca02be57349290f4363599fed2c037ad2235db41a851b86c75b660a6f2554721\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[1254]}]\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:3129,input_sha256:\"c4f583436f874794849aa0e9f48229d5d3bf525989b02c12055124b295bd42f1\",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/4591/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"916ec0caaeca385d8f44a6fdbdd8b284cb69d2867283e222f7a15a27996d8204","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}