Certified sparse linear system solving

A Las Vegas randomized algorithm for solving sparse linear systems over principal ideal domains is described. The algorithm returns a minimal-denominator solution accompanied by a certificate for its minimality or, if no solution exists, a certificate for the inconsistency of the system. The algorithm works for domains of any size, without need of ring extensions.