starkom-pcs 6.0.0
“The DEEP-FRI polynomial commitment scheme used in Starkom.”
GitHub Actions workflow definition pathRust test marker or harness
SHA-256e4d054ef27eab26af2aaafaeb7124a3f2465e8b62c9fbcd2928ce6c2449f9a1b
MaleculeH(Db₂)Md₂(BkPa)
Evidence
11:19… odulus: U512) -> U256 {
12 static DST_STRING: &'static [u8] = b"starkom/merkle/leaf";
13 let mut hasher = sha3::Sha3_512::new();
14 hasher.update(DST_STRING);
15 let hash: U512 = U512::from_little_endian(hashe …
248:25… self.hashes.as_slice();
249 while n > 1 {
250 path.push(hashes[index ^ 1]);
251 hashes = &hashes[n..];
252 n /= 2;
⋯4 lines
37:18… = [0u8; 32];
38 bytes[24..32].copy_from_slice(&(value as u64).to_be_bytes());
39 H256::from_slice(&bytes)
40}
41
42/// Checks that none of the given points lies inside the evaluation domain of size `n`.
43///
44/// Used on both si …
1use primitive_types::{H256, U128, U256, U512};
2use sha2::Digest;
3use starkom_ff::Field256;
4use std::fmt::Debug;
5use std::marker::PhantomData;
6
7/// Describes a hash backend for hashing internal Merkle tree nodes.
8pub trait MerkleHasher {
9 /// Hashes a binary Merkle tre …
155:8… for input in inputs {
156 hasher.update(&input.to_be_bytes());
157 }
158 hasher.finalize()
⋯4 lines
No evidence locations were recorded for this file. Raw result