2014-12-09 02:17:57 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include "bignum.h"
|
|
|
|
#include "sync.h"
|
|
|
|
#include "net.h"
|
|
|
|
#include "key.h"
|
|
|
|
#include "util.h"
|
|
|
|
#include "script.h"
|
|
|
|
#include "base58.h"
|
|
|
|
#include "protocol.h"
|
|
|
|
#include "instantx.h"
|
|
|
|
#include "masternode.h"
|
|
|
|
#include "activemasternode.h"
|
|
|
|
#include "darksend.h"
|
|
|
|
#include <boost/lexical_cast.hpp>
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
using namespace boost;
|
2014-12-31 03:54:00 +01:00
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
std::map<uint256, CTransaction> mapTxLockReq;
|
|
|
|
std::map<uint256, CTransaction> mapTxLockReqRejected;
|
2015-02-01 16:53:49 +01:00
|
|
|
std::map<uint256, int> mapTxLockVote;
|
2014-12-09 02:17:57 +01:00
|
|
|
std::map<uint256, CTransactionLock> mapTxLocks;
|
2015-02-04 21:20:13 +01:00
|
|
|
std::map<COutPoint, uint256> mapLockedInputs;
|
2015-02-02 18:33:52 +01:00
|
|
|
std::map<uint256, int64_t> mapUnknownVotes; //track votes with no tx for DOS
|
2015-02-01 21:04:20 +01:00
|
|
|
int nCompleteTXLocks;
|
2014-12-09 02:17:57 +01:00
|
|
|
|
|
|
|
//txlock - Locks transaction
|
|
|
|
//
|
|
|
|
//step 1.) Broadcast intention to lock transaction inputs, "txlreg", CTransaction
|
|
|
|
//step 2.) Top 10 masternodes, open connect to top 1 masternode. Send "txvote", CTransaction, Signature, Approve
|
|
|
|
//step 3.) Top 1 masternode, waits for 10 messages. Upon success, sends "txlock'
|
|
|
|
|
|
|
|
void ProcessMessageInstantX(CNode* pfrom, std::string& strCommand, CDataStream& vRecv)
|
|
|
|
{
|
2015-01-18 16:28:16 +01:00
|
|
|
if(fLiteMode) return; //disable all darksend/masternode related functionality
|
2015-02-05 18:56:11 +01:00
|
|
|
if(fLargeWorkForkFound || fLargeWorkInvalidChainFound) return;
|
2014-12-09 02:17:57 +01:00
|
|
|
|
|
|
|
if (strCommand == "txlreq")
|
|
|
|
{
|
|
|
|
//LogPrintf("ProcessMessageInstantX::txlreq\n");
|
|
|
|
CDataStream vMsg(vRecv);
|
|
|
|
CTransaction tx;
|
|
|
|
vRecv >> tx;
|
|
|
|
|
|
|
|
CInv inv(MSG_TXLOCK_REQUEST, tx.GetHash());
|
|
|
|
pfrom->AddInventoryKnown(inv);
|
|
|
|
|
2015-02-02 15:36:00 +01:00
|
|
|
if(mapTxLockReq.count(tx.GetHash()) || mapTxLockReqRejected.count(tx.GetHash())){
|
2014-12-09 02:17:57 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2015-02-04 11:44:41 +01:00
|
|
|
if(!IsIXTXValid(tx)){
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
BOOST_FOREACH(const CTxOut o, tx.vout){
|
|
|
|
if(!o.scriptPubKey.IsNormalPaymentScript()){
|
2015-02-01 16:53:49 +01:00
|
|
|
printf ("ProcessMessageInstantX::txlreq - Invalid Script %s\n", tx.ToString().c_str());
|
2014-12-09 02:17:57 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-02-04 22:59:19 +01:00
|
|
|
int nBlockHeight = CreateNewLock(tx);
|
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
bool fMissingInputs = false;
|
|
|
|
CValidationState state;
|
2014-12-31 03:54:00 +01:00
|
|
|
|
2015-02-05 05:05:36 +01:00
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
if (AcceptToMemoryPool(mempool, state, tx, true, &fMissingInputs))
|
|
|
|
{
|
2015-02-02 15:36:00 +01:00
|
|
|
RelayTransactionLockReq(tx, tx.GetHash());
|
2015-02-04 22:59:19 +01:00
|
|
|
DoConsensusVote(tx, nBlockHeight);
|
2014-12-09 02:17:57 +01:00
|
|
|
|
2015-02-02 15:36:00 +01:00
|
|
|
mapTxLockReq.insert(make_pair(tx.GetHash(), tx));
|
2014-12-09 02:17:57 +01:00
|
|
|
|
|
|
|
LogPrintf("ProcessMessageInstantX::txlreq - Transaction Lock Request: %s %s : accepted %s\n",
|
|
|
|
pfrom->addr.ToString().c_str(), pfrom->cleanSubVer.c_str(),
|
|
|
|
tx.GetHash().ToString().c_str()
|
|
|
|
);
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
} else {
|
2015-02-03 18:17:30 +01:00
|
|
|
mapTxLockReqRejected.insert(make_pair(tx.GetHash(), tx));
|
2014-12-09 02:17:57 +01:00
|
|
|
|
|
|
|
// can we get the conflicting transaction as proof?
|
|
|
|
|
|
|
|
RelayTransactionLockReq(tx, inv.hash);
|
|
|
|
|
|
|
|
LogPrintf("ProcessMessageInstantX::txlreq - Transaction Lock Request: %s %s : rejected %s\n",
|
|
|
|
pfrom->addr.ToString().c_str(), pfrom->cleanSubVer.c_str(),
|
|
|
|
tx.GetHash().ToString().c_str()
|
|
|
|
);
|
|
|
|
|
2015-02-04 21:20:13 +01:00
|
|
|
BOOST_FOREACH(const CTxIn& in, tx.vin){
|
|
|
|
if(!mapLockedInputs.count(in.prevout)){
|
|
|
|
mapLockedInputs.insert(make_pair(in.prevout, tx.GetHash()));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-02-03 18:17:30 +01:00
|
|
|
// resolve conflicts
|
2015-02-03 23:40:00 +01:00
|
|
|
std::map<uint256, CTransactionLock>::iterator i = mapTxLocks.find(tx.GetHash());
|
2015-02-03 18:17:30 +01:00
|
|
|
if (i != mapTxLocks.end()){
|
2015-02-04 02:19:54 +01:00
|
|
|
//we only care if we have a complete tx lock
|
2015-02-03 18:17:30 +01:00
|
|
|
if((*i).second.CountSignatures() >= INSTANTX_SIGNATURES_REQUIRED){
|
2015-02-05 17:48:57 +01:00
|
|
|
if(!CheckForConflictingLocks(tx)){
|
|
|
|
LogPrintf("ProcessMessageInstantX::txlreq - Found Existing Complete IX Lock\n");
|
2015-02-03 18:17:30 +01:00
|
|
|
|
2015-02-05 17:48:57 +01:00
|
|
|
CValidationState state;
|
|
|
|
DisconnectBlockAndInputs(state, tx);
|
|
|
|
mapTxLockReq.insert(make_pair(tx.GetHash(), tx));
|
|
|
|
}
|
2015-02-03 18:17:30 +01:00
|
|
|
}
|
2015-02-03 23:40:00 +01:00
|
|
|
}
|
2015-02-03 18:17:30 +01:00
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
return;
|
|
|
|
}
|
2014-12-31 03:54:00 +01:00
|
|
|
}
|
2014-12-09 02:17:57 +01:00
|
|
|
else if (strCommand == "txlvote") //InstantX Lock Consensus Votes
|
|
|
|
{
|
|
|
|
CConsensusVote ctx;
|
|
|
|
vRecv >> ctx;
|
|
|
|
|
2015-02-01 16:53:49 +01:00
|
|
|
CInv inv(MSG_TXLOCK_VOTE, ctx.GetHash());
|
2014-12-09 02:17:57 +01:00
|
|
|
pfrom->AddInventoryKnown(inv);
|
|
|
|
|
2015-02-01 21:37:20 +01:00
|
|
|
if(mapTxLockVote.count(ctx.GetHash())){
|
2015-02-01 16:53:49 +01:00
|
|
|
return;
|
|
|
|
}
|
2014-12-09 02:17:57 +01:00
|
|
|
|
2015-02-01 21:37:20 +01:00
|
|
|
mapTxLockVote.insert(make_pair(ctx.GetHash(), 1));
|
2014-12-31 03:54:00 +01:00
|
|
|
|
2015-02-02 15:36:00 +01:00
|
|
|
if(ProcessConsensusVote(ctx)){
|
|
|
|
//Spam/Dos protection
|
2015-02-02 18:33:52 +01:00
|
|
|
/*
|
|
|
|
Masternodes will sometimes propagate votes before the transaction is known to the client.
|
|
|
|
This tracks those messages and allows it at the same rate of the rest of the network, if
|
|
|
|
a peer violates it, it will simply be ignored
|
|
|
|
*/
|
2015-02-02 15:36:00 +01:00
|
|
|
if(!mapTxLockReq.count(ctx.txHash) && !mapTxLockReqRejected.count(ctx.txHash)){
|
|
|
|
if(!mapUnknownVotes.count(ctx.vinMasternode.prevout.hash)){
|
|
|
|
mapUnknownVotes[ctx.vinMasternode.prevout.hash] = GetTime()+(60*10);
|
|
|
|
}
|
|
|
|
|
2015-02-02 18:33:52 +01:00
|
|
|
if(mapUnknownVotes[ctx.vinMasternode.prevout.hash] > GetTime() &&
|
|
|
|
mapUnknownVotes[ctx.vinMasternode.prevout.hash] - GetAverageVoteTime() > 60*10){
|
2015-02-04 15:44:23 +01:00
|
|
|
LogPrintf("ProcessMessageInstantX::txlreq - masternode is spamming transaction votes: %s %s\n",
|
2015-02-02 18:33:52 +01:00
|
|
|
ctx.vinMasternode.ToString().c_str(),
|
|
|
|
ctx.txHash.ToString().c_str()
|
|
|
|
);
|
|
|
|
return;
|
2015-02-02 15:36:00 +01:00
|
|
|
} else {
|
|
|
|
mapUnknownVotes[ctx.vinMasternode.prevout.hash] = GetTime()+(60*10);
|
|
|
|
}
|
|
|
|
}
|
2014-12-09 02:17:57 +01:00
|
|
|
|
2015-02-02 15:36:00 +01:00
|
|
|
LOCK(cs_vNodes);
|
|
|
|
BOOST_FOREACH(CNode* pnode, vNodes)
|
|
|
|
{
|
|
|
|
if(!pnode->fRelayTxes)
|
|
|
|
continue;
|
2015-02-02 13:01:06 +01:00
|
|
|
|
2015-02-02 15:36:00 +01:00
|
|
|
pnode->PushMessage("txlvote", ctx);
|
|
|
|
}
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
2015-02-01 21:37:20 +01:00
|
|
|
|
2015-02-01 16:53:49 +01:00
|
|
|
return;
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-02-04 11:44:41 +01:00
|
|
|
bool IsIXTXValid(const CTransaction& txCollateral){
|
|
|
|
if(txCollateral.vout.size() < 1) return false;
|
|
|
|
if(txCollateral.nLockTime != 0) return false;
|
|
|
|
|
|
|
|
int64_t nValueIn = 0;
|
|
|
|
int64_t nValueOut = 0;
|
|
|
|
bool missingTx = false;
|
|
|
|
|
|
|
|
BOOST_FOREACH(const CTxOut o, txCollateral.vout)
|
|
|
|
nValueOut += o.nValue;
|
|
|
|
|
|
|
|
BOOST_FOREACH(const CTxIn i, txCollateral.vin){
|
|
|
|
CTransaction tx2;
|
|
|
|
uint256 hash;
|
|
|
|
if(GetTransaction(i.prevout.hash, tx2, hash, true)){
|
|
|
|
if(tx2.vout.size() > i.prevout.n) {
|
|
|
|
nValueIn += tx2.vout[i.prevout.n].nValue;
|
|
|
|
}
|
|
|
|
} else{
|
|
|
|
missingTx = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if(missingTx){
|
|
|
|
if(fDebug) LogPrintf ("IsIXTXValid - Unknown inputs in IX transaction - %s\n", txCollateral.ToString().c_str());
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
//collateral transactions are required to pay out DARKSEND_COLLATERAL as a fee to the miners
|
|
|
|
if(nValueIn-nValueOut < COIN*0.01) {
|
|
|
|
if(fDebug) LogPrintf ("IsIXTXValid - did not include enough fees in transaction %d\n%s\n", nValueOut-nValueIn, txCollateral.ToString().c_str());
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2015-02-04 22:59:19 +01:00
|
|
|
int64_t CreateNewLock(CTransaction tx)
|
2014-12-09 02:17:57 +01:00
|
|
|
{
|
2015-02-04 22:59:19 +01:00
|
|
|
|
|
|
|
int64_t nTxAge = 0;
|
|
|
|
BOOST_REVERSE_FOREACH(CTxIn i, tx.vin){
|
|
|
|
nTxAge = GetInputAge(i);
|
|
|
|
if(nTxAge < 6)
|
|
|
|
{
|
2015-02-05 05:05:36 +01:00
|
|
|
LogPrintf("CreateNewLock - Transaction not found / too new: %d / %s\n", nTxAge, tx.GetHash().ToString().c_str());
|
2015-02-04 22:59:19 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
2014-12-09 02:17:57 +01:00
|
|
|
|
2015-02-04 22:09:50 +01:00
|
|
|
/*
|
2015-02-04 22:59:19 +01:00
|
|
|
Use a blockheight newer than the input.
|
|
|
|
This prevents attackers from using transaction mallibility to predict which masternodes
|
|
|
|
they'll use.
|
2015-02-04 22:09:50 +01:00
|
|
|
*/
|
2015-02-04 22:59:19 +01:00
|
|
|
int nBlockHeight = (chainActive.Tip()->nHeight - nTxAge)+4;
|
2015-02-04 22:09:50 +01:00
|
|
|
|
|
|
|
if (!mapTxLocks.count(tx.GetHash())){
|
2015-02-05 05:05:36 +01:00
|
|
|
LogPrintf("CreateNewLock - New Transaction Lock %s !\n", tx.GetHash().ToString().c_str());
|
2015-02-04 22:09:50 +01:00
|
|
|
|
|
|
|
CTransactionLock newLock;
|
|
|
|
newLock.nBlockHeight = nBlockHeight;
|
2015-02-06 01:49:55 +01:00
|
|
|
newLock.nExpiration = GetTime()+(60*60); //locks expire after 15 minutes (6 confirmations)
|
2015-02-05 16:52:02 +01:00
|
|
|
newLock.nTimeout = GetTime()+(60*5);
|
2015-02-04 22:09:50 +01:00
|
|
|
newLock.txHash = tx.GetHash();
|
|
|
|
mapTxLocks.insert(make_pair(tx.GetHash(), newLock));
|
|
|
|
} else {
|
|
|
|
mapTxLocks[tx.GetHash()].nBlockHeight = nBlockHeight;
|
2015-02-05 05:05:36 +01:00
|
|
|
if(fDebug) LogPrintf("CreateNewLock - Transaction Lock Exists %s !\n", tx.GetHash().ToString().c_str());
|
2015-02-04 22:09:50 +01:00
|
|
|
}
|
|
|
|
|
2015-02-04 22:59:19 +01:00
|
|
|
return nBlockHeight;
|
|
|
|
}
|
|
|
|
|
|
|
|
// check if we need to vote on this transaction
|
|
|
|
void DoConsensusVote(CTransaction& tx, int64_t nBlockHeight)
|
|
|
|
{
|
|
|
|
if(!fMasterNode) return;
|
|
|
|
|
2015-02-06 05:41:17 +01:00
|
|
|
int n = GetMasternodeRank(activeMasternode.vin, nBlockHeight, MIN_INSTANTX_PROTO_VERSION);
|
|
|
|
|
|
|
|
if(n == -1)
|
|
|
|
{
|
|
|
|
LogPrintf("InstantX::DoConsensusVote - Unknown Masternode\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(n > INSTANTX_SIGNATURES_TOTAL)
|
|
|
|
{
|
|
|
|
LogPrintf("InstantX::DoConsensusVote - Masternode not in the top %d (%d)\n", INSTANTX_SIGNATURES_TOTAL, n);
|
|
|
|
return;
|
|
|
|
}
|
2015-02-04 22:59:19 +01:00
|
|
|
/*
|
|
|
|
nBlockHeight calculated from the transaction is the authoritive source
|
|
|
|
*/
|
|
|
|
|
2015-02-06 05:41:17 +01:00
|
|
|
LogPrintf("InstantX::DoConsensusVote - In the top %d (%d)\n", INSTANTX_SIGNATURES_TOTAL, n);
|
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
CConsensusVote ctx;
|
2014-12-06 20:41:53 +01:00
|
|
|
ctx.vinMasternode = activeMasternode.vin;
|
2015-02-02 13:24:04 +01:00
|
|
|
ctx.txHash = tx.GetHash();
|
2014-12-31 03:54:00 +01:00
|
|
|
ctx.nBlockHeight = nBlockHeight;
|
2014-12-09 02:17:57 +01:00
|
|
|
if(!ctx.Sign()){
|
|
|
|
LogPrintf("InstantX::DoConsensusVote - Failed to sign consensus vote\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if(!ctx.SignatureValid()) {
|
|
|
|
LogPrintf("InstantX::DoConsensusVote - Signature invalid\n");
|
|
|
|
return;
|
|
|
|
}
|
2015-02-02 13:01:06 +01:00
|
|
|
|
2015-02-01 16:53:49 +01:00
|
|
|
LOCK(cs_vNodes);
|
|
|
|
BOOST_FOREACH(CNode* pnode, vNodes)
|
|
|
|
{
|
|
|
|
//LogPrintf("%s::check -- %s %s\n", vecMasternodes[winner].addr.ToString().c_str(), pnode->addr.ToString().c_str());
|
2014-12-31 03:54:00 +01:00
|
|
|
|
2015-02-01 16:53:49 +01:00
|
|
|
pnode->PushMessage("txlvote", ctx);
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//received a consensus vote
|
2015-02-02 15:36:00 +01:00
|
|
|
bool ProcessConsensusVote(CConsensusVote& ctx)
|
2014-12-09 02:17:57 +01:00
|
|
|
{
|
|
|
|
int n = GetMasternodeRank(ctx.vinMasternode, ctx.nBlockHeight, MIN_INSTANTX_PROTO_VERSION);
|
|
|
|
|
2014-12-31 03:54:00 +01:00
|
|
|
if(n == -1)
|
2014-12-09 02:17:57 +01:00
|
|
|
{
|
|
|
|
LogPrintf("InstantX::ProcessConsensusVote - Unknown Masternode\n");
|
2015-02-02 15:36:00 +01:00
|
|
|
return false;
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
|
|
|
|
2015-02-05 18:56:11 +01:00
|
|
|
if(n > INSTANTX_SIGNATURES_TOTAL)
|
2014-12-09 02:17:57 +01:00
|
|
|
{
|
2015-02-05 18:56:11 +01:00
|
|
|
LogPrintf("InstantX::ProcessConsensusVote - Masternode not in the top %d (%d)\n", INSTANTX_SIGNATURES_TOTAL, n);
|
2015-02-02 15:36:00 +01:00
|
|
|
return false;
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if(!ctx.SignatureValid()) {
|
|
|
|
LogPrintf("InstantX::ProcessConsensusVote - Signature invalid\n");
|
|
|
|
//don't ban, it could just be a non-synced masternode
|
2015-02-02 15:36:00 +01:00
|
|
|
return false;
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
|
|
|
|
2015-02-02 13:24:04 +01:00
|
|
|
if (!mapTxLocks.count(ctx.txHash)){
|
|
|
|
LogPrintf("InstantX::ProcessConsensusVote - New Transaction Lock %s !\n", ctx.txHash.ToString().c_str());
|
2015-02-01 21:04:20 +01:00
|
|
|
|
2015-02-01 16:53:49 +01:00
|
|
|
CTransactionLock newLock;
|
2015-02-04 22:09:50 +01:00
|
|
|
newLock.nBlockHeight = 0;
|
2015-02-01 21:04:20 +01:00
|
|
|
newLock.nExpiration = GetTime()+(60*60);
|
2015-02-05 16:52:02 +01:00
|
|
|
newLock.nTimeout = GetTime()+(60*5);
|
2015-02-02 13:24:04 +01:00
|
|
|
newLock.txHash = ctx.txHash;
|
|
|
|
mapTxLocks.insert(make_pair(ctx.txHash, newLock));
|
2015-02-01 21:04:20 +01:00
|
|
|
} else {
|
2015-02-03 23:40:00 +01:00
|
|
|
if(fDebug) LogPrintf("InstantX::ProcessConsensusVote - Transaction Lock Exists %s !\n", ctx.txHash.ToString().c_str());
|
2015-02-01 16:53:49 +01:00
|
|
|
}
|
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
//compile consessus vote
|
2015-02-02 13:24:04 +01:00
|
|
|
std::map<uint256, CTransactionLock>::iterator i = mapTxLocks.find(ctx.txHash);
|
2015-02-01 16:53:49 +01:00
|
|
|
if (i != mapTxLocks.end()){
|
|
|
|
(*i).second.AddSignature(ctx);
|
2015-02-03 23:40:00 +01:00
|
|
|
|
2015-02-05 19:29:13 +01:00
|
|
|
#ifdef ENABLE_WALLET
|
|
|
|
if(pwalletMain){
|
|
|
|
//when we get back signatures, we'll count them as requests. Otherwise the client will think it didn't propagate.
|
|
|
|
if(pwalletMain->mapRequestCount.count(ctx.txHash))
|
|
|
|
pwalletMain->mapRequestCount[ctx.txHash]++;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2015-02-03 23:40:00 +01:00
|
|
|
if(fDebug) LogPrintf("InstantX::ProcessConsensusVote - Transaction Lock Votes %d - %s !\n", (*i).second.CountSignatures(), ctx.GetHash().ToString().c_str());
|
|
|
|
|
2015-02-01 16:53:49 +01:00
|
|
|
if((*i).second.CountSignatures() >= INSTANTX_SIGNATURES_REQUIRED){
|
2015-02-03 23:40:00 +01:00
|
|
|
if(fDebug) LogPrintf("InstantX::ProcessConsensusVote - Transaction Lock Is Complete %s !\n", (*i).second.GetHash().ToString().c_str());
|
2015-02-03 18:17:30 +01:00
|
|
|
|
2015-02-05 17:48:57 +01:00
|
|
|
CTransaction& tx = mapTxLockReq[ctx.txHash];
|
|
|
|
if(!CheckForConflictingLocks(tx)){
|
|
|
|
|
2015-02-04 22:19:18 +01:00
|
|
|
#ifdef ENABLE_WALLET
|
2015-02-05 17:48:57 +01:00
|
|
|
if(pwalletMain){
|
|
|
|
if(pwalletMain->UpdatedTransaction((*i).second.txHash)){
|
|
|
|
nCompleteTXLocks++;
|
|
|
|
}
|
2015-02-04 22:19:18 +01:00
|
|
|
}
|
|
|
|
#endif
|
2015-02-03 18:17:30 +01:00
|
|
|
|
2015-02-05 17:48:57 +01:00
|
|
|
if(mapTxLockReq.count(ctx.txHash)){
|
|
|
|
BOOST_FOREACH(const CTxIn& in, tx.vin){
|
|
|
|
if(!mapLockedInputs.count(in.prevout)){
|
|
|
|
mapLockedInputs.insert(make_pair(in.prevout, ctx.txHash));
|
|
|
|
}
|
2015-02-04 21:20:13 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-02-05 17:48:57 +01:00
|
|
|
// resolve conflicts
|
2015-02-04 02:19:54 +01:00
|
|
|
|
2015-02-05 17:48:57 +01:00
|
|
|
//if this tx lock was rejected, we need to remove the conflicting blocks
|
|
|
|
if(mapTxLockReqRejected.count((*i).second.txHash)){
|
|
|
|
CValidationState state;
|
|
|
|
DisconnectBlockAndInputs(state, mapTxLockReqRejected[(*i).second.txHash]);
|
|
|
|
}
|
2015-02-03 23:40:00 +01:00
|
|
|
}
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
2015-02-02 15:36:00 +01:00
|
|
|
return true;
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
|
|
|
|
2015-02-01 16:53:49 +01:00
|
|
|
|
2015-02-02 15:36:00 +01:00
|
|
|
return false;
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
|
|
|
|
2015-02-05 17:48:57 +01:00
|
|
|
bool CheckForConflictingLocks(CTransaction& tx)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
It's possible (very unlikely though) to get 2 conflicting transaction locks approved by the network.
|
|
|
|
In that case, they will cancel each other out.
|
|
|
|
|
|
|
|
Blocks could have been rejected during this time, which is OK. After they cancel out, the client will
|
|
|
|
rescan the blocks and find they're acceptable and then take the chain with the most work.
|
|
|
|
*/
|
|
|
|
BOOST_FOREACH(const CTxIn& in, tx.vin){
|
|
|
|
if(mapLockedInputs.count(in.prevout)){
|
|
|
|
if(mapLockedInputs[in.prevout] != tx.GetHash()){
|
|
|
|
LogPrintf("InstantX::CheckForConflictingLocks - found two complete conflicting locks - removing both. %s %s", tx.GetHash().ToString().c_str(), mapLockedInputs[in.prevout].ToString().c_str());
|
|
|
|
if(mapTxLocks.count(tx.GetHash())) mapTxLocks[tx.GetHash()].nExpiration = GetTime();
|
|
|
|
if(mapTxLocks.count(mapLockedInputs[in.prevout])) mapTxLocks[mapLockedInputs[in.prevout]].nExpiration = GetTime();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
2015-02-02 18:33:52 +01:00
|
|
|
|
|
|
|
int64_t GetAverageVoteTime()
|
|
|
|
{
|
|
|
|
std::map<uint256, int64_t>::iterator it = mapUnknownVotes.begin();
|
|
|
|
int64_t total = 0;
|
|
|
|
int64_t count = 0;
|
|
|
|
|
|
|
|
while(it != mapUnknownVotes.end()) {
|
|
|
|
total+= it->second;
|
|
|
|
count++;
|
|
|
|
it++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return total / count;
|
|
|
|
}
|
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
void CleanTransactionLocksList()
|
|
|
|
{
|
|
|
|
if(chainActive.Tip() == NULL) return;
|
|
|
|
|
|
|
|
std::map<uint256, CTransactionLock>::iterator it = mapTxLocks.begin();
|
2014-12-31 03:54:00 +01:00
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
while(it != mapTxLocks.end()) {
|
2015-02-01 21:04:20 +01:00
|
|
|
if(GetTime() > it->second.nExpiration){ //keep them for an hour
|
2015-02-02 13:24:04 +01:00
|
|
|
LogPrintf("Removing old transaction lock %s\n", it->second.txHash.ToString().c_str());
|
2015-02-04 21:20:13 +01:00
|
|
|
|
|
|
|
if(mapTxLockReq.count(it->second.txHash)){
|
|
|
|
CTransaction& tx = mapTxLockReq[it->second.txHash];
|
2015-02-04 21:25:12 +01:00
|
|
|
|
2015-02-04 21:20:13 +01:00
|
|
|
BOOST_FOREACH(const CTxIn& in, tx.vin)
|
|
|
|
mapLockedInputs.erase(in.prevout);
|
|
|
|
|
|
|
|
mapTxLockReq.erase(it->second.txHash);
|
|
|
|
mapTxLockReqRejected.erase(it->second.txHash);
|
|
|
|
}
|
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
mapTxLocks.erase(it++);
|
|
|
|
} else {
|
|
|
|
it++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2015-02-01 16:53:49 +01:00
|
|
|
uint256 CConsensusVote::GetHash() const
|
|
|
|
{
|
2015-02-02 13:24:04 +01:00
|
|
|
return vinMasternode.prevout.hash + txHash;
|
2015-02-01 16:53:49 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
bool CConsensusVote::SignatureValid()
|
|
|
|
{
|
|
|
|
std::string errorMessage;
|
2015-02-02 15:36:00 +01:00
|
|
|
std::string strMessage = txHash.ToString().c_str() + boost::lexical_cast<std::string>(nBlockHeight);
|
2015-02-01 16:53:49 +01:00
|
|
|
//LogPrintf("verify strMessage %s \n", strMessage.c_str());
|
2014-12-31 03:54:00 +01:00
|
|
|
|
2014-12-09 02:17:57 +01:00
|
|
|
int n = GetMasternodeByVin(vinMasternode);
|
|
|
|
|
2014-12-31 03:54:00 +01:00
|
|
|
if(n == -1)
|
2014-12-09 02:17:57 +01:00
|
|
|
{
|
|
|
|
LogPrintf("InstantX::CConsensusVote::SignatureValid() - Unknown Masternode\n");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2015-02-01 16:53:49 +01:00
|
|
|
//LogPrintf("verify addr %s \n", vecMasternodes[0].addr.ToString().c_str());
|
|
|
|
//LogPrintf("verify addr %s \n", vecMasternodes[1].addr.ToString().c_str());
|
|
|
|
//LogPrintf("verify addr %d %s \n", n, vecMasternodes[n].addr.ToString().c_str());
|
2014-12-09 02:17:57 +01:00
|
|
|
|
|
|
|
CScript pubkey;
|
2014-12-31 03:54:00 +01:00
|
|
|
pubkey.SetDestination(vecMasternodes[n].pubkey2.GetID());
|
2014-12-09 02:17:57 +01:00
|
|
|
CTxDestination address1;
|
|
|
|
ExtractDestination(pubkey, address1);
|
|
|
|
CBitcoinAddress address2(address1);
|
2015-02-01 16:53:49 +01:00
|
|
|
//LogPrintf("verify pubkey2 %s \n", address2.ToString().c_str());
|
2014-12-09 02:17:57 +01:00
|
|
|
|
2014-12-31 03:54:00 +01:00
|
|
|
if(!darkSendSigner.VerifyMessage(vecMasternodes[n].pubkey2, vchMasterNodeSignature, strMessage, errorMessage)) {
|
2014-12-09 02:17:57 +01:00
|
|
|
LogPrintf("InstantX::CConsensusVote::SignatureValid() - Verify message failed\n");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool CConsensusVote::Sign()
|
|
|
|
{
|
|
|
|
std::string errorMessage;
|
|
|
|
|
|
|
|
CKey key2;
|
|
|
|
CPubKey pubkey2;
|
2015-02-02 15:36:00 +01:00
|
|
|
std::string strMessage = txHash.ToString().c_str() + boost::lexical_cast<std::string>(nBlockHeight);
|
2015-02-01 16:53:49 +01:00
|
|
|
//LogPrintf("signing strMessage %s \n", strMessage.c_str());
|
|
|
|
//LogPrintf("signing privkey %s \n", strMasterNodePrivKey.c_str());
|
2014-12-09 02:17:57 +01:00
|
|
|
|
|
|
|
if(!darkSendSigner.SetKey(strMasterNodePrivKey, errorMessage, key2, pubkey2))
|
|
|
|
{
|
2015-01-18 16:28:16 +01:00
|
|
|
LogPrintf("CActiveMasternode::RegisterAsMasterNode() - ERROR: Invalid masternodeprivkey: '%s'\n", errorMessage.c_str());
|
|
|
|
return false;
|
2014-12-09 02:17:57 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
CScript pubkey;
|
|
|
|
pubkey.SetDestination(pubkey2.GetID());
|
|
|
|
CTxDestination address1;
|
|
|
|
ExtractDestination(pubkey, address1);
|
|
|
|
CBitcoinAddress address2(address1);
|
2015-02-01 16:53:49 +01:00
|
|
|
//LogPrintf("signing pubkey2 %s \n", address2.ToString().c_str());
|
2014-12-09 02:17:57 +01:00
|
|
|
|
|
|
|
if(!darkSendSigner.SignMessage(strMessage, errorMessage, vchMasterNodeSignature, key2)) {
|
|
|
|
LogPrintf("CActiveMasternode::RegisterAsMasterNode() - Sign message failed");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(!darkSendSigner.VerifyMessage(pubkey2, vchMasterNodeSignature, strMessage, errorMessage)) {
|
|
|
|
LogPrintf("CActiveMasternode::RegisterAsMasterNode() - Verify message failed");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool CTransactionLock::SignaturesValid()
|
|
|
|
{
|
|
|
|
|
|
|
|
BOOST_FOREACH(CConsensusVote vote, vecConsensusVotes)
|
|
|
|
{
|
|
|
|
int n = GetMasternodeRank(vote.vinMasternode, vote.nBlockHeight, MIN_INSTANTX_PROTO_VERSION);
|
|
|
|
|
2014-12-31 03:54:00 +01:00
|
|
|
if(n == -1)
|
2014-12-09 02:17:57 +01:00
|
|
|
{
|
|
|
|
LogPrintf("InstantX::DoConsensusVote - Unknown Masternode\n");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2015-02-05 18:56:11 +01:00
|
|
|
if(n > INSTANTX_SIGNATURES_TOTAL)
|
2014-12-09 02:17:57 +01:00
|
|
|
{
|
2015-02-05 18:56:11 +01:00
|
|
|
LogPrintf("InstantX::DoConsensusVote - Masternode not in the top %s\n", INSTANTX_SIGNATURES_TOTAL);
|
2014-12-09 02:17:57 +01:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(!vote.SignatureValid()){
|
|
|
|
LogPrintf("InstantX::CTransactionLock::SignaturesValid - Signature not valid\n");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void CTransactionLock::AddSignature(CConsensusVote cv)
|
|
|
|
{
|
|
|
|
vecConsensusVotes.push_back(cv);
|
|
|
|
}
|
|
|
|
|
|
|
|
int CTransactionLock::CountSignatures()
|
|
|
|
{
|
2015-02-04 22:09:50 +01:00
|
|
|
/*
|
|
|
|
Only count signatures where the BlockHeight matches the transaction's blockheight.
|
|
|
|
The votes have no proof it's the correct blockheight
|
|
|
|
*/
|
|
|
|
|
2015-02-05 05:05:36 +01:00
|
|
|
if(nBlockHeight == 0) return -1;
|
2015-02-04 22:09:50 +01:00
|
|
|
|
|
|
|
int n = 0;
|
|
|
|
BOOST_FOREACH(CConsensusVote v, vecConsensusVotes){
|
|
|
|
if(v.nBlockHeight == nBlockHeight){
|
|
|
|
n++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return n;
|
2014-12-06 20:41:53 +01:00
|
|
|
}
|