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.
157 lines
4.2 KiB
157 lines
4.2 KiB
/*
|
|
This file is part of cpp-ethereum.
|
|
|
|
cpp-ethereum is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
cpp-ethereum is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with cpp-ethereum. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file BlockInfo.cpp
|
|
* @author Gav Wood <i@gavwood.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
#include "Common.h"
|
|
#include "Dagger.h"
|
|
#include "Exceptions.h"
|
|
#include "RLP.h"
|
|
#include "State.h"
|
|
#include "BlockInfo.h"
|
|
using namespace std;
|
|
using namespace eth;
|
|
|
|
BlockInfo* BlockInfo::s_genesis = nullptr;
|
|
|
|
BlockInfo::BlockInfo(): timestamp(Invalid256)
|
|
{
|
|
}
|
|
|
|
BlockInfo::BlockInfo(bytesConstRef _block)
|
|
{
|
|
populate(_block);
|
|
}
|
|
|
|
BlockInfo BlockInfo::fromHeader(bytesConstRef _block)
|
|
{
|
|
BlockInfo ret;
|
|
ret.populateFromHeader(RLP(_block));
|
|
return ret;
|
|
}
|
|
|
|
bytes BlockInfo::createGenesisBlock()
|
|
{
|
|
RLPStream block(3);
|
|
auto sha3EmptyList = sha3(RLPEmptyList);
|
|
|
|
h256 stateRoot;
|
|
{
|
|
BasicMap db;
|
|
TrieDB<Address, BasicMap> state(&db);
|
|
state.init();
|
|
eth::commit(genesisState(), db, state);
|
|
stateRoot = state.root();
|
|
}
|
|
|
|
block.appendList(9) << h256() << sha3EmptyList << h160() << stateRoot << sha3EmptyList << c_genesisDifficulty << (uint)0 << string() << sha3(bytes(1, 42));
|
|
block.appendRaw(RLPEmptyList);
|
|
block.appendRaw(RLPEmptyList);
|
|
return block.out();
|
|
}
|
|
|
|
h256 BlockInfo::headerHashWithoutNonce() const
|
|
{
|
|
RLPStream s;
|
|
fillStream(s, false);
|
|
return sha3(s.out());
|
|
}
|
|
|
|
void BlockInfo::fillStream(RLPStream& _s, bool _nonce) const
|
|
{
|
|
_s.appendList(_nonce ? 9 : 8) << parentHash << sha3Uncles << coinbaseAddress << stateRoot << sha3Transactions << difficulty << timestamp << extraData;
|
|
if (_nonce)
|
|
_s << nonce;
|
|
}
|
|
|
|
void BlockInfo::populateGenesis()
|
|
{
|
|
bytes genesisBlock = createGenesisBlock();
|
|
populate(&genesisBlock);
|
|
}
|
|
|
|
void BlockInfo::populateFromHeader(RLP const& _header)
|
|
{
|
|
int field = 0;
|
|
try
|
|
{
|
|
parentHash = _header[field = 0].toHash<h256>();
|
|
sha3Uncles = _header[field = 1].toHash<h256>();
|
|
coinbaseAddress = _header[field = 2].toHash<Address>();
|
|
stateRoot = _header[field = 3].toHash<h256>();
|
|
sha3Transactions = _header[field = 4].toHash<h256>();
|
|
difficulty = _header[field = 5].toInt<u256>();
|
|
timestamp = _header[field = 6].toInt<u256>();
|
|
extraData = _header[field = 7].toBytes();
|
|
nonce = _header[field = 8].toHash<h256>();
|
|
}
|
|
catch (RLPException const&)
|
|
{
|
|
throw InvalidBlockHeaderFormat(field, _header[field].data());
|
|
}
|
|
}
|
|
|
|
void BlockInfo::populate(bytesConstRef _block)
|
|
{
|
|
hash = eth::sha3(_block);
|
|
|
|
RLP root(_block);
|
|
RLP header = root[0];
|
|
if (!header.isList())
|
|
throw InvalidBlockFormat(0, header.data());
|
|
populateFromHeader(header);
|
|
|
|
if (!root[1].isList())
|
|
throw InvalidBlockFormat(1, root[1].data());
|
|
if (!root[2].isList())
|
|
throw InvalidBlockFormat(2, root[2].data());
|
|
// check it hashes according to proof of work or that it's the genesis block.
|
|
if (parentHash && !Dagger::verify(headerHashWithoutNonce(), nonce, difficulty))
|
|
throw InvalidBlockNonce(headerHashWithoutNonce(), nonce, difficulty);
|
|
}
|
|
|
|
void BlockInfo::verifyInternals(bytesConstRef _block) const
|
|
{
|
|
RLP root(_block);
|
|
|
|
if (sha3Transactions != sha3(root[1].data()))
|
|
throw InvalidTransactionsHash(sha3Transactions, sha3(root[1].data()));
|
|
|
|
if (sha3Uncles != sha3(root[2].data()))
|
|
throw InvalidUnclesHash();
|
|
}
|
|
|
|
u256 BlockInfo::calculateDifficulty(BlockInfo const& _parent) const
|
|
{
|
|
if (!parentHash)
|
|
return c_genesisDifficulty;
|
|
else
|
|
return timestamp >= _parent.timestamp + 42 ? _parent.difficulty - (_parent.difficulty >> 10) : (_parent.difficulty + (_parent.difficulty >> 10));
|
|
}
|
|
|
|
void BlockInfo::verifyParent(BlockInfo const& _parent) const
|
|
{
|
|
// Check difficulty is correct given the two timestamps.
|
|
if (difficulty != calculateDifficulty(_parent))
|
|
throw InvalidDifficulty();
|
|
|
|
// Check timestamp is after previous timestamp.
|
|
if (parentHash && _parent.timestamp > timestamp)
|
|
throw InvalidTimestamp();
|
|
}
|
|
|