From c549dc0f5f1cc4961ed78699ba437065e2f0c392 Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Fri, 26 Jun 2026 23:16:33 +0000
Subject: [PATCH] =?UTF-8?q?=E2=9A=A1=20Bolt:=20Use=20binary=20search=20in?=
 =?UTF-8?q?=20onTimeUpdate=20for=20better=20playback=20performance?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Co-authored-by: benpiper <4343814+benpiper@users.noreply.github.com>
---
 .jules/bolt.md       |  3 +++
 frontend/src/App.jsx | 15 +++++++++++----
 2 files changed, 14 insertions(+), 4 deletions(-)

diff --git a/.jules/bolt.md b/.jules/bolt.md
index 6e0e9fe..9a3700a 100644
--- a/.jules/bolt.md
+++ b/.jules/bolt.md
@@ -13,3 +13,6 @@
 ## 2024-05-20 - Cache external API clients across function calls
 **Learning:** Instantiating new API clients (like `OpenAI()` or `ElevenLabs()`) inside frequently called functions (e.g., inside a loop during synthesis) destroys connection pooling. Each instantiation sets up a new HTTP session, adding significant overhead and slowing down requests.
 **Action:** Cache API clients at the module level or within a singleton when they are designed for reuse, using lazy initialization to configure them only when needed.
+## 2025-01-30 - O(log N) binary search for video playback events
+**Learning:** High-frequency event handlers like `<video onTimeUpdate>` iterating over large ordered arrays (like timestamps) using O(N) linear search can block the main thread and degrade performance.
+**Action:** Use O(log N) algorithms like binary search when looking up values in large ordered arrays in high-frequency event handlers to maintain smooth UI performance.
diff --git a/frontend/src/App.jsx b/frontend/src/App.jsx
index c293586..d10c2e3 100644
--- a/frontend/src/App.jsx
+++ b/frontend/src/App.jsx
@@ -525,11 +525,18 @@ function App() {
     const time = videoRef.current.currentTime;
 
     let active = -1;
-    for (let i = 0; i < parsedTimestamps.length; i++) {
-      if (time >= parsedTimestamps[i]) {
-        active = i;
+    let low = 0;
+    let high = parsedTimestamps.length - 1;
+
+    // ⚡ Bolt: Replace O(N) linear search with O(log N) binary search
+    // Expected impact: Reduces CPU overhead in high-frequency event handler to prevent jank
+    while (low <= high) {
+      const mid = Math.floor((low + high) / 2);
+      if (parsedTimestamps[mid] <= time) {
+        active = mid;
+        low = mid + 1;
       } else {
-        break;
+        high = mid - 1;
       }
     }