Nixpkgs now supports version-range queries with grail SAT solver

The primary change is the addition of version-range querying to nixpkgs via the grail tool. Engineers can now write expressions such as python3@>=3.10 ^[email protected].* and obtain a specific revision where both constraints hold simultaneously. This shifts nixpkgs from a static, version-less attribute set to a searchable space of historical package versions.

Adopting this feature brings a computational cost. Exact-pin queries were previously solvable in O(n log n) time, but version-range queries reduce to a boolean satisfiability problem that is NP-hard. The grail tool therefore relies on an external SAT solver, which can increase runtime and memory usage compared with the previous lightweight approach.

The solution works only as long as the required versions exist in the nixpkgs-multiverse archive. If no revision satisfies a given set of constraints, the solver will return no result. Although the tool supports date ranges and glibc eras via the --one-glibc flag, its answers are limited to the revisions stored in the multiverse, meaning it cannot infer compatibility beyond the archived history.

Community feeds highlight both the novelty and the familiarity of the approach. While the concept of version ranges is well established in ecosystems like npm, cargo, pip, and Spack, its introduction to nixpkgs marks a significant shift for a system that traditionally avoided dependency solving. The discussion indicates interest in applying the technique to real-world build reproducibility and dependency analysis.