Skip to content

Commit af247d8

Browse files
committed
update changelog
1 parent e9532aa commit af247d8

File tree

4 files changed

+8
-4
lines changed

4 files changed

+8
-4
lines changed

CHANGELOG.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,9 @@
11
# Changelog
22

3+
## 0.12.3 (TBD)
4+
5+
- Added Horner-type batching method (#378).
6+
37
## 0.12.2 (2025-03-19) - `fri`, `prover`, and `verifier` crates only
48

59
- Commit to coefficients of FRI remainder polynomial in reverse order (#373).

crypto/src/commitment.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@ use crate::Hasher;
1717
/// position.
1818
///
1919
/// This is achieved by providing the value `v_i` together with a proof `proof_i` such that anyone
20-
/// posessing `com` can be convinced, with high confidence, that the claim is true.
20+
/// possessing `com` can be convinced, with high confidence, that the claim is true.
2121
///
2222
/// Vector commitment schemes usually have some batching properties in the sense that opening
2323
/// proofs for a number of `(i, v_i)` can be batched together into one batch opening proof in order

crypto/src/hash/mds/mds_f64_12x12.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -77,7 +77,7 @@ pub(crate) fn mds_multiply_freq(state: [u64; 12]) -> [u64; 12] {
7777
let (u8, u9, u10) = fft4_real([s2, s5, s8, s11]);
7878

7979
// This where the multiplication in frequency domain is done. More precisely, and with
80-
// the appropriate permuations in between, the sequence of
80+
// the appropriate permutations in between, the sequence of
8181
// 3-point FFTs --> multiplication by twiddle factors --> Hadamard multiplication -->
8282
// 3 point iFFTs --> multiplication by (inverse) twiddle factors
8383
// is "squashed" into one step composed of the functions "block1", "block2" and "block3".

utils/core/src/serde/byte_reader.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -434,7 +434,7 @@ impl<'a> ReadAdapter<'a> {
434434
// Read until we have at least `count` bytes, or until we reach end-of-file,
435435
// which ever comes first.
436436
loop {
437-
// If we have succesfully read `count` bytes, we're done
437+
// If we have successfully read `count` bytes, we're done
438438
if count == 0 || self.buf.len() >= count {
439439
break Ok(());
440440
}
@@ -469,7 +469,7 @@ impl ByteReader for ReadAdapter<'_> {
469469
///
470470
/// <div class="warning">
471471
/// Callers must ensure that they do not hold any immutable references to the buffer of this
472-
/// reader when calling this function so as to avoid a situtation in which the dynamic borrow
472+
/// reader when calling this function so as to avoid a situation in which the dynamic borrow
473473
/// check fails. Specifically, you must not be holding a reference to the result of
474474
/// [Self::read_slice] when this function is called.
475475
/// </div>

0 commit comments

Comments
 (0)