⚡ Bolt: Replace O(n) array filtering with O(log n) binary search in time-series lookups

[toreleon]

💡 What: Replaced O(n) array .filter() calls on chronologically sorted time-series market data (Bar[]) with an O(log n) binary search function (findLastBarIndex) and .slice() or direct array indexing.
🎯 Why: Time-series market data arrays are chronologically sorted. Array filtering inside backtesting intervals (and standard historical lookups) is O(n), creating a massive performance bottleneck when traversing over long intervals or running backtests with many turns and symbols.
📊 Impact: Reduces algorithmic lookup complexity from O(n) to O(log n) for all backtesting turns and historical bar lookups. Expected to drastically speed up backtest execution times.
🔬 Measurement: Run the test suite using pnpm test and note execution speeds, and run pnpm typecheck to ensure no functionality is broken. Check the test suite passes on the modified functionality.

Included critical learnings journal in .jules/bolt.md.

---

PR created automatically by Jules for task 8428595261062791023 started by @toreleon

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.