Documentation

module ZkFold.Symbolic.GroebnerBasis.Types

boundVariables :: forall p. PrimeField (Zp p) => Polynomial p -> [Polynomial p] -> Polynomial p Source #

makeTheorem :: forall p. PrimeField (Zp p) => ArithmeticCircuit (Zp p) -> (Polynomial p, [Polynomial p]) Source #

verify :: forall p. PrimeField (Zp p) => (Polynomial p, [Polynomial p]) -> Bool Source #

groebner :: forall p. PrimeField (Zp p) => [Polynomial p] -> [Polynomial p] Source #

variableTypes :: forall p. Prime p => [Polynomial p] -> [(Monomial p, VarType)] Source #

lt :: Polynom c a -> Monom c a Source #

zeroM :: (Eq c, FiniteField c) => Monom a c -> Bool Source #

zeroP :: Polynom a c -> Bool Source #

similarM :: (Eq a, MultiplicativeMonoid a) => Monom a c -> Monom a c -> Bool Source #

makeSPoly :: (Eq c, FiniteField c, Ord a, Ring a) => Polynom a c -> Polynom a c -> Polynom a c Source #

fullReduceMany :: (Eq c, FiniteField c, Ord a, Ring a) => Polynom a c -> [Polynom a c] -> Polynom a c Source #

groebnerStep :: (Eq c, FiniteField c, Ord a, Ring a) => Polynom a c -> [Polynom a c] -> (Polynom a c, [Polynom a c]) Source #

groebnerStepMax :: Integer Source #