logos-storage/logos-storage-proofs
1
0
Fork 0
mirror of https://github.com/logos-storage/logos-storage-proofs.git synced 2026-01-04 06:23:11 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix hashes serialization

Browse Source
This commit is contained in:
Dmitriy Ryajov 2023-04-10 12:16:53 -06:00
parent 1f9cb9175a
commit ddace087f7
No known key found for this signature in database
GPG Key ID: DA8C680CE7C657A4
1 changed files with 20 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
src/ffi.rs
View File

@ -196,7 +196,7 @@ mod tests {
use super::{init, prove, Buffer}; use super::{init, prove, Buffer};
#[test] #[test]
fn should_prove() { fn test_storer_ffi() {
// generate a tuple of (preimages, hash), where preimages is a vector of 256 U256s // generate a tuple of (preimages, hash), where preimages is a vector of 256 U256s
// and hash is the hash of each vector generated using the digest function // and hash is the hash of each vector generated using the digest function
let data = (0..4) let data = (0..4)
@ -218,14 +218,15 @@ mod tests {
c.0.iter() c.0.iter()
.map(|c| c.to_le_bytes_vec()) .map(|c| c.to_le_bytes_vec())
.flatten() .flatten()
// .cloned()
.collect::<Vec<u8>>() .collect::<Vec<u8>>()
}) })
.flatten() .flatten()
.collect(); .collect();
let hashes: Vec<U256> = data.iter().map(|c| c.1).collect();
let path = [0, 1, 2, 3];
let hashes: Vec<U256> = data.iter().map(|c| c.1).collect();
let hashes_slice: Vec<u8> = hashes.iter().map(|c| c.to_le_bytes_vec()).flatten().collect();
let path = [0, 1, 2, 3];
let parent_hash_l = hash(&[hashes[0], hashes[1]]); let parent_hash_l = hash(&[hashes[0], hashes[1]]);
let parent_hash_r = hash(&[hashes[2], hashes[3]]); let parent_hash_r = hash(&[hashes[2], hashes[3]]);
@ -244,7 +245,6 @@ mod tests {
.iter() .iter()
.map(|c| c.to_le_bytes_vec()) .map(|c| c.to_le_bytes_vec())
.flatten() .flatten()
// .cloned()
.collect(); .collect();
let root = merkelize(hashes.as_slice()); let root = merkelize(hashes.as_slice());
@ -259,8 +259,8 @@ mod tests {
}; };
let hashes_buff = Buffer { let hashes_buff = Buffer {
data: hashes.as_ptr() as *const u8, data: hashes_slice.as_ptr() as *const u8,
len: hashes.len(), len: hashes_slice.len(),
}; };
let root_bytes: [u8; U256::BYTES] = root.to_le_bytes(); let root_bytes: [u8; U256::BYTES] = root.to_le_bytes();
@ -283,17 +283,19 @@ mod tests {
}; };
let prover_ptr = unsafe { init(&r1cs, &wasm, std::ptr::null()) }; let prover_ptr = unsafe { init(&r1cs, &wasm, std::ptr::null()) };
let prove_ctx = unsafe { prove( let prove_ctx = unsafe {
prover_ptr, prove(
&chunks_buff as *const Buffer, prover_ptr,
&siblings_buff as *const Buffer, &chunks_buff as *const Buffer,
&hashes_buff as *const Buffer, &siblings_buff as *const Buffer,
&path as *const i32, &hashes_buff as *const Buffer,
path.len(), &path as *const i32,
&root_buff as *const Buffer, // root path.len(),
&root_buff as *const Buffer, // pubkey &root_buff as *const Buffer, // root
&root_buff as *const Buffer, // salt/block hash &root_buff as *const Buffer, // pubkey
) }; &root_buff as *const Buffer, // salt/block hash
)
};
assert!(prove_ctx.is_null() == false); assert!(prove_ctx.is_null() == false);
} }