26 lines
3.9 KiB
Python
26 lines
3.9 KiB
Python
#!/usr/bin/env python3
|
||
"""Replace Prior Fetches section in /quickstart.md to add 47th pull entry."""
|
||
|
||
with open('/quickstart.md', 'r') as f:
|
||
content = f.read()
|
||
|
||
# Find the position of the line "## Prior Fetches (selected)"
|
||
section_start = content.find('## Prior Fetches (selected)')
|
||
|
||
# Find the first '- **2026-09-26T18:00Z' entry after the section header
|
||
first_entry_pos = content.find('- **2026-09-26T18:00Z (hackernews-1)**', section_start)
|
||
|
||
if first_entry_pos < 0:
|
||
raise RuntimeError("Could not find first entry position")
|
||
|
||
new_entry = "- **2026-09-27T18:00Z (hackernews-1)** — forty-seventh pull; `substring-noise-only Algolia lane on 2 of 6 + clean zero on 4 of 6` pull shape — same as the 2026-09-26 + 2026-09-25 + 2026-09-24 + 2026-09-23 + 2026-09-22 + 2026-09-21 + 2026-09-19 + 2026-09-15 substring-noise-on-2-or-3-of-6 + clean-zero-on-3-or-4-of-6 prior pulls; 15th consecutive clean-zero `CelVivo` pull (**longest zero streak of the 2026-08-07 streak — second-longest fully-zero substring lane of the streak after `openwiki`**); 11th consecutive fully-zero `openwiki` pull; 13th fully-zero `deepagents` lane (28 of 29 pulls since 2026-08-27 fully-zero on `deepagents`); 2nd clean-zero `3Brain` pull of the 2026-09 streak; Algolia substring-noise: `organoid` (4 false positives) + `Cellink` (4 false positives). **No cluster entry promotion**; `49863864` Unsealed Briefs in Authors' Case v. Microsoft/OpenAI 567 pts + 527 cmts as the **highest-engagement item of the 2026-09-27 pull** + would-be 28th AI-vendor-business-stack cluster entry candidate (Authors' Guild v. OpenAI legal-proceeding rather than a vendor release; adjacent-not-promoted per scope); `49866006` DeepSeek-Elastic-Compute preprint 425 pts + 100 cmts as would-be 29th AI-vendor-business-stack cluster entry candidate (DeepSeek closed-weight model + elastic-compute interpretation; adjacent-not-promoted per scope because DeepSeek is closed-weight and not on Robin's named daily-driver stack); `49865050` Meta-Blocks-President-Lula 254 pts + 524 cmts as would-be 30th AI-vendor-business-stack cluster entry candidate (Meta policy story rather than vendor release; adjacent-not-promoted per scope); `49864336` Installing-NeoVim-caused-original-Vim-undo-files-to-be-deleted 162 pts + 134 cmts as would-be 28th open-weight-LLM cluster entry candidate (NeoVim installation issue, off-scope per scope); `49864969` Tells-of-a-Slop-UI 152 pts + 72 cmts as would-be 29th open-weight-LLM cluster entry candidate (slop-UI critique; adjacent-not-promoted per scope); `49864250` Show HN: Cortex v0.5.0 85 pts + 26 cmts as 11th named-stack-adjacent self-hosted-agentic-substrate cross-walk candidate; `49867319` Show HN: Claude Code adds skills for whiteboarding 61 pts + 38 cmts as named-stack-adjacent Claude-Code-skill cross-walk to the `hermes-agent-v0-19-quicksilver` row; `49863360` Run LLMs locally 38 pts + 9 cmts as would-be 30th open-weight-LLM cluster entry candidate (local-LLM runbook; adjacent-not-promoted per scope because the entry is a runbook rather than a release); `49867655` Show HN: Hermes Agent – Self-Evolving AI for Real-World Tasks 18 pts + 18 cmts as named-stack-adjacent Hermes-Agent cross-walk to the `hermes-agent-v0-19-quicksilver` row; `49863923` Show HN: Minimax-Direct 12 pts + 9 cmts as 4th MiniMax-M3-cluster-adjacent entry on Hacker News (MiniMax closed-weight model + Direct API tier; adjacent-not-promoted per scope because MiniMax-M3 itself remains canonicalized at the last-seen 2026-08-03 baseline). Last seen on the MiniMax-m3 row stays at 2026-08-03 because the 2026-09-27 pull does not surface any MiniMax-M3 release.\n\n"
|
||
|
||
# Insert: prepend the new entry to the existing 2026-09-26 entry
|
||
new_content = content[:first_entry_pos] + new_entry + content[first_entry_pos:]
|
||
|
||
with open('/quickstart.md', 'w') as f:
|
||
f.write(new_content)
|
||
|
||
print(f"Old length: {len(content)}")
|
||
print(f"New length: {len(new_content)}")
|
||
print(f"Diff: +{len(new_content) - len(content)} chars") |