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.
811 lines
34 KiB
811 lines
34 KiB
/******************************************************************************
|
|
* Copyright © 2018-2020 The Hush Developers *
|
|
* Copyright © 2014-2018 The SuperNET Developers. *
|
|
* *
|
|
* See the AUTHORS, DEVELOPER-AGREEMENT and LICENSE files at *
|
|
* the top-level directory of this distribution for the individual copyright *
|
|
* holder information and the developer policies on copyright and licensing. *
|
|
* *
|
|
* Unless otherwise agreed in a custom licensing agreement, no part of the *
|
|
* Hush software, including this file may be copied, modified, propagated *
|
|
* or distributed except according to the terms contained in the LICENSE file *
|
|
* *
|
|
* Removal or modification of this copyright notice is prohibited. *
|
|
* *
|
|
******************************************************************************/
|
|
|
|
#include "dragon.h"
|
|
|
|
#define dragon_blockfind(str,coin,hash2) dragon_blockhashset(str,coin,-1,hash2,0)
|
|
|
|
int32_t dragon_blockconv(uint8_t zcash,uint8_t auxpow,struct dragon_zblock *zdest,struct dragon_msgzblock *zmsg,bits256 hash2,int32_t height) //uint32_t numtxids,uint32_t numunspents,uint32_t numspends,double PoW)
|
|
{
|
|
int32_t i; struct dragon_block *dest = (void *)zdest; struct dragon_msgblock *msg = (void *)zmsg;
|
|
if ( zcash == 0 )
|
|
{
|
|
memset(dest,0,sizeof(*dest));
|
|
dest->RO.version = msg->H.version;
|
|
dest->RO.prev_block = msg->H.prev_block;
|
|
dest->RO.merkle_root = msg->H.merkle_root;
|
|
dest->RO.timestamp = msg->H.timestamp;
|
|
dest->RO.bits = msg->H.bits;
|
|
dest->RO.txn_count = msg->txn_count;
|
|
dest->height = height;
|
|
dest->RO.hash2 = hash2;
|
|
dest->RO.nonce = msg->H.nonce;
|
|
return(msg->txn_count);
|
|
}
|
|
else
|
|
{
|
|
zdest->RO.allocsize = (int32_t)sizeof(struct dragon_zblock);
|
|
zdest->RO.txn_count = zmsg->txn_count;
|
|
zdest->RO.hash2 = hash2;
|
|
zdest->height = height;
|
|
zdest->RO.version = zmsg->zH.version;
|
|
zdest->RO.prev_block = zmsg->zH.prev_block;
|
|
zdest->RO.merkle_root = zmsg->zH.merkle_root;
|
|
zdest->RO.timestamp = zmsg->zH.timestamp;
|
|
zdest->RO.bits = zmsg->zH.bits;
|
|
zdest->zRO.bignonce = zmsg->zH.bignonce;
|
|
if ( dragon_rwvarint32(0,zmsg->zH.var_numelements,&zdest->zRO.numelements) != sizeof(zmsg->zH.var_numelements) )
|
|
printf("unexpected varint size for zmsg.zH.numelements <- %d\n",zdest->zRO.numelements);
|
|
for (i=0; i<ZCASH_SOLUTION_ELEMENTS; i++)
|
|
zdest->zRO.solution[i] = zmsg->zH.solution[i];
|
|
return(zmsg->txn_count);
|
|
}
|
|
}
|
|
|
|
void dragon_blockunconv(uint8_t zcash,uint8_t auxpow,struct dragon_msgzblock *zmsg,struct dragon_zblock *zsrc,int32_t cleartxn_count)
|
|
{
|
|
int32_t i; struct dragon_msgblock *msg = (void *)zmsg; struct dragon_block *src = (void *)zsrc;
|
|
if ( zcash != 0 )
|
|
{
|
|
memset(zmsg,0,sizeof(*zmsg));
|
|
zmsg->zH.version = zsrc->RO.version;
|
|
zmsg->zH.prev_block = zsrc->RO.prev_block;
|
|
zmsg->zH.merkle_root = zsrc->RO.merkle_root;
|
|
zmsg->zH.timestamp = zsrc->RO.timestamp;
|
|
zmsg->zH.bits = zsrc->RO.bits;
|
|
zmsg->zH.bignonce = zsrc->zRO.bignonce;
|
|
if ( dragon_rwvarint32(1,zmsg->zH.var_numelements,&zsrc->zRO.numelements) != sizeof(zmsg->zH.var_numelements) )
|
|
printf("unexpected varint size for zmsg.zH.numelements <- %d\n",zsrc->zRO.numelements);
|
|
for (i=0; i<zsrc->zRO.numelements; i++)
|
|
zmsg->zH.solution[i] = zsrc->zRO.solution[i];
|
|
if ( cleartxn_count == 0 )
|
|
zmsg->txn_count = zsrc->RO.txn_count;
|
|
}
|
|
else
|
|
{
|
|
memset(msg,0,sizeof(*msg));
|
|
msg->H.version = src->RO.version;
|
|
msg->H.prev_block = src->RO.prev_block;
|
|
msg->H.merkle_root = src->RO.merkle_root;
|
|
msg->H.timestamp = src->RO.timestamp;
|
|
msg->H.bits = src->RO.bits;
|
|
msg->H.nonce = src->RO.nonce;
|
|
if ( cleartxn_count == 0 )
|
|
msg->txn_count = src->RO.txn_count;
|
|
}
|
|
}
|
|
|
|
void dragon_blockcopy(uint8_t zcash,uint8_t auxpow,struct dragon_info *coin,struct dragon_block *block,struct dragon_block *origblock)
|
|
{
|
|
int32_t i;
|
|
block->RO.hash2 = origblock->RO.hash2;
|
|
block->RO.merkle_root = origblock->RO.merkle_root;
|
|
if ( bits256_nonz(block->RO.prev_block) == 0 )
|
|
block->RO.prev_block = origblock->RO.prev_block;
|
|
if ( block->mainchain == 0 )
|
|
block->mainchain = origblock->mainchain;
|
|
if ( block->fpos < 0 )
|
|
block->fpos = origblock->fpos;
|
|
if ( block->fpipbits == 0 )
|
|
block->fpipbits = origblock->fpipbits;
|
|
if ( block->RO.timestamp == 0 )
|
|
block->RO.timestamp = origblock->RO.timestamp;
|
|
if ( block->RO.bits == 0 )
|
|
block->RO.bits = origblock->RO.bits;
|
|
if ( block->RO.txn_count == 0 )
|
|
block->RO.txn_count = origblock->RO.txn_count;
|
|
if ( block->RO.version == 0 )
|
|
block->RO.version = origblock->RO.version;
|
|
if ( block->mainchain == 0 )
|
|
block->mainchain = origblock->mainchain;
|
|
if ( block->valid == 0 )
|
|
block->valid = origblock->valid;
|
|
if ( block->RO.recvlen == 0 )
|
|
block->RO.recvlen = origblock->RO.recvlen;
|
|
if ( zcash == 0 )
|
|
{
|
|
if ( block->RO.nonce == 0 )
|
|
block->RO.nonce = origblock->RO.nonce;
|
|
}
|
|
else
|
|
{
|
|
dragon_blocksizecheck("blockcopy dest",coin->chain->zcash,block);
|
|
dragon_blocksizecheck("blockcopy src",coin->chain->zcash,origblock);
|
|
if ( block->RO.allocsize != origblock->RO.allocsize )
|
|
printf("missing space for zcash block.%d origblock.%d\n",block->RO.allocsize,origblock->RO.allocsize);
|
|
//else
|
|
{
|
|
struct dragon_zblock *zblock = (void *)block;
|
|
struct dragon_zblock *origzblock = (void *)origblock;
|
|
zblock->zRO.bignonce = origzblock->zRO.bignonce;
|
|
zblock->zRO.numelements = origzblock->zRO.numelements;
|
|
for (i=0; i<ZCASH_SOLUTION_ELEMENTS; i++)
|
|
zblock->zRO.solution[i] = origzblock->zRO.solution[i];
|
|
}
|
|
}
|
|
}
|
|
|
|
/*bits256 dragon_merkle(bits256 *tree,int32_t txn_count)
|
|
{
|
|
int32_t i,n=0,prev; uint8_t serialized[sizeof(bits256) * 2];
|
|
if ( txn_count == 1 )
|
|
return(tree[0]);
|
|
prev = 0;
|
|
while ( txn_count > 1 )
|
|
{
|
|
if ( (txn_count & 1) != 0 )
|
|
tree[prev + txn_count] = tree[prev + txn_count-1], txn_count++;
|
|
n += txn_count;
|
|
for (i=0; i<txn_count; i+=2)
|
|
{
|
|
dragon_rwbignum(1,serialized,sizeof(*tree),tree[prev + i].bytes);
|
|
dragon_rwbignum(1,&serialized[sizeof(*tree)],sizeof(*tree),tree[prev + i + 1].bytes);
|
|
tree[n + (i >> 1)] = bits256_doublesha256(0,serialized,sizeof(serialized));
|
|
}
|
|
prev = n;
|
|
txn_count >>= 1;
|
|
}
|
|
return(tree[n]);
|
|
}*/
|
|
|
|
struct dragon_block *dragon_prevblock(struct dragon_info *coin,struct dragon_block *block,int32_t PoSflag)
|
|
{
|
|
int32_t hdrsi,bundlei,height; struct dragon_bundle *bp;
|
|
if ( (height= block->height - 1) < 0 )
|
|
return(0);
|
|
hdrsi = (height / coin->chain->bundlesize);
|
|
bundlei = (height % coin->chain->bundlesize);
|
|
if ( hdrsi < coin->bundlescount && (bp= coin->bundles[hdrsi]) != 0 )
|
|
return(bp->blocks[bundlei]);
|
|
else return(0);
|
|
}
|
|
|
|
void _dragon_blocklink(struct dragon_info *coin,struct dragon_block *prev,struct dragon_block *block)
|
|
{
|
|
char str[65],str2[65]; struct dragon_block *next;
|
|
if ( memcmp(block->RO.prev_block.bytes,prev->RO.hash2.bytes,sizeof(bits256)) != 0 )
|
|
{
|
|
printf("illegal blocklink mismatched hashes\n");
|
|
dragon_exit(0,0);
|
|
return;
|
|
}
|
|
block->hh.prev = prev;
|
|
if ( (next= prev->hh.next) != 0 )
|
|
{
|
|
if ( next != block )
|
|
{
|
|
if ( memcmp(next->RO.prev_block.bytes,prev->RO.hash2.bytes,sizeof(bits256)) != 0 )
|
|
{
|
|
printf("illegal blocklink next mismatched hashes\n");
|
|
return;
|
|
}
|
|
if ( memcmp(next->RO.hash2.bytes,block->RO.hash2.bytes,sizeof(bits256)) != 0 )
|
|
printf("blocklink collision: %s vs %s\n",bits256_str(str,block->RO.hash2),bits256_str(str2,next->RO.hash2));
|
|
else printf("blocklink corruption: identical hashes with diff ptrs %s %p %p\n",bits256_str(str,block->RO.hash2),block,next);
|
|
}
|
|
prev->hh.next = block; // could make a linked list of all at same height for multibranch
|
|
} else prev->hh.next = block;
|
|
printf("link.(%s) -> (%s)\n",bits256_str(str,prev->RO.hash2),bits256_str(str,block->RO.hash2));
|
|
}
|
|
|
|
struct dragon_block *dragon_blockhashset(char *debugstr,struct dragon_info *coin,int32_t height,bits256 hash2,int32_t createflag)
|
|
{
|
|
struct dragon_block *block,*prev; int32_t size;
|
|
#ifndef __APPLE__
|
|
#endif
|
|
portable_mutex_lock(&coin->blocks_mutex);
|
|
coin->blockdepth++;
|
|
HASH_FIND(hh,coin->blocks.hash,&hash2,sizeof(hash2),block);
|
|
if ( block != 0 )
|
|
{
|
|
if ( coin->blockdepth > 0 )
|
|
coin->blockdepth--;
|
|
portable_mutex_unlock(&coin->blocks_mutex);
|
|
return(block);
|
|
}
|
|
if ( createflag > 0 )
|
|
{
|
|
size = (int32_t)((coin->chain->zcash != 0) ? sizeof(struct dragon_zblock) : sizeof(struct dragon_block));
|
|
block = calloc(1,size);
|
|
block->RO.hash2 = hash2;
|
|
block->RO.allocsize = size;
|
|
dragon_blocksizecheck("blockhashset",coin->chain->zcash,block);
|
|
block->hh.itemind = height, block->height = -1;
|
|
HASH_ADD(hh,coin->blocks.hash,RO.hash2,sizeof(hash2),block);
|
|
block->hh.next = block->hh.prev = 0;
|
|
if ( bits256_nonz(block->RO.prev_block) > 0 )
|
|
{
|
|
HASH_FIND(hh,coin->blocks.hash,&block->RO.prev_block,sizeof(block->RO.prev_block),prev);
|
|
if ( prev != 0 )
|
|
_dragon_blocklink(coin,prev,block);
|
|
}
|
|
//char str[65];
|
|
if ( coin->virtualchain != 0 )
|
|
{
|
|
//printf("%s added.(%s) height.%d (%p %p)\n",coin->symbol,bits256_str(str,hash2),height,block->hh.prev,block->hh.next);
|
|
struct dragon_block *tmp;
|
|
HASH_FIND(hh,coin->blocks.hash,&hash2,sizeof(hash2),tmp);
|
|
char str[65];
|
|
bits256_str(str,hash2);
|
|
if ( tmp != block )
|
|
printf("%s height.%d search error %p != %p\n",str,height,block,tmp);
|
|
}
|
|
}
|
|
if ( coin->blockdepth > 0 )
|
|
coin->blockdepth--;
|
|
portable_mutex_unlock(&coin->blocks_mutex);
|
|
/* while ( coin->blockdepth > 0 )
|
|
{
|
|
usleep(100000);
|
|
if ( coin->blockdepth > 0 )
|
|
printf("C %s >>>>>>>>>> OK only if rare %s create blockhashset.%d depth.%d\n",coin->symbol,debugstr,height,coin->blockdepth);
|
|
//fprintf(stderr,">>>>>>>>>> OK only if rare%s create blockhashset.%d depth.%d\n",debugstr,height,depth);
|
|
//printf("%d\n",1/(1 - depth/depth));
|
|
}*/
|
|
return(block);
|
|
}
|
|
|
|
bits256 *dragon_blockhashptr(struct dragon_info *coin,int32_t height)
|
|
{
|
|
int32_t hdrsi,bundlei,bundlesize; struct dragon_bundle *bp; //bits256 *hashptr;
|
|
if ( height >= 0 && (bundlesize= coin->chain->bundlesize) != 0 )
|
|
{
|
|
hdrsi = (height / bundlesize);
|
|
bundlei = height - (hdrsi * bundlesize);
|
|
if ( hdrsi >= 0 && hdrsi < coin->bundlescount && bundlei >= 0 && bundlei < bundlesize )
|
|
{
|
|
if ( (bp= coin->bundles[hdrsi]) != 0 )
|
|
return(&bp->hashes[bundlei]);
|
|
else return(0);
|
|
}
|
|
}
|
|
return(0);
|
|
}
|
|
|
|
bits256 dragon_blockhash(struct dragon_info *coin,int32_t height)
|
|
{
|
|
bits256 *hash2p; static const bits256 zero;
|
|
if ( (hash2p= dragon_blockhashptr(coin,height)) != 0 )
|
|
return(*hash2p);
|
|
return(zero);
|
|
}
|
|
|
|
struct dragon_block *dragon_blockptr(char *debugstr,struct dragon_info *coin,int32_t height)
|
|
{
|
|
static const bits256 zero; bits256 hash2 = dragon_blockhash(coin,height);
|
|
if ( memcmp(zero.bytes,hash2.bytes,sizeof(zero)) != 0 )
|
|
return(dragon_blockfind(debugstr,coin,hash2));
|
|
return(0);
|
|
}
|
|
|
|
int32_t dragon_blocksizecheck(char *debugstr,uint8_t zcash,struct dragon_block *block)
|
|
{
|
|
int32_t bsize = zcash != 0 ? sizeof(struct dragon_zblock) : sizeof(struct dragon_block);
|
|
if ( block->RO.allocsize != bsize )
|
|
{
|
|
if ( block->RO.allocsize == 0 || block->RO.allocsize < bsize )
|
|
{
|
|
//printf("%s block validate warning: mismatched size %d vs %d\n",debugstr,block->RO.allocsize,bsize);
|
|
block->RO.allocsize = bsize;
|
|
} else return(-1);
|
|
return(bsize);
|
|
}
|
|
return(0);
|
|
}
|
|
|
|
int32_t dragon_blockROsize(uint8_t zcash)
|
|
{
|
|
return((int32_t)(sizeof(struct dragon_blockRO) + zcash*sizeof(struct dragon_msgzblockhdr)));
|
|
}
|
|
|
|
void *dragon_blockzcopyRO(uint8_t zcash,struct dragon_blockRO *dest,int32_t desti,struct dragon_blockRO *src,int32_t srci)
|
|
{
|
|
int32_t bROsize = dragon_blockROsize(zcash);
|
|
/**
|
|
* The memory address calculation was done in a non-portable way using
|
|
* long value which has 4 bytes in 64bit windows (causing invalide memory address)
|
|
* due to data truncation,
|
|
* the solution is to use portable way to calculate the address
|
|
* in all platform sizeof(char) / sizeof(uchar) == 1
|
|
* @author - fadedreamz@gmail.com
|
|
*/
|
|
#if defined(_M_X64)
|
|
dest = (void *)((unsigned char *)dest + desti*bROsize);
|
|
src = (void *)((unsigned char *)src + srci*bROsize);
|
|
#else
|
|
dest = (void *)((long)dest + desti*bROsize);
|
|
src = (void *)((long)src + srci*bROsize);
|
|
#endif
|
|
memcpy(dest,src,bROsize);
|
|
return(src);
|
|
}
|
|
|
|
void dragon_blockzcopy(uint8_t zcash,struct dragon_block *dest,struct dragon_block *src)
|
|
{
|
|
dragon_blocksizecheck("blockcopy dest",zcash,dest);
|
|
dragon_blocksizecheck("blockcopy src",zcash,src);
|
|
if ( zcash == 0 )
|
|
*dest = *src;
|
|
else
|
|
{
|
|
if ( src->RO.allocsize != sizeof(struct dragon_zblock) )
|
|
printf("warning: dragon_blockcopy src size %d vs %d\n",src->RO.allocsize,(int32_t)sizeof(struct dragon_zblock));
|
|
*(struct dragon_zblock *)dest = *(struct dragon_zblock *)src;
|
|
dest->RO.allocsize = sizeof(struct dragon_zblock);
|
|
}
|
|
}
|
|
|
|
int32_t dragon_blockvalidate(struct supernet_info *myinfo,struct dragon_info *coin,int32_t *validp,struct dragon_block *block,int32_t dispflag)
|
|
{
|
|
bits256 hash2; int32_t len; uint8_t serialized[sizeof(struct dragon_msgblock) + 32768];
|
|
if ( coin->chain->debug != 0 || coin->chain->zcash != 0 )
|
|
{
|
|
*validp = 1;
|
|
return(0);
|
|
}
|
|
*validp = 0;
|
|
if ( (len= dragon_serialize_block(myinfo,coin->chain,&hash2,serialized,block)) < 0 )
|
|
return(-1);
|
|
*validp = (memcmp(hash2.bytes,block->RO.hash2.bytes,sizeof(hash2)) == 0);
|
|
block->valid = *validp;
|
|
dragon_blocksizecheck("blockvalidate",coin->chain->zcash,block);
|
|
char str[65]; char str2[65];
|
|
if ( *validp == 0 )
|
|
{
|
|
if ( dispflag != 0 )
|
|
{
|
|
static uint32_t counter;
|
|
//for (i=0; i<len; i++)
|
|
// printf("%02x",serialized[i]);
|
|
if ( (counter++ % 100) == 99 )
|
|
printf(" dragon_blockvalidate.%d: %s miscompare.%d (%s) vs (%s)\n",block->height,coin->symbol,counter,bits256_str(str,hash2),bits256_str(str2,block->RO.hash2));
|
|
//getchar();
|
|
}
|
|
return(-1);
|
|
}
|
|
return(0);
|
|
}
|
|
|
|
/*void dragon_mergeprevdep(struct dragon_prevdep *destlp,struct dragon_prevdep *srclp)
|
|
{
|
|
if ( srclp->numpkinds > destlp->numpkinds )
|
|
destlp->numpkinds = srclp->numpkinds;
|
|
if ( srclp->numtxids > destlp->numtxids )
|
|
destlp->numtxids = srclp->numtxids;
|
|
if ( srclp->numunspents > destlp->numunspents )
|
|
destlp->numunspents = srclp->numunspents;
|
|
if ( srclp->numspends > destlp->numspends )
|
|
destlp->numspends = srclp->numspends;
|
|
if ( srclp->PoW > destlp->PoW )
|
|
destlp->PoW = srclp->PoW;
|
|
}
|
|
|
|
void dragon_blockmerge(struct dragon_block *dest,struct dragon_prevdep *destlp,struct dragon_block *block,struct dragon_prevdep *srclp)
|
|
{
|
|
if ( block->numvins > dest->numvins )
|
|
dest->numvins = block->numvins;
|
|
if ( block->numvouts > dest->numvouts )
|
|
dest->numvouts = block->numvouts;
|
|
if ( block->txn_count > dest->txn_count )
|
|
dest->txn_count = block->txn_count;
|
|
if ( dest->height == 0 )
|
|
dest->height = block->height;
|
|
dragon_mergeprevdep(destlp,srclp);
|
|
}*/
|
|
|
|
double PoW_from_compact(uint32_t nBits,uint8_t unitval) // NOT consensus safe, but most of the time will be correct
|
|
{
|
|
uint32_t nbytes,nbits; int32_t i,n; double PoW; uint64_t mult;
|
|
nbytes = (nBits >> 24) & 0xFF;
|
|
nbits = (8 * (nbytes - 3));
|
|
PoW = (nBits & 0xFFFFFF);
|
|
if ( (0) && nbytes > unitval )
|
|
{
|
|
printf("illegal nBits.%x unitval.%02x\n",nBits,unitval);
|
|
return(0.);
|
|
}
|
|
if ( (n= ((8 * (unitval-3)) - nbits)) > 0 ) // 0x1d00ffff is genesis nBits so we map that to 1.
|
|
{
|
|
//printf("nbits.%d -> n.%d\n",nbits,n);
|
|
if ( n < 64 )
|
|
PoW /= (1LL << n);
|
|
else // rare case efficiency not issue
|
|
{
|
|
for (i=0; i<n; i++)
|
|
PoW /= 2.;
|
|
}
|
|
} else PoW = 1.;
|
|
mult = 1;
|
|
while ( nbytes++ < unitval )
|
|
mult <<= 8;
|
|
PoW = (PoW * mult) / (nBits & 0xffffff);
|
|
//printf("nBits.%x -> %.15f diff %.15f | n.%d unitval.%d nbytes.%d\n",nBits,PoW,1./PoW,n,unitval,nbytes);
|
|
return(PoW);
|
|
}
|
|
|
|
int32_t dragon_blockunmain(struct dragon_info *coin,struct dragon_block *block)
|
|
{
|
|
struct dragon_block *next; int32_t n = 0;
|
|
while ( block != 0 )
|
|
{
|
|
//printf("n.%d %p (%p %p) mainchain.%d delink %d\n",n,block,block->hh.prev,block->hh.next,block->mainchain,block->height);
|
|
block->mainchain = 0;
|
|
next = block->hh.next;
|
|
block = next;
|
|
n++;
|
|
}
|
|
if ( n > 1000 )
|
|
printf("delinked.%d\n",n);
|
|
return(n);
|
|
}
|
|
|
|
int32_t dragon_walkchain(struct dragon_info *coin,int32_t skipflag)
|
|
{
|
|
char str[65]; int32_t height,hdrsi,bundlei,n = 0; struct dragon_bundle *bp; struct dragon_block *block=0;
|
|
height = coin->blocks.hwmchain.height;
|
|
while ( 1 ) //(block= dragon_blockfind("main",coin,dragon_blockhash(coin,height))) != 0 )
|
|
{
|
|
hdrsi = (height / coin->chain->bundlesize);
|
|
bundlei = (height % coin->chain->bundlesize);
|
|
if ( (bp= coin->bundles[hdrsi]) == 0 || (block= bp->blocks[bundlei]) == 0 )
|
|
{
|
|
printf("%s walk error [%d:%d] %p vs %p\n",coin->symbol,hdrsi,bundlei,block,bp->blocks[bundlei]);
|
|
break;
|
|
}
|
|
else if ( block->height >= 0 && block->height != height )
|
|
printf("%s walkchain height mismatch %d vs %d\n",coin->symbol,block->height,height);
|
|
dragon_blocksizecheck("walkchain",coin->chain->zcash,block);
|
|
if ( bits256_nonz(dragon_blockhash(coin,height)) != 0 && bits256_cmp(dragon_blockhash(coin,height),block->RO.hash2) != 0 )
|
|
{
|
|
printf("%s walk error blockhash error at %d %s\n",coin->symbol,height,bits256_str(str,dragon_blockhash(coin,height)));
|
|
break;
|
|
}
|
|
else if ( bits256_cmp(bp->hashes[bundlei],block->RO.hash2) != 0 )
|
|
{
|
|
printf("%s walk error [%d:%d] %s vs %s\n",coin->symbol,hdrsi,bundlei,bits256_str(str,bp->hashes[bundlei]),bits256_str(str,block->RO.hash2));
|
|
break;
|
|
}
|
|
else if ( block->hdrsi != hdrsi || block->bundlei != bundlei )
|
|
{
|
|
printf("%s walk error [%d:%d] vs [%d:%d]\n",coin->symbol,hdrsi,bundlei,block->hdrsi,block->bundlei);
|
|
break;
|
|
}
|
|
if ( height == 0 )
|
|
break;
|
|
else if ( skipflag != 0 && (height % coin->chain->bundlesize) == 0 )
|
|
{
|
|
n += coin->chain->bundlesize;
|
|
height -= coin->chain->bundlesize;
|
|
}
|
|
else
|
|
{
|
|
n++;
|
|
height--;
|
|
}
|
|
}
|
|
//printf("walk skip.%d n.%d hwm.%d %s\n",skipflag,n,coin->blocks.hwmchain.height,bits256_str(str,coin->blocks.hwmchain.RO.hash2));
|
|
return(n);
|
|
}
|
|
|
|
struct dragon_block *dragon_fastlink(struct dragon_info *coin,int32_t hwmheight)
|
|
{
|
|
int32_t hdrsi,bundlei,height; struct dragon_block *block = 0,*prev=0; double prevPoW = 0.; struct dragon_bundle *bp;
|
|
for (height=0; height<=hwmheight; height++)
|
|
{
|
|
hdrsi = (height / coin->chain->bundlesize);
|
|
bundlei = (height % coin->chain->bundlesize);
|
|
/*#ifndef __PNACL__
|
|
if ( (height % 10000) == 0 )
|
|
fprintf(stderr,".");
|
|
#endif*/
|
|
if ( (bp= coin->bundles[hdrsi]) == 0 )
|
|
{
|
|
printf("dragon_fastlink null bundle.[%d]\n",hdrsi);
|
|
break;
|
|
}
|
|
block = dragon_blockhashset("fastlink",coin,height,bp->hashes[bundlei],1);
|
|
if ( bp->blocks[bundlei] != 0 && block != bp->blocks[bundlei] )
|
|
{
|
|
printf("dragon_fastlink null block.[%d:%d]\n",hdrsi,bundlei);
|
|
break;
|
|
}
|
|
if ( prev != 0 && bits256_nonz(block->RO.prev_block) == 0 )
|
|
{
|
|
block->RO.prev_block = prev->RO.hash2;
|
|
printf("%s PATCH.[%d:%d] prev is null\n",coin->symbol,bp->hdrsi,bundlei);
|
|
break;
|
|
}
|
|
bp->blocks[bundlei] = block;
|
|
coin->blocks.maxblocks = (block->height + 1);
|
|
if ( coin->blocks.maxblocks > coin->longestchain )
|
|
coin->longestchain = coin->blocks.maxblocks;
|
|
block->valid = block->mainchain = 1;
|
|
block->hdrsi = hdrsi, block->bundlei = bundlei;
|
|
block->height = height;
|
|
//printf("set height.%d for bundlei.%d\n",height,bundlei);
|
|
block->PoW = PoW_from_compact(block->RO.bits,coin->chain->unitval) + prevPoW;
|
|
block->hh.prev = prev;
|
|
if ( prev != 0 )
|
|
prev->hh.next = block;
|
|
dragon_hash2set(coin,"fastlink",bp,bundlei,block->RO.hash2);
|
|
//dragon_bundlehash2add(coin,0,bp,bundlei,block->RO.hash2);
|
|
prev = block;
|
|
prevPoW = block->PoW;
|
|
}
|
|
return(block);
|
|
}
|
|
|
|
int32_t process_dragonblock(void *pblock,void *chainparams);
|
|
|
|
void *CHAINPARMS;
|
|
void dragon_setchain(void *chainparms)
|
|
{
|
|
extern int32_t MAIN_initflag;
|
|
MAIN_initflag = 1;
|
|
OS_init();
|
|
CHAINPARMS = chainparms;
|
|
printf("dragon_setchain chainparms.%p\n",chainparms);
|
|
dragon_launch(0,"dragon_main",dragon_main,0,0);
|
|
printf("RETURN dragon_setchain chainparms.%p\n",chainparms);
|
|
}
|
|
|
|
struct dragon_block *_dragon_chainlink(struct supernet_info *myinfo,struct dragon_info *coin,struct dragon_block *newblock)
|
|
{
|
|
int32_t valid,bundlei,height=-1; struct dragon_block *hwmchain,*block = 0,*prev=0;
|
|
bits256 *hash2p=0; double prevPoW = 0.;
|
|
if ( coin->blocks.hwmchain.height < 0 )
|
|
dragon_genesis(myinfo,coin,coin->chain);
|
|
if ( newblock == 0 || newblock->RO.timestamp == 0 || bits256_nonz(newblock->RO.prev_block) == 0 )
|
|
return(0);
|
|
dragon_blocksizecheck("chainlink new",coin->chain->zcash,newblock);
|
|
hwmchain = (struct dragon_block *)&coin->blocks.hwmchain;
|
|
if ( (block= dragon_blockfind("chainlink",coin,newblock->RO.hash2)) != 0 )
|
|
{
|
|
dragon_blockcopy(coin->chain->zcash,coin->chain->auxpow,coin,block,newblock);
|
|
if ( block->RO.timestamp == 0 )
|
|
block->mainchain = block->valid = block->txvalid = 0;
|
|
dragon_blocksizecheck("chainlink",coin->chain->zcash,block);
|
|
if ( memcmp(coin->chain->genesis_hashdata,block->RO.hash2.bytes,sizeof(bits256)) == 0 )
|
|
{
|
|
block->PoW = PoW_from_compact(block->RO.bits,coin->chain->unitval), height = 0;
|
|
if ( isnan(block->PoW) != 0 )
|
|
block->PoW = 0.;
|
|
}
|
|
else if ( (prev= dragon_blockfind("chainprev",coin,block->RO.prev_block)) != 0 )
|
|
{
|
|
//if ( memcmp(prev->RO.hash2.bytes,coin->blocks.hwmchain.RO.hash2.bytes,sizeof(bits256)) == 0 )
|
|
// prev->mainchain = 1;
|
|
if ( bits256_nonz(prev->RO.hash2) == 0 || (prev->valid == 0 && dragon_blockvalidate(myinfo,coin,&valid,prev,0) < 0) )
|
|
{
|
|
char str[65];
|
|
if ( (0) && bits256_nonz(prev->RO.hash2) != 0 )
|
|
printf("(%s) notready v.%d m.%d h.%d\n",bits256_str(str,prev->RO.hash2),prev->valid,prev->mainchain,prev->height);
|
|
return(0);
|
|
} else prev->valid = 1;
|
|
if ( prev->valid != 0 && prev->mainchain != 0 && prev->height >= 0 )
|
|
{
|
|
prevPoW = prev->PoW;
|
|
block->PoW = PoW_from_compact(block->RO.bits,coin->chain->unitval) + prevPoW;
|
|
/*if ( (next= prev->hh.next) != 0 )
|
|
{
|
|
if ( next->mainchain != 0 && block->PoW < next->PoW )
|
|
return(0);
|
|
//printf("block->PoW %f next %f\n",block->PoW,next->PoW);
|
|
hwmchain = next;
|
|
}*/
|
|
height = prev->height + 1;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if ( bits256_nonz(block->RO.prev_block) != 0 )
|
|
{
|
|
//printf("chainlink error: cant find prev.(%s)\n",bits256_str(str,block->RO.prev_block));
|
|
dragon_blockunmark(coin,block,0,-1,0);
|
|
//memset(&block->RO.prev_block.bytes,0,sizeof(block->RO.prev_block));
|
|
//getchar();
|
|
}
|
|
return(0);
|
|
}
|
|
//char str[65]; printf("extend? %s.h%d: %.15f vs %.15f ht.%d vs %d\n",bits256_str(str,block->RO.hash2),height,block->PoW,coin->blocks.hwmchain.PoW,height,coin->blocks.hwmchain.height);
|
|
if ( height < 0 || dragon_blockvalidate(myinfo,coin,&valid,newblock,0) < 0 || valid == 0 )
|
|
return(0);
|
|
block->height = height;
|
|
block->valid = 1;
|
|
if ( block->PoW >= hwmchain->PoW )
|
|
{
|
|
block->hh.prev = prev;
|
|
if ( prev != 0 )
|
|
{
|
|
//if ( prev->hh.next != block )
|
|
// dragon_blockunmain(coin,prev->hh.next);
|
|
prev->hh.next = block;
|
|
}
|
|
if ( coin->isRT != 0 || block->height >= hwmchain->height )
|
|
{
|
|
coin->blocks.maxblocks = (block->height + 1);
|
|
//printf("[%s] <- ht.%d %f\n",bits256_str(str,block->RO.hash2),coin->blocks.hwmchain.height,coin->blocks.hwmchain.PoW);
|
|
char str[65],str2[65]; bits256 zero;
|
|
memset(&zero,0,sizeof(zero));
|
|
bits256_str(str,newblock->RO.hash2);
|
|
if ( hash2p != 0 )
|
|
bits256_str(str2,*hash2p);
|
|
else str2[0] = 0;
|
|
if ( coin->blocks.maxblocks > coin->longestchain )
|
|
coin->longestchain = coin->blocks.maxblocks;
|
|
if ( (0) && (block->height % coin->chain->bundlesize) == 0 )
|
|
{
|
|
printf("EXTENDMAIN %s %d <- (%s) n.%u max.%u PoW %f numtx.%d valid.%d\n",str,block->height,str2,hwmchain->height+1,coin->blocks.maxblocks,block->PoW,block->RO.txn_count,block->valid);
|
|
//dragon_walkchain(coin);
|
|
}
|
|
struct dragon_bundle *bp; int32_t hdrsi;
|
|
bundlei = (block->height % coin->chain->bundlesize);
|
|
hdrsi = (block->height / coin->chain->bundlesize);
|
|
if ( bundlei == 0 )
|
|
{
|
|
if ( hdrsi < coin->bundlescount )
|
|
{
|
|
if ( (bp= coin->bundles[hdrsi]) != 0 && bits256_cmp(block->RO.hash2,bp->hashes[0]) != 0 )
|
|
{
|
|
printf(">>>>>>>>>>>>>> interloper bundle.[%d] ht.%d %s != %s\n",hdrsi,block->height,bits256_str(str,bp->hashes[0]),bits256_str(str2,block->RO.hash2));
|
|
coin->bundles[hdrsi] = 0;
|
|
}
|
|
}
|
|
bp = dragon_bundlecreate(coin,&bundlei,block->height,block->RO.hash2,zero,0);
|
|
if ( bp != 0 && bp->hdrsi == coin->bundlescount-1 )
|
|
{
|
|
//printf("created last bundle ht.%d\n",bp->bundleheight);
|
|
dragon_blockreq(coin,block->height,1);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if ( (bp= coin->bundles[hdrsi]) != 0 )
|
|
{
|
|
if ( memcmp(bp->hashes[bundlei].bytes,block->RO.hash2.bytes,sizeof(bits256)) != 0 || block != bp->blocks[bundlei] )
|
|
{
|
|
if ( bits256_nonz(bp->hashes[bundlei]) != 0 )
|
|
{
|
|
if ( bp->blocks[bundlei] == 0 && block != 0 )
|
|
bp->blocks[bundlei] = block;
|
|
else
|
|
{
|
|
//char str[65],str2[65];
|
|
//printf("ERROR: need to fix up bundle for height.%d (%p %p) (%s %s)\n",block->height,block,bp->blocks[bundlei],bits256_str(str,block->RO.hash2),bits256_str(str2,bp->hashes[bundlei]));
|
|
bp->blocks[bundlei] = block;
|
|
bp->hashes[bundlei] = block->RO.hash2;
|
|
|
|
//if ( bp == coin->current && coin->RTheight > 0 )
|
|
// coin->RTdatabad = 1;
|
|
//dragon_bundleremove(coin,bp->hdrsi,0);
|
|
//exit(-1);
|
|
//getchar();
|
|
}
|
|
}
|
|
dragon_blockunmark(coin,block,bp,bundlei,0);
|
|
dragon_bundlehash2add(coin,0,bp,bundlei,block->RO.hash2);
|
|
}
|
|
else
|
|
{
|
|
bp->blocks[bundlei] = block;
|
|
bp->hashes[bundlei] = block->RO.hash2;
|
|
dragon_bundlehash2add(coin,0,bp,bundlei,block->RO.hash2);
|
|
}
|
|
if ( coin->started != 0 && bundlei == coin->minconfirms && (block->height > coin->longestchain-coin->chain->bundlesize*2 || ((block->height / coin->chain->bundlesize) % 10) == 9) )
|
|
{
|
|
//printf("savehdrs.[%d] ht.%d\n",bp->hdrsi,block->height);
|
|
dragon_savehdrs(coin);
|
|
//printf("done savehdrs.%d\n",bp->hdrsi);
|
|
}
|
|
}
|
|
}
|
|
block->mainchain = 1;
|
|
if ( coin->blocks.pending > 0 )
|
|
coin->blocks.pending--;
|
|
/*if ( block->serdata != 0 )
|
|
{
|
|
printf(" call process_dragonblock2.%p ht.%d nbits.%08x\n",block->serdata,block->height,*(uint32_t *)&block->serdata[72]);
|
|
process_dragonblock(block->serdata,CHAINPARMS);
|
|
}*/
|
|
dragon_blockzcopy(coin->chain->zcash,(void *)&coin->blocks.hwmchain,block);
|
|
if ( coin->RTheight > 0 )
|
|
dragon_RTnewblock(myinfo,coin,block);
|
|
block->hdrsi = hdrsi;
|
|
block->bundlei = bundlei;
|
|
if ( (0) && (bp= coin->bundles[hdrsi]) != 0 )
|
|
{
|
|
if ( bp->blocks[bundlei] != block || bits256_cmp(bp->hashes[bundlei],block->RO.hash2) != 0 )
|
|
printf("new hwm [%d:%d] mismatched bundle block\n",hdrsi,bundlei);
|
|
}
|
|
return(block);
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
char str[65];
|
|
printf("chainlink error from block.%p %s\n",block,bits256_str(str,newblock->RO.hash2));
|
|
}
|
|
return(0);
|
|
}
|
|
|
|
/*void dragon_blocksetheights(struct dragon_info *coin,struct dragon_block *block)
|
|
{
|
|
int32_t height;
|
|
if ( (height= block->height) < 0 )
|
|
return;
|
|
while ( block != 0 && block->height != height )
|
|
{
|
|
block->height = height;
|
|
dragon_bundlehash2add(coin,0,coin->bundles[height/coin->chain->bundlesize],height % coin->chain->bundlesize,block->RO.hash2);
|
|
block = block->hh.next, height++;
|
|
}
|
|
}*/
|
|
|
|
int32_t dragon_chainextend(struct supernet_info *myinfo,struct dragon_info *coin,struct dragon_block *newblock)
|
|
{
|
|
struct dragon_block *block,*prev; int32_t valid,oldhwm; char str[65];
|
|
if ( dragon_blockvalidate(myinfo,coin,&valid,newblock,0) < 0 || valid == 0 )
|
|
{
|
|
printf("chainextend: newblock.%s didnt validate\n",bits256_str(str,newblock->RO.hash2));
|
|
return(-1);
|
|
}
|
|
else
|
|
{
|
|
block = dragon_blockhashset("chainextend",coin,-1,newblock->RO.hash2,1);
|
|
if ( block != newblock )
|
|
dragon_blockcopy(coin->chain->zcash,coin->chain->auxpow,coin,block,newblock);
|
|
block->valid = 1;
|
|
if ( block->hh.prev == 0 && (prev= dragon_blockfind("extendprev",coin,block->RO.prev_block)) != 0 )
|
|
{
|
|
if ( prev->hh.next == 0 && block->hh.prev == 0 )
|
|
prev->hh.next = block, block->hh.prev = prev;
|
|
//printf("extend newblock.%s prevm.%d\n",bits256_str(str,block->prev_block),prev->mainchain);
|
|
if ( prev->mainchain == 0 )
|
|
{
|
|
if ( (block= dragon_blockfind("extendmain",coin,coin->blocks.hwmchain.RO.hash2)) != 0 && block->mainchain == 0 )
|
|
{
|
|
//printf("c hwmchain is not mainchain anymore?\n");
|
|
prev->mainchain = 1;
|
|
} else return(0);
|
|
}
|
|
}
|
|
if ( memcmp(block->RO.prev_block.bytes,coin->blocks.hwmchain.RO.hash2.bytes,sizeof(bits256)) != 0 )
|
|
return(0);
|
|
}
|
|
if ( block != 0 )
|
|
{
|
|
oldhwm = coin->blocks.hwmchain.height;
|
|
//printf("link.%s\n",bits256_str(str,block->hash2));
|
|
while ( block != 0 && memcmp(block->RO.hash2.bytes,coin->blocks.hwmchain.RO.hash2.bytes,sizeof(bits256)) != 0 && _dragon_chainlink(myinfo,coin,block) == block && coin->blocks.hwmchain.height != oldhwm )
|
|
{
|
|
oldhwm = coin->blocks.hwmchain.height;
|
|
block = block->hh.next;
|
|
if ( block != 0 )
|
|
{
|
|
if ( bits256_nonz(block->RO.prev_block) == 0 )
|
|
break;
|
|
//printf("next link.%s\n",bits256_str(str,block->hash2));
|
|
}
|
|
}
|
|
}
|
|
if ( (block= dragon_blockfind("extendcheck",coin,coin->blocks.hwmchain.RO.hash2)) != 0 && block->mainchain == 0 )
|
|
{
|
|
printf("hwmchain is not mainchain anymore?\n");
|
|
block->mainchain = 1;
|
|
}
|
|
return(coin->blocks.hwmchain.height);
|
|
}
|
|
|