| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Bulletproofs.Fq
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 # | |
| Fractional Fq # | |
| Num Fq # | |
| Ord Fq # | |
| Show Fq # | |
| Generic Fq # | |
| Bits Fq # | |
Defined in Bulletproofs.Fq | |
| NFData Fq # | |
Defined in Bulletproofs.Fq | |
| Field Fq # | |
Defined in Bulletproofs.Utils | |
| AsInteger Fq # | |
Defined in Bulletproofs.Utils | |
| type Rep Fq # | |
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 #
Euclidean algorithm to compute inverse in an integral domain a
random :: MonadRandom m => m Fq #