chore: update version to v0.10.1

CHANGELOG.md

@@ -1,4 +1,4 @@
-## 0.10.1 (TBD)
+## 0.10.1 (2024-09-13)
 
 * Added `Serializable` and `Deserializable` implementations for `PartialMmr` and `InOrderIndex` (#329).
 

Cargo.lock

@@ -518,7 +518,7 @@ checksum = "78ca9ab1a0babb1e7d5695e3530886289c18cf2f87ec19a575a0abdce112e3a3"
 
 [[package]]
 name = "miden-crypto"
-version = "0.10.0"
+version = "0.10.1"
 dependencies = [
  "blake3",
  "cc",

Cargo.toml

@@ -1,12 +1,12 @@
 [package]
 name = "miden-crypto"
-version = "0.10.0"
+version = "0.10.1"
 description = "Miden Cryptographic primitives"
 authors = ["miden contributors"]
 readme = "README.md"
 license = "MIT"
 repository = "https://github.com/0xPolygonMiden/crypto"
-documentation = "https://docs.rs/miden-crypto/0.10.0"
+documentation = "https://docs.rs/miden-crypto/0.10.1"
 categories = ["cryptography", "no-std"]
 keywords = ["miden", "crypto", "hash", "merkle"]
 edition = "2021"

src/dsa/rpo_falcon512/keys/secret_key.rs

@@ -27,13 +27,14 @@ const WIDTH_SMALL_POLY_COEFFICIENT: usize = 6;
 // SECRET KEY
 // ================================================================================================
 
-/// The secret key is a quadruple [[g, -f], [G, -F]] of polynomials with integer coefficients. Each
+/// The secret key is a quadruple [[g, -f], [G, -F]] of polynomials with integer coefficients.
-/// polynomial is of degree at most N = 512 and computations with these polynomials are done modulo
+///
-/// the monic irreducible polynomial ϕ = x^N + 1. The secret key is a basis for a lattice and has
+/// Each polynomial is of degree at most N = 512 and computations with these polynomials are done
-/// the property of being short with respect to a certain norm and an upper bound appropriate for
+/// modulo the monic irreducible polynomial ϕ = x^N + 1. The secret key is a basis for a lattice
-/// a given security parameter. The public key on the other hand is another basis for the same
+/// and has the property of being short with respect to a certain norm and an upper bound
-/// lattice and can be described by a single polynomial h with integer coefficients modulo ϕ.
+/// appropriate for a given security parameter. The public key on the other hand is another basis
-/// The two keys are related by the following relation:
+/// for the same lattice and can be described by a single polynomial h with integer coefficients
+/// modulo ϕ. The two keys are related by the following relation:
 ///
 /// 1. h = g /f [mod ϕ][mod p]
 /// 2. f.G - g.F = p [mod ϕ]

src/merkle/mmr/partial.rs

@@ -186,7 +186,7 @@ impl PartialMmr {
     pub fn inner_nodes<'a, I: Iterator<Item = (usize, RpoDigest)> + 'a>(
         &'a self,
         mut leaves: I,
-    ) -> impl Iterator<Item = InnerNodeInfo> + '_ {
+    ) -> impl Iterator<Item = InnerNodeInfo> + 'a {
         let stack = if let Some((pos, leaf)) = leaves.next() {
             let idx = InOrderIndex::from_leaf_pos(pos);
             vec![(idx, leaf)]