Hush Full Node software. We were censored from Github, this is where all development happens now.
https://hush.is
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.
70 lines
1.9 KiB
70 lines
1.9 KiB
#include "cc/eval.h"
|
|
#include "crosschain.h"
|
|
#include "notarisationdb.h"
|
|
#include "notaries_staked.h"
|
|
|
|
int GetSymbolAuthority(const char* symbol)
|
|
{
|
|
if (strncmp(symbol, "TXSCL", 5) == 0)
|
|
return CROSSCHAIN_TXSCL;
|
|
if (is_STAKED(symbol) != 0) {
|
|
//printf("RETURNED CROSSCHAIN STAKED AS TRUE\n");
|
|
return CROSSCHAIN_STAKED;
|
|
}
|
|
//printf("RETURNED CROSSCHAIN KOMODO AS TRUE\n");
|
|
return CROSSCHAIN_KOMODO;
|
|
}
|
|
|
|
|
|
bool CheckTxAuthority(const CTransaction &tx, CrosschainAuthority auth)
|
|
{
|
|
EvalRef eval;
|
|
|
|
if (tx.vin.size() < auth.requiredSigs) return false;
|
|
|
|
uint8_t seen[64] = {0};
|
|
|
|
BOOST_FOREACH(const CTxIn &txIn, tx.vin)
|
|
{
|
|
// Get notary pubkey
|
|
CTransaction tx;
|
|
uint256 hashBlock;
|
|
if (!eval->GetTxUnconfirmed(txIn.prevout.hash, tx, hashBlock)) return false;
|
|
if (tx.vout.size() < txIn.prevout.n) return false;
|
|
CScript spk = tx.vout[txIn.prevout.n].scriptPubKey;
|
|
if (spk.size() != 35) return false;
|
|
const unsigned char *pk = &spk[0];
|
|
if (pk++[0] != 33) return false;
|
|
if (pk[33] != OP_CHECKSIG) return false;
|
|
|
|
// Check it's a notary
|
|
for (int i=0; i<auth.size; i++) {
|
|
if (!seen[i]) {
|
|
if (memcmp(pk, auth.notaries[i], 33) == 0) {
|
|
seen[i] = 1;
|
|
goto found;
|
|
} else {
|
|
//printf("notary.%i is not valid!\n",i);
|
|
}
|
|
}
|
|
}
|
|
|
|
return false;
|
|
found:;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
/*
|
|
const CrosschainAuthority auth_STAKED = [&](){
|
|
CrosschainAuthority auth;
|
|
auth.requiredSigs = (num_notaries_STAKED / 5);
|
|
auth.size = num_notaries_STAKED;
|
|
for (int n=0; n<auth.size; n++)
|
|
for (size_t i=0; i<33; i++)
|
|
sscanf(notaries_STAKED[n][1]+(i*2), "%2hhx", auth.notaries[n]+i);
|
|
return auth;
|
|
}();
|
|
*/
|
|
|