ZkFold.Symbolic.Data.Ord

Documentation

class Ord b a where

Methods

(<=) :: a -> a -> b

(<) :: a -> a -> b

(>=) :: a -> a -> b

(>) :: a -> a -> b

max :: a -> a -> a

min :: a -> a -> a

Instances

Ord a => Ord Bool a

Defined in ZkFold.Symbolic.Data.Ord

Methods

(<=) :: a -> a -> Bool

(<) :: a -> a -> Bool

(>=) :: a -> a -> Bool

(>) :: a -> a -> Bool

max :: a -> a -> a

min :: a -> a -> a

Symbolic c => Ord (Bool c) (FieldElement c)

Defined in ZkFold.Symbolic.Data.FieldElement

Methods

(<=) :: FieldElement c -> FieldElement c -> Bool c

(<) :: FieldElement c -> FieldElement c -> Bool c

(>=) :: FieldElement c -> FieldElement c -> Bool c

(>) :: FieldElement c -> FieldElement c -> Bool c

max :: FieldElement c -> FieldElement c -> FieldElement c

min :: FieldElement c -> FieldElement c -> FieldElement c

(Symbolic c, SymbolicOutput x, Context x ~ c) => Ord (Bool c) (Lexicographical x)

Every SymbolicData type can be compared lexicographically.

Defined in ZkFold.Symbolic.Data.Ord

Methods

(<=) :: Lexicographical x -> Lexicographical x -> Bool c

(<) :: Lexicographical x -> Lexicographical x -> Bool c

(>=) :: Lexicographical x -> Lexicographical x -> Bool c

(>) :: Lexicographical x -> Lexicographical x -> Bool c

max :: Lexicographical x -> Lexicographical x -> Lexicographical x

min :: Lexicographical x -> Lexicographical x -> Lexicographical x

(Symbolic c, KnownNat n, KnownRegisterSize r, KnownRegisters c n r, regSize ~ GetRegisterSize (BaseField c) n r, KnownNat (Ceil regSize OrdWord)) => Ord (Bool c) (UInt n r c)

Defined in ZkFold.Symbolic.Data.UInt

Methods

(<=) :: UInt n r c -> UInt n r c -> Bool c

(<) :: UInt n r c -> UInt n r c -> Bool c

(>=) :: UInt n r c -> UInt n r c -> Bool c

(>) :: UInt n r c -> UInt n r c -> Bool c

max :: UInt n r c -> UInt n r c -> UInt n r c

min :: UInt n r c -> UInt n r c -> UInt n r c

newtype Lexicographical a

A newtype wrapper for easy definition of Ord instances (though not necessarily a most effective one)

Constructors

Lexicographical a

Instances

SymbolicData a => SymbolicData (Lexicographical a)

Defined in ZkFold.Symbolic.Data.Ord

Associated Types

type Context (Lexicographical a) :: (Type -> Type) -> Type

type Support (Lexicographical a)

type Layout (Lexicographical a) :: Type -> Type

type Payload (Lexicographical a) :: Type -> Type

Methods

arithmetize :: Lexicographical a -> Support (Lexicographical a) -> Context (Lexicographical a) (Layout (Lexicographical a))

payload :: Lexicographical a -> Support (Lexicographical a) -> Payload (Lexicographical a) (WitnessField (Context (Lexicographical a)))

restore :: Context (Lexicographical a) ~ c => (Support (Lexicographical a) -> (c (Layout (Lexicographical a)), Payload (Lexicographical a) (WitnessField c))) -> Lexicographical a

(Symbolic c, SymbolicOutput x, Context x ~ c) => Ord (Bool c) (Lexicographical x)

Every SymbolicData type can be compared lexicographically.

Defined in ZkFold.Symbolic.Data.Ord

Methods

(<=) :: Lexicographical x -> Lexicographical x -> Bool c

(<) :: Lexicographical x -> Lexicographical x -> Bool c

(>=) :: Lexicographical x -> Lexicographical x -> Bool c

(>) :: Lexicographical x -> Lexicographical x -> Bool c

max :: Lexicographical x -> Lexicographical x -> Lexicographical x

min :: Lexicographical x -> Lexicographical x -> Lexicographical x

type Context (Lexicographical a)

Defined in ZkFold.Symbolic.Data.Ord

type Context (Lexicographical a) = Context a

type Layout (Lexicographical a)

Defined in ZkFold.Symbolic.Data.Ord

type Layout (Lexicographical a) = Layout a

type Payload (Lexicographical a)

Defined in ZkFold.Symbolic.Data.Ord

type Payload (Lexicographical a) = Payload a

type Support (Lexicographical a)

Defined in ZkFold.Symbolic.Data.Ord

type Support (Lexicographical a) = Support a

blueprintGE :: forall r i a w m f. (Arithmetic a, MonadCircuit i a w m, Zip f, Foldable f, KnownNat r) => f i -> f i -> m i

bitwiseGE :: forall r c f. (Symbolic c, Zip f, Foldable f, KnownNat r) => c f -> c f -> Bool c

Given two lists of bits of equal length, compares them lexicographically.

bitwiseGT :: forall r c f. (Symbolic c, Zip f, Foldable f, KnownNat r) => c f -> c f -> Bool c

Given two lists of bits of equal length, compares them lexicographically.

getBitsBE :: forall c x. (SymbolicOutput x, Context x ~ c) => x -> c List

getBitsBE x returns a list of circuits computing bits of x, eldest to youngest.