Functional commitments (FCs) enable a prover to commit to a message and later produce a succinct proof of its image under any given admissible function. Unlike succinct non-interactive arguments (SNARGs), secure FCs can be realised under falsifiable assumptions in the standard model, making them attractive alternatives when fully algebraic constructions are desired. All known algebraic constructions of FC are either lattice-based or pairing-based. While a lattice-based FC for circuits with almost optimal complexities has been recently achieved [Wee, CRYPTO’25], state-of-the-art pairing-based FCs for bounded-width w [Balbás-Catalano-Fiore-Lai (BCFL), TCC’23] and bounded-size s circuits [Wee-Wu, EUROCRYPT’24] require prohibitive public parameter sizes \(\mathcal {O}{(\lambda w^5)}\) and \(\mathcal {O}{(\lambda s^5)}\) , respectively. In this work, we present a new algebraic pairing-based FC which achieves \(\mathcal {O}{(\lambda w^3)}\) public parameter size for bounded-width w and unbounded depth d circuits. The construction preserves all nice properties of BCFL: \(\mathcal {O}{(\lambda )}\) commitment size, \(\mathcal {O}{(\lambda d^2)}\) proof size, additive homomorphism, efficient verification, and chainability. For bounded-size s circuits, we alternatively obtain \(\mathcal {O}{(\lambda s^3)}\) public parameters with \(\mathcal {O}{(\lambda d)}\) proofs. At the core of our scheme lies a new chainable FC for quadratic functions with commitments computed with respect to a power basis, as well as techniques for switching between different commitment bases.