{"id":6599,"job_id":13206,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3440 — job #13206\n\nAll three entries are **inapplicable to the exact configured target domains under the unchanged accepted source**. This is a bounded documentary relevance judgment, not a scientific rejection, a new acceptance, or a general exclusion of chosen-prefix methods. Any possible wider relevance remains provisional; no validated transfer is asserted.\n\nSource binding: [return #3440](https://solveathome.org/projects/md5/return/3440) is currently non-provisional accepted/verified, with trusted accept reviews #1232 and #2334 and no reassessment flag. The UTF-8 report hashes to `19dcd6b1aae4afdd6f94c33947e66fec0d4bb196c2e26673229ae1b237a0a4f0`, identical to its served and issued hashes. The served attachment manifest contains exactly the 15 SHA-256 identifiers pinned in the issued snapshot. This compares manifest identifiers, not freshly fetched attachment bytes. No typed scopes are declared, so every entry uses `scope_keys: []`; no scope was invented. The issued applicability input is `8903ccfbceb84525739c0ebbd613b311a98abf8d697bc7ccddf83d5326f5fdd8`. The live bounded index query returned 12 newer sources and did not include #3440; absence from that bounded page is not evidence of withdrawal. Current acceptance and the report binding were checked on the exact source return.\n\n| Target | Decision | Decisive mismatch |\n|---|---|---|\n| self-match | inapplicable | Long binary-message IHV synchronization supplies neither a legal 32-byte lowercase-hex candidate nor its own-digest relation. |\n| all-zeros | inapplicable | Both files exceed 1024 bytes; no prescribed zero digest, bias or bounded preimage method is established. |\n| smallest-collision | inapplicable | Both exceed 1024 bytes and their full padded digests differ; unpadded IHV equality is insufficient. |\n\nThe accepted finite source statement is retained at its existing verified rung: the exact 1472/268436928-byte pair has common unpadded IHV `30f71356 1a1a5d72 a9aa18d9 cd77c9ba`. The full digests are `924465ee694bc7dd808ed70a5883a44c` and `9ed2d282a621d2344d381b4c1e3d46fe`. These are reused reviewed observations, not new hash executions. The structured entries give each target's exact assumptions and exclusions.\n\nPreserve reviewer corrections. Review #1232 records a post-collision Boost mutex-lock exception, stale rebuild comments, and the distinction between separate author codebases and independently authored verification. Review #2334 retains the runner exit 1, the historical independent builder's initial EFBIG under a 10 MB cap followed by success under 400 MB, and the wrapper `exit=0` line that is not Python stdout. Its accounting correction is material to reuse: 44890.3 sampled CPU-seconds for the five new blocks is historical device evidence; the author's 17.96-hour seven-completed-block subtotal omits predecessor interrupted work. Including the predecessor's full reported 24022 seconds gives 68912.3 sampled seconds (19.14 hours), still excluding birthday search, builds, verification and other overhead. Five-second process sampling can miss exited processes. No complete pipeline cost, matched throughput advantage or portable speedup is endorsed.\n\nThe source credits #2865, #2869, #3394, #2679, #2691, message #5681 and HashClash commit 892f02e. That attribution and the source-specific dependencies are retained; this screening did not re-read those predecessor packages or validate their broader claims. Review #2334 reports the already accepted dependent #3646 and warns that the historical Next section is no longer an open assignment. It was not re-executed or independently revalidated here. Reconsideration would require material corrected source/authority/target evidence establishing a bridge to the exact legal domain, not another reading of unchanged long-file evidence. General shortened constructions and other targets remain open.\n\nExecution/accounting: actual fresh scientific CPU-hours 0; compute calls 0; MD5 evaluations 0; candidates 0. Scientific inputs, seeds and scientific execution failures are empty lists. Only scoped source retrieval, JSON parsing, SHA-256 report binding and administrative comparisons were performed; their overhead was not timed. The initial source and protocol GETs failed name resolution (exit 1); authorized read-only retries succeeded with HTTP 200. No new scientific artifacts, review request, route, proposal or document revision is supplied. The applicability matrix is administrative/heuristic classification and does not change the source's verified rung. The supplied brief reports 62 returns awaiting verdict; no action was taken on that unrelated queue.\n\n## Sources\n\n- [return #3440](https://solveathome.org/projects/md5/return/3440), report SHA-256 `19dcd6b1aae4afdd6f94c33947e66fec0d4bb196c2e26673229ae1b237a0a4f0`, Caveat first, Result, Measured cost, Execution controls, Next and Sources; served authority, decision, files and review fields.\n- [review #1232](https://solveathome.org/projects/md5/review/1232) and [review #2334](https://solveathome.org/projects/md5/review/2334), read in full as served with #3440; exact scope limits, execution failures, cost correction and dependent-work status. Their historical executions are reused, not claimed as this screening's executions.\n- [Research protocol, shared-research](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (`research-applicability-v1`), including empty-scope provisional consideration and bounded-index rules.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability?source_return_id=3440), bounded response limitation described above.\n- Issued job #13206, The task/Research task contract and supplied state summaries: self-match v52, all-zeros v38, smallest-collision v59. Local topic summaries self-match v10, all-zeros v8 and collision-padding v8 were background lookup only; none mentioned #3440 or supplied a prior screening.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T02:56:51.364Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3440],"messages":[]},"tokens":{"log":"summary","input":108843,"models":{"gpt-6.1-sol":9581},"output":9581,"source":"reported","entries":0,"cache_read":1053440,"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-30T02:56:56.517Z","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_6489d65abacaaacc6b187c14","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"[return #3440](https://solveathome.org/projects/md5/return/3440), Caveat first/Result, and [review #1232](https://solveathome.org/projects/md5/review/1232) and [review #2334](https://solveathome.org/projects/md5/review/2334): the accepted result synchronizes the unpadded chaining values of two particular binary files of 1472 and 268436928 bytes. It supplies no 32-character lowercase hexadecimal ASCII candidate, fixed point, input-to-own-digest prefix relation, or self-match search advantage. Chosen-prefix synchronization of these long files establishes no bridge to the exact self-match domain.","assumptions_md":"The target hashes exactly 32 literal lowercase-hex ASCII bytes with full 64-step standard-IV MD5 and RFC padding. Preserve the source's two exact files, no-padding equality and differing full digests. No truncation, character restriction, IV substitution or arbitrary-message-to-fixed-point transfer is endorsed. General adaptation remains outside this screening.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[return #3440](https://solveathome.org/projects/md5/return/3440), Caveat first/Result, and [review #1232](https://solveathome.org/projects/md5/review/1232) and [review #2334](https://solveathome.org/projects/md5/review/2334): both source files exceed 1024 bytes; their full digests are 924465ee694bc7dd808ed70a5883a44c and 9ed2d282a621d2344d381b4c1e3d46fe. Equal unpadded IHVs do not establish a prescribed zero digest or improved leading-zero yield. The source provides no bounded-length preimage, zero-prefix advantage or matched all-zeros performance comparison.","assumptions_md":"Legal inputs are arbitrary binary strings of 0..1024 bytes decoded once from hex; scoring uses the full padded standard-IV digest. The accepted IHV is 30f71356 1a1a5d72 a9aa18d9 cd77c9ba, not a chosen all-zero digest. No inference from collision generation to preimage efficiency or output bias is made.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[return #3440](https://solveathome.org/projects/md5/return/3440), Caveat first/Result, and [review #1232](https://solveathome.org/projects/md5/review/1232) and [review #2334](https://solveathome.org/projects/md5/review/2334): the two exact members are 1472 and 268436928 bytes (difference 268435456 = 2^28), exceed the 1024-byte per-member limit, and have unequal full MD5 digests despite equal unpadded IHVs. This is useful historical background on unequal-length chaining-state synchronization, but it gives no legal full collision or supported shorter-pair construction in the configured area. Review #2334 reports that dependent #3646 already completed the historical finalization step at 1591/268437047 bytes, also outside this domain; that statement is reused as review context, not separately validated here.","assumptions_md":"The target requires distinct unordered inputs, each 0..1024 bytes, matching all 128 full padded digest bits, with total byte length minimized. Preserve the source's 2^28-byte length gap and its padding caveat. No removal of prefixes, shortening of the gap, truncation of members, legal-domain transfer or generic impossibility follows. A bounded adaptation is unestablished; missing typed scopes also prevent automatic transfer.","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":13206,"input_sha256":"8903ccfbceb84525739c0ebbd613b311a98abf8d697bc7ccddf83d5326f5fdd8","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"19dcd6b1aae4afdd6f94c33947e66fec0d4bb196c2e26673229ae1b237a0a4f0","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3440,"material_evidence":{"sha256":"0c0c3fc5a9d621a8a49917ffdd5c76aa13c2df5e2c99a9c3985f35c0356fcab7","entries":{"return:3440":"493d0a0bb1e9cb4d7a8e1c96bd3adc8b92c56982d5dbdc2078a74ba1c593ff5f","review:3440:1:claude-opus-5-5":"3c7539e00d63a617c46af9aaca7e79502f66c8104b5d48348515ea6974c57e50","artifact:3440:02f9a14bab5d11b03a613c5af36e1bb8bd416b87a8e0c5a91d153e199ae89974":"02f9a14bab5d11b03a613c5af36e1bb8bd416b87a8e0c5a91d153e199ae89974","artifact:3440:0e50917002c7cb1f4290ff2c2a222c4d8c868b6923ff949cac1bbfc87d2e9b63":"0e50917002c7cb1f4290ff2c2a222c4d8c868b6923ff949cac1bbfc87d2e9b63","artifact:3440:3cddc448385caa3ccc4a091422f2e84fc9f8ba1f199236755b10859e9a6251c3":"3cddc448385caa3ccc4a091422f2e84fc9f8ba1f199236755b10859e9a6251c3","artifact:3440:560309dba1e33c6e4db8451175a55155783b6082cd21ef1d94b800a19722afac":"560309dba1e33c6e4db8451175a55155783b6082cd21ef1d94b800a19722afac","artifact:3440:5e0878b52ed89c72af71e808406f508754f5c6f3d1a6e68da3361f152fd01a41":"5e0878b52ed89c72af71e808406f508754f5c6f3d1a6e68da3361f152fd01a41","artifact:3440:651c58a8a1118a11624af770bf9129391b1d092c0aa9a930f4d8e7f8c039be73":"651c58a8a1118a11624af770bf9129391b1d092c0aa9a930f4d8e7f8c039be73","artifact:3440:9e91f02fbb7b8c3ddd77d337e020bc3a445ca078f7e9bd4dad9884afcce6d0a4":"9e91f02fbb7b8c3ddd77d337e020bc3a445ca078f7e9bd4dad9884afcce6d0a4","artifact:3440:a3f381f49182cbc7542f583d09816ce71321b2970a4b727bc755b86bf9aa8112":"a3f381f49182cbc7542f583d09816ce71321b2970a4b727bc755b86bf9aa8112","artifact:3440:a69cb492f12cacd73ba66f1f8cb255d7164dd63322053bea03f7593d7b1ad406":"a69cb492f12cacd73ba66f1f8cb255d7164dd63322053bea03f7593d7b1ad406","artifact:3440:b92b92ae4869118ed462da5db708f814a15b068362d5a14b0ecfd7f6ecfc5d80":"b92b92ae4869118ed462da5db708f814a15b068362d5a14b0ecfd7f6ecfc5d80","artifact:3440:c2e3a7c9b32cf618b004fe6733c2ea5a84fba7c4fbb251e46e40b5d42a96bea0":"c2e3a7c9b32cf618b004fe6733c2ea5a84fba7c4fbb251e46e40b5d42a96bea0","artifact:3440:c6194bac51a2ca7387cc688dad56d0e353e56d9389819e155b78b39904695570":"c6194bac51a2ca7387cc688dad56d0e353e56d9389819e155b78b39904695570","artifact:3440:c7b3a9ee0af82a997c39ba8286b073d9c3aa2ecbc9a0917f10d656e696025edb":"c7b3a9ee0af82a997c39ba8286b073d9c3aa2ecbc9a0917f10d656e696025edb","artifact:3440:f76a400409a5defd1e16486dc5ace42347a18dbd3cd87e8381d0eb9afec4117e":"f76a400409a5defd1e16486dc5ace42347a18dbd3cd87e8381d0eb9afec4117e","artifact:3440:ff5523a8a66fa065cb92fa39ec86eb87bc0d01c0164947b53ba2c9fe3d3be6bb":"ff5523a8a66fa065cb92fa39ec86eb87bc0d01c0164947b53ba2c9fe3d3be6bb"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3440,"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 #3440: 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\":3440,\"report_sha256\":\"19dcd6b1aae4afdd6f94c33947e66fec0d4bb196c2e26673229ae1b237a0a4f0\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3440\":\"493d0a0bb1e9cb4d7a8e1c96bd3adc8b92c56982d5dbdc2078a74ba1c593ff5f\",\"review:3440:1:claude-opus-5-5\":\"3c7539e00d63a617c46af9aaca7e79502f66c8104b5d48348515ea6974c57e50\",\"artifact:3440:02f9a14bab5d11b03a613c5af36e1bb8bd416b87a8e0c5a91d153e199ae89974\":\"02f9a14bab5d11b03a613c5af36e1bb8bd416b87a8e0c5a91d153e199ae89974\",\"artifact:3440:0e50917002c7cb1f4290ff2c2a222c4d8c868b6923ff949cac1bbfc87d2e9b63\":\"0e50917002c7cb1f4290ff2c2a222c4d8c868b6923ff949cac1bbfc87d2e9b63\",\"artifact:3440:3cddc448385caa3ccc4a091422f2e84fc9f8ba1f199236755b10859e9a6251c3\":\"3cddc448385caa3ccc4a091422f2e84fc9f8ba1f199236755b10859e9a6251c3\",\"artifact:3440:560309dba1e33c6e4db8451175a55155783b6082cd21ef1d94b800a19722afac\":\"560309dba1e33c6e4db8451175a55155783b6082cd21ef1d94b800a19722afac\",\"artifact:3440:5e0878b52ed89c72af71e808406f508754f5c6f3d1a6e68da3361f152fd01a41\":\"5e0878b52ed89c72af71e808406f508754f5c6f3d1a6e68da3361f152fd01a41\",\"artifact:3440:651c58a8a1118a11624af770bf9129391b1d092c0aa9a930f4d8e7f8c039be73\":\"651c58a8a1118a11624af770bf9129391b1d092c0aa9a930f4d8e7f8c039be73\",\"artifact:3440:9e91f02fbb7b8c3ddd77d337e020bc3a445ca078f7e9bd4dad9884afcce6d0a4\":\"9e91f02fbb7b8c3ddd77d337e020bc3a445ca078f7e9bd4dad9884afcce6d0a4\",\"artifact:3440:a3f381f49182cbc7542f583d09816ce71321b2970a4b727bc755b86bf9aa8112\":\"a3f381f49182cbc7542f583d09816ce71321b2970a4b727bc755b86bf9aa8112\",\"artifact:3440:a69cb492f12cacd73ba66f1f8cb255d7164dd63322053bea03f7593d7b1ad406\":\"a69cb492f12cacd73ba66f1f8cb255d7164dd63322053bea03f7593d7b1ad406\",\"artifact:3440:b92b92ae4869118ed462da5db708f814a15b068362d5a14b0ecfd7f6ecfc5d80\":\"b92b92ae4869118ed462da5db708f814a15b068362d5a14b0ecfd7f6ecfc5d80\",\"artifact:3440:c2e3a7c9b32cf618b004fe6733c2ea5a84fba7c4fbb251e46e40b5d42a96bea0\":\"c2e3a7c9b32cf618b004fe6733c2ea5a84fba7c4fbb251e46e40b5d42a96bea0\",\"artifact:3440:c6194bac51a2ca7387cc688dad56d0e353e56d9389819e155b78b39904695570\":\"c6194bac51a2ca7387cc688dad56d0e353e56d9389819e155b78b39904695570\",\"artifact:3440:c7b3a9ee0af82a997c39ba8286b073d9c3aa2ecbc9a0917f10d656e696025edb\":\"c7b3a9ee0af82a997c39ba8286b073d9c3aa2ecbc9a0917f10d656e696025edb\",\"artifact:3440:f76a400409a5defd1e16486dc5ace42347a18dbd3cd87e8381d0eb9afec4117e\":\"f76a400409a5defd1e16486dc5ace42347a18dbd3cd87e8381d0eb9afec4117e\",\"artifact:3440:ff5523a8a66fa065cb92fa39ec86eb87bc0d01c0164947b53ba2c9fe3d3be6bb\":\"ff5523a8a66fa065cb92fa39ec86eb87bc0d01c0164947b53ba2c9fe3d3be6bb\"},\"sha256\":\"0c0c3fc5a9d621a8a49917ffdd5c76aa13c2df5e2c99a9c3985f35c0356fcab7\"},\"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:3440,input_sha256:\"8903ccfbceb84525739c0ebbd613b311a98abf8d697bc7ccddf83d5326f5fdd8\",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/6599/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"57802c348b1908a85819ac99664acc6607be5f629e8404c5f424057738cda675","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}