You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
Jae Kwon 01b5540ffe consensus/state is 2-step asynchronous 10 years ago
..
README.md tendermint/block -> tendermint/types and tendermint/blockchain 10 years ago
block.go consensus/state is 2-step asynchronous 10 years ago
block_meta.go Made all JSON fields lower_case 10 years ago
config.go Config is passed into each module. Remove tendermint/confer 10 years ago
events.go Made all JSON fields lower_case 10 years ago
log.go Package import path change 10 years ago
names.go allow . in names 10 years ago
node.go network > chain_id, put in genesis.json 10 years ago
part_set.go Fix usage of SimpleProof for PartSet 10 years ago
part_set_test.go Fix usage of SimpleProof for PartSet 10 years ago
tx.go fixed NameTx.WriteSignBytes() bug. 10 years ago
tx_test.go chain_id written as string not hex in WriteSignBytes 10 years ago
tx_utils.go type assert fix 10 years ago
vote.go consensus/state is 2-step asynchronous 10 years ago

README.md

tendermint/block

Block

TODO: document

Header

Validation

Data

PartSet

PartSet is used to split a byteslice of data into parts (pieces) for transmission. By splitting data into smaller parts and computing a Merkle root hash on the list, you can verify that a part is legitimately part of the complete data, and the part can be forwarded to other peers before all the parts are known. In short, it's a fast way to propagate a large file over a gossip network.

PartSet was inspired by the LibSwift project.

Usage:

data := RandBytes(2 << 20) // Something large

partSet := NewPartSetFromData(data)
partSet.Total()     // Total number of 4KB parts
partSet.Count()     // Equal to the Total, since we already have all the parts
partSet.Hash()      // The Merkle root hash
partSet.BitArray()  // A BitArray of partSet.Total() 1's

header := partSet.Header() // Send this to the peer
header.Total        // Total number of parts
header.Hash         // The merkle root hash

// Now we'll reconstruct the data from the parts
partSet2 := NewPartSetFromHeader(header)
partSet2.Total()    // Same total as partSet.Total()
partSet2.Count()    // Zero, since this PartSet doesn't have any parts yet.
partSet2.Hash()     // Same hash as in partSet.Hash()
partSet2.BitArray() // A BitArray of partSet.Total() 0's

// In a gossip network the parts would arrive in arbitrary order, perhaps
// in response to explicit requests for parts, or optimistically in response
// to the receiving peer's partSet.BitArray().
for !partSet2.IsComplete() {
    part := receivePartFromGossipNetwork()
    added, err := partSet2.AddPart(part)
    if err != nil {
		// A wrong part,
        // the merkle trail does not hash to partSet2.Hash()
    } else if !added {
        // A duplicate part already received
    }
}

data2, _ := ioutil.ReadAll(partSet2.GetReader())
bytes.Equal(data, data2) // true