Skip to content

⚡ Bolt: optimize CivicRAG service by removing redundant operations #788

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
RohanExploit wants to merge 1 commit into
base: main
Choose a base branch
from
Open

⚡ Bolt: optimize CivicRAG service by removing redundant operations #788

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
4 changes: 4 additions & 0 deletions .jules/bolt.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -93,3 +93,7 @@
## 2026-05-20 - Joined Queries for Integrity Verification
**Learning:** Performing multiple sequential database queries to verify cryptographically chained records (e.g., fetching a record and then its associated token/metadata from another table) introduces unnecessary latency and increases database load.
**Action:** Consolidate associated data retrieval into a single SQL `JOIN` query within the verification hot-path. This reduces database round-trips and improves end-to-end latency for blockchain-style integrity checks.

## 2026-06-03 - Redundant Hot-Path Operations
Copy link
Copy Markdown

@coderabbitai coderabbitai Bot May 21, 2026

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

⚠️ Potential issue | 🟡 Minor | ⚡ Quick win

Fix future-dated journal entry timestamp.

The new section is dated 2026-06-03, but this PR was opened on 2026-05-21. Please use a non-future date (typically the PR/commit date) to keep the Bolt journal chronology accurate.

Suggested edit 
-## 2026-06-03 - Redundant Hot-Path Operations
+## 2026-05-21 - Redundant Hot-Path Operations
📝 Committable suggestion

‼️ IMPORTANT
Carefully review the code before committing. Ensure that it accurately replaces the highlighted code, contains no missing lines, and has no issues with indentation. Thoroughly test & benchmark the code to ensure it meets the requirements.

Suggested change
## 2026-06-03 - Redundant Hot-Path Operations
## 2026-05-21 - Redundant Hot-Path Operations
🤖 Prompt for AI Agents 
Verify each finding against current code. Fix only still-valid issues, skip the
rest with a brief reason, keep changes minimal, and validate.

In @.jules/bolt.md at line 97, Update the journal header "## 2026-06-03 -
Redundant Hot-Path Operations" to a non-future date (e.g., the PR/commit date
2026-05-21) so the Bolt journal chronology remains correct; locate the header
line in .jules/bolt.md and replace the date portion "2026-06-03" with the
appropriate PR/commit date.

**Learning:** Redundant operations in hot paths, such as duplicate tokenization in RAG pre-processing or repeated `isdisjoint` checks during retrieval, introduce measurable latency without altering logic. These often stem from refactoring artifacts or copy-paste errors.
**Action:** Audit hot-path code (RAG retrieval, spatial loops, priority scoring) for line-for-line duplicates and redundant variable assignments. Consolidate logic to ensure each expensive operation (like `_tokenize`) is performed exactly once.
8 changes: 0 additions & 8 deletions backend/rag_service.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -48,8 +48,6 @@ def _prepare_policies(self):
content = f"{title} {text}"
content_tokens = self._tokenize(content)

content_tokens = self._tokenize(content)

self._prepared_policies.append({
'title_tokens': self._tokenize(title),
'content_tokens': content_tokens,
Expand Down Expand Up @@ -83,8 +81,6 @@ def retrieve(self, query: str, threshold: float = 0.05) -> Optional[str]:
len_query = len(query_tokens)
if not len_query:
return None

query_len = len(query_tokens)
best_score = 0.0
best_formatted = None

Expand All @@ -95,10 +91,6 @@ def retrieve(self, query: str, threshold: float = 0.05) -> Optional[str]:
if query_tokens.isdisjoint(policy_tokens):
continue

# Optimized: Early exit using isdisjoint which is faster than computing intersection
if query_tokens.isdisjoint(policy_tokens):
continue

# Jaccard Similarity
# Optimization 2: Calculate intersection
intersection_len = len(query_tokens.intersection(policy_tokens))
Expand Down
Loading