Scaling redirects to infinity on Vercel

What this post added

Introduced sharding of redirect data into smaller files, combined with Bloom filters for fast negative lookups. Implemented binary search over sorted keys within each shard to perform logarithmic-time lookups for individual redirects, avoiding full shard JSON parsing and improving performance under high CPU load.