symbolic-base-0.1.0.0: ZkFold Symbolic compiler and zero-knowledge proof protocols
Safe HaskellSafe-Inferred
LanguageHaskell2010

ZkFold.Base.Algebra.Polynomials.Multivariate.Groebner

Documentation

reducable :: Polynomial c i j => Poly c i j -> Poly c i j -> Bool Source #

reduce :: forall c i j. (Ring j, Polynomial c i j) => Poly c i j -> Poly c i j -> Poly c i j Source #

reduceMany :: forall c i j. (Ring j, Polynomial c i j) => Poly c i j -> [Poly c i j] -> Poly c i j Source #

fullReduceMany :: forall c i j. (Ring j, Polynomial c i j) => Poly c i j -> [Poly c i j] -> Poly c i j Source #

systemReduce :: forall c i j. (Ring j, Polynomial c i j) => [Poly c i j] -> [Poly c i j] Source #

data GroebnerParams c i j Source #

Constructors

GroebnerParams 

Fields

makeSPoly :: (Ring j, Polynomial c i j) => Poly c i j -> Poly c i j -> Poly c i j Source #

groebnerStep :: (Ring j, Polynomial c i j) => GroebnerParams c i j -> [Poly c i j] -> [Poly c i j] Source #

groebner :: forall c i j. (Ring j, Polynomial c i j) => GroebnerParams c i j -> [Poly c i j] -> [Poly c i j] Source #

verifyGroebner :: forall c i j. (Ring j, Polynomial c i j) => GroebnerParams c i j -> [Poly c i j] -> Poly c i j -> Bool Source #