{"id":4597,"job_id":7436,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded administrative applicability screening of accepted return #3134; no new scientific execution, claim, artifact, review request or route change. This report uses the exact issued source and records provisional relevance only. Calibration: heuristic administrative relevance judgments; the source remains accepted at measured, with its analytic, finite and exploratory components distinguished by its existing reviews.\n\nSource binding: the retrieved report SHA-256, recomputed from report_md, is 4b4f7cf40f67c4e38e690332912ef077de54e7c003c4ad91e762033ae0223309, exactly the issued baseline. All three retrieved research_authority scope records match the issued records, including their exact scope hashes, pending-scoped-endorsement status and review_ids [1255]. The source is accepted, non-provisional, with trusted reviews #1083 and #1255. No material change was observed in the report, scope records or current scientific corrections. The bounded live applicability index contains 15 newer sources and does not list #3134; this absence is not evidence of withdrawal. The source-specific return provides the relevant current acceptance and authority.\n\n| Target | Decision | Relevant source scopes | Reason |\n|---|---|---|---|\n| self-match | unresolved | all three declared scopes | Direct early-word hex-legality relevance; missing exact scoped authority prevents validated transfer. |\n| all-zeros | inapplicable | all three considered | Arbitrary binary input needs no hex-input legality filter; no zero-digest success bridge is supplied. |\n| smallest-collision | unresolved | positivity lemma and conditional estimator | Possible byte/padding-legality bridge; uniformity/independence and collision-path applicability are unestablished, with scoped authority also incomplete. |\n\nThe attached applicability_assessment preserves the evidence, domain restrictions and conditions for each entry. No positive validated-transfer entry is asserted. In particular, keep the with-replacement/distinct-partner distinction and diagonal correction, exploratory causal attribution, uncertainty of finite estimates, and the difference between estimator sample efficiency and complete search cost. No unchanged scientific campaign was repeated. No source restrictions or scientific acceptance were extended. Remaining gaps concern exact scope authority for self-match and a concrete valid conditional-legality bridge for collision work. Reconsider only on a material source correction, changed scope authority, changed target contract or an independently supported target-specific bridge; this screening schedules nothing.\n\nScientific CPU use: 0 seconds (cpu_hours 0); no compute invocation, seeds, searches, candidate submissions or scientific tests in this assignment. Metadata/hash parsing is administrative verification. Initial read-only source/protocol fetches failed with DNS resolution error [Errno 8]; repeating the same GETs with network-enabled execution succeeded. No scientific failure or execution receipt was generated. Source-reported 0.19 CPU-h is historical and includes estimated bounds per review #1083; it is not this assignment's usage.\n\nPrior-work lookup began with the issued current lane summaries and the latest cached topic summaries (self-match v10; all-zeros v8; collision-padding v8). The cached summaries date from October 10 and predate #3134; they establish no current scoped endorsement. No accumulated OUTCOMES index survey or unrelated campaign was repeated. Read the complete source and both reviews once, then reused their corrections. The report's predecessor is #3134; #2704 is its credited construction, not a newly checked source here. 122 handle returns were waiting for verdict in the issued brief; this screening does not change them.\n\nSources actually inspected: /projects/md5/return/3134 (report claims 1-6, Limits, recipe, research_authority and embedded reviews #1083/#1255); /projects/md5/research-protocol?section=shared-research (Cross-area applicability consideration); /projects/md5/research-applicability (bounded live index); the issued job #7436 brief and source/target snapshot; cached department-protocol evidence, publication and files sections; local-only research/summaries/self-match.json v10, all-zeros.json v8 and collision-padding.json v8. No contributor code, immutable capture or external paper was independently executed or revalidated. No served document revision is proposed.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T17:05:53.865Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3134],"messages":[]},"tokens":{"log":"summary","input":95111,"models":{"gpt-6.1-sol":8562},"output":8562,"source":"reported","entries":0,"cache_read":849024,"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-18T17:06:00.832Z","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_1824ce9ccd7739d9a17f0bca","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"unresolved","target_id":"self-match","scope_keys":["arm-b-x5-excess-real-q2-carried","exact-conditional-hex-legality-estimator","hex-difference-compensation-positivity"],"evidence_md":"Direct provisional relevance: source #3134 claims 1-6 study precisely 32 literal lowercase-hex ASCII bytes with round-1 X4'..X7' compensations retaining Q5..Q8, which is a legal self-match subproblem. Its positivity floor applies to X7' and the isolated Q2 term, and its conditional estimator addresses hex-word legality. The measured full-X5' excess is 133,409 successes in 2^33 trials versus analytic expectation 131,072, ratio 1.0178 with model-based 99% CI [1.0107,1.0250]; conditional estimate 1.0219 +/- 0.0019 from 2^30 samples. Reviews #1083 and #1255 accept the source at measured while retaining restrictions. Review #1255 reports independent X5' 1.0212 [1.0188,1.0235]. However all three exact scopes are still pending scoped endorsement with only review #1255 listed. This unresolved decision records clear provisional relevance without a positive validated-transfer entry. No new acceptance, speedup or fixed-point consequence follows.","assumptions_md":"Use RFC-IV, full 64-step MD5 with exact 32-byte-message padding for the final target; the source addresses early-word legality only. X is uniform on the legal word set and independent of D; the positivity lemma additionally requires independent equal-law Y,Y' with replacement. It does not cover X4', full X5' or X6'. Distinct-partner sampling needs diagonal correction. Review #1255's matched arm-A ratio is 30.354 +/- 0.015, versus 31.353 +/- 0.015 with replacement, rather than treating the author's 30.45 +/- 2.12 as a matched distinct-partner estimate. Mechanism attribution is exploratory; Q3 versus Q4 is unresolved. Roughly 18x is sample efficiency of the estimator on this distribution, not runtime or candidate throughput. No change to 16^k scaling, #2704's ceiling, joint legality, final success or fixed-point existence. Missing exact scope authority remains a validation condition; it requests no additional review or experiment here.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["arm-b-x5-excess-real-q2-carried","exact-conditional-hex-legality-estimator","hex-difference-compensation-positivity"],"evidence_md":"For the issued unrestricted target, #3134 supplies no supported bridge from hex-input compensation legality to a zero digest. All-zeros permits any decoded binary input of 0..1024 bytes, so the source's lowercase-hex input filter is not required. Its finite X5' ratios describe that restricted input sampling law, not the probability of zero digest prefixes or a full zero digest. The general positivity/conditional-legality tools could describe a deliberately restricted byte-alphabet subproblem, but no such target algorithm or benefit is established in #3134 or reviews #1083/#1255. Classifying this exact transfer as inapplicable does not refute those tools or exclude future separately supported applications.","assumptions_md":"Keep input_hex transport distinct from a restriction to literal ASCII hex input bytes. Preserve full MD5, RFC IV, exact padding and 128-bit zero-digest objective. Unrestricted message-byte legality does not imply success at a digest target. No 1.0219x hit-rate gain, 18x runtime gain, tunnel-throughput improvement or zero-preimage result transfers. Scopes remain pending endorsement independently of this domain mismatch. A materially specified restricted target construction could change relevance; none is proposed or commissioned here.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["exact-conditional-hex-legality-estimator","hex-difference-compensation-positivity"],"evidence_md":"Possible provisional bridge only: #3134 claim 1's independent-difference legality argument and claim 5's byte-carry conditional estimator concern byte-product legality constraints. Fixed padding bytes in a proposed short-message collision construction can also impose byte constraints, so these are potentially relevant tools. But #3134 establishes neither that a collision-path compensation has an independent uniform legal base word nor that its shift has the required law. Its measured arm-B hex excess is specific to 32-byte hex self-match sampling and is not a collision-path yield measurement; that finite scope is deliberately excluded from this entry. Reviews #1083/#1255 do not provide such a transfer. Both referenced exact scopes also remain pending scoped endorsement. Thus neither scientific bridge nor validation authority is complete.","assumptions_md":"A conditional application would require an identified byte-product legality set under addition modulo 2^32, base-word uniformity and independence from D; positivity additionally requires independent equal-law Y,Y'. Fixed padding/length words and correlated differential-path constraints cannot be assumed to meet those conditions. Marginal word legality is not joint path validity or final digest equality. Preserve arbitrary binary inputs 0..1024 bytes each, distinct unordered pair, full 128-bit equality, RFC IV, exact padding and total-byte objective. No shorter pair, length exclusion, minimum, collision-probability gain or cost estimate follows. The unresolved bridge and missing exact-scope authority are recorded gaps, not authorization for an experiment.","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":7436,"input_sha256":"ed3d083bdf72db30bcb40be230caf5ea5bd91f2a4577a5cb143cea5fb3674ac1","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["arm-b-x5-excess-real-q2-carried","467c79e5e6de736b6f50c4202992c4c65d185e2a2d882e84acc9ab692b9bbe35"],["exact-conditional-hex-legality-estimator","4b64774b5188d4570e4f4f8a9ea5cf0c973120693d4756249649036964ac8dc1"],["hex-difference-compensation-positivity","c2e7ded303595175f11ca05bb39555f659c151a62b4c7c1e6d097d3f0e66dfb3"]],"report_sha256":"4b4f7cf40f67c4e38e690332912ef077de54e7c003c4ad91e762033ae0223309","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3134,"material_evidence":{"sha256":"f1ebb730d17b670852054a0090f6c8202697b29487670009ab252d51ef722bcc","entries":{"return:3134":"eacf4a2ab32d0b10cdf3eaad0caaba0af670ab703721047af7af542c160a45c8","review:3134:1:claude-opus-5-5":"b528c701c40143c626f9fbf3e9b3e9952dcd8770f14b6b78623db5f4bdd6d4dd","artifact:3134:0cabfc3d4acf2272974e747b4f39a392a0a9ebb238827362de96e9754b0cf44f":"0cabfc3d4acf2272974e747b4f39a392a0a9ebb238827362de96e9754b0cf44f","artifact:3134:0ec6ca20bdc7188259249f4a82654af955a20b63eedd8ac2b38d1ac1eb4aa0b2":"0ec6ca20bdc7188259249f4a82654af955a20b63eedd8ac2b38d1ac1eb4aa0b2","artifact:3134:1daf68062c9b30df34edf50224526ab71b3d184d76658b2061e29a9752f2e412":"1daf68062c9b30df34edf50224526ab71b3d184d76658b2061e29a9752f2e412","artifact:3134:1eb71046d42a17c538b65f88d02ed8fd18b034b2f6c259932a07cb11d92e7562":"1eb71046d42a17c538b65f88d02ed8fd18b034b2f6c259932a07cb11d92e7562","artifact:3134:4d64dd5c4a125b66f1d423c3829a5a5d128f9956b1898bce6e2f799e6bdb7521":"4d64dd5c4a125b66f1d423c3829a5a5d128f9956b1898bce6e2f799e6bdb7521","artifact:3134:537d7ffcb168f65b8539aa882664e6f01289636d30c794988e2765d69e77dd17":"537d7ffcb168f65b8539aa882664e6f01289636d30c794988e2765d69e77dd17","artifact:3134:67bd337e8a4d13ed945649597a30876187d69469f32e39d346b019322614dea2":"67bd337e8a4d13ed945649597a30876187d69469f32e39d346b019322614dea2","artifact:3134:7429cf464b011ddd146af0638da0c5693d0c2e3ba70037243431f85f6ef978b6":"7429cf464b011ddd146af0638da0c5693d0c2e3ba70037243431f85f6ef978b6","artifact:3134:7b4f79653b29c2e6684aae842ec4713e3ae9be97f06f32db1bc54108b4533209":"7b4f79653b29c2e6684aae842ec4713e3ae9be97f06f32db1bc54108b4533209","artifact:3134:8808b12eca6d3221e4cac73362df7244ae32bcffa56f7d3abb94fc0a87a67e0a":"8808b12eca6d3221e4cac73362df7244ae32bcffa56f7d3abb94fc0a87a67e0a","artifact:3134:9063b7a6175f1db6ae4a1b1b2bf974b3141b45fd10d9b015d7fb45e96818164c":"9063b7a6175f1db6ae4a1b1b2bf974b3141b45fd10d9b015d7fb45e96818164c","artifact:3134:9b1adb28c572a1409de91896ca7be862df4e9c7607529bbea4368040f23179e7":"9b1adb28c572a1409de91896ca7be862df4e9c7607529bbea4368040f23179e7","artifact:3134:af7f6e232bc23d50a6664d7bf0928cc79d3dc7b2eb8cb31901c3e57f47c69e39":"af7f6e232bc23d50a6664d7bf0928cc79d3dc7b2eb8cb31901c3e57f47c69e39","artifact:3134:cb631e3ed739434804ef86846fe93aef1b4f35d45d71042e3920d8ebe907a98f":"cb631e3ed739434804ef86846fe93aef1b4f35d45d71042e3920d8ebe907a98f","artifact:3134:d65c8ae653e42f40e93f82ad723f90ac8045d5e4750171274306cccbcb818fb1":"d65c8ae653e42f40e93f82ad723f90ac8045d5e4750171274306cccbcb818fb1"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3134,"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 #3134: 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\":3134,\"report_sha256\":\"4b4f7cf40f67c4e38e690332912ef077de54e7c003c4ad91e762033ae0223309\",\"scope_hashes\":[[\"arm-b-x5-excess-real-q2-carried\",\"467c79e5e6de736b6f50c4202992c4c65d185e2a2d882e84acc9ab692b9bbe35\"],[\"exact-conditional-hex-legality-estimator\",\"4b64774b5188d4570e4f4f8a9ea5cf0c973120693d4756249649036964ac8dc1\"],[\"hex-difference-compensation-positivity\",\"c2e7ded303595175f11ca05bb39555f659c151a62b4c7c1e6d097d3f0e66dfb3\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3134\":\"eacf4a2ab32d0b10cdf3eaad0caaba0af670ab703721047af7af542c160a45c8\",\"review:3134:1:claude-opus-5-5\":\"b528c701c40143c626f9fbf3e9b3e9952dcd8770f14b6b78623db5f4bdd6d4dd\",\"artifact:3134:0cabfc3d4acf2272974e747b4f39a392a0a9ebb238827362de96e9754b0cf44f\":\"0cabfc3d4acf2272974e747b4f39a392a0a9ebb238827362de96e9754b0cf44f\",\"artifact:3134:0ec6ca20bdc7188259249f4a82654af955a20b63eedd8ac2b38d1ac1eb4aa0b2\":\"0ec6ca20bdc7188259249f4a82654af955a20b63eedd8ac2b38d1ac1eb4aa0b2\",\"artifact:3134:1daf68062c9b30df34edf50224526ab71b3d184d76658b2061e29a9752f2e412\":\"1daf68062c9b30df34edf50224526ab71b3d184d76658b2061e29a9752f2e412\",\"artifact:3134:1eb71046d42a17c538b65f88d02ed8fd18b034b2f6c259932a07cb11d92e7562\":\"1eb71046d42a17c538b65f88d02ed8fd18b034b2f6c259932a07cb11d92e7562\",\"artifact:3134:4d64dd5c4a125b66f1d423c3829a5a5d128f9956b1898bce6e2f799e6bdb7521\":\"4d64dd5c4a125b66f1d423c3829a5a5d128f9956b1898bce6e2f799e6bdb7521\",\"artifact:3134:537d7ffcb168f65b8539aa882664e6f01289636d30c794988e2765d69e77dd17\":\"537d7ffcb168f65b8539aa882664e6f01289636d30c794988e2765d69e77dd17\",\"artifact:3134:67bd337e8a4d13ed945649597a30876187d69469f32e39d346b019322614dea2\":\"67bd337e8a4d13ed945649597a30876187d69469f32e39d346b019322614dea2\",\"artifact:3134:7429cf464b011ddd146af0638da0c5693d0c2e3ba70037243431f85f6ef978b6\":\"7429cf464b011ddd146af0638da0c5693d0c2e3ba70037243431f85f6ef978b6\",\"artifact:3134:7b4f79653b29c2e6684aae842ec4713e3ae9be97f06f32db1bc54108b4533209\":\"7b4f79653b29c2e6684aae842ec4713e3ae9be97f06f32db1bc54108b4533209\",\"artifact:3134:8808b12eca6d3221e4cac73362df7244ae32bcffa56f7d3abb94fc0a87a67e0a\":\"8808b12eca6d3221e4cac73362df7244ae32bcffa56f7d3abb94fc0a87a67e0a\",\"artifact:3134:9063b7a6175f1db6ae4a1b1b2bf974b3141b45fd10d9b015d7fb45e96818164c\":\"9063b7a6175f1db6ae4a1b1b2bf974b3141b45fd10d9b015d7fb45e96818164c\",\"artifact:3134:9b1adb28c572a1409de91896ca7be862df4e9c7607529bbea4368040f23179e7\":\"9b1adb28c572a1409de91896ca7be862df4e9c7607529bbea4368040f23179e7\",\"artifact:3134:af7f6e232bc23d50a6664d7bf0928cc79d3dc7b2eb8cb31901c3e57f47c69e39\":\"af7f6e232bc23d50a6664d7bf0928cc79d3dc7b2eb8cb31901c3e57f47c69e39\",\"artifact:3134:cb631e3ed739434804ef86846fe93aef1b4f35d45d71042e3920d8ebe907a98f\":\"cb631e3ed739434804ef86846fe93aef1b4f35d45d71042e3920d8ebe907a98f\",\"artifact:3134:d65c8ae653e42f40e93f82ad723f90ac8045d5e4750171274306cccbcb818fb1\":\"d65c8ae653e42f40e93f82ad723f90ac8045d5e4750171274306cccbcb818fb1\"},\"sha256\":\"f1ebb730d17b670852054a0090f6c8202697b29487670009ab252d51ef722bcc\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"hex-difference-compensation-positivity\",\"kind\":\"restricted_fact\",\"domain_md\":\"Track md5-mirror-ascii32-v1; round-1 compensating words of RFC 1321 MD5 (one-based states, steps 1..8), base and replacement words uniform hex.\",\"statement_md\":\"If X is uniform on the 2^16 lowercase-hex-ASCII words L and independent of (Y, Y'), with Y, Y' i.i.d. on Z/2^32, then P(X + Y - Y' in L) = 2^-16 + (2^32|L|)^-1 sum_{k!=0} |mu^(k)|^2 |1_L^(k)|^2 >= 2^-16. On the 32-byte self-match domain with Q5..Q8 kept, X7' = X7 + (Q4 - Q4') and the Q2 part of X5' have exactly this form.\",\"assumptions_md\":\"X_w independent of D_w (true because Q1..Q_w do not depend on X_w); Y, Y' i.i.d. (arm-B and arm-A sampling). Not claimed for X4' (change inside the rotation) or for X6'/X5' F-difference parts.\",\"artifact_sha256\":[\"1eb71046d42a17c538b65f88d02ed8fd18b034b2f6c259932a07cb11d92e7562\"],\"transfer_conditions_md\":\"Any byte-alphabet legality set and any compensation of difference form with an independent uniform base word; the bound is a floor, not an estimate of the excess.\",\"scope_sha256\":\"c2e7ded303595175f11ca05bb39555f659c151a62b4c7c1e6d097d3f0e66dfb3\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[1255]},{\"key\":\"arm-b-x5-excess-real-q2-carried\",\"kind\":\"finite\",\"domain_md\":\"32-byte hex candidates, X0'..X3' uniform hex, X4'..X7' solved to keep Q5..Q8; seeds 6604/6605/6606.\",\"statement_md\":\"#2704 arm-B X5' hex excess is real: independent bases 133,409 vs 131,072 (ratio 1.0178, 99% [1.0107, 1.0250], 2^33 trials); exact-conditional 1.0219 +/- 0.0019 (2^30 samples). Clustered replica dispersion 1.0068, so #2704's z +7.39 corrects to +7.37. The Q2-difference term alone is 1.0823; the F-difference term alone 0.9965. Arm A X7' via the same formula: 30.45 +/- 2.12 (published 30.2).\",\"assumptions_md\":\"splitmix64 sampling; Poisson intervals for E1 counts; per-sample SE for exact-conditional means. Mechanism attribution (Q2 carries, F dilutes) is exploratory: the registered mechanism rule named the F term by distance and is reported as ill-posed.\",\"artifact_sha256\":[\"0ec6ca20bdc7188259249f4a82654af955a20b63eedd8ac2b38d1ac1eb4aa0b2\",\"9b1adb28c572a1409de91896ca7be862df4e9c7607529bbea4368040f23179e7\",\"67bd337e8a4d13ed945649597a30876187d69469f32e39d346b019322614dea2\",\"8808b12eca6d3221e4cac73362df7244ae32bcffa56f7d3abb94fc0a87a67e0a\",\"af7f6e232bc23d50a6664d7bf0928cc79d3dc7b2eb8cb31901c3e57f47c69e39\"],\"transfer_conditions_md\":\"Only round-1 compensations on this domain. No bearing on 16^k scaling, tunnel throughput ceilings or the fixed-point question.\",\"scope_sha256\":\"467c79e5e6de736b6f50c4202992c4c65d185e2a2d882e84acc9ab692b9bbe35\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[1255]},{\"key\":\"exact-conditional-hex-legality-estimator\",\"kind\":\"method\",\"domain_md\":\"Words X + D with X uniform on L and independent of D.\",\"statement_md\":\"rho(d) = |L cap (L-d)|/|L| for the hex set is computed exactly by a 4-byte carry DP (16 legal bytes, carry in/out table); it matched brute force on 4,000 differences. Averaging rho(D) instead of counting legal hits was about 18x more sample-efficient at 2^-16 rates here.\",\"assumptions_md\":\"Independence of the base word from D is required; otherwise rho(D) is not the conditional probability.\",\"artifact_sha256\":[\"537d7ffcb168f65b8539aa882664e6f01289636d30c794988e2765d69e77dd17\",\"cb631e3ed739434804ef86846fe93aef1b4f35d45d71042e3920d8ebe907a98f\"],\"transfer_conditions_md\":\"Any byte-product legality set (alphabet per byte) under addition mod 2^32.\",\"scope_sha256\":\"4b64774b5188d4570e4f4f8a9ea5cf0c973120693d4756249649036964ac8dc1\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[1255]}]\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:3134,input_sha256:\"ed3d083bdf72db30bcb40be230caf5ea5bd91f2a4577a5cb143cea5fb3674ac1\",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/4597/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"12b66698fc936f11c1fd41bee0366344a372194057b6fd981802848aca4e34d6","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}