diff --git a/halo2/all.html b/halo2/all.html
index 434fc426fc..a8928bd49b 100644
--- a/halo2/all.html
+++ b/halo2/all.html
@@ -1,4 +1,4 @@
-List of all items in this crate
+List of all items in this crate
+halo2 - Rust
+List of all items in this crate
+FIXED_BASE_WINDOW_SIZE in halo2_gadgets::ecc::chip::constants - Rust
+H in halo2_gadgets::ecc::chip::constants - Rust
+NUM_WINDOWS in halo2_gadgets::ecc::chip::constants - Rust
+NUM_WINDOWS_SHORT in halo2_gadgets::ecc::chip::constants - Rust
+compute_lagrange_coeffs in halo2_gadgets::ecc::chip::constants - Rust
+find_zs_and_us in halo2_gadgets::ecc::chip::constants - Rust
+test_lagrange_coeffs in halo2_gadgets::ecc::chip::constants - Rust
+test_zs_and_us in halo2_gadgets::ecc::chip::constants - Rust
+halo2_gadgets::ecc::chip::constants - Rust
+BaseFieldElem in halo2_gadgets::ecc::chip - Rust
+FullScalar in halo2_gadgets::ecc::chip - Rust
+ScalarVar in halo2_gadgets::ecc::chip - Rust
An element of the elliptic curve’s base field, that is used as a scalar
in variable-base scalar mul.
It is not true in general that a scalar field element fits in a curve’s
base field, and in particular it is untrue for the Pallas curve, whose
@@ -124,5 +124,5 @@
V: MultiLane<T>,
\ No newline at end of file
diff --git a/halo2_gadgets/ecc/chip/enum.ShortScalar.html b/halo2_gadgets/ecc/chip/enum.ShortScalar.html
index 5da20158e7..792a5430f9 100644
--- a/halo2_gadgets/ecc/chip/enum.ShortScalar.html
+++ b/halo2_gadgets/ecc/chip/enum.ShortScalar.html
@@ -1,4 +1,4 @@
-ShortScalar in halo2_gadgets::ecc::chip - Rust
+ShortScalar in halo2_gadgets::ecc::chip - Rust
+halo2_gadgets::ecc::chip - Rust
+EccChip in halo2_gadgets::ecc::chip - Rust
A type that holds the configuration for this chip, and any other state it may need
-during circuit synthesis, that can be derived during Circuit::configure.
A type that holds the configuration for this chip, and any other state it may need
+during circuit synthesis, that can be derived during Circuit::configure.
Enumeration of the set of fixed bases to be used in scalar mul.
TODO: When associated consts can be used as const generics, introduce
Self::NUM_WINDOWS, Self::NUM_WINDOWS_BASE_FIELD, Self::NUM_WINDOWS_SHORT
and use them to differentiate FixedPoints types.
Witnesses the given point as a private input to the circuit.
+ layouter: &mut impl Layouter<Base>,
+ value: Value<Affine>
+) -> Result<Self::Point, Error>
Witnesses the given point as a private input to the circuit.
This allows the point to be the identity, mapped to (0, 0) in
affine coordinates.
Witnesses the given point as a private input to the circuit.
+ layouter: &mut impl Layouter<Base>,
+ value: Value<Affine>
+) -> Result<Self::NonIdentityPoint, Error>
Witnesses the given point as a private input to the circuit.
This returns an error if the point is the identity.
Converts a magnitude and sign that exists as variables in the circuit into a
+ _layouter: &mut impl Layouter<Base>,
+ (magnitude, sign): (AssignedCell<Base, Base>, AssignedCell<Base, Base>)
+) -> Result<Self::ScalarFixedShort, Error>
Converts a magnitude and sign that exists as variables in the circuit into a
signed short scalar to be used in fixed-base scalar multiplication.
Performs fixed-base scalar multiplication using a base field element as the scalar.
+) -> Result<Self::Point, Error>
Performs fixed-base scalar multiplication using a base field element as the scalar.
In the current implementation, this base field element must be output from another
instruction.
\ No newline at end of file
diff --git a/halo2_gadgets/ecc/chip/struct.EccConfig.html b/halo2_gadgets/ecc/chip/struct.EccConfig.html
index fe62cc34e9..9017537b6e 100644
--- a/halo2_gadgets/ecc/chip/struct.EccConfig.html
+++ b/halo2_gadgets/ecc/chip/struct.EccConfig.html
@@ -1,4 +1,4 @@
-EccConfig in halo2_gadgets::ecc::chip - Rust
+EccConfig in halo2_gadgets::ecc::chip - Rust
\ No newline at end of file
diff --git a/halo2_gadgets/ecc/chip/struct.EccPoint.html b/halo2_gadgets/ecc/chip/struct.EccPoint.html
index 6e0d09cfc7..893d4ad24f 100644
--- a/halo2_gadgets/ecc/chip/struct.EccPoint.html
+++ b/halo2_gadgets/ecc/chip/struct.EccPoint.html
@@ -1,4 +1,4 @@
-EccPoint in halo2_gadgets::ecc::chip - Rust
+EccPoint in halo2_gadgets::ecc::chip - Rust
+EccScalarFixed in halo2_gadgets::ecc::chip - Rust
+EccScalarFixedShort in halo2_gadgets::ecc::chip - Rust
+NonIdentityEccPoint in halo2_gadgets::ecc::chip - Rust
Witnesses the given point as a private input to the circuit.
+ layouter: &mut impl Layouter<C::Base>,
+ value: Value<C>
+) -> Result<Self::Point, Error>
Witnesses the given point as a private input to the circuit.
This allows the point to be the identity, mapped to (0, 0) in
affine coordinates.
Witnesses the given point as a private input to the circuit.
+ layouter: &mut impl Layouter<C::Base>,
+ value: Value<C>
+) -> Result<Self::NonIdentityPoint, Error>
Witnesses the given point as a private input to the circuit.
This returns an error if the point is the identity.
Performs fixed-base scalar multiplication using a base field element as the scalar.
+) -> Result<Self::Point, Error>
Performs fixed-base scalar multiplication using a base field element as the scalar.
In the current implementation, this base field element must be output from another
instruction.
\ No newline at end of file
diff --git a/halo2_gadgets/ecc/trait.FixedPoints.html b/halo2_gadgets/ecc/trait.FixedPoints.html
index 9b97f758f1..de7a9414f8 100644
--- a/halo2_gadgets/ecc/trait.FixedPoints.html
+++ b/halo2_gadgets/ecc/trait.FixedPoints.html
@@ -1,4 +1,4 @@
-FixedPoints in halo2_gadgets::ecc - Rust
+FixedPoints in halo2_gadgets::ecc - Rust
+halo2_gadgets - Rust
+PaddedWord in halo2_gadgets::poseidon - Rust
\ No newline at end of file
diff --git a/halo2_gadgets/poseidon/struct.Word.html b/halo2_gadgets/poseidon/struct.Word.html
index e154ab3af5..12dc0fc602 100644
--- a/halo2_gadgets/poseidon/struct.Word.html
+++ b/halo2_gadgets/poseidon/struct.Word.html
@@ -1,4 +1,4 @@
-Word in halo2_gadgets::poseidon - Rust
+Word in halo2_gadgets::poseidon - Rust
+PoseidonInstructions in halo2_gadgets::poseidon - Rust
-
\ No newline at end of file
diff --git a/halo2_gadgets/poseidon/trait.PoseidonSpongeInstructions.html b/halo2_gadgets/poseidon/trait.PoseidonSpongeInstructions.html
index df0c7eb5c9..e97281d418 100644
--- a/halo2_gadgets/poseidon/trait.PoseidonSpongeInstructions.html
+++ b/halo2_gadgets/poseidon/trait.PoseidonSpongeInstructions.html
@@ -1,4 +1,4 @@
-PoseidonSpongeInstructions in halo2_gadgets::poseidon - Rust
+PoseidonSpongeInstructions in halo2_gadgets::poseidon - Rust
\ No newline at end of file
diff --git a/halo2_gadgets/sha256/constant.BLOCK_SIZE.html b/halo2_gadgets/sha256/constant.BLOCK_SIZE.html
index 6e8e4207f9..73285ff133 100644
--- a/halo2_gadgets/sha256/constant.BLOCK_SIZE.html
+++ b/halo2_gadgets/sha256/constant.BLOCK_SIZE.html
@@ -1,4 +1,4 @@
-BLOCK_SIZE in halo2_gadgets::sha256 - Rust
+BLOCK_SIZE in halo2_gadgets::sha256 - Rust
+halo2_gadgets::sha256 - Rust
+BlockWord in halo2_gadgets::sha256 - Rust
-
\ No newline at end of file
diff --git a/halo2_gadgets/sha256/struct.Sha256.html b/halo2_gadgets/sha256/struct.Sha256.html
index 8cd76b82b3..a7ffc43a0a 100644
--- a/halo2_gadgets/sha256/struct.Sha256.html
+++ b/halo2_gadgets/sha256/struct.Sha256.html
@@ -1,4 +1,4 @@
-Sha256 in halo2_gadgets::sha256 - Rust
+Sha256 in halo2_gadgets::sha256 - Rust
\ No newline at end of file
diff --git a/halo2_gadgets/sha256/struct.Sha256Digest.html b/halo2_gadgets/sha256/struct.Sha256Digest.html
index ad26484f0a..2bad9be6dd 100644
--- a/halo2_gadgets/sha256/struct.Sha256Digest.html
+++ b/halo2_gadgets/sha256/struct.Sha256Digest.html
@@ -1,4 +1,4 @@
-Sha256Digest in halo2_gadgets::sha256 - Rust
+Sha256Digest in halo2_gadgets::sha256 - Rust
+Table16Chip in halo2_gadgets::sha256 - Rust
A type that holds the configuration for this chip, and any other state it may need
-during circuit synthesis, that can be derived during Circuit::configure.
A type that holds the configuration for this chip, and any other state it may need
+during circuit synthesis, that can be derived during Circuit::configure.
\ No newline at end of file
diff --git a/halo2_gadgets/sha256/struct.Table16Config.html b/halo2_gadgets/sha256/struct.Table16Config.html
index 1f84633d80..dbd57017cc 100644
--- a/halo2_gadgets/sha256/struct.Table16Config.html
+++ b/halo2_gadgets/sha256/struct.Table16Config.html
@@ -1,4 +1,4 @@
-Table16Config in halo2_gadgets::sha256 - Rust
+Table16Config in halo2_gadgets::sha256 - Rust
+Sha256Instructions in halo2_gadgets::sha256 - Rust
-
Instructions to check the validity of a Merkle path of a given PATH_LENGTH.
The hash function used is a Sinsemilla instance with K-bit words.
The hash function can process MAX_WORDS words.
Compute MerkleCRH for a given layer. The hash that computes the root
+) -> Result<Self::Var, Error>
Compute MerkleCRH for a given layer. The hash that computes the root
is at layer 0, and the hashes that are applied to two leaves are at
layer MERKLE_DEPTH - 1 = layer 31.
A type that holds the configuration for this chip, and any other state it may need
-during circuit synthesis, that can be derived during Circuit::configure.
A type that holds the configuration for this chip, and any other state it may need
+during circuit synthesis, that can be derived during Circuit::configure.
\ No newline at end of file
diff --git a/halo2_gadgets/utilities/cond_swap/struct.CondSwapConfig.html b/halo2_gadgets/utilities/cond_swap/struct.CondSwapConfig.html
index be920afc54..080d6a9ea2 100644
--- a/halo2_gadgets/utilities/cond_swap/struct.CondSwapConfig.html
+++ b/halo2_gadgets/utilities/cond_swap/struct.CondSwapConfig.html
@@ -1,4 +1,4 @@
-CondSwapConfig in halo2_gadgets::utilities::cond_swap - Rust
+CondSwapConfig in halo2_gadgets::utilities::cond_swap - Rust
+CondSwapInstructions in halo2_gadgets::utilities::cond_swap - Rust
+halo2_gadgets::utilities::decompose_running_sum - Rust
+RunningSum in halo2_gadgets::utilities::decompose_running_sum - Rust
This panics if the length of the resulting slice would overflow a usize.
This is only possible when flattening a slice of arrays of zero-sized
types, and thus tends to be irrelevant in practice. If
size_of::<T>() > 0, this will never panic.
This is only possible when flattening a slice of arrays of zero-sized
types, and thus tends to be irrelevant in practice. If
size_of::<T>() > 0, this will never panic.
The predicate is called on two elements following themselves,
it means the predicate is called on slice[0] and slice[1]
then on slice[1] and slice[2] and so on.
The predicate is called on two elements following themselves,
it means the predicate is called on slice[0] and slice[1]
then on slice[1] and slice[2] and so on.
Calling this method with an out-of-bounds index is undefined behavior
even if the resulting reference is not used. The caller has to ensure that
0 <= mid <= self.len().
Calling this method with an out-of-bounds index is undefined behavior
even if the resulting reference is not used. The caller has to ensure that
0 <= mid <= self.len().
Returns an iterator over subslices separated by elements that match
pred. The matched element is contained in the end of the previous
subslice as a terminator.
Returns an iterator over mutable subslices separated by elements that
match pred. The matched element is contained in the previous
subslice as a terminator.
Returns an iterator over subslices separated by elements that match
pred, starting at the end of the slice and working backwards.
The matched element is not contained in the subslices.
Returns an iterator over mutable subslices separated by elements that
match pred, starting at the end of the slice and working
backwards. The matched element is not contained in the subslices.
If any matching elements are resent in the slice, returns the prefix
before the match and suffix after. The matching element itself is not
included. If no elements match, returns None.
If any matching elements are resent in the slice, returns the prefix
before the match and suffix after. The matching element itself is not
included. If no elements match, returns None.
Looks up a series of four elements. The first is found, with a
uniquely determined position; the second and third are not
found; the fourth could match any position in [1, 4].
Looks up a series of four elements. The first is found, with a
uniquely determined position; the second and third are not
found; the fourth could match any position in [1, 4].
Looks up a series of four elements in a slice of pairs sorted by
their second elements. The first is found, with a uniquely
determined position; the second and third are not found; the
@@ -1534,7 +1468,7 @@
The current algorithm is based on pattern-defeating quicksort by Orson Peters,
which combines the fast average case of randomized quicksort with the fast worst case of
heapsort, while achieving linear time on slices with certain patterns. It uses some
@@ -1542,7 +1476,7 @@
The current algorithm is based on pattern-defeating quicksort by Orson Peters,
which combines the fast average case of randomized quicksort with the fast worst case of
heapsort, while achieving linear time on slices with certain patterns. It uses some
@@ -1573,7 +1507,7 @@
This sort is unstable (i.e., may reorder equal elements), in-place
(i.e., does not allocate), and O(m * n * log(n)) worst-case, where the key function is
O(m).
The current algorithm is based on pattern-defeating quicksort by Orson Peters,
which combines the fast average case of randomized quicksort with the fast worst case of
heapsort, while achieving linear time on slices with certain patterns. It uses some
@@ -1597,7 +1531,7 @@
the subslice prior to index, the element at index, and the subslice after index;
accordingly, the values in those two subslices will respectively all be less-than-or-equal-to
and greater-than-or-equal-to the value of the element at index.
-
The current algorithm is an introselect implementation based on Pattern Defeating Quicksort, which is also
the basis for sort_unstable. The fallback algorithm is Median of Medians using Tukey’s Ninther for
pivot selection, which guarantees linear runtime for all inputs.
index, the element at index, and the subslice after index; accordingly, the values in
those two subslices will respectively all be less-than-or-equal-to and greater-than-or-equal-to
the value of the element at index.
-
The current algorithm is an introselect implementation based on Pattern Defeating Quicksort, which is also
the basis for sort_unstable. The fallback algorithm is Median of Medians using Tukey’s Ninther for
pivot selection, which guarantees linear runtime for all inputs.
index, the element at index, and the subslice after index; accordingly, the values in
those two subslices will respectively all be less-than-or-equal-to and greater-than-or-equal-to
the value of the element at index.
-
The current algorithm is an introselect implementation based on Pattern Defeating Quicksort, which is also
the basis for sort_unstable. The fallback algorithm is Median of Medians using Tukey’s Ninther for
pivot selection, which guarantees linear runtime for all inputs.