FIRE 7: Automatic Reduction with Modular Approach
Alexander V. Smirnov, Mao Zeng
TL;DR
FIRE7 addresses the computational bottlenecks of integration-by-parts reduction by introducing a modular arithmetic workflow that performs reductions at finite-field primes and reconstructs analytic coefficients. The approach is supported by single- and multi-probe binaries, MPI parallelization, and an automated reconstruction pipeline, complemented by tools to manipulate IBP tables and combine linear combinations. Key contributions include a robust presolve step that streamlines IBP identities, flexible orderings to optimize the Laporta solve, and the ability to reduce combinations directly, with significant speedups (up to ~50x) demonstrated in modular benchmarks and analytic benchmarks for multi-loop diagrams. The practical impact is a more scalable, automation-friendly IBP reduction framework suitable for large-scale perturbative QFT computations, with broad utility from signer workflows to high-performance computing environments.
Abstract
FIRE7 is a major update to the FIRE program for integration-by-parts (IBP) reduction of Feynman integrals. A large part of improvements is related to the automatic reduction and reconstruction with the modular arithmetic approach, while the performance of the classical rational polynomial approach is also significantly increased. An improved presolve algorithm performs Gaussian elimination to simplify IBP identities before substituting numerical indices as in the Laporta algorithm. Various new command line tools are included to facilitate tasks such as applying an IBP reduction table to reduce a loop integrand as a linear combination of individual integrals.
