* fix rng and get_winner_numbers implemented * coipied code for bitshares fixing 429 and 433 isuues * ticket_purchase_operation implemented. added lottery_options to asset * lottery end implemented * minor logic changes. added db_api and cli_wallet methods * fix reindex on peerplays network * fix some tests. add gitlab-ci.yml * add pull to gitlab-ci * fix * fix and comment some tests * added owner to lottery_asset_options. commented async call in on_applied_block callback * added get_account_lotteries method to db_api and cli, lottery end_date and ticket_price verification * merge get_account_lotteries branch. fix create_witness test * fix test genesis and end_date verification * fixed indices sorting and lottery end checking by date * update db_version for replay and removed duplicate include files * Added ntp and upgraded boost version * Revert "GPOS protocol" * need to remove backup files * virtual-op-fix for deterministic virtual_op number * Merged beatrice into 5050 * Updated gitmodules, changes to allow voting on lottery fee * Removed submodule libraries/fc * Added libraries/fc * added missing , in types.hpp * Added sweeps parameters to parameter_extension * added missing comma in operations.hpp, small changes to config.hpp * fixed returntype in chain_parameters.hpp * removed sweeps_parameter_extensions * Changed fc library * fixed asset_object * Changed peerplays-fc submodule * Changed fc submodule to ubuntu 18.04 upgrade * Removed submodule libraries/fc * Added fc library back * fix casting in overloaded function * Removed blind_sign and unblind_signature functions * Added new lottery_asset_create_operation * Changed sweeps hardfork time * Removed redundant if from asset_evaluator and fixed db_notify * fixed duplicate code in fee_tests * removed redundant tgenesis file * Enable building on Ubuntu 18.04 using GCC 7 compiler * fix: is_benefactor_reward had the default value of true when not set * Docker file for Ubuntu 18.04 Base image updated to Unbuntu 18.04 Prerequisite list updated Basic configuration updated * Quick fix: Added missing package pkg-config * Docker file updates * 5050 fee update and compilation error fix * Dockerfile, set system locale Prevents locale::facet::_S_create_c_locale name error * Update README.md Fix typo * Update README.md * Changed hardfork time for SWEEPS and Core-429 * revert master changes that were brought in previous commit * Fixed error when account_history_object with id 0 doesnt exist * Fixed error while loading object database * test for zero id object in account history * Reorder operations in Dockerfile, to make image creation faster - Reorder prevents unnecessary building of Boost libraries * Fix for irrelevant signature included issue * fix copyrigth messages order * remove double empty lines * Backport fix for `get_account_history` from https://github.com/bitshares/bitshares-core/pull/628 and add additional account history test case * NTP client back * GRPH-53-Log_format_error * Merge pull request #1036 from jmjatlanta/issue_730 Add fail_reason to proposal_object * Unit test case fixes and prepared SONs base * Use offsetof instead of custom macro * Hide some compiler warnings * Make all the tests compile * Add nullptr check in api.cpp for easier testing * Add test case for broadcast_trx_with_callback API * Unit test case fixes and prepared SONs base * Merge pull request #714 from pmconrad/json_fix JSON fix * Increase max depth for trx confirmation callback * Adapt to variant API with `max_depth` argument * Update fc submodule * Created unit test for #325 * remove needless find() * GRPH-4-CliWallet_crash_ctrlD * fix copyright message * Make all the tests compile * increase delay for node connection * Increase block creation timeout to 2500ms * remove cache from cli get_account * add cli tests framework * Adjust newly merged code to new API * Improved resilience of block database against corruption * Merged changes from Bitshares PR 1036 * GRPH-76 - Short-cut long sequences of missed blocks Fixes database::update_global_dynamic_data to speed up counting missed blocks. (This also fixes a minor issue with counting - the previous algorithm would skip missed blocks for the witness who signed the first block after the gap.) * Moved reindex logic into database / chain_database, make use of additional blocks in block_database Fixed tests wrt db.open * Enable undo + fork database for final blocks in a replay Dont remove blocks from block db when popping blocks, handle edge case in replay wrt fork_db, adapted unit tests * Log starting block number of replay * Prevent unsigned integer underflow * Fixed lock detection * Dont leave _data_dir empty if db is locked * Writing the object_database is now almost atomic * Improved consistency check for block_log * Cut back block_log index file if inconsistent * Fixed undo_database * Added test case for broken merge on empty undo_db * Merge pull request #938 from bitshares/fix-block-storing Store correct block ID when switching forks * exclude second undo_db.enable() call in some cases * Add missing change * change bitshares to core in message * Fixed integer overflow issue * Fix for for history ID mismatch ( Bitshares PR #875 ) * Update the FC submodule with the changes for GRPH-4 * Fix #436 object_database created outside of witness data directory * supplement more comments on database::_opened variable * prevent segfault when destructing application obj * Fixed duplicate ops returned from get_account_history * minor performance improvement * Added comment * Merged Bitshares PR #1462 and compilation fixes * Support/gitlab (#123) * Updated gitlab process * Fix undefined references in cli test * Fixed test failures and compilation issue * Fixed account_history_pagination test * Fix compilation in debug mode * Removed unrelated comment * Skip auth check when pushing self-generated blocks * Extract public keys before pushing a transaction * Dereference chain_database shared_ptr * Updated transaction::signees to mutable and * updated get_signature_keys() to return a const reference, * get_signature_keys() will update signees on first call, * modified test cases and wallet.cpp accordingly, * no longer construct a new signed_transaction object before pushing * Added get_asset_count API * Allow sufficient space for new undo_session * Throw for deep nesting * No longer extract public keys before pushing a trx and removed unused new added constructor and _get_signature_keys() function from signed_transaction struct * Added cli_test to CI * use random port numbers in app_test (#154) * proposal fail_reason bug fixed (#157) * Added Sonarcloud code_quality to CI (#159) * Added sonarcloud analysis (#158) * fix for lottery end * fix declarations * fix declarations * fix boost integer * fix compilation * fix chain tests * fix app_test * try to fix cli test * fix incorrect max_depth param * working cli test * correct fc version
392 lines
14 KiB
C++
392 lines
14 KiB
C++
/*
|
|
* Copyright (c) 2015 Cryptonomex, Inc., and contributors.
|
|
*
|
|
* The MIT License
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
* THE SOFTWARE.
|
|
*/
|
|
#include <graphene/chain/exceptions.hpp>
|
|
#include <graphene/chain/protocol/fee_schedule.hpp>
|
|
#include <fc/io/raw.hpp>
|
|
#include <fc/bitutil.hpp>
|
|
#include <fc/smart_ref_impl.hpp>
|
|
#include <algorithm>
|
|
|
|
namespace graphene { namespace chain {
|
|
|
|
digest_type processed_transaction::merkle_digest()const
|
|
{
|
|
digest_type::encoder enc;
|
|
fc::raw::pack( enc, *this );
|
|
return enc.result();
|
|
}
|
|
|
|
digest_type transaction::digest()const
|
|
{
|
|
digest_type::encoder enc;
|
|
fc::raw::pack( enc, *this );
|
|
return enc.result();
|
|
}
|
|
|
|
digest_type transaction::sig_digest( const chain_id_type& chain_id )const
|
|
{
|
|
digest_type::encoder enc;
|
|
fc::raw::pack( enc, chain_id );
|
|
fc::raw::pack( enc, *this );
|
|
return enc.result();
|
|
}
|
|
|
|
void transaction::validate() const
|
|
{
|
|
FC_ASSERT( operations.size() > 0, "A transaction must have at least one operation", ("trx",*this) );
|
|
for( const auto& op : operations )
|
|
operation_validate(op);
|
|
}
|
|
|
|
graphene::chain::transaction_id_type graphene::chain::transaction::id() const
|
|
{
|
|
auto h = digest();
|
|
transaction_id_type result;
|
|
memcpy(result._hash, h._hash, std::min(sizeof(result), sizeof(h)));
|
|
return result;
|
|
}
|
|
|
|
const signature_type& graphene::chain::signed_transaction::sign(const private_key_type& key, const chain_id_type& chain_id)
|
|
{
|
|
digest_type h = sig_digest( chain_id );
|
|
signatures.push_back(key.sign_compact(h));
|
|
signees.clear(); // Clear signees since it may be inconsistent after added a new signature
|
|
return signatures.back();
|
|
}
|
|
|
|
signature_type graphene::chain::signed_transaction::sign(const private_key_type& key, const chain_id_type& chain_id)const
|
|
{
|
|
digest_type::encoder enc;
|
|
fc::raw::pack( enc, chain_id );
|
|
fc::raw::pack( enc, *this );
|
|
return key.sign_compact(enc.result());
|
|
}
|
|
|
|
void transaction::set_expiration( fc::time_point_sec expiration_time )
|
|
{
|
|
expiration = expiration_time;
|
|
}
|
|
|
|
void transaction::set_reference_block( const block_id_type& reference_block )
|
|
{
|
|
ref_block_num = fc::endian_reverse_u32(reference_block._hash[0]);
|
|
ref_block_prefix = reference_block._hash[1];
|
|
}
|
|
|
|
void transaction::get_required_authorities( flat_set<account_id_type>& active, flat_set<account_id_type>& owner, vector<authority>& other )const
|
|
{
|
|
for( const auto& op : operations )
|
|
operation_get_required_authorities( op, active, owner, other );
|
|
}
|
|
|
|
|
|
|
|
|
|
struct sign_state
|
|
{
|
|
/** returns true if we have a signature for this key or can
|
|
* produce a signature for this key, else returns false.
|
|
*/
|
|
bool signed_by( const public_key_type& k )
|
|
{
|
|
auto itr = provided_signatures.find(k);
|
|
if( itr == provided_signatures.end() )
|
|
{
|
|
auto pk = available_keys.find(k);
|
|
if( pk != available_keys.end() )
|
|
return provided_signatures[k] = true;
|
|
return false;
|
|
}
|
|
return itr->second = true;
|
|
}
|
|
|
|
optional<map<address,public_key_type>> available_address_sigs;
|
|
optional<map<address,public_key_type>> provided_address_sigs;
|
|
|
|
bool signed_by( const address& a ) {
|
|
if( !available_address_sigs ) {
|
|
available_address_sigs = std::map<address,public_key_type>();
|
|
provided_address_sigs = std::map<address,public_key_type>();
|
|
for( auto& item : available_keys ) {
|
|
(*available_address_sigs)[ address(pts_address(item, false, 56) ) ] = item;
|
|
(*available_address_sigs)[ address(pts_address(item, true, 56) ) ] = item;
|
|
(*available_address_sigs)[ address(pts_address(item, false, 0) ) ] = item;
|
|
(*available_address_sigs)[ address(pts_address(item, true, 0) ) ] = item;
|
|
(*available_address_sigs)[ address(item) ] = item;
|
|
}
|
|
for( auto& item : provided_signatures ) {
|
|
(*provided_address_sigs)[ address(pts_address(item.first, false, 56) ) ] = item.first;
|
|
(*provided_address_sigs)[ address(pts_address(item.first, true, 56) ) ] = item.first;
|
|
(*provided_address_sigs)[ address(pts_address(item.first, false, 0) ) ] = item.first;
|
|
(*provided_address_sigs)[ address(pts_address(item.first, true, 0) ) ] = item.first;
|
|
(*provided_address_sigs)[ address(item.first) ] = item.first;
|
|
}
|
|
}
|
|
auto itr = provided_address_sigs->find(a);
|
|
if( itr == provided_address_sigs->end() )
|
|
{
|
|
auto aitr = available_address_sigs->find(a);
|
|
if( aitr != available_address_sigs->end() ) {
|
|
auto pk = available_keys.find(aitr->second);
|
|
if( pk != available_keys.end() )
|
|
return provided_signatures[aitr->second] = true;
|
|
return false;
|
|
}
|
|
}
|
|
return provided_signatures[itr->second] = true;
|
|
}
|
|
|
|
bool check_authority( account_id_type id )
|
|
{
|
|
if( approved_by.find(id) != approved_by.end() ) return true;
|
|
return check_authority( get_active(id) );
|
|
}
|
|
|
|
/**
|
|
* Checks to see if we have signatures of the active authorites of
|
|
* the accounts specified in authority or the keys specified.
|
|
*/
|
|
bool check_authority( const authority* au, uint32_t depth = 0 )
|
|
{
|
|
if( au == nullptr ) return false;
|
|
const authority& auth = *au;
|
|
|
|
uint32_t total_weight = 0;
|
|
for( const auto& k : auth.key_auths )
|
|
if( signed_by( k.first ) )
|
|
{
|
|
total_weight += k.second;
|
|
if( total_weight >= auth.weight_threshold )
|
|
return true;
|
|
}
|
|
|
|
for( const auto& k : auth.address_auths )
|
|
if( signed_by( k.first ) )
|
|
{
|
|
total_weight += k.second;
|
|
if( total_weight >= auth.weight_threshold )
|
|
return true;
|
|
}
|
|
|
|
for( const auto& a : auth.account_auths )
|
|
{
|
|
if( approved_by.find(a.first) == approved_by.end() )
|
|
{
|
|
if( depth == max_recursion )
|
|
continue;
|
|
if( check_authority( get_active( a.first ), depth+1 ) )
|
|
{
|
|
approved_by.insert( a.first );
|
|
total_weight += a.second;
|
|
if( total_weight >= auth.weight_threshold )
|
|
return true;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
total_weight += a.second;
|
|
if( total_weight >= auth.weight_threshold )
|
|
return true;
|
|
}
|
|
}
|
|
return total_weight >= auth.weight_threshold;
|
|
}
|
|
|
|
bool remove_unused_signatures()
|
|
{
|
|
vector<public_key_type> remove_sigs;
|
|
for( const auto& sig : provided_signatures )
|
|
if( !sig.second ) remove_sigs.push_back( sig.first );
|
|
|
|
for( auto& sig : remove_sigs )
|
|
provided_signatures.erase(sig);
|
|
|
|
return remove_sigs.size() != 0;
|
|
}
|
|
|
|
sign_state( const flat_set<public_key_type>& sigs,
|
|
const std::function<const authority*(account_id_type)>& a,
|
|
const flat_set<public_key_type>& keys = flat_set<public_key_type>() )
|
|
:get_active(a),available_keys(keys)
|
|
{
|
|
for( const auto& key : sigs )
|
|
provided_signatures[ key ] = false;
|
|
approved_by.insert( GRAPHENE_TEMP_ACCOUNT );
|
|
}
|
|
|
|
const std::function<const authority*(account_id_type)>& get_active;
|
|
const flat_set<public_key_type>& available_keys;
|
|
|
|
flat_map<public_key_type,bool> provided_signatures;
|
|
flat_set<account_id_type> approved_by;
|
|
uint32_t max_recursion = GRAPHENE_MAX_SIG_CHECK_DEPTH;
|
|
};
|
|
|
|
|
|
void verify_authority( const vector<operation>& ops, const flat_set<public_key_type>& sigs,
|
|
const std::function<const authority*(account_id_type)>& get_active,
|
|
const std::function<const authority*(account_id_type)>& get_owner,
|
|
uint32_t max_recursion_depth,
|
|
bool allow_committe,
|
|
const flat_set<account_id_type>& active_aprovals,
|
|
const flat_set<account_id_type>& owner_approvals )
|
|
{ try {
|
|
flat_set<account_id_type> required_active;
|
|
flat_set<account_id_type> required_owner;
|
|
vector<authority> other;
|
|
|
|
for( const auto& op : ops )
|
|
operation_get_required_authorities( op, required_active, required_owner, other );
|
|
|
|
if( !allow_committe )
|
|
GRAPHENE_ASSERT( required_active.find(GRAPHENE_COMMITTEE_ACCOUNT) == required_active.end(),
|
|
invalid_committee_approval, "Committee account may only propose transactions" );
|
|
|
|
sign_state s(sigs,get_active);
|
|
s.max_recursion = max_recursion_depth;
|
|
for( auto& id : active_aprovals )
|
|
s.approved_by.insert( id );
|
|
for( auto& id : owner_approvals )
|
|
s.approved_by.insert( id );
|
|
|
|
for( const auto& auth : other )
|
|
{
|
|
GRAPHENE_ASSERT( s.check_authority(&auth), tx_missing_other_auth, "Missing Authority", ("auth",auth)("sigs",sigs) );
|
|
}
|
|
|
|
// fetch all of the top level authorities
|
|
for( auto id : required_active )
|
|
{
|
|
GRAPHENE_ASSERT( s.check_authority(id) ||
|
|
s.check_authority(get_owner(id)),
|
|
tx_missing_active_auth, "Missing Active Authority ${id}", ("id",id)("auth",*get_active(id))("owner",*get_owner(id)) );
|
|
}
|
|
|
|
for( auto id : required_owner )
|
|
{
|
|
GRAPHENE_ASSERT( owner_approvals.find(id) != owner_approvals.end() ||
|
|
s.check_authority(get_owner(id)),
|
|
tx_missing_owner_auth, "Missing Owner Authority ${id}", ("id",id)("auth",*get_owner(id)) );
|
|
}
|
|
|
|
GRAPHENE_ASSERT(
|
|
!s.remove_unused_signatures(),
|
|
tx_irrelevant_sig,
|
|
"Unnecessary signature(s) detected"
|
|
);
|
|
} FC_CAPTURE_AND_RETHROW( (ops)(sigs) ) }
|
|
|
|
|
|
const flat_set<public_key_type>& signed_transaction::get_signature_keys( const chain_id_type& chain_id )const
|
|
{ try {
|
|
// Strictly we should check whether the given chain ID is same as the one used to initialize the `signees` field.
|
|
// However, we don't pass in another chain ID so far, for better performance, we skip the check.
|
|
if( signees.empty() && !signatures.empty() )
|
|
{
|
|
auto d = sig_digest( chain_id );
|
|
flat_set<public_key_type> result;
|
|
for( const auto& sig : signatures )
|
|
{
|
|
GRAPHENE_ASSERT(
|
|
result.insert( fc::ecc::public_key(sig,d) ).second,
|
|
tx_duplicate_sig,
|
|
"Duplicate Signature detected" );
|
|
}
|
|
signees = std::move( result );
|
|
}
|
|
return signees;
|
|
} FC_CAPTURE_AND_RETHROW() }
|
|
|
|
|
|
set<public_key_type> signed_transaction::get_required_signatures(
|
|
const chain_id_type& chain_id,
|
|
const flat_set<public_key_type>& available_keys,
|
|
const std::function<const authority*(account_id_type)>& get_active,
|
|
const std::function<const authority*(account_id_type)>& get_owner,
|
|
uint32_t max_recursion_depth )const
|
|
{
|
|
flat_set<account_id_type> required_active;
|
|
flat_set<account_id_type> required_owner;
|
|
vector<authority> other;
|
|
get_required_authorities( required_active, required_owner, other );
|
|
|
|
const flat_set<public_key_type>& signature_keys = get_signature_keys( chain_id );
|
|
sign_state s( signature_keys, get_active, available_keys );
|
|
s.max_recursion = max_recursion_depth;
|
|
|
|
for( const auto& auth : other )
|
|
s.check_authority(&auth);
|
|
for( auto& owner : required_owner )
|
|
s.check_authority( get_owner( owner ) );
|
|
for( auto& active : required_active )
|
|
s.check_authority( active );
|
|
|
|
s.remove_unused_signatures();
|
|
|
|
set<public_key_type> result;
|
|
|
|
for( auto& provided_sig : s.provided_signatures )
|
|
if( available_keys.find( provided_sig.first ) != available_keys.end() )
|
|
result.insert( provided_sig.first );
|
|
|
|
return result;
|
|
}
|
|
|
|
set<public_key_type> signed_transaction::minimize_required_signatures(
|
|
const chain_id_type& chain_id,
|
|
const flat_set<public_key_type>& available_keys,
|
|
const std::function<const authority*(account_id_type)>& get_active,
|
|
const std::function<const authority*(account_id_type)>& get_owner,
|
|
uint32_t max_recursion
|
|
) const
|
|
{
|
|
set< public_key_type > s = get_required_signatures( chain_id, available_keys, get_active, get_owner, max_recursion );
|
|
flat_set< public_key_type > result( s.begin(), s.end() );
|
|
|
|
for( const public_key_type& k : s )
|
|
{
|
|
result.erase( k );
|
|
try
|
|
{
|
|
graphene::chain::verify_authority( operations, result, get_active, get_owner, max_recursion );
|
|
continue; // element stays erased if verify_authority is ok
|
|
}
|
|
catch( const tx_missing_owner_auth& e ) {}
|
|
catch( const tx_missing_active_auth& e ) {}
|
|
catch( const tx_missing_other_auth& e ) {}
|
|
result.insert( k );
|
|
}
|
|
return set<public_key_type>( result.begin(), result.end() );
|
|
}
|
|
|
|
void signed_transaction::verify_authority(
|
|
const chain_id_type& chain_id,
|
|
const std::function<const authority*(account_id_type)>& get_active,
|
|
const std::function<const authority*(account_id_type)>& get_owner,
|
|
uint32_t max_recursion )const
|
|
{ try {
|
|
graphene::chain::verify_authority( operations, get_signature_keys( chain_id ), get_active, get_owner, max_recursion );
|
|
} FC_CAPTURE_AND_RETHROW( (*this) ) }
|
|
|
|
} } // graphene::chain
|