N+1 Finder (Claude Code)

A Claude Code skill that finds database queries running inside loops, the N+1 pattern that costs 11 fast queries on seed data and 10,001 round trips in production. Catches the lazy-relation form that has no visible query at all, unbounded reads with no limit on tables that grow forever, and repeated identical reads in a single request. Insists you measure query count at two different row counts, because whether the count GROWS with rows is the entire diagnosis. Also flags Promise.all over per-item queries, which is still N queries and merely exhausts the connection pool instead of the clock.