This package provides the framework for the implementation of unirationality constructions.
A moduli space M of objects is unirational if there exists a dominant rational map φ:ℙn --> M. If the function φ is explicilty given it can be translated into a construction function that computes φ(P) for a given P ∈ℙn. If P is chosen randomly (over a finite field Fq or over a subset of ℚ limited by a given height) it may not lie in the open subset of ℙn where φ is defined. This can be remedied by calling the function several times, i.e. allowing a certain number of Attempts. One is also interested in certifying the constructed object meaning that it satisfies certain reasonable properties.