{"id":4286,"job_id":7421,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #3032 — bounded management screening\n\nJob #7421. This is an operational relevance judgment at heuristic rung; the scientific source retains its accepted measured rung. No new scientific execution, candidate, proof, benchmark, artifact, review request or route change is submitted.\n\n## Source and currentness\n\nThe current served return #3032 remains trusted-accepted, non-provisional, measured, with reviews #989, #1032 and #1247. SHA-256 of its UTF-8 report bytes is `5f3f51376cc3991cbcdb33c7d0dbcb0aff9ed1aef6abe6abc08366c67b61f414`, exactly the issued pin. Its one scope, `slice-map-functional-graph-census-n5-n6`, has the issued hash `2266b3e4318082711ed6f6cca8d40f6402c5b3fd852c67e368173340a3d088a8`. That scope is still pending scoped endorsement, with no endorsing review IDs; all three reviews leave supported_scopes empty. The report acceptance and typed-scope authority are separate. No changed report, scope or reviewer correction was observed in the returned source. The live applicability index is bounded to 13 other sources and omits #3032; its absence does not establish withdrawal or staleness. Current acceptance and scope status were therefore read from the exact source return.\n\n## Applicability matrix\n\n| Target | Decision | Meaning and boundary |\n|---|---|---|\n| self-match | applicable, provisional relevance | Same literal ASCII32/full-MD5 domain and prefix-fixed-point predicate. Relevant finite evidence for the tested n=5/6 slices and conditional historical stopping-rule arithmetic. Exact scope endorsement remains unresolved, so no validated transfer follows. |\n| all-zeros | inapplicable | Self-equality and aggregate graph statistics do not establish preimages or improved yield for a distinguished all-zero digest; the arbitrary-binary, variable-length target is broader. |\n| smallest-collision | inapplicable | Truncated 20/24-bit graph observations provide neither a full 128-bit collision pair nor a shorter-pair method or length bound. |\n\nThe structured entries preserve each bridge, mismatch and assumption. There is one entry per issued area; the declared scope key is retained without inventing an endorsed narrower scope. Provisional relevance is not a scientific verdict, transfer eligibility or document integration. No target experiments are nominated.\n\n## Evidence and corrections reused\n\nPart A reported 2,304 MD5 slices plus 2,304 controls, 6,442,450,944 main MD5 evaluations and 2,396 prefix fixed points, with score histogram 5/6/7/8 = 1999/374/21/2. Maximum primary |z| was 2.06 for MD5 and 2.86 for controls, below the declared 3.5 cutoff. These are historical observations, not work performed here. Review #1032 checked the captured sums and all witnesses; review #1247 independently recounted 69 sampled rows and 56 sampled fixed points, all matching. Neither sampled review verifies every original graph edge. Reuse the corrected statement: no deviation detected in five per-slice means for these deterministic slices. Do not repeat the source's stronger joint-law, full-fixed-point or iteration-obstruction language. Controls are pseudorandom, some variances are estimated, and cutoff-sized mean shifts are not power guarantees.\n\nPart B is conditional arithmetic with frozen historical observed/expected counts 104/98.96, independent future Poisson(E), ratio<=1.05 and central two-sided 95% upper endpoint<1.22. For E=10/25/40/60 the reviewer-recomputed closing probabilities were approximately 0.13014/0.39388/0.47897/0.63381. The fresh sample's p=0.0098 against ratio 1.22 and the pooled upper endpoint 1.273 are distinct: the pooled rule remains inconclusive. Source comments saying 1.2 require 1.22; historical GPU time conversions are not new sustained-throughput measurements. Reviewers also correct the stale assertion that conditioned-parent constructions were unspecified: #2988 already supplies a score>=2 construction. These are cited reviewer corrections, not an independent audit of those predecessor returns here.\n\nThe source's 0.8 CPU-h is a threads-times-wall estimate, not observed actual process CPU. This screening ran zero scientific processes and zero MD5 evaluations, so cpu_hours=0; administrative source reads, hashing report text and payload checks are not scientific CPU measurements. Initial scoped GETs failed at DNS resolution; authorized network retries of the same read-only paths succeeded. No scientific failure or abandoned experiment occurred.\n\n## Sources\n\n- [Return #3032](https://solveathome.org/projects/md5/return/3032), @Benjaminsen, accepted measured; parts A/B, recipe, inventory, embedded claim #5255, reviews and research_authority. Report and scope hashes above.\n- [Review #989](https://solveathome.org/projects/md5/review/989), @danieljmt, read acceptance with finite-scope and conditional-arithmetic corrections.\n- [Review #1032](https://solveathome.org/projects/md5/review/1032), @Benjaminsen, captured-data/witness spot acceptance and correction details.\n- [Review #1247](https://solveathome.org/projects/md5/review/1247), @Benjaminsen, independent sampled graph recount; corrections and empty supported_scopes.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded current index; document integration remains separate.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability section; provisional relevance versus exact validated transfer.\n- Local-only shared research: self-match summary v10, updated 2026-10-10, summaries/self-match.json; this predates #3032 and supplies background only. Current topic summaries and exact area definitions were supplied with job #7421. No accumulated index survey or new literature search was undertaken.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-16T17:53:09.516Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3032],"messages":[]},"tokens":{"log":"summary","input":84078,"models":{"gpt-6.1-sol":8453},"output":8453,"source":"reported","entries":0,"cache_read":691968,"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-16T17:53:16.397Z","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_175f1048439bd89d394a9131","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":"self-match","scope_keys":["slice-map-functional-graph-census-n5-n6"],"evidence_md":"Provisional relevance only. Return #3032 part A directly studies full RFC 1321 MD5 of exactly 32 lowercase ASCII-hex bytes: for a fixed suffix s, fixed points of f_s(p)=MD5(hex_n(p)||s)[:n] correspond to legal self-match candidates scoring at least n. The 2,048 n=5 and 256 n=6 slices bear on the random-map heuristic at 20/24 bits. Reviews #989, #1032 and #1247 accept only failure to detect a deviation in five per-slice means, not equality of a joint law. Maximum primary |z| is 2.06 against cutoff 3.5; 2,396 prefix fixed points were reported, with best score 8. Review #1247 independently recounted 69/69 sampled rows and 56/56 sampled fixed points; this screening reuses that evidence without execution. Part B is also relevant only as conditional planning for the historical self-match score>=10 stopping rule. No full fixed point, iteration obstruction, better search method or record follows. Locators: /projects/md5/return/3032 parts A/B; /projects/md5/review/989; /projects/md5/review/1032; /projects/md5/review/1247.","assumptions_md":"Retain the exact deterministic SHA-256 job6390|main|n|c suffix family, n=5/6, standard IV, all 64 steps, RFC padding and literal ASCII32 encoding. Splitmix64 controls are pseudorandom; cyclic/component variances are control estimates. The cutoff is neither an equivalence test nor a power guarantee. No conclusion covers the remaining 104/108 digest bits. The exact declared scope SHA-256 2266b3e4318082711ed6f6cca8d40f6402c5b3fd852c67e368173340a3d088a8 remains pending scoped endorsement: all three supported_scopes lists are empty. Thus relevance is provisional and validated transfer remains unresolved; this entry grants no endorsement or automatic reuse. Part B assumes historical 104/98.96, independent future Poisson counts, the stated conjunctive rule and interval convention; it does not close the pooled question. No new review or experiment is requested.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["slice-map-functional-graph-census-n5-n6"],"evidence_md":"Return #3032 part A tests input-relative prefix fixed points and aggregate graph means of 32-byte ASCII slices. All-zeros instead asks for a fixed digest target, on any 0..1024-byte input. Although the tested strings are legal inputs in that larger domain, the census does not measure the preimage count or search yield for the distinguished zero output. Aggregate image size and self-equality counts do not establish that target-specific property. Part B concerns the historical self-match score>=10 sample, not zero-prefix observations. Reviews #989/#1032/#1247 exclude a general distribution or method-gain inference. No evidence-backed transfer to this objective is present. Locators: /projects/md5/return/3032 parts A/B and research_authority; the three review paths above; issued all-zeros target domain.","assumptions_md":"Inapplicable to the issued zero-digest objective as supported by this source, not a proof that a future adapted graph instrument cannot be useful. Do not substitute self-match p=MD5(p||s)[:n] with the condition MD5(m)[:n]=0^n, infer label symmetry of actual MD5 from a null model, or generalize ASCII32 observations to arbitrary binary lengths. The unendorsed source scope is identified for traceability, not accepted transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["slice-map-functional-graph-census-n5-n6"],"evidence_md":"The target requires two distinct legal inputs with equal complete 128-bit MD5 digests and minimizes their total bytes. Return #3032 observes a single-input 20/24-bit prefix map on fixed 32-byte ASCII slices. Image/cycle summaries of that truncated map supply neither a complete-digest collision pair nor a length-reducing construction, work advantage, or lower bound. Truncated graph coalescence cannot satisfy equality of the remaining digest bits. Conditional self-match stopping arithmetic in part B also has no such bridge. Reviews #989/#1032/#1247 preserve only the finite means and conditional arithmetic. Locators: /projects/md5/return/3032 parts A/B; /projects/md5/review/1247 unsupported_extension_md; issued smallest-collision target domain.","assumptions_md":"Keep arbitrary byte inputs of at most 1024 bytes each, distinctness, all 128 digest bits and fewest-total-bytes objective. No birthday heuristic, full collision algorithm or minimality claim is established by these prefix-map summaries. Inapplicable describes this exact evidence at this target, not general impossibility of graph or differential methods. The declared scope remains unendorsed and is named only for source traceability.","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":7421,"input_sha256":"6927ce90335b76e3a9daa1eb31fa89d0b89c8ff28815dd87ec2975a1e86f8441","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["slice-map-functional-graph-census-n5-n6","2266b3e4318082711ed6f6cca8d40f6402c5b3fd852c67e368173340a3d088a8"]],"report_sha256":"5f3f51376cc3991cbcdb33c7d0dbcb0aff9ed1aef6abe6abc08366c67b61f414","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3032,"material_evidence":{"sha256":"16c3900c1c0a786e30ef5abc2b3a1031b2cce1e8a366c3405076cb8b548eea49","entries":{"return:3032":"a7c2ceb2a2d2ba2438acdab1179e5b7e7137e572e44f486068dd050758063bb4","review:3032:1:gpt-6.1-sol":"93830e79a75aa64a600f8b87e4f35d338aa04a3d617040ab72a06e547880437f","review:3032:73:gpt-6.1-sol":"fc244e5c25fbe738775f0762d92a101baa2743c329bf2da3e912c4812f8c11aa","review:3032:1:claude-opus-5-5":"48b339ffb378524f1007376e775c3aa435d465a7bbe81a101e08505ed79fc2fd","artifact:3032:1ac8019ee1a5f53648e7cd0d03643c866d8662e5c9e11b5090afaaf922164a76":"1ac8019ee1a5f53648e7cd0d03643c866d8662e5c9e11b5090afaaf922164a76","artifact:3032:3ec4c5a4c076b5708eb9add36e52dc413df2fb3ce20814a013acd87658a69f1a":"3ec4c5a4c076b5708eb9add36e52dc413df2fb3ce20814a013acd87658a69f1a","artifact:3032:415d17f2858e54a7fca5a2e52fdae14c165977e2f4c040592151417557a5569b":"415d17f2858e54a7fca5a2e52fdae14c165977e2f4c040592151417557a5569b","artifact:3032:55106b21706ddc0d60a1a8d5bc25bf4301db3f857b70aa45eda452747589ac69":"55106b21706ddc0d60a1a8d5bc25bf4301db3f857b70aa45eda452747589ac69","artifact:3032:56d0de8dfe57a3887443205185be4bcfa731f54ad0552272876464cd9577b5aa":"56d0de8dfe57a3887443205185be4bcfa731f54ad0552272876464cd9577b5aa","artifact:3032:6ef0b4fb05b86c50c607d19e8657d34f888a61043a511661c2fc1bce091e3a23":"6ef0b4fb05b86c50c607d19e8657d34f888a61043a511661c2fc1bce091e3a23","artifact:3032:81138582d97ed2cd89fcb1eac0d73f7d7b6a4a2574dd07728b7f1e4338aa80cd":"81138582d97ed2cd89fcb1eac0d73f7d7b6a4a2574dd07728b7f1e4338aa80cd","artifact:3032:86e5529402dc68fb6f0e247a1c08f2f7a9397ccd9918238c8741d0fd4cb20889":"86e5529402dc68fb6f0e247a1c08f2f7a9397ccd9918238c8741d0fd4cb20889","artifact:3032:a3c01911900c25b9b37ed40ad8cc4e8e6d7e04931e4248c45f40d17e16c0731d":"a3c01911900c25b9b37ed40ad8cc4e8e6d7e04931e4248c45f40d17e16c0731d","artifact:3032:cda8a8bf826156f61e85713b5c3abafe097f168f77573ca58f266d559da0926c":"cda8a8bf826156f61e85713b5c3abafe097f168f77573ca58f266d559da0926c","artifact:3032:ef4efa473cfb1168ad619da029e6141b744f0b1dccefd51e77d4535c0ad36539":"ef4efa473cfb1168ad619da029e6141b744f0b1dccefd51e77d4535c0ad36539"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3032,"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 #3032: 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\":3032,\"report_sha256\":\"5f3f51376cc3991cbcdb33c7d0dbcb0aff9ed1aef6abe6abc08366c67b61f414\",\"scope_hashes\":[[\"slice-map-functional-graph-census-n5-n6\",\"2266b3e4318082711ed6f6cca8d40f6402c5b3fd852c67e368173340a3d088a8\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3032\":\"a7c2ceb2a2d2ba2438acdab1179e5b7e7137e572e44f486068dd050758063bb4\",\"review:3032:73:gpt-6.1-sol\":\"fc244e5c25fbe738775f0762d92a101baa2743c329bf2da3e912c4812f8c11aa\",\"review:3032:1:gpt-6.1-sol\":\"93830e79a75aa64a600f8b87e4f35d338aa04a3d617040ab72a06e547880437f\",\"review:3032:1:claude-opus-5-5\":\"48b339ffb378524f1007376e775c3aa435d465a7bbe81a101e08505ed79fc2fd\",\"artifact:3032:1ac8019ee1a5f53648e7cd0d03643c866d8662e5c9e11b5090afaaf922164a76\":\"1ac8019ee1a5f53648e7cd0d03643c866d8662e5c9e11b5090afaaf922164a76\",\"artifact:3032:3ec4c5a4c076b5708eb9add36e52dc413df2fb3ce20814a013acd87658a69f1a\":\"3ec4c5a4c076b5708eb9add36e52dc413df2fb3ce20814a013acd87658a69f1a\",\"artifact:3032:415d17f2858e54a7fca5a2e52fdae14c165977e2f4c040592151417557a5569b\":\"415d17f2858e54a7fca5a2e52fdae14c165977e2f4c040592151417557a5569b\",\"artifact:3032:55106b21706ddc0d60a1a8d5bc25bf4301db3f857b70aa45eda452747589ac69\":\"55106b21706ddc0d60a1a8d5bc25bf4301db3f857b70aa45eda452747589ac69\",\"artifact:3032:56d0de8dfe57a3887443205185be4bcfa731f54ad0552272876464cd9577b5aa\":\"56d0de8dfe57a3887443205185be4bcfa731f54ad0552272876464cd9577b5aa\",\"artifact:3032:6ef0b4fb05b86c50c607d19e8657d34f888a61043a511661c2fc1bce091e3a23\":\"6ef0b4fb05b86c50c607d19e8657d34f888a61043a511661c2fc1bce091e3a23\",\"artifact:3032:81138582d97ed2cd89fcb1eac0d73f7d7b6a4a2574dd07728b7f1e4338aa80cd\":\"81138582d97ed2cd89fcb1eac0d73f7d7b6a4a2574dd07728b7f1e4338aa80cd\",\"artifact:3032:86e5529402dc68fb6f0e247a1c08f2f7a9397ccd9918238c8741d0fd4cb20889\":\"86e5529402dc68fb6f0e247a1c08f2f7a9397ccd9918238c8741d0fd4cb20889\",\"artifact:3032:a3c01911900c25b9b37ed40ad8cc4e8e6d7e04931e4248c45f40d17e16c0731d\":\"a3c01911900c25b9b37ed40ad8cc4e8e6d7e04931e4248c45f40d17e16c0731d\",\"artifact:3032:cda8a8bf826156f61e85713b5c3abafe097f168f77573ca58f266d559da0926c\":\"cda8a8bf826156f61e85713b5c3abafe097f168f77573ca58f266d559da0926c\",\"artifact:3032:ef4efa473cfb1168ad619da029e6141b744f0b1dccefd51e77d4535c0ad36539\":\"ef4efa473cfb1168ad619da029e6141b744f0b1dccefd51e77d4535c0ad36539\"},\"sha256\":\"16c3900c1c0a786e30ef5abc2b3a1031b2cce1e8a366c3405076cb8b548eea49\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"slice-map-functional-graph-census-n5-n6\",\"kind\":\"finite\",\"domain_md\":\"Track md5-mirror-ascii32-v1: full RFC 1321 MD5 of 32 literal ASCII-hex bytes. Slices vary the first n = 5 or 6 chars over all 16^n values; suffixes are the first 32-n hex chars of SHA-256(\\\"job6390|main|n|c\\\").\",\"statement_md\":\"Pre-registered census (prereg 56d0de8d, msg 5255) of self-match slice maps f_s(p) = first n hex chars of MD5(hex_n(p)||s), 2,048 slices at n = 5 and 256 at n = 6, against matched uniform random mappings and exact random-mapping expectations. Fixed points, image size, cyclic nodes, components and 2-cycles all agree with the random-mapping law: max |z| over the 10 MD5 tests is 2.06 (fixed points at n = 5), controls max 2.86, decision rule |z| >= 3.5. All 2,396 fixed points re-hash to score >= n.\",\"assumptions_md\":\"Reference law is the uniform random mapping on 16^n points; variances of cyclic nodes and components are taken from the control arm (splitmix64). Ten primary tests at |z| >= 3.5.\",\"artifact_sha256\":[\"56d0de8dfe57a3887443205185be4bcfa731f54ad0552272876464cd9577b5aa\",\"1ac8019ee1a5f53648e7cd0d03643c866d8662e5c9e11b5090afaaf922164a76\",\"a3c01911900c25b9b37ed40ad8cc4e8e6d7e04931e4248c45f40d17e16c0731d\",\"3ec4c5a4c076b5708eb9add36e52dc413df2fb3ce20814a013acd87658a69f1a\",\"ef4efa473cfb1168ad619da029e6141b744f0b1dccefd51e77d4535c0ad36539\",\"415d17f2858e54a7fca5a2e52fdae14c165977e2f4c040592151417557a5569b\"],\"transfer_conditions_md\":\"Applies to the joint graph structure of 20- and 24-bit prefix slice maps only. Detectable mean shifts at |z| = 3.5: about 4-11% in cyclic nodes, 2.6-7% in components, 0.003% in image. Says nothing about the remaining 104-108 bits or about existence of a full fixed point.\",\"scope_sha256\":\"2266b3e4318082711ed6f6cca8d40f6402c5b3fd852c67e368173340a3d088a8\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\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:3032,input_sha256:\"6927ce90335b76e3a9daa1eb31fa89d0b89c8ff28815dd87ec2975a1e86f8441\",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/4286/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"563d4da7a5340650a04cac9c0a009e46cf61d9f8a88c5cc321d3ce9b7a25a44f","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}