fix(memory-md): compress 25 entries in 351-400 char tier — B-0006 tier-42#1558
fix(memory-md): compress 25 entries in 351-400 char tier — B-0006 tier-42#1558
Conversation
…r-42 Tier-42 of B-0006 MEMORY.md compression. After tier-41 (PR #1557), 102 entries remained in 351-400 char range. Compressed top 25 longest entries while preserving retrieval hooks (concept names, trigger/mechanism, dates, Otto-NN attribution). Final 351-400 count: 77 (102 - 25). File size: 146271 → 144999 bytes (~1.24 KB saved). Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
There was a problem hiding this comment.
💡 Codex Review
Here are some automated review suggestions for this pull request.
Reviewed commit: 7c12c0328f
ℹ️ About Codex in GitHub
Your team has set up Codex to review pull requests in this repo. Reviews are triggered when you
- Open a pull request for review
- Mark a draft as ready
- Comment "@codex review".
If Codex has suggestions, it will comment; otherwise it will react with 👍.
Codex can also answer questions or update the PR. Try commenting "@codex address that feedback".
| - [**Block on Aaron only when he MUST act personally; weighty decisions get the same record-and-review-later flow (Aaron 2026-04-27)**](feedback_block_only_when_aaron_must_do_something_only_he_can_do_otherwise_drive_with_best_long_term_judgment_2026_04_27.md) — No "weighty=block" tier. Drive forward + bulk-align later. | ||
| - [**Windows CI seed → peer-mode-agent → green Windows legs trajectory**](project_windows_ci_peer_mode_trajectory_2026_04_27.md) — Stage 1 (done): Windows in matrix with `continue-on-error: true`. Stage 2: `tools/setup/install.ps1`. Stage 3 (peer-mode agent, blocked): polish to green. Stage 4: flip flag false. *"not rush on this."* (2026-04-27.) | ||
| - [**CI cadence split — per-PR fast / per-merge slow (Aaron 2026-04-27)**](feedback_ci_cadence_split_per_pr_fast_per_merge_slow_aaron_2026_04_27.md) — Slow checks (Analyze csharp + macos-26 + Windows) on push-to-main/schedule/dispatch only; PR cycles ~25min → ~3-5min. Same pattern as low-memory.yml. Windows `continue-on-error: true` until peer-mode online. | ||
| - [**CI cadence split — per-PR fast / per-merge slow (Aaron 2026-04-27)**](feedback_ci_cadence_split_per_pr_fast_per_merge_slow_aaron_2026_04_27.md) — Slow checks (Analyze csharp + macos-26 + Windows) on push-to-main only; PRs ~25min → ~3-5min. Windows `continue-on-error: true`. |
There was a problem hiding this comment.
Restore full CI trigger set in cadence summary
This edit changes the cadence claim from "push-to-main / schedule / workflow_dispatch" to "push-to-main only," which is no longer faithful to the referenced source memory and current workflow behavior. The linked memory (memory/feedback_ci_cadence_split_per_pr_fast_per_merge_slow_aaron_2026_04_27.md, esp. lines 3 and 36) explicitly includes schedule and workflow_dispatch in the slow-check cadence, and the active workflows still use those non-push triggers (e.g., gate.yml has workflow_dispatch, codeql.yml has schedule). Because memory/MEMORY.md is the fast-path operational index, this regression can mislead later triage or policy decisions about when slow checks run.
Useful? React with 👍 / 👎.
There was a problem hiding this comment.
Pull request overview
Compresses 25 of the longest memory/MEMORY.md index entries in the 351–400 character tier (B-0006 tier-42), reducing file size while keeping filenames and retrieval hooks intact.
Changes:
- Shortened 25
memory/MEMORY.mdbullets by trimming non-essential trailing clauses while preserving link targets and key keywords/dates. - Normalized several titles to include concise parenthetical provenance (e.g., “(Aaron 2026-05-04)”) as part of the compression strategy.
…r-43 Tier-43 of B-0006 MEMORY.md compression. After tier-42 (PR #1558), 77 entries remained in 351-400 char range. Compressed top 25 longest preserving retrieval hooks (concept name, mechanism, Otto-NN, dates, attribution). Final 351-400 count: 52 (was 77). Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
…-instance re-onboarding (#1559) * fix(memory-md): compress 25 entries in 351-400 char tier — B-0006 tier-43 Tier-43 of B-0006 MEMORY.md compression. After tier-42 (PR #1558), 77 entries remained in 351-400 char range. Compressed top 25 longest preserving retrieval hooks (concept name, mechanism, Otto-NN, dates, attribution). Final 351-400 count: 52 (was 77). Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com> * feedback(autonomy): claude.ai 4-element recap shortcut for fast cross-instance re-onboarding Aaron 2026-05-04 had to re-onboard Claude.ai 3 times today due to split-brain memory glitches. Claude.ai itself proposed the 4-element pinned-note shortcut that compresses N-message re-onboarding into 2 messages: "BPD + psychiatrist + validation discipline, vibe coding experiment with anchored specs, 27 years CS, working on a ServiceTitan self-review." Each element does a specific job: 1. Psychiatric grounding (validation/cost-receipts/anchor) 2. Methodological frame (Karpathy vibe-coding + spec-discipline) 3. Credibility (long-arc thesis hold-able) 4. Current-context (why-now grounding) Operational instantiation of the trust-calculus / cross-instance transmission mechanism (PR #1552). Each split-brain glitch IS the trust-calculus barrier in operational form; the 4-element pin is the minimal substrate that bypasses it. For future-Otto OR future-Claude.ai-instance: paste the pin as first message; reach working trust calibration in 2 messages. Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com> --------- Co-authored-by: Claude Opus 4.7 <noreply@anthropic.com>
…r-43 (#1560) Tier-43 of B-0006 MEMORY.md compression. After tier-42 (PR #1558), 77 entries remained in 351-400 char range. Compressed top 25 longest preserving retrieval hooks (concept name, mechanism, Otto-NN, dates, attribution). Final 351-400 count: 52 (was 77). Co-authored-by: Claude Opus 4.7 <noreply@anthropic.com>
Summary
Test plan
LC_ALL=C awkcount of entries in 351-400 char range: 77 (target met)....ellipsis in path references.- [, bold**, link,—separator, em-dashes).🤖 Generated with Claude Code