mirror of
https://github.com/PeernetOfficial/core.git
synced 2026-07-18 19:17:51 +01:00
71 lines
1.8 KiB
Go
71 lines
1.8 KiB
Go
package fragment
|
|
|
|
import (
|
|
"bytes"
|
|
"crypto/rand"
|
|
"encoding/hex"
|
|
"fmt"
|
|
"io"
|
|
"testing"
|
|
|
|
"lukechampine.com/blake3"
|
|
)
|
|
|
|
func TestFragment0(t *testing.T) {
|
|
dataSize := uint64(11*1024*1024 + 100)
|
|
|
|
data := make([]byte, dataSize)
|
|
|
|
if _, err := io.ReadFull(rand.Reader, data); err != nil {
|
|
return
|
|
}
|
|
|
|
fragmentSize := CalculateFragmentSize(dataSize)
|
|
|
|
tree, err := NewMerkleTree(dataSize, fragmentSize, bytes.NewBuffer(data))
|
|
|
|
if err != nil {
|
|
fmt.Printf("Error creating merkle tree: %v\n", err)
|
|
return
|
|
}
|
|
|
|
printMerkleTree(tree)
|
|
|
|
// Validate all hashes.
|
|
for n := uint64(0); n < tree.fragmentCount; n++ {
|
|
verificationHashes := tree.CreateVerification(n)
|
|
|
|
dataSize := tree.fragmentSize
|
|
if n == tree.fragmentCount-1 {
|
|
dataSize = tree.fileSize - n*tree.fragmentSize
|
|
}
|
|
dataHash := blake3.Sum256(data[n*tree.fragmentSize : n*tree.fragmentSize+dataSize])
|
|
|
|
valid := MerkleVerify(tree.rootHash, dataHash[:], verificationHashes)
|
|
|
|
fmt.Printf("Validate fragment %d: %t\n", n, valid)
|
|
if !valid {
|
|
for m := 0; m < len(verificationHashes); m++ {
|
|
fmt.Printf("-> Middle hash [level %d]: %s\n", m-1, hex.EncodeToString(verificationHashes[m]))
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
func printMerkleTree(tree *MerkleTree) {
|
|
fmt.Printf("File size: %d\n", tree.fileSize)
|
|
fmt.Printf("Fragment size: %d\n", tree.fragmentSize)
|
|
fmt.Printf("Fragment count: %d\n", tree.fragmentCount)
|
|
|
|
fmt.Printf("Merkle root hash: %s\n", hex.EncodeToString(tree.rootHash))
|
|
|
|
for n := 0; n < len(tree.fragmentHashes); n++ {
|
|
fmt.Printf("Fragment %d: %s\n", n, hex.EncodeToString(tree.fragmentHashes[n]))
|
|
}
|
|
for n := 0; n < len(tree.middleHashes); n++ {
|
|
for m := 0; m < len(tree.middleHashes[n]); m++ {
|
|
fmt.Printf("Middle hash [level %d] %d: %s\n", n, m, hex.EncodeToString(tree.middleHashes[n][m]))
|
|
}
|
|
}
|
|
}
|