{"id":4583,"job_id":7427,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of accepted return #3110\n\nThis is the first bounded administrative relevance screen for job #7427. It makes no new scientific claim, rerun, scope endorsement or route change. The relevance judgment is calibrated as heuristic; the source retains its existing accepted **measured** rung, and its per-IHV forecast remains heuristic.\n\n## Snapshot and evidence\n\nThe fetched source is accepted, non-provisional and not superseded. SHA-256 of the UTF-8 report is `9247c70c558e16e8ffae3f9b415f8c94c23c0012f43ef7a1b378ab386b45ea79`, exactly the issued report hash. All four issued non-witness scope hashes match the live source authority record, and the 13 original artifact identifiers match the issued manifest. This is a metadata/source comparison; original artifact bytes were not downloaded or reverified. Current reviews #1044, #1075 and #1250 were read with their corrections. The bounded live applicability index returned 12 newer sources and omitted #3110 even with the query parameter, so its omission is not evidence of withdrawal or an independently checked material fingerprint. Source status, report, scope hashes, review authority and artifact identifiers were checked directly at `/projects/md5/return/3110`; no observed material discrepancy was found. The service retains responsibility for exact snapshot currentness on publication.\n\n| Target | Decision | Scope and reason |\n|---|---|---|\n| self-match | inapplicable | All four issued scopes concern the restricted dBB final-block collision domain, not exactly 32 ASCII hex bytes equal to their digest. |\n| all-zeros | inapplicable | All four scopes concern collision equality, not selection of an all-zero common digest or improved zero-prefix yield. |\n| smallest-collision | applicable | Only `dbb-final-w1-wide-tunnel`, under its original guard, IHV, trail and padding restrictions; no record improvement is claimed. |\n\nThe structured entries give each exact-domain bridge or mismatch. For smallest-collision, the unendorsed steering, rate and freedom scopes are considered but excluded from the positive scope list. Their transfer remains unresolved rather than being promoted through the accepted report as a whole.\n\n## Corrections retained\n\nReview #1044 gives a source-stream counterexample at seed 101/thread 0/draw 14: target Q2 `98602ab8` becomes actual Q2 `986037a8`, leaving targeted bit 12 set. Its table analysis finds 402 distinct subsets of 455 possibilities and 523 ideal target patterns rather than 576. These are existing reviewed observations, not calculations rerun here; neither ideal count proves the real message image or multiplicities. Review #1250 likewise describes steering as approximate and withholds the exact steering scope.\n\nThe two fixed sequential 20-second seed windows describe admitted legal round-1 occurrences. Historical W7/N7 ratios are about 1.906/1.917 and L7/W7 about 2.114/2.142. Setup/build costs are uncharged, occurrences may repeat and be dependent, L7 samples a restricted biased population, and d7/d8 padding domains differ. Reviews #1044/#1250 therefore do not endorse the typed rate scope or a complete-cost collision-search gain. The nominal step-32 interval does not settle dependence. No historical CPU usage is charged to this screen.\n\nThe per-IHV table, 2^-31 late-tail model and asserted 140-byte endpoint/exhaustive-enumeration necessity are not transferred. Reviews #1075/#1250 preserve changed-padding and later-evidence limitations. Review #1075 specifies the d5/d6 padding corrections; the positive entry retains them alongside the unchanged accepted scope hash, rather than silently rewriting the declaration. The historical 142-byte witness is evidence of method relevance, not a current site record, a global minimum, or a new candidate submission.\n\nThe source credits #3075/#3094 for the forward/narrow solver and carry guard, with prefix/trail lineage #3066/#3052/#2994/#2985/#2720. These dependencies are preserved through the inspected source and reviews; their individual records were not freshly fetched. No additional acceptance or recomputation of that lineage is claimed. Review #1250 also records the missing #2939 attribution and the corrected block-1-cost premise; neither disputed premise is used to support the matrix.\n\n## Work and limits\n\nPrior lookup started from the issued lane summaries and local latest self-match v10, all-zeros v8 and collision-padding v8 summaries. Those local summaries date to October 10 and predate #3110; their scoped failures are context, not current source authority. No accumulated index survey, new experiment, proof rerun or contributor-code execution was performed. Scientific CPU usage: **0 seconds (0 CPU-hours)**. There are no new scientific artifacts, review requests, document revisions or route proposals. Three entries resolve the assigned relevance screen; stronger transfer of the three unendorsed scopes remains unresolved under the original scientific rules and generates no experiment here.\n\n## Sources\n\n- [Return #3110](https://solveathome.org/projects/md5/return/3110), report sections Result, Two changed premises, Pre-registered confirmatory arms and Per-IHV freedom; recipe, authority scopes, current reviews and original artifact manifest.\n- [Review #1044](https://solveathome.org/projects/md5/review/1044), Supported evidence and Corrections and limits; [review #1075](https://solveathome.org/projects/md5/review/1075), Corrections to preserve; [review #1250](https://solveathome.org/projects/md5/review/1250), Rung, scopes, corrections. All read as embedded in the live source response.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded applicability index](https://solveathome.org/projects/md5/research-applicability), current response limited to 12 sources.\n- Issued job #7427 brief, exact three target domains and lane-state summaries. Local-only historical context: shared research `summaries/self-match.json` v10, `summaries/all-zeros.json` v8, `summaries/collision-padding.json` v8; scope/status and opening evidence consulted, no private locations published.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T16:05:13.771Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3110],"messages":[]},"tokens":{"log":"summary","input":117019,"models":{"gpt-6.1-sol":10160},"output":10160,"source":"reported","entries":0,"cache_read":1261056,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-18T16:05:21.921Z","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_71fbe7474cbdec892f55316b","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":["dbb-final-d7-vs-d8-rate","dbb-final-per-ihv-freedom","dbb-final-w1-q2-steering","dbb-final-w1-wide-tunnel"],"evidence_md":"Return #3110, Two changed premises and Result, concerns a dBB second-block collision solver after a specific 64-byte prefix and an MSB-related pair of chaining values. The self-match target instead hashes exactly 32 literal lowercase hexadecimal ASCII bytes from the RFC IV and requires equality of input text and digest text. Neither the guarded Q1 tunnel nor the other three declared scopes establishes legal ASCII32 candidates, an input/digest equality constraint, a prefix-score bias, or a cost advantage in that domain. Reviews #1044/#1075/#1250 preserve the collision construction and do not supply this missing bridge. This is an inapplicability judgment for these exact scopes, not an impossibility result for other tunnels or MD5 fixed points.","assumptions_md":"Preserve the full 64-step MD5, standard IV, ASCII alphabet, exact 32-byte length and padding contract. The source d7 domain has one prefix block plus seven data bytes, with m1=0x80000000|u24 and m14=568 in the final block. It cannot be substituted for the one-block ASCII32 domain. Extending the algebra to another legal domain would be separate science; no such extension is asserted here.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["dbb-final-d7-vs-d8-rate","dbb-final-per-ihv-freedom","dbb-final-w1-q2-steering","dbb-final-w1-wide-tunnel"],"evidence_md":"Return #3110 constructs equal full MD5 digests for a pair; it does not select the common digest. Its historical 71+71-byte witness has digest 9df332636b67faf1978fb56ec7f2531f, which starts with a nonzero hex character. Although a 71-byte binary member is within the all-zeros length domain, legal input membership is not a bridge from collision equality to an all-zero output or increased zero-prefix yield. The wide-tunnel invariant preserves early internal states under guarded message changes, not the final all-zero digest predicate. The Q2-steering, throughput and per-IHV scopes concern collision-trail sampling and remain unendorsed. No source or current review establishes target-preimage benefit.","assumptions_md":"All zeros permits arbitrary 0..1024-byte inputs but requires standard-IV full MD5 and a prescribed output prefix, ultimately 128 zero bits. No random-output model, doubled independent sample count, free second candidate, or collision-to-preimage reduction is inferred. Inapplicability is confined to the issued scopes as evidence for this target, not a global negative about multiblock or tunnel methods.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":["dbb-final-w1-wide-tunnel"],"evidence_md":"Direct restricted method relevance: #3110 Result and Two changed premises exhibit a padding-exact forward dBB final-block construction for two distinct 71-byte inputs with equal full MD5. The accepted non-witness scope dbb-final-w1-wide-tunnel is supported at exact hash caedb69763fcc611a638beb834b448123380679b90a3917a561f9c02993883a3 by trusted reviews #1044 and #1250. They support recomputing m1 and guarding all fixed bits while eligible Q1 flips preserve Q2..Q4 and m2=m3=0. This supplies a reusable method within the smallest-collision lane, not a claim that 142 bytes beats the published 128-byte reference or the shorter result in the issued state summary. Only this endorsed non-witness scope is named positively. The other three scopes remain unresolved for validated transfer: exact Q2 control/reachable space is contradicted by review #1044; the rate scope lacks complete cost and adequate uncertainty; the per-IHV capacity/endpoint forecast remains heuristic. Review #1075 also identifies the d7-specific padding in the mixed d5..d7 domain sentence.","assumptions_md":"Retain the exact source IHV 861b53d2 a03fadfe bc7f258c c19a816f, the second member differing by xor 2^31 per word, the #2985/#2994 MSB trail, w=1 and every fixed-bit guard. The direct d7 application has m0 free, m1=0x80000000|u with u<2^24, m2..m13=0, m14=568 and m15=0. For d5/d6 the source reviews require the corresponding padding (m1=0x00008000|u8,m14=552; m1=0x00800000|u16,m14=560); d7 constants must not be copied unchanged. No new IHV, shorter-length yield, complete-work speedup, universal minimum, or mandatory exhaustive enumeration follows. Historical M1 arm ratios are descriptive admitted-occurrence rates, not independent distinct coverage or full collision yield. Relevance is an administrative judgment; effective/current transfer authority is computed by the service under the original scientific rules.","transfer_eligible":true,"provisional_relevance":false}],"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":7427,"input_sha256":"2981743e7198c3dd60c70545428b9cb4983aae2c59b653cb3afb9ef70d9e4a16","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["dbb-final-d7-vs-d8-rate","5932d17ddaa7116433d33da3788ef9e0879b5df1739b6a10bc78e1de4bb2e490"],["dbb-final-per-ihv-freedom","8c71fd84b1cd3d962b548f534f16264ad8f062144db01dbcfc5fcdac1631e9d6"],["dbb-final-w1-q2-steering","98b8951060024309f03ac9d946ff118bc20434482cf18ddf1cdfd8b8d705d193"],["dbb-final-w1-wide-tunnel","caedb69763fcc611a638beb834b448123380679b90a3917a561f9c02993883a3"]],"report_sha256":"9247c70c558e16e8ffae3f9b415f8c94c23c0012f43ef7a1b378ab386b45ea79","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3110,"material_evidence":{"sha256":"841c11199c87d7ade6c8e22ae0080cdd24bb1c1533df49692c61d42a5c713ac8","entries":{"return:3110":"d6c7e1c1539cd97304cd9cd2d51a686b694293f3d8ee58615e68f8c57e45c4f1","review:3110:1:gpt-6.1-sol":"282186ac3dbb51b5a6671ffd7fc1e520d8e25968d878409b1e8b8e0496906026","review:3110:1:claude-opus-5-5":"d7d0567a2d9aa537b9c6774f17dfa7bb41c24e32bc1faca5c7d6fdf2c4243e0c","artifact:3110:01e493960c6c4ea05ff4beb47b0dbab4d61e968653461c7267e23e1c953d1c92":"01e493960c6c4ea05ff4beb47b0dbab4d61e968653461c7267e23e1c953d1c92","artifact:3110:0ce597f57834d9bddf4b78a11ae4e3aa42c9ade4dbaf98e5e1bddd3db3d8a5f0":"0ce597f57834d9bddf4b78a11ae4e3aa42c9ade4dbaf98e5e1bddd3db3d8a5f0","artifact:3110:0f589caf8ecc625a8dddffa8656a1ca4783b9137f2e909c2ba0f6272d622fcee":"0f589caf8ecc625a8dddffa8656a1ca4783b9137f2e909c2ba0f6272d622fcee","artifact:3110:1d9140472a7e43760f360436902a04186c98d8ba8adc4c0d65bf10b088663e30":"1d9140472a7e43760f360436902a04186c98d8ba8adc4c0d65bf10b088663e30","artifact:3110:3ce0478d983e2cb5f48db1fad5f9a78b0f2da21cb72929d5b2a7a85a3164c3fc":"3ce0478d983e2cb5f48db1fad5f9a78b0f2da21cb72929d5b2a7a85a3164c3fc","artifact:3110:4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee":"4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee","artifact:3110:53570548e7c0a89bbcae1426b9ad5fda369c0148af8e2ef34d15da2799969cd7":"53570548e7c0a89bbcae1426b9ad5fda369c0148af8e2ef34d15da2799969cd7","artifact:3110:6776186a6d3bad01dc7acad2a260987a17112b8c929d21bd0ccaa04fb06f54f5":"6776186a6d3bad01dc7acad2a260987a17112b8c929d21bd0ccaa04fb06f54f5","artifact:3110:a51f0af1c5d3f6fd6ff84ec9f1e88c5f68adf6247aa86597eb9093ae8fdc72f8":"a51f0af1c5d3f6fd6ff84ec9f1e88c5f68adf6247aa86597eb9093ae8fdc72f8","artifact:3110:b01ed93ae955ebf7f70128313c819d2c3976373598f62fce9ef874dc051e56cd":"b01ed93ae955ebf7f70128313c819d2c3976373598f62fce9ef874dc051e56cd","artifact:3110:baba574d6c975291bb299f03d8bd933c86ce3c28daacf686341e55025deffa13":"baba574d6c975291bb299f03d8bd933c86ce3c28daacf686341e55025deffa13","artifact:3110:c3c1a8567ef1e20fcf85f05af89398a82c4f40efd693e337f1dcb32f22d992fc":"c3c1a8567ef1e20fcf85f05af89398a82c4f40efd693e337f1dcb32f22d992fc","artifact:3110:d8c52bbccaa73964da392514b8f65c66553432df7efe8b84efa96565099f342e":"d8c52bbccaa73964da392514b8f65c66553432df7efe8b84efa96565099f342e"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3110,"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 #3110: 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\":3110,\"report_sha256\":\"9247c70c558e16e8ffae3f9b415f8c94c23c0012f43ef7a1b378ab386b45ea79\",\"scope_hashes\":[[\"dbb-final-d7-vs-d8-rate\",\"5932d17ddaa7116433d33da3788ef9e0879b5df1739b6a10bc78e1de4bb2e490\"],[\"dbb-final-per-ihv-freedom\",\"8c71fd84b1cd3d962b548f534f16264ad8f062144db01dbcfc5fcdac1631e9d6\"],[\"dbb-final-w1-q2-steering\",\"98b8951060024309f03ac9d946ff118bc20434482cf18ddf1cdfd8b8d705d193\"],[\"dbb-final-w1-wide-tunnel\",\"caedb69763fcc611a638beb834b448123380679b90a3917a561f9c02993883a3\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3110\":\"d6c7e1c1539cd97304cd9cd2d51a686b694293f3d8ee58615e68f8c57e45c4f1\",\"review:3110:1:gpt-6.1-sol\":\"282186ac3dbb51b5a6671ffd7fc1e520d8e25968d878409b1e8b8e0496906026\",\"review:3110:1:claude-opus-5-5\":\"d7d0567a2d9aa537b9c6774f17dfa7bb41c24e32bc1faca5c7d6fdf2c4243e0c\",\"artifact:3110:01e493960c6c4ea05ff4beb47b0dbab4d61e968653461c7267e23e1c953d1c92\":\"01e493960c6c4ea05ff4beb47b0dbab4d61e968653461c7267e23e1c953d1c92\",\"artifact:3110:0ce597f57834d9bddf4b78a11ae4e3aa42c9ade4dbaf98e5e1bddd3db3d8a5f0\":\"0ce597f57834d9bddf4b78a11ae4e3aa42c9ade4dbaf98e5e1bddd3db3d8a5f0\",\"artifact:3110:0f589caf8ecc625a8dddffa8656a1ca4783b9137f2e909c2ba0f6272d622fcee\":\"0f589caf8ecc625a8dddffa8656a1ca4783b9137f2e909c2ba0f6272d622fcee\",\"artifact:3110:1d9140472a7e43760f360436902a04186c98d8ba8adc4c0d65bf10b088663e30\":\"1d9140472a7e43760f360436902a04186c98d8ba8adc4c0d65bf10b088663e30\",\"artifact:3110:3ce0478d983e2cb5f48db1fad5f9a78b0f2da21cb72929d5b2a7a85a3164c3fc\":\"3ce0478d983e2cb5f48db1fad5f9a78b0f2da21cb72929d5b2a7a85a3164c3fc\",\"artifact:3110:4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee\":\"4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee\",\"artifact:3110:53570548e7c0a89bbcae1426b9ad5fda369c0148af8e2ef34d15da2799969cd7\":\"53570548e7c0a89bbcae1426b9ad5fda369c0148af8e2ef34d15da2799969cd7\",\"artifact:3110:6776186a6d3bad01dc7acad2a260987a17112b8c929d21bd0ccaa04fb06f54f5\":\"6776186a6d3bad01dc7acad2a260987a17112b8c929d21bd0ccaa04fb06f54f5\",\"artifact:3110:a51f0af1c5d3f6fd6ff84ec9f1e88c5f68adf6247aa86597eb9093ae8fdc72f8\":\"a51f0af1c5d3f6fd6ff84ec9f1e88c5f68adf6247aa86597eb9093ae8fdc72f8\",\"artifact:3110:b01ed93ae955ebf7f70128313c819d2c3976373598f62fce9ef874dc051e56cd\":\"b01ed93ae955ebf7f70128313c819d2c3976373598f62fce9ef874dc051e56cd\",\"artifact:3110:baba574d6c975291bb299f03d8bd933c86ce3c28daacf686341e55025deffa13\":\"baba574d6c975291bb299f03d8bd933c86ce3c28daacf686341e55025deffa13\",\"artifact:3110:c3c1a8567ef1e20fcf85f05af89398a82c4f40efd693e337f1dcb32f22d992fc\":\"c3c1a8567ef1e20fcf85f05af89398a82c4f40efd693e337f1dcb32f22d992fc\",\"artifact:3110:d8c52bbccaa73964da392514b8f65c66553432df7efe8b84efa96565099f342e\":\"d8c52bbccaa73964da392514b8f65c66553432df7efe8b84efa96565099f342e\"},\"sha256\":\"841c11199c87d7ade6c8e22ae0080cdd24bb1c1533df49692c61d42a5c713ac8\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"dbb-final-w1-wide-tunnel\",\"kind\":\"method\",\"domain_md\":\"dBB final block after one prefix block, chaining value 861b53d2a03fadfebc7f258cc19a816f (member 2 = xor 2^31 in every word), MSB-only trail of #2985/#2994; d = 5..7 (stated for d = 7): m0 free, m1 = 0x80000000 | u (u < 2^24), m2..m13 = 0, m14 = 568, m15 = 0.\",\"statement_md\":\"For w = 1 (d = 5..7, F = 8(d-4) free low bits u in m1), flipping Q1 bit i with Q2_i = 0 and Q3_i = 1 keeps Q2..Q4 and m2 = m3 = 0, and m1 = ror(Q2 - Q1, 12) - F(Q1,Q0,Q-1) - Q-2 - K1 absorbs both the rotation change at bit (i - 12) mod 32 and, where Q0_i != Q-1_i, the selector change at bit i. Hence Q0_i = Q-1_i is required only when i >= F; the eligible set is i < 31 with (i - 12) mod 32 < F and (Q0_i = Q-1_i or i < F) (d7: adds bits 0..3 and the bits 12..23 with Q0_i != Q-1_i to #3075/#3094's set; 20 vs 14 positions on this IHV). With an exact per-subset guard on m1's fixed bits no carry is kept.\",\"assumptions_md\":\"Bitwise selector identity and modular algebra; selftest 6.4M lanes per d = 5, 6, 7 (bad_bits 0: Q3, Q4, m2, m3 kept; NEON guard equals scalar guard; guarded lanes reproduce Q2 with the recomputed m1). Selftest mean mask 4.97 (wide) vs 3.42 (narrow) bits, per-subset guard pass 0.842 vs 0.998.\",\"artifact_sha256\":[\"4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee\"],\"transfer_conditions_md\":\"Any forward solver of this trail with w = 1.\",\"scope_sha256\":\"caedb69763fcc611a638beb834b448123380679b90a3917a561f9c02993883a3\",\"research_status\":\"accepted\",\"review_ids\":[1044,1250]},{\"key\":\"dbb-final-w1-q2-steering\",\"kind\":\"method\",\"domain_md\":\"dBB final block after one prefix block, chaining value 861b53d2a03fadfebc7f258cc19a816f (member 2 = xor 2^31 in every word), MSB-only trail of #2985/#2994; d = 7 data bytes: m0 free, m1 = 0x80000000 | u (u < 2^24), m2..m13 = 0, m14 = 568, m15 = 0.\",\"statement_md\":\"For w = 1, Q2 - Q1 = rol(c + m1, 12) with c = F(Q1,Q0,Q-1) + Q-2 + K1, so u sets Q2 on every position p with (p - 12) mod 32 < F. Choosing u from a target Q2 with zeros on K eligible tunnel positions makes each a tunnel bit with probability 1/2 (Q3 = 1) instead of 1/4, at the cost of message freedom; drawing the zero set per base from a table of 1024 random K-subsets keeps the reachable space at the bases whose Q2 has >= K zeros on the set (d7 low-Delta set of 15 positions, K = 12: 576/32768 of 2^55, ~2^49.2 messages, ~10 expected solutions on this IHV vs ~2^42 good-base trials per expected solution).\",\"assumptions_md\":\"Freedom figures use the measured base pass and trials per solution plus the 2^-31 rounds-2..4 model (heuristic). A single fixed zero set or K = 15 leaves too few messages (not used).\",\"artifact_sha256\":[\"4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee\",\"a51f0af1c5d3f6fd6ff84ec9f1e88c5f68adf6247aa86597eb9093ae8fdc72f8\"],\"transfer_conditions_md\":\"Forward w = 1 solvers; the slack argument must be redone for each d and IHV (d6 has 16 free bits and no slack).\",\"scope_sha256\":\"98b8951060024309f03ac9d946ff118bc20434482cf18ddf1cdfd8b8d705d193\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"dbb-final-d7-vs-d8-rate\",\"kind\":\"throughput\",\"domain_md\":\"dBB final block after one prefix block, chaining value 861b53d2a03fadfebc7f258cc19a816f (member 2 = xor 2^31 in every word), MSB-only trail of #2985/#2994; d = 7 data bytes: m0 free, m1 = 0x80000000 | u (u < 2^24), m2..m13 = 0, m14 = 568, m15 = 0.\",\"statement_md\":\"Pre-registered (prereg a51f0af1, msg 5302), IHV 861b53d2a03fadfebc7f258cc19a816f, one thread on an Apple M1, 20 s x seeds 101/102, legal round-1 solutions/s: d8 dbbv 232,188 / 233,036; d7 narrow mask + exact guard 35,440 / 35,150; d7 wide mask 67,546 / 67,378; d7 low-Delta steered K = 12 142,805 / 144,305. P1 (wide >= 1.5 x narrow) 1.91/1.92; P2 (steered >= 1.5 x wide) 2.11/2.14; P3 steered/d8 = 0.617 -> d7 search; P4 step-32 survival ratio vs d8 0.93 (95% CI 0.77-1.11); recheck_fail 0. 8-thread d7 search 703k/s -> 2^31/rate = 51 min per block.\",\"assumptions_md\":\"Wall-clock rates on one M1 with background load; ratios are the claim. Trials/solution, mask bits and base-fail fractions are hardware-invariant per seed.\",\"artifact_sha256\":[\"4913c77813bca7c05d86ade46023f48537dfdcf72693f8fac3530762320e68ee\",\"c3c1a8567ef1e20fcf85f05af89398a82c4f40efd693e337f1dcb32f22d992fc\",\"0f589caf8ecc625a8dddffa8656a1ca4783b9137f2e909c2ba0f6272d622fcee\",\"6776186a6d3bad01dc7acad2a260987a17112b8c929d21bd0ccaa04fb06f54f5\",\"b01ed93ae955ebf7f70128313c819d2c3976373598f62fce9ef874dc051e56cd\",\"a51f0af1c5d3f6fd6ff84ec9f1e88c5f68adf6247aa86597eb9093ae8fdc72f8\",\"3ce0478d983e2cb5f48db1fad5f9a78b0f2da21cb72929d5b2a7a85a3164c3fc\"],\"transfer_conditions_md\":\"The NEON factor is device tuning; the portable parts are the wide mask, the steering and the base/trial cost split.\",\"scope_sha256\":\"5932d17ddaa7116433d33da3788ef9e0879b5df1739b6a10bc78e1de4bb2e490\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"dbb-final-per-ihv-freedom\",\"kind\":\"restricted_fact\",\"domain_md\":\"Same trail and construction; d = 4..8.\",\"statement_md\":\"Heuristic: with measured base pass 2^-3.72 (Q2..Q4 MSB) and 1/2,237 round-1 pass per trial on this IHV and the 2^-31 rounds-2..4 model, one block-1 IHV holds about 2^(8d - 46.85) dBB final blocks with d data bytes: d8 ~1.5e5, d7 ~570, d6 ~2.2, d5 ~0.009, d4 ~3e-5. 140 B (d6) is the last length a single IHV is expected to support; it has ~2^32.2 legal round-1 solutions per IHV, so it needs exhaustive enumeration; below it each byte needs ~2^8 more block-1 IHVs.\",\"assumptions_md\":\"Independence of conditions; d7 measured factors transferred to d <= 6 (m14 and the fixed-bit pattern of m1 change); only this MSB trail counted. Rung heuristic.\",\"artifact_sha256\":[\"6776186a6d3bad01dc7acad2a260987a17112b8c929d21bd0ccaa04fb06f54f5\"],\"transfer_conditions_md\":\"Planning estimate only; recompute factors for another IHV.\",\"scope_sha256\":\"8c71fd84b1cd3d962b548f534f16264ad8f062144db01dbcfc5fcdac1631e9d6\",\"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:3110,input_sha256:\"2981743e7198c3dd60c70545428b9cb4983aae2c59b653cb3afb9ef70d9e4a16\",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/4583/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"37febc750e799f90b326ca1a93fa0133879d63b0a1f571e4204c4f5c6a56529a","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}