Cool stuff, congrats on the launch!<p>I am excited to learn about the details for complexity-based rate limits, as there are quite a few design considerations involved. For example, how to configure which (numeric) arguments in a GraphQL query actually impact complexity. The example in the blogpost relies on `first`, which seems to be derived from Relay Connections. But implementations might differ and user other arguments.<p>We did research in this area (cf. <a href="https://arxiv.org/pdf/2009.05632.pdf" rel="nofollow">https://arxiv.org/pdf/2009.05632.pdf</a>) and proposed a specification to embed required configuration in the GraphQL schema (cf. <a href="https://ibm.github.io/graphql-specs/cost-spec.html" rel="nofollow">https://ibm.github.io/graphql-specs/cost-spec.html</a>).