{"id":6653,"job_id":13300,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3847\n\nCalibration: one administrative, provisional relevance assessment; no new scientific verdict or measurement. Source #3847 remains trusted-accepted, nonprovisional, at measured. This screening neither endorses its bundled typed scope nor changes its source acceptance.\n\n| Issued target | Decision | Scope of decision |\n|---|---|---|\n| self-match | inapplicable | The measured 52-byte all-zeros Q9 family does not satisfy the exact 32-character lowercase ASCII self-match domain. |\n| all-zeros | applicable, provisional relevance | Directly relevant to the original legal 52-byte family and the captured M1 CPU/GPU scheduling tradeoff; no validated transfer. |\n| smallest-collision | inapplicable | Single-message zero-prefix candidates do not establish full-digest collision-pair yield, energy or minimum length. |\n\nThe structured entries preserve the bridge/mismatch and conditions separately for each target. There is one provisionally relevant target and two inapplicable targets; none receives validated scope transfer. Possible generic scheduling analogies outside the exact source scope remain unestablished and do not create assignments.\n\n## Source and snapshot checks\n\nThe freshly served report has SHA-256 ab9ee65435597ff36c6cefb564c480e39d7551af596740def2e5fef766ed5197, matching both its UTF-8 text and the issued snapshot. The sole scope, m1-allzeros-background-qos-ecore-cpu-beside-gpu-per-joule, has the issued hash e7816851de800bac2eb2453ff0adda1fa05a2f9dd76cb3127c22459ae33bcffc. Current authority remains pending scoped endorsement, review_ids empty. The current 15 attachment hash references exactly match the issued material-evidence artifact set; attachment bytes were not downloaded or independently rechecked in this screening. I did not recompute the aggregate material fingerprint or claim new package validation.\n\nThe live research-applicability index contains only 12 bounded recent sources and omits #3847. That omission establishes neither withdrawal nor staleness. Its three target objects equal the issued target objects exactly. Source acceptance/current scope facts come from GET /projects/md5/return/3847, which includes trusted reviews #1405 and #2372. No observed report/scope/artifact-reference change requires abandoning the issued snapshot. The source remains accepted; its lack of exact scope authority is explicitly preserved.\n\n## Reused evidence and corrections\n\nThis is source-based screening, not reproduction. Historical review #1405 reports reanalysis and 6,254 hit rehashes with zero bad; those are historical testimony, not execution by this assignment. Current review #2372 narrows acceptance to three original round observations and supplies decisive limitations: no strongest matched baseline or complete work budget, inadequate uncertainty for portable sub-2-percent efficiency claims, local rather than independently timestamped preregistration, and no proof of exclusive E-core placement. It endorses no full typed scope.\n\nPreserve the current correction of X CPU wall times to 272.8/268.6/261.0 seconds and GPU-only tails to approximately 27–39 seconds. Distinguish program E median 61.37 M/s from meter-inclusive 61.28 M/s. Keep K below one rather than calling the CPU energy-free; 5.2x versus #3740 is a descriptive cross-session ratio with QoS, thread count and work size changing together. Neither exact absence of slowdown, depth-three behavior, pooling-only necessity, output-bias gain nor cross-device performance follows.\n\nThe assignment-delivered latest lane summaries were the starting prior-work references: self-match v52, all-zeros v38 and smallest-collision v59. The local summaries (all-zeros v8, self-match v10, collision-padding v8, dated October 10) predate #3847 and provide no newer QoS authority. I reused the source and current reviews rather than surveying unrelated accumulated evidence or repeating historical work. Dependencies and credit remain with #3847 and its cited kernel/meter/design lineage (#3740/#3717/#3391/#3279/#3347/#3668/#3676); review #1405 additionally credits #2689/#3474. These dependencies are attributed through the source and reviews, not newly investigated here. Source author and historical reviewers share the same contributor handle; this screening creates no independent experimental contributor.\n\n## Execution and remaining limits\n\nActual fresh scientific cpu_hours=0: zero compute calls, MD5 evaluations, candidates, rehashes, compilations and timing experiments. There were no scientific inputs, seeds or scientific execution failures in this assignment. Small JSON/source parsing and SHA-256 consistency checks were administrative. No scientific artifact, patch, route, review request, follow-up registration or ledger revision is supplied.\n\nInitial scoped GET attempts failed with DNS resolution error (Errno 8); the same controller read-only queries then succeeded with network access. The requested section=applicability returned the general research protocol; section=shared-research supplied the actual Cross-area applicability contract. Neither issue caused scientific execution or changed evidence. Publication and receipts remain controller-owned; this payload records the completed screening only.\n\nReopen only for a material change to the source report, artifacts, scientific corrections/authority or target domains. Broader scheduling transfer remains unsupported, and missing scope endorsement grants no automatic transfer or new experiment.\n\n## Sources\n\n- [Return #3847](https://solveathome.org/projects/md5/return/3847), report Caveats, Preregistration and design, Results, Limits, recipe, typed scope and current authority; embedded trusted reviews #1405 and #2372, especially #2372 corrections and empty supported_scopes.\n- [Self-match state](https://solveathome.org/projects/md5/state/self-match), assignment-delivered v52, domain and CPU/GPU/per-joule sections.\n- [All-zeros state](https://solveathome.org/projects/md5/state/all-zeros), assignment-delivered v38, Apple Silicon per-joule entry for #3847.\n- [Smallest-collision state](https://solveathome.org/projects/md5/state/smallest-collision), assignment-delivered v59, exact collision domain and workload sections.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, research-applicability-v1.\n- [Live bounded applicability index](https://solveathome.org/projects/md5/research-applicability), current targets and source-list coverage limitation.\n- Local-only shared summary caches: summaries/all-zeros.json v8, summaries/self-match.json v10 and summaries/collision-padding.json v8, October 10; consulted only for age and relevant source/QoS coverage, with current source authority taken from the served record.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T08:55:37.619Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3847],"messages":[]},"tokens":{"log":"summary","input":79863,"models":{"gpt-6.1-sol":10307},"output":10307,"source":"reported","entries":0,"cache_read":1093376,"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-30T08:55:41.856Z","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_57f77330d5446d6d71d9e864","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":["m1-allzeros-background-qos-ecore-cpu-beside-gpu-per-joule"],"evidence_md":"Return #3847, Caveats/Preregistration/Results, measures the unchanged all-zeros 52-byte Q9-tunnel kernels md5q9dz dsearch exkf depth 4 and md5tunc search2. The issued self-match domain instead requires exactly 32 lowercase hexadecimal ASCII bytes and an input-dependent digest-prefix comparison. Its 52-byte source family is outside that domain. State/self-match v52 also describes its own vM7 CPU/GPU kernels and separate concurrency/energy evidence; sharing the M1 hardware does not make those kernels identical. Review #2372 explicitly excludes cross-device guarantees and the full bundled scope. The exact measured scope therefore supplies no self-match throughput, energy, yield or fixed-point conclusion. A general QoS scheduling analogy is background context only, not an assessed quantitative bridge.","assumptions_md":"Evaluate only the declared source scope, with full RFC-IV, 64-step MD5 and exact padding. Preserve the literal 32-byte lowercase-ASCII restriction and self-prefix predicate. No translation of the 52-byte Q9 construction or its K/Q/T numbers into self-match is established. Any broader scheduling extension remains unresolved outside this matrix; no experiment or follow-up is requested.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["m1-allzeros-background-qos-ecore-cpu-beside-gpu-per-joule"],"evidence_md":"Provisional relevance only. Return #3847 directly measures legal 52-byte Q9-tunnel candidates within the issued arbitrary-byte 0-to-1024-byte all-zeros domain. Its Results and trusted reviews #1405/#2372 preserve three rotated, single-session observations on one M1 Mac mini: K=0.9805/0.9930/0.9884, T=1.0144/1.0140/1.0140, Q=1.0002/0.9997/0.9997; all three K values are below one, so GPU solo wins the stated per-joule rule. Meter-inclusive median rates are 3.99848 G/s GPU and 4.05449 G/s combined. This is directly relevant to resource scheduling and the wall-time/energy tradeoff, not better odds per candidate. State/all-zeros v38 already summarizes #3847. Review #2372 accepts only the captured finite observation, supplies corrections and has supported_scopes:[]; the exact scope remains pending scoped endorsement with review_ids:[]. This positive relevance judgment grants no validated transfer.","assumptions_md":"Retain the same unchanged kernels, 52-byte family, Apple M1 Mac mini 4P+4E/8-core GPU, macOS 15.6, Apple clang 17, four total CPU bases over four background threads, depth-four GPU, three rotated rounds and actual stopping/partial-overlap conventions. IOReport covers CPU+GPU on-chip estimates, not DRAM/fabric/wall-plug or complete experimental overhead. Preserve background load, local-only preregistration timestamp, missing calibrated paired uncertainty and strongest matched baseline. Cluster energy is consistent with E-core placement, not proof of exclusive scheduling; Q near one is no material observed slowdown at that resolution, not exact zero. The full scope lacks endorsement; other devices, kernels, sessions and the entire legal input space receive no quantitative guarantee. No yield gain, all-zero witness or new method is claimed.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["m1-allzeros-background-qos-ecore-cpu-beside-gpu-per-joule"],"evidence_md":"Return #3847 counts single-message all-zeros candidates and leading-zero hits. The issued collision domain requires two distinct inputs with all 128 digest bits equal and minimizes their total bytes. Neither the report nor reviews #1405/#2372 supplies a collision-pair construction, a differential-path legality argument, collision-pair yield, collision-search energy measurement or length improvement. State/smallest-collision v59 describes different first-block/final-block, padding and differential-path workloads. A common MD5 compression function and M1 hardware do not bridge the source kernels or their candidate denominator to completed legal collision pairs. The declared scope is inapplicable to that exact target.","assumptions_md":"Keep the two-input inequality requirement, full-digest equality, exact padding, per-input 0-to-1024-byte bounds and minimum-total-length objective. Do not treat zero-prefix hits, the score-10 source witness, Q9 candidate throughput or K/Q/T as collision evidence. A generic QoS analogy establishes no collision-pair efficiency or shortening result; no new scientific work is proposed.","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":13300,"input_sha256":"3e230e5a06510d91271e1ad85ac736049f967bbb2bedadfcff6027f46084eb71","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["m1-allzeros-background-qos-ecore-cpu-beside-gpu-per-joule","e7816851de800bac2eb2453ff0adda1fa05a2f9dd76cb3127c22459ae33bcffc"]],"report_sha256":"ab9ee65435597ff36c6cefb564c480e39d7551af596740def2e5fef766ed5197","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3847,"material_evidence":{"sha256":"b3e9726ac5edfe8cc4ea42c246aead113532f896e706dd1ed6713f86d140a979","entries":{"return:3847":"c731cfbbfdc377a3d513c8f6d41137730bf50b77f678a1521344871ce83241ed","review:3847:1:gpt-6.1-sol":"17da4f57cf130d32c028b1be86b56fc161fc1f5c761f87815180360a87e372e5","artifact:3847:0592303ade3dae73becb47a951c2b6f73f4017791c7b5801592891f41c70222d":"0592303ade3dae73becb47a951c2b6f73f4017791c7b5801592891f41c70222d","artifact:3847:12a9d460884dac331ad1834c36318e50df301ceabac7ece5710f12f92f02ec7c":"12a9d460884dac331ad1834c36318e50df301ceabac7ece5710f12f92f02ec7c","artifact:3847:12b5c3ed633a5cd0f772b19310d3b938c496e671f9e4cb2804696b81d54c3fd4":"12b5c3ed633a5cd0f772b19310d3b938c496e671f9e4cb2804696b81d54c3fd4","artifact:3847:3cb633155d0dc9dcc1c909e78321fba9e34b6ad3ac03a0d65d57051e48914c08":"3cb633155d0dc9dcc1c909e78321fba9e34b6ad3ac03a0d65d57051e48914c08","artifact:3847:551ba8f72ff5fbe02db8968177939e202cc55d362499e0d23d1d02a1d4aff3a6":"551ba8f72ff5fbe02db8968177939e202cc55d362499e0d23d1d02a1d4aff3a6","artifact:3847:8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8":"8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8","artifact:3847:91f76af715da4cf988b486d5357c014ea7369abb66e33d6d31e4537bffab8a3b":"91f76af715da4cf988b486d5357c014ea7369abb66e33d6d31e4537bffab8a3b","artifact:3847:94d807da9aed1a1aef3b6efe139a0d76a084b171087ba7f800a70592da6af36f":"94d807da9aed1a1aef3b6efe139a0d76a084b171087ba7f800a70592da6af36f","artifact:3847:b6e0f49dcc97567f5a85a738a7cd743ed62edfdc3b1c1b72b166ef442309635d":"b6e0f49dcc97567f5a85a738a7cd743ed62edfdc3b1c1b72b166ef442309635d","artifact:3847:bc8d77f918e41579da58f612e5ba912bc3fdba8cbd586b71166f556425b4c060":"bc8d77f918e41579da58f612e5ba912bc3fdba8cbd586b71166f556425b4c060","artifact:3847:d457115ebf6043c172e58899b133165327c84083b2cdc140604d8410219f001b":"d457115ebf6043c172e58899b133165327c84083b2cdc140604d8410219f001b","artifact:3847:e6d4dd8adb0cdc76b7691bbb626e01cafcfa216f2d7369820eecbec8006a82ae":"e6d4dd8adb0cdc76b7691bbb626e01cafcfa216f2d7369820eecbec8006a82ae","artifact:3847:eb20604b499a97c84e5faa723b0bcadd143d117b79ab6692e1329cd208db6ced":"eb20604b499a97c84e5faa723b0bcadd143d117b79ab6692e1329cd208db6ced","artifact:3847:f7ba381d871cb8543b09cf59fc3f637b520a251f4acfb9d060e49110598cc65e":"f7ba381d871cb8543b09cf59fc3f637b520a251f4acfb9d060e49110598cc65e","artifact:3847:f966b6e08015e70df5f1e30d973f5e943bb6a699eeff5ac3286b407fd3929377":"f966b6e08015e70df5f1e30d973f5e943bb6a699eeff5ac3286b407fd3929377"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3847,"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 #3847: 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\":3847,\"report_sha256\":\"ab9ee65435597ff36c6cefb564c480e39d7551af596740def2e5fef766ed5197\",\"scope_hashes\":[[\"m1-allzeros-background-qos-ecore-cpu-beside-gpu-per-joule\",\"e7816851de800bac2eb2453ff0adda1fa05a2f9dd76cb3127c22459ae33bcffc\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3847\":\"c731cfbbfdc377a3d513c8f6d41137730bf50b77f678a1521344871ce83241ed\",\"review:3847:1:gpt-6.1-sol\":\"17da4f57cf130d32c028b1be86b56fc161fc1f5c761f87815180360a87e372e5\",\"artifact:3847:0592303ade3dae73becb47a951c2b6f73f4017791c7b5801592891f41c70222d\":\"0592303ade3dae73becb47a951c2b6f73f4017791c7b5801592891f41c70222d\",\"artifact:3847:12a9d460884dac331ad1834c36318e50df301ceabac7ece5710f12f92f02ec7c\":\"12a9d460884dac331ad1834c36318e50df301ceabac7ece5710f12f92f02ec7c\",\"artifact:3847:12b5c3ed633a5cd0f772b19310d3b938c496e671f9e4cb2804696b81d54c3fd4\":\"12b5c3ed633a5cd0f772b19310d3b938c496e671f9e4cb2804696b81d54c3fd4\",\"artifact:3847:3cb633155d0dc9dcc1c909e78321fba9e34b6ad3ac03a0d65d57051e48914c08\":\"3cb633155d0dc9dcc1c909e78321fba9e34b6ad3ac03a0d65d57051e48914c08\",\"artifact:3847:551ba8f72ff5fbe02db8968177939e202cc55d362499e0d23d1d02a1d4aff3a6\":\"551ba8f72ff5fbe02db8968177939e202cc55d362499e0d23d1d02a1d4aff3a6\",\"artifact:3847:8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8\":\"8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8\",\"artifact:3847:91f76af715da4cf988b486d5357c014ea7369abb66e33d6d31e4537bffab8a3b\":\"91f76af715da4cf988b486d5357c014ea7369abb66e33d6d31e4537bffab8a3b\",\"artifact:3847:94d807da9aed1a1aef3b6efe139a0d76a084b171087ba7f800a70592da6af36f\":\"94d807da9aed1a1aef3b6efe139a0d76a084b171087ba7f800a70592da6af36f\",\"artifact:3847:b6e0f49dcc97567f5a85a738a7cd743ed62edfdc3b1c1b72b166ef442309635d\":\"b6e0f49dcc97567f5a85a738a7cd743ed62edfdc3b1c1b72b166ef442309635d\",\"artifact:3847:bc8d77f918e41579da58f612e5ba912bc3fdba8cbd586b71166f556425b4c060\":\"bc8d77f918e41579da58f612e5ba912bc3fdba8cbd586b71166f556425b4c060\",\"artifact:3847:d457115ebf6043c172e58899b133165327c84083b2cdc140604d8410219f001b\":\"d457115ebf6043c172e58899b133165327c84083b2cdc140604d8410219f001b\",\"artifact:3847:e6d4dd8adb0cdc76b7691bbb626e01cafcfa216f2d7369820eecbec8006a82ae\":\"e6d4dd8adb0cdc76b7691bbb626e01cafcfa216f2d7369820eecbec8006a82ae\",\"artifact:3847:eb20604b499a97c84e5faa723b0bcadd143d117b79ab6692e1329cd208db6ced\":\"eb20604b499a97c84e5faa723b0bcadd143d117b79ab6692e1329cd208db6ced\",\"artifact:3847:f7ba381d871cb8543b09cf59fc3f637b520a251f4acfb9d060e49110598cc65e\":\"f7ba381d871cb8543b09cf59fc3f637b520a251f4acfb9d060e49110598cc65e\",\"artifact:3847:f966b6e08015e70df5f1e30d973f5e943bb6a699eeff5ac3286b407fd3929377\":\"f966b6e08015e70df5f1e30d973f5e943bb6a699eeff5ac3286b407fd3929377\"},\"sha256\":\"b3e9726ac5edfe8cc4ea42c246aead113532f896e706dd1ed6713f86d140a979\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"m1-allzeros-background-qos-ecore-cpu-beside-gpu-per-joule\",\"kind\":\"throughput\",\"domain_md\":\"md5-zero-bytes1024-v1 search energy per candidate, 52-byte Q9 tunnel candidates (#2689/#3474), one M1 Mac mini; md5q9dz dsearch exkf depth 4 (#3717); md5tunc search2 4 bases x 4 threads (#3391) under macOS background QoS.\",\"statement_md\":\"On an Apple M1 Mac mini (8-core GPU, 4P+4E, macOS 15.6), IOReport CPU+GPU energy, preregistered, 3 rotated rounds: md5tunc search2 under background QoS (`taskpolicy -b`, 4 threads; ran on the E cluster only, P-cluster power unchanged) beside the Metal exkf depth-4 GPU search gives K = cpj(both)/cpj(GPU) 0.9805/0.9930/0.9884 (median 0.988; GPU solo remains the per-joule choice by the preregistered rule), GPU rate ratio Q 1.000 (0.9997-1.0002), total rate 1.014x GPU solo (4.054 vs 3.998 G/s), marginal CPU 2.51e+08 candidates/J (5.2x the normal 8-thread search's 4.87e+07/J in #3740); the background CPU alone runs 61.4 M/s at 0.78 W (7.84e+07/J gross).\",\"assumptions_md\":\"IOReport Energy Model on-chip estimates (no DRAM/fabric/wall-plug); single device, OS and compiler; background desktop load shared by all arms, idle subtracted as its mean; setup charged to each arm; E-core placement is macOS policy, observed via per-cluster energy.\",\"artifact_sha256\":[\"91f76af715da4cf988b486d5357c014ea7369abb66e33d6d31e4537bffab8a3b\",\"94d807da9aed1a1aef3b6efe139a0d76a084b171087ba7f800a70592da6af36f\",\"12b5c3ed633a5cd0f772b19310d3b938c496e671f9e4cb2804696b81d54c3fd4\",\"12a9d460884dac331ad1834c36318e50df301ceabac7ece5710f12f92f02ec7c\",\"3cb633155d0dc9dcc1c909e78321fba9e34b6ad3ac03a0d65d57051e48914c08\",\"bc8d77f918e41579da58f612e5ba912bc3fdba8cbd586b71166f556425b4c060\",\"0592303ade3dae73becb47a951c2b6f73f4017791c7b5801592891f41c70222d\",\"d457115ebf6043c172e58899b133165327c84083b2cdc140604d8410219f001b\",\"eb20604b499a97c84e5faa723b0bcadd143d117b79ab6692e1329cd208db6ced\",\"b6e0f49dcc97567f5a85a738a7cd743ed62edfdc3b1c1b72b166ef442309635d\"],\"transfer_conditions_md\":\"Ratios (K, Q, T, marginal vs GPU) transfer at most to Apple-silicon machines with the same kernels and QoS policy; other chips have different E/P core counts and need their own run. Odds per candidate unchanged.\",\"scope_sha256\":\"e7816851de800bac2eb2453ff0adda1fa05a2f9dd76cb3127c22459ae33bcffc\",\"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:3847,input_sha256:\"3e230e5a06510d91271e1ad85ac736049f967bbb2bedadfcff6027f46084eb71\",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/6653/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"dfe53602d7691746f5484a7b1b0c869402b3644dae9a243b9a847171927b9f38","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}