-
Notifications
You must be signed in to change notification settings - Fork 0
/
Miner.cpp
68 lines (51 loc) · 1.27 KB
/
Miner.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/**
* This is free and unencumbered software released into the public domain.
**/
#include "Miner.h"
#include <cstddef>
#include <algorithm>
struct MinerRegistry
{
static MinerRegistry& get()
{
static MinerRegistry* registry = new MinerRegistry;
return *registry;
}
std::map<std::string, Miner::CreateInstanceFn> types;
};
Miner::~Miner()
{
}
MinerPtr Miner::createInstance( const std::string& typeName )
{
auto& types = MinerRegistry::get().types;
auto fn = types.find( typeName );
if( fn == types.end() )
{
return nullptr;
}
return fn->second();
}
void Miner::registerMinerType( const std::string& typeName, CreateInstanceFn fn )
{
MinerRegistry::get().types[typeName] = fn;
}
std::vector<std::string> Miner::types()
{
std::vector<std::string> result;
for( auto it : MinerRegistry::get().types )
{
result.push_back( it.first );
}
return result;
}
Miner::Result Miner::mine( Block& block )
{
// Precompute as much hash as possible
Sha256 hash;
hash.update( &block.header, offsetof(Block::Header, nonce) * CHAR_BIT );
auto target = bitsToTarget( block.header.bits );
std::reverse( target.begin(), target.end() );
auto result = _mine( hash, target, block.header.nonce );
return result;
}