12 KiB
Session Tree Format
Analysis of switching from linear JSONL to tree-based session storage.
Current Format (Linear)
{"type":"session","id":"...","timestamp":"...","cwd":"..."}
{"type":"message","timestamp":"...","message":{"role":"user",...}}
{"type":"message","timestamp":"...","message":{"role":"assistant",...}}
{"type":"compaction","timestamp":"...","summary":"...","firstKeptEntryIndex":2,"tokensBefore":50000}
{"type":"message","timestamp":"...","message":{"role":"user",...}}
Context is built by scanning linearly, applying compaction ranges.
Proposed Format (Tree)
Each entry has a uuid and parentUuid field (null for root):
{"type":"session","uuid":"a1b2c3","parentUuid":null,"id":"...","cwd":"..."}
{"type":"message","uuid":"d4e5f6","parentUuid":"a1b2c3","message":{"role":"user",...}}
{"type":"message","uuid":"g7h8i9","parentUuid":"d4e5f6","message":{"role":"assistant",...}}
{"type":"message","uuid":"j0k1l2","parentUuid":"g7h8i9","message":{"role":"user",...}}
{"type":"message","uuid":"m3n4o5","parentUuid":"j0k1l2","message":{"role":"assistant",...}}
The last entry is always the current leaf. Context = walk from leaf to root via parentUuid.
Using UUIDs (like Claude Code does) instead of indices because:
- No remapping needed when branching to new file
- Robust to entry deletion/reordering
- Orphan references are detectable
- ~30 extra bytes per entry is negligible for text-heavy sessions
Branching
Branch from entry g7h8i9 (after first assistant response):
... entries unchanged ...
{"type":"message","uuid":"p6q7r8","parentUuid":"g7h8i9","message":{"role":"user",...}}
{"type":"message","uuid":"s9t0u1","parentUuid":"p6q7r8","message":{"role":"assistant",...}}
Walking s9t0u1→p6q7r8→g7h8i9→d4e5f6→a1b2c3 gives the branched context.
The old path (j0k1l2, m3n4o5) remains in the file but is not in the current context.
Visual
[a1b2:session]
│
[d4e5:user "hello"]
│
[g7h8:assistant "hi"]
│
┌────┴────┐
│ │
[j0k1:user A] [p6q7:user B] ← branch point
│ │
[m3n4:asst A] [s9t0:asst B] ← current leaf
│
(old path)
Context Building
function buildContext(entries: SessionEntry[]): AppMessage[] {
// Build UUID -> entry map
const byUuid = new Map(entries.map(e => [e.uuid, e]));
// Start from last entry (current leaf)
let current: SessionEntry | undefined = entries[entries.length - 1];
// Walk to root, collecting messages
const path: SessionEntry[] = [];
while (current) {
path.unshift(current);
current = current.parentUuid ? byUuid.get(current.parentUuid) : undefined;
}
// Extract messages, apply compaction summaries
return pathToMessages(path);
}
Complexity: O(n) to build map, O(depth) to walk. Total O(n), but walk is fast.
Consequences for Stacking
Current Approach (hooks-v2.md)
Stacking uses stack_pop entries with complex range overlap rules:
interface StackPopEntry {
type: "stack_pop";
backToIndex: number;
summary: string;
prePopSummary?: string;
}
Context building requires tracking ranges, IDs, "later wins" logic.
Tree Approach
Stacking becomes trivial branching:
... conversation entries ...
{"type":"stack_summary","uuid":"x1y2z3","parentUuid":"g7h8i9","summary":"Work done after this point"}
To "pop" to entry g7h8i9:
- Generate summary of entries after
g7h8i9 - Append summary entry with
parentUuid: "g7h8i9"
Context walk follows parentUuid chain. Abandoned entries are not traversed.
No range tracking. No overlap rules. No "later wins" logic.
Multiple Pops
[a]─[b]─[c]─[d]─[e]─[f]─[g]─[h]
│
└─[i:summary]─[j]─[k]─[l]
│
└─[m:summary]─[n:current]
Each pop just creates a new branch. Context: n→m→k→j→i→c→b→a.
Consequences for Compaction
Current Approach
Compaction stores firstKeptEntryIndex and requires careful handling when stacking crosses compaction boundaries.
Tree Approach
Compaction creates a summary node:
{"type":"compaction","uuid":"c1","parentUuid":"a1b2c3","summary":"...","summarizedUuids":["d4e5f6","g7h8i9"]}
{"type":"message","uuid":"m1","parentUuid":"c1","message":{"role":"user",...}}
The compaction node's parentUuid points to root. Walking from m1: m1→c1→a1b2c3.
Summarized entries are still in the file (for export, debugging) but not in context.
Compaction + Stacking
No special handling needed. They're both just branches:
[root]─[msg1]─[msg2]─[msg3]─[msg4]─[msg5]
│
└─[compaction]─[msg6]─[msg7]─[msg8]
│
└─[stack_summary]─[msg9:current]
Context: msg9→stack_summary→msg6→compaction→root. Clean.
Consequences for API
SessionManager Changes
interface SessionEntry {
type: string;
uuid: string; // NEW: unique identifier
parentUuid: string | null; // NEW: null for root
timestamp?: string;
// ... type-specific fields
}
class SessionManager {
// NEW: Get current leaf entry
getCurrentLeaf(): SessionEntry;
// NEW: Walk from entry to root
getPath(fromUuid?: string): SessionEntry[];
// NEW: Get entry by UUID
getEntry(uuid: string): SessionEntry | undefined;
// CHANGED: Uses tree walk instead of linear scan
buildSessionContext(): SessionContext;
// NEW: Create branch point
branch(parentUuid: string): string; // returns new entry's uuid
// NEW: Create branch with summary of abandoned subtree
branchWithSummary(parentUuid: string, summary: string): string;
// CHANGED: Simpler, just creates summary node
saveCompaction(entry: CompactionEntry): void;
// CHANGED: Now requires parentUuid (uses current leaf if omitted)
saveMessage(message: AppMessage, parentUuid?: string): void;
saveEntry(entry: SessionEntry): void;
}
AgentSession Changes
class AgentSession {
// CHANGED: Uses tree-based branching
async branch(entryUuid: string): Promise<BranchResult>;
// NEW: Branch in current session (no new file)
async branchInPlace(entryUuid: string, options?: {
summarize?: boolean; // Generate summary of abandoned subtree
}): Promise<void>;
// NEW: Get tree structure for visualization
getSessionTree(): SessionTree;
// CHANGED: Simpler implementation
async compact(): Promise<CompactionResult>;
}
interface BranchResult {
selectedText: string;
cancelled: boolean;
newSessionFile?: string; // If branching to new file
inPlace: boolean; // If branched in current file
}
Hook API Changes
interface HookEventContext {
// NEW: Tree-aware entry access
entries: readonly SessionEntry[];
currentPath: readonly SessionEntry[]; // Entries from root to current leaf
// NEW: Branch without creating new file
branchInPlace(parentUuid: string, summary?: string): Promise<void>;
// Existing
saveEntry(entry: SessionEntry): Promise<void>;
rebuildContext(): Promise<void>;
}
New Features Enabled
1. In-Place Branching
Currently, /branch always creates a new session file. With tree format:
/branch → Create new session file (current behavior)
/branch-here → Branch in current file, optionally with summary
Use case: Quick "let me try something else" without file proliferation.
2. Branch History Navigation
/branches → List all branches in current session
/switch <uuid> → Switch to branch at entry
The session file contains full history. UI can visualize the tree.
3. Simpler Stacking
No hooks needed for basic stacking:
/pop → Branch to previous user message with auto-summary
/pop <uuid> → Branch to specific entry with auto-summary
Core functionality, not hook-dependent.
4. Subtree Export
/export-branch <uuid> → Export just the subtree from entry
Useful for sharing specific conversation paths. No index remapping needed since UUIDs are stable.
5. Merge/Cherry-pick (Future)
With tree structure, could support:
/cherry-pick <uuid> → Copy entry's message to current branch
/merge <uuid> → Merge branch into current
Migration
File Format
Add uuid and parentUuid fields to all entries. Existing sessions get generated UUIDs with linear parentage:
function migrateSession(content: string): string {
const lines = content.trim().split('\n');
const uuids: string[] = [];
return lines.map((line, i) => {
const entry = JSON.parse(line);
const uuid = generateUuid();
uuids.push(uuid);
entry.uuid = uuid;
entry.parentUuid = i === 0 ? null : uuids[i - 1];
return JSON.stringify(entry);
}).join('\n');
}
Migrated sessions work exactly as before (linear path).
API Compatibility
buildSessionContext()returns same structurebranch()still works, just uses UUIDs- Existing hooks continue to work
Complexity Analysis
| Operation | Linear | Tree |
|---|---|---|
| Append message | O(1) | O(1) |
| Build context | O(n) | O(n) map + O(depth) walk |
| Branch to new file | O(n) copy | O(path) copy, no remapping |
| Find entry by UUID | O(n) | O(1) with map |
| Compaction | O(n) | O(depth) |
Tree with UUIDs is comparable or better. The UUID map can be cached.
File Size
Tree format adds ~50 bytes per entry ("uuid":"...","parentUuid":"...", 36 chars each). For 1000-entry session: ~50KB overhead. Negligible for text-heavy sessions.
Abandoned branches remain in file but don't affect context building performance.
Example: Full Session with Branching
{"type":"session","uuid":"ses1","parentUuid":null,"id":"abc","cwd":"/project"}
{"type":"message","uuid":"m1","parentUuid":"ses1","message":{"role":"user","content":"Build a CLI"}}
{"type":"message","uuid":"m2","parentUuid":"m1","message":{"role":"assistant","content":"I'll create..."}}
{"type":"message","uuid":"m3","parentUuid":"m2","message":{"role":"user","content":"Add --verbose flag"}}
{"type":"message","uuid":"m4","parentUuid":"m3","message":{"role":"assistant","content":"Here's the flag..."}}
{"type":"message","uuid":"m5","parentUuid":"m4","message":{"role":"user","content":"Actually use Python"}}
{"type":"message","uuid":"m6","parentUuid":"m5","message":{"role":"assistant","content":"Converting to Python..."}}
{"type":"branch_summary","uuid":"bs1","parentUuid":"m2","summary":"Attempted Node.js CLI with --verbose flag"}
{"type":"message","uuid":"m7","parentUuid":"bs1","message":{"role":"user","content":"Use Rust instead"}}
{"type":"message","uuid":"m8","parentUuid":"m7","message":{"role":"assistant","content":"Creating Rust CLI..."}}
Context path: m8→m7→bs1→m2→m1→ses1
Result:
- User: "Build a CLI"
- Assistant: "I'll create..."
- Summary: "Attempted Node.js CLI with --verbose flag"
- User: "Use Rust instead"
- Assistant: "Creating Rust CLI..."
Entries m3-m6 (the Node.js/Python path) are preserved but not in context.
Prior Art
Claude Code uses the same approach:
uuidfield on each entryparentUuidlinks to parent (null for root)leafUuidin summary entries to track conversation endpoints- Separate files for sidechains (
isSidechain: true)
Recommendation
The tree format with UUIDs:
- Simplifies stacking (no range overlap logic)
- Simplifies compaction (no boundary crossing)
- Enables in-place branching
- Enables branch visualization/navigation
- No index remapping on branch-to-file
- Maintains backward compatibility
- Validated by Claude Code's implementation
Recommend implementing for v2 of hooks/session system.