research
Faster Than Dijkstra: The New Shortest-Path Algorithm, Explained
A new shortest path algorithm finally beats Dijkstra on sparse graphs. How it breaks the 65-year sorting barrier, and why Dijkstra still wins in practice.
research
A new shortest path algorithm finally beats Dijkstra on sparse graphs. How it breaks the 65-year sorting barrier, and why Dijkstra still wins in practice.
Build a Python monorepo with uv workspaces: one shared lockfile and virtualenv, cross-package imports, per-package builds, and the gotchas I hit doing it.
Context engineering explained: why long-running AI agents suffer context rot, what 2026 research shows about pruning and compaction, plus a Python demo.
Python lazy imports (PEP 810) land in Python 3.15. I benchmarked boto3, requests and pydantic startup: the real speedup, and how to get most of it today.
The EU AI Act's high-risk hiring rules slipped from August 2026 to December 2027 — but GPAI and transparency duties still hit Aug 2. Here's the dev impact.
Long-form posts in your inbox roughly once a week — research breakdowns, tutorials, comparisons, the occasional review. No tracking pixels, no growth-hacked subject lines.
Or grab the RSS feed — same posts, no email needed.
I'm Maksim. By day I lead an engineering team at inDrive. After hours I ship side projects (PageBloom, NotesPilot, MyDevKit, startgaze) and write things up here when I learn something worth keeping.
The blog itself runs on an agentic publishing pipeline I built and rebuilt — a slow-moving experiment in how much of a writer's workflow can be automated without losing the voice. It writes, fact-checks, and refreshes; I edit, decide, and publish.