mirror of
https://github.com/XRPLF/rippled.git
synced 2025-12-06 17:27:55 +00:00
79 lines
1.7 KiB
C++
79 lines
1.7 KiB
C++
#ifndef PROOF_OF_WORK__H
|
|
#define PROOF_OF_WORK__H
|
|
|
|
#include <string>
|
|
|
|
#include <boost/thread/mutex.hpp>
|
|
#include <boost/bimap.hpp>
|
|
#include <boost/bimap/set_of.hpp>
|
|
#include <boost/bimap/multiset_of.hpp>
|
|
|
|
#include "uint256.h"
|
|
|
|
enum POWResult
|
|
{
|
|
powOK = 0,
|
|
powREUSED = 1,
|
|
powBADNONCE = 2,
|
|
powBADTOKEN = 3,
|
|
powEXPIRED = 4,
|
|
};
|
|
|
|
class ProofOfWork
|
|
{
|
|
protected:
|
|
|
|
std::string mToken;
|
|
uint256 mChallenge;
|
|
uint256 mTarget;
|
|
int mIterations;
|
|
|
|
static const uint256 sMinTarget;
|
|
static const int sMaxIterations;
|
|
|
|
public:
|
|
ProofOfWork(const std::string& token, int iterations, const uint256& challenge, const uint256& target) :
|
|
mToken(token), mChallenge(challenge), mTarget(target), mIterations(iterations)
|
|
{ ; }
|
|
|
|
bool isValid() const;
|
|
|
|
uint256 solve(int maxIterations) const;
|
|
bool checkSolution(const uint256& solution) const;
|
|
|
|
// approximate number of hashes needed to solve
|
|
static uint64 getDifficulty(const uint256& target, int iterations);
|
|
uint64 getDifficulty() const { return getDifficulty(mTarget, mIterations); }
|
|
};
|
|
|
|
class ProofOfWorkGenerator
|
|
{
|
|
public:
|
|
typedef boost::bimap< boost::bimaps::multiset_of<time_t>, boost::bimaps::set_of<uint256> > powMap_t;
|
|
typedef powMap_t::value_type powMap_vt;
|
|
|
|
protected:
|
|
uint256 mSecret;
|
|
int mIterations;
|
|
uint256 mTarget;
|
|
time_t mLastDifficultyChange;
|
|
int mValidTime;
|
|
|
|
powMap_t mSolvedChallenges;
|
|
boost::mutex mLock;
|
|
|
|
public:
|
|
ProofOfWorkGenerator();
|
|
|
|
ProofOfWork getProof();
|
|
bool checkProof(const std::string& token, const uint256& solution);
|
|
|
|
void loadHigh();
|
|
void loadLow();
|
|
uint64 getDifficulty() { return ProofOfWork::getDifficulty(mTarget, mIterations); }
|
|
};
|
|
|
|
#endif
|
|
|
|
// vim:ts=4
|