Linear Rate Limits Overview Linear uses the leaky bucket algorithm with two rate limiting dimensions. Understanding both is critical for reliable integrations: | Budget | Limit | Refill Rate | |--------|-------|-------------| | Requests | 5,000/hour per API key | 83/min constant refill | | Complexity | 250,000 points/hour | 4,167/min constant refill | | Max single query | 10,000 points | Hard reject if exceeded | Complexity scoring: Each property = 0.1 pt, each object = 1 pt, connections multiply children by arg (default 50), then round up. Prerequisites - installed - Understanding of HTTP re…