fix(docs): fix documentation errors.

Author: mmaker

src/composition.rs

@@ -1,6 +1,6 @@
 //! # Protocol Composition with AND/OR Logic
 //!
-//! This module defines the [`Protocol`] enum, which generalizes the [`SchnorrProof`]
+//! This module defines the [`ComposedRelation`] enum, which generalizes the [`SchnorrProof`]
 //! by enabling compositional logic between multiple proof instances.
 //!
 //! Specifically, it supports:
@@ -38,7 +38,7 @@ use crate::{
 /// This implementation generalizes [`SchnorrProof`] by using AND/OR links.
 ///
 /// # Type Parameters
-/// - `G`: A cryptographic group implementing [`Group`] and [`GroupEncoding`].
+/// - `G`: A cryptographic group implementing [`group::Group`] and [`group::GroupEncoding`].
 #[derive(Clone)]
 pub enum ComposedRelation<G: PrimeGroup> {
     Simple(SchnorrProof<G>),

src/duplex_sponge/keccak.rs

@@ -1,6 +1,6 @@
 //! Keccak-based duplex sponge implementation
 //!
-//! This module implements a duplex sponge construction using the Keccak-f[1600] permutation.
+//! This module implements a duplex sponge construction using the Keccak-f\[1600\] permutation.
 //! It is designed to match test vectors from the original Sage implementation.
 
 use crate::duplex_sponge::DuplexSpongeInterface;
@@ -9,7 +9,7 @@ use zerocopy::IntoBytes;
 const RATE: usize = 136;
 const LENGTH: usize = 136 + 64;
 
-/// Low-level Keccak-f[1600] state representation.
+/// Low-level Keccak-f\[1600\] state representation.
 #[derive(Clone, Default)]
 pub struct KeccakPermutationState([u64; LENGTH / 8]);
 
@@ -37,7 +37,7 @@ impl AsMut<[u8]> for KeccakPermutationState {
     }
 }
 
-/// Duplex sponge construction using Keccak-f[1600].
+/// Duplex sponge construction using Keccak-f\[1600\].
 #[derive(Clone)]
 pub struct KeccakDuplexSponge {
     state: KeccakPermutationState,

src/lib.rs

@@ -38,7 +38,7 @@
 //! - **[`traits::SigmaProtocol`]**: The fundamental three-move protocol interface
 //! - **[`linear_relation::LinearRelation`]**: Express mathematical relations over groups
 //! - **[`fiat_shamir::Nizk`]**: Convert interactive proofs to standalone proofs
-//! - **[`composition::Protocol`]**: Combine multiple proofs together
+//! - **[`composition::ComposedRelation`]**: Combine multiple proofs together
 //! - **[`codec`]**: Hash function backends for proof generation
 //!
 //! ---

src/linear_relation/canonical.rs

@@ -10,10 +10,10 @@ use crate::errors::{Error, InvalidInstance};
 use super::{ScalarVar, GroupVar, GroupMap, LinearRelation, LinearCombination, ScalarTerm};
 
 
-/// A normalized form of the [`LinearRelation``], which is used for serialization into the transcript.
+/// A normalized form of the [`LinearRelation`], which is used for serialization into the transcript.
 ///
 /// This struct represents a normalized form of a linear relation where each
-/// constraint is of the form: image[i] = Σ (scalar_j * group_element_k)
+/// constraint is of the form: image_i = Σ (scalar_j * group_element_k)
 /// without weights or extra scalars.
 #[derive(Clone, Debug, Default)]
 pub struct CanonicalLinearRelation<G: PrimeGroup> {

src/schnorr_protocol.rs

@@ -1,4 +1,4 @@
-//! Implementation of the generic Schnorr Sigma Protocol over a [`Group`].
+//! Implementation of the generic Schnorr Sigma Protocol over a [`group::Group`].
 //!
 //! This module defines the [`SchnorrProof`] structure, which implements
 //! a Sigma protocol proving different types of discrete logarithm relations (eg. Schnorr, Pedersen's commitments)