Skip to content

⚡ Bolt: Replace BFS graph pathfinding with recursive CTEs #491

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Theory903 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

⚡ Bolt: Replace BFS graph pathfinding with recursive CTEs #491

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions .jules/bolt.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,3 +5,6 @@
## 2024-05-23 - Synchronous Audit Logging Bottleneck
**Learning:** `ToolOrchestrator._audit_action` was performing synchronous file I/O (open/write/close) for every tool invocation. This introduced ~68ms latency per 1000 calls. Moving this to a background thread with `queue.Queue` reduced it to ~3ms (20x improvement).
**Action:** For high-frequency logging or audit trails, always use an asynchronous writer or background thread to decouple I/O latency from the main execution path.
## 2026-06-23 - Graph Pathfinding Query Optimization
**Learning:** BFS for graph pathfinding without caching or CTEs results in massive N+1 querying in deep or heavily branched graphs, heavily degrading latency (from ~6ms to >100ms per search with just a minor noise addition in tests).
**Action:** Replace iterative BFS queries with recursive CTEs (Common Table Expressions) inside a single SQL query wherever graph path traversal is necessary.
Loading
Loading