Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- newtype Fq = Fq Integer
- new :: Integer -> Fq
- norm :: Fq -> Fq
- fqAdd :: Fq -> Fq -> Fq
- fqMul :: Fq -> Fq -> Fq
- fqNeg :: Fq -> Fq
- fqDiv :: Fq -> Fq -> Fq
- fqInv :: Fq -> Fq
- fqZero :: Fq
- fqOne :: Fq
- fqSquare :: Fq -> Fq
- fqCube :: Fq -> Fq
- fqPower :: Fq -> Integer -> Fq
- fqPower' :: Fq -> Integer -> Fq -> Fq
- inv :: Fq -> Fq
- asInteger :: Fq -> Integer
- euclidean :: Integral a => a -> a -> a
- inv' :: Integral a => a -> a -> (a, a)
- random :: MonadRandom m => m Fq
Documentation
Prime field with characteristic _q
Instances
Eq Fq Source # | |
Fractional Fq Source # | |
Num Fq Source # | |
Ord Fq Source # | |
Show Fq Source # | |
Generic Fq Source # | |
Bits Fq Source # | |
Defined in Bulletproofs.Fq | |
NFData Fq Source # | |
Defined in Bulletproofs.Fq | |
Field Fq Source # | |
AsInteger Fq Source # | |
type Rep Fq Source # | |
Defined in Bulletproofs.Fq |
Turn an integer into an Fq
number, should be used instead of
the Fq
constructor.
euclidean :: Integral a => a -> a -> a Source #
Euclidean algorithm to compute inverse in an integral domain a
random :: MonadRandom m => m Fq Source #