0bcfc69da2
This commit redefines the hash h of a node in the Merkle tree as:
h(unary_node) = unary_node
h(binary_node) = H(left_child + right_child)
Previous code in c0b9af9a99 defined hash as:
h(unary_node) = H(unary_node + digest_type())
h(binary_node) = H(left_child + right_child)
The improved definition in this commit saves some hash computations.
86 lines
3.4 KiB
C++
86 lines
3.4 KiB
C++
/*
|
|
* Copyright (c) 2015, Cryptonomex, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This source code is provided for evaluation in private test networks only, until September 8, 2015. After this date, this license expires and
|
|
* the code may not be used, modified or distributed for any purpose. Redistribution and use in source and binary forms, with or without modification,
|
|
* are permitted until September 8, 2015, provided that the following conditions are met:
|
|
*
|
|
* 1. The code and/or derivative works are used only for private test networks consisting of no more than 10 P2P nodes.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
|
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
#include <graphene/chain/protocol/block.hpp>
|
|
#include <fc/io/raw.hpp>
|
|
#include <fc/bitutil.hpp>
|
|
#include <algorithm>
|
|
|
|
namespace graphene { namespace chain {
|
|
digest_type block_header::digest()const
|
|
{
|
|
return digest_type::hash(*this);
|
|
}
|
|
|
|
uint32_t block_header::num_from_id(const block_id_type& id)
|
|
{
|
|
return fc::endian_reverse_u32(id._hash[0]);
|
|
}
|
|
|
|
block_id_type signed_block_header::id()const
|
|
{
|
|
auto tmp = fc::sha224::hash( *this );
|
|
tmp._hash[0] = fc::endian_reverse_u32(block_num()); // store the block num in the ID, 160 bits is plenty for the hash
|
|
static_assert( sizeof(tmp._hash[0]) == 4, "should be 4 bytes" );
|
|
block_id_type result;
|
|
memcpy(result._hash, tmp._hash, std::min(sizeof(result), sizeof(tmp)));
|
|
return result;
|
|
}
|
|
|
|
fc::ecc::public_key signed_block_header::signee()const
|
|
{
|
|
return fc::ecc::public_key( witness_signature, digest(), true/*enforce canonical*/ );
|
|
}
|
|
|
|
void signed_block_header::sign( const fc::ecc::private_key& signer )
|
|
{
|
|
witness_signature = signer.sign_compact( digest() );
|
|
}
|
|
|
|
bool signed_block_header::validate_signee( const fc::ecc::public_key& expected_signee )const
|
|
{
|
|
return signee() == expected_signee;
|
|
}
|
|
|
|
checksum_type signed_block::calculate_merkle_root()const
|
|
{
|
|
if( transactions.size() == 0 )
|
|
return checksum_type();
|
|
|
|
vector<digest_type> ids;
|
|
ids.resize( transactions.size() );
|
|
for( uint32_t i = 0; i < transactions.size(); ++i )
|
|
ids[i] = transactions[i].merkle_digest();
|
|
|
|
vector<digest_type>::size_type current_number_of_hashes = ids.size();
|
|
while( current_number_of_hashes > 1 )
|
|
{
|
|
// hash ID's in pairs
|
|
uint32_t i_max = current_number_of_hashes - (current_number_of_hashes&1);
|
|
uint32_t k = 0;
|
|
|
|
for( uint32_t i = 0; i < i_max; i += 2 )
|
|
ids[k++] = digest_type::hash( std::make_pair( ids[i], ids[i+1] ) );
|
|
|
|
if( current_number_of_hashes&1 )
|
|
ids[k++] = ids[i_max];
|
|
current_number_of_hashes = k;
|
|
}
|
|
return checksum_type::hash( ids[0] );
|
|
}
|
|
|
|
} }
|