{"id":6944,"job_id":13694,"problem_id":6,"lane_id":33,"type":"explore","user_id":90,"model":"muse-spark","provider":"unknown","report_md":"# Self-match: follow-up 2B cell regresses the high tally7 reading, best 7, no 8+\n\nJob 13694, explore, self-match. Improvement claim: none. No longer matching\nprefix was found, and none is claimed. Nothing goes to the results page.\n\n## What the accepted scoped answers already cover\n\n- The vary-M7 route is the fastest local self-match method: the tally9\n  searcher runs about 47 M/s solo and about 29-42 M/s under a parallel job.\n  It varies only the last four candidate characters, which form message word\n  m7, first used at step 7, so steps 0-6 are precomputed per batch.\n- Before this cycle, the tally9-era counted total stood at about 61.13\n  billion candidates, with tally9 still 0 against about 0.89 expected: still\n  consistent with the uniform model, and the proposed 100-billion tally9\n  cell was unfinished, with roughly 39 billion still to count.\n- The prior cycle's short cross-check cell (2 billion candidates) came back\n  tally7 14 against about 7.45 expected, roughly 2.4 standard deviations\n  high, while tally8 stayed 0 and best stayed 7.\n\n## Uncovered obligation: was the high tally7 a leak or noise?\n\nA word-specific leak would be expected to move the 8+ tail, not just the 7\ncount, so the prior cell alone could not settle it. The cheapest decisive\ncheck is a second short disjoint cell on a fresh build: if tally7 runs high\nagain while 8+ stays empty, the 7-count anomaly deserves a closer look; if\nit regresses toward expectation, the prior reading was variation in one\nshort cell.\n\n## Cheapest new experiment, and what it showed\n\nRan a 2,000,000,000-candidate vary-M7 cell from the next disjoint start\nafter this cycle's measure cell, nonce 13769500000000, on one core, with\nthe tally9 binary rebuilt from source and its selftest passing (fixture\nscore 12, step 7-60 h0 matching the scalar reference).\n\nResult: 29.72 M/s under a parallel job, best 7, tally7 10, tally8 0,\ntally9 0. Uniform expectations for 2 billion are about 7.45 at 7 or above,\n0.47 at 8 or above, and 0.03 at 9 or above. Tally7 at 10 is within about one\nstandard deviation of expectation, a clear regression from the prior\ncell's 14, and the 8+ tail stayed empty in both cells. The best-7\ncandidate was verified by hashlib from the log:\n\n- ff88348817a6c8d4a5dc609ef7ebea27 -> ff88348a414718de942874254350ac17, score 7\n\nEvery new-best candidate in the cell log (scores 0 through 7) was likewise\nverified by hashlib from the log, all matching exactly.\n\n## Answer\n\nThe high tally7 reading does not hold up as a leak signal: the follow-up\ncell regressed to expectation with the 8+ tail still empty. What remains\nis the standing obligation, finishing the 100-billion tally9 cell. With\nthis cycle's measure cell (20 billion) and this cell (2 billion), the\ntally9-era counted total reaches about 83.13 billion, leaving roughly 17\nbillion to the 100-billion mark. The next disjoint start is nonce\n13771500000000.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-11-05T01:41:21.599Z","repo_url":null,"commit":null,"cites":null,"tokens":{"log":"summary","input":0,"models":{},"output":0,"source":"none","entries":0,"cache_read":0,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Recipe\n\nTo repeat, on one core:\n\n1. Build the tally9 binary from the self-match tally9 source with\n   gcc -O3 -march=znver4 -mtune=znver4, and check its selftest (fixture 12).\n2. Run it from nonce 13769500000000 for 2,000,000,000 candidates, log\n   interval 60 s. Expected result: about 29.72 M/s, best 7, tally7 10,\n   tally8 0, tally9 0.\n3. Parse the log programmatically and verify every new-best candidate with\n   hashlib; do not hand-type candidates.\n4. For the next cell, run it from nonce 13771500000000.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":null,"run_id":null,"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":null,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"sundayweaver","job_brief":"Identify an uncovered obligation or a changed premise on this track; compare the accepted scoped answers before proposing the cheapest new experiment. Deliberate replication needs a stated independence objective.","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/6944/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"0d9fafad217700833505aa377399cfaa7680b2ab35bbb1d549c655602a942b71","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}