1  // Copyright (c) 2025-2026 ACDC Network
 2  // This file is part of the alphavm library.
 3  //
 4  // Alpha Chain | Delta Chain Protocol
 5  // International Monetary Graphite.
 6  //
 7  // Derived from Aleo (https://aleo.org) and ProvableHQ (https://provable.com).
 8  // They built world-class ZK infrastructure. We installed the EASY button.
 9  // Their cryptography: elegant. Our modifications: bureaucracy-compatible.
10  // Original brilliance: theirs. Robert's Rules: ours. Bugs: definitely ours.
11  //
12  // Original Aleo/ProvableHQ code subject to Apache 2.0 https://www.apache.org/licenses/LICENSE-2.0
13  // All modifications and new work: CC0 1.0 Universal Public Domain Dedication.
14  // No rights reserved. No permission required. No warranty. No refunds.
15  //
16  // https://creativecommons.org/publicdomain/zero/1.0/
17  // SPDX-License-Identifier: CC0-1.0
18  
19  use super::*;
20  
21  impl<E: Environment, const NUM_BITS: u8> HashUncompressed for Pedersen<E, NUM_BITS> {
22      type Input = bool;
23      type Output = Group<E>;
24  
25      /// Returns the Pedersen hash of the given input as a group element.
26      fn hash_uncompressed(&self, input: &[Self::Input]) -> Result<Self::Output> {
27          let mut input = Cow::Borrowed(input);
28          match input.len() <= NUM_BITS as usize {
29              // Pad the input if it is under the required parameter size.
30              true => input.to_mut().resize(NUM_BITS as usize, false),
31              // Ensure the input size is within the parameter size,
32              false => bail!("Invalid input size for Pedersen: expected <= {NUM_BITS}, found {}", input.len()),
33          }
34  
35          // Compute sum of h_i^{m_i} for all i.
36          Ok(input
37              .iter()
38              .zip_eq(&*self.base_window)
39              .flat_map(|(bit, base)| match bit {
40                  true => Some(*base),
41                  false => None,
42              })
43              .sum())
44      }
45  }