'CACHE'Project [VALM-Cache difficulty recalculation algorithm, SpamHash Control] - page 5.

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Quote from: minerja on January 23, 2020, 04:50:58 AM

Hi Deff,

I finally managed to compile, and started syncing...but, do you have the correct nodes please. I added the ones i found from the explorer, and had synced with only 96,000 to go, but now i still have over 126,000 to go.

Also noticed you have updated to v6.1.1.35, so have that compiled too.

These are the peers i am connected too
   {
   "addr" : "145.239.189.106:2225",
   "services" : "00000001",
   "lastsend" : 1579769360,
   "lastrecv" : 1579769380,
   "bytessent" : 44726,
   "bytesrecv" : 519863,
   "conntime" : 1579769167,
   "version" : 91004,
   "subver-tx" : "/CACHEProject 2018:0.7.6.45/",
   "subver" : "/'CACHE'Project 2018:0.7.6.45/",
   "inbound" : false,
   "releasetime" : 0,
   "startingheight" : 365131,
   "banscore" : 0
   },
   {
   "addr" : "63.142.251.194:2225",
   "services" : "00000001",
   "lastsend" : 1579769173,
   "lastrecv" : 1579769170,
   "bytessent" : 242,
   "bytesrecv" : 241,
   "conntime" : 1579769169,
   "version" : 91001,
   "subver-tx" : "/CACHecoinWM:0.7.6.14/",
   "subver" : "/CACHecoin-WM:0.7.6.14/",
   "inbound" : false,
   "releasetime" : 0,
   "startingheight" : 364024,
   "banscore" : 0
   },
   {
   "addr" : "31.43.218.102:2225",
   "services" : "00000001",
   "lastsend" : 1579769382,
   "lastrecv" : 1579769382,
   "bytessent" : 187,
   "bytesrecv" : 338,
   "conntime" : 1579769382,
   "version" : 91004,
   "subver-tx" : "/CACHEProject 2018:0.7.6.46/",
   "subver" : "/'CACHE'Project 2018:0.7.6.46/",
   "inbound" : false,
   "releasetime" : 0,
   "startingheight" : 365131,
   "banscore" : 0

its taken over 12 hours so far to sync this much....any ideas how i can speed it up please.

Thanks
J

Synchronization takes more than a day.
If you need faster -

Windows and noWindows BD
https://drive.google.com/drive/folders/15kvCVv9lLfmLDuUIM12sfP-Fv_baoDWH?usp=sharing

minerja

sr. member

Activity: 1248

Merit: 297

Hi Deff,

I finally managed to compile, and started syncing...but, do you have the correct nodes please. I added the ones i found from the explorer, and had synced with only 96,000 to go, but now i still have over 126,000 to go.

Also noticed you have updated to v6.1.1.35, so have that compiled too.

These are the peers i am connected too
   {
   "addr" : "145.239.189.106:2225",
   "services" : "00000001",
   "lastsend" : 1579769360,
   "lastrecv" : 1579769380,
   "bytessent" : 44726,
   "bytesrecv" : 519863,
   "conntime" : 1579769167,
   "version" : 91004,
   "subver-tx" : "/CACHEProject 2018:0.7.6.45/",
   "subver" : "/'CACHE'Project 2018:0.7.6.45/",
   "inbound" : false,
   "releasetime" : 0,
   "startingheight" : 365131,
   "banscore" : 0
   },
   {
   "addr" : "63.142.251.194:2225",
   "services" : "00000001",
   "lastsend" : 1579769173,
   "lastrecv" : 1579769170,
   "bytessent" : 242,
   "bytesrecv" : 241,
   "conntime" : 1579769169,
   "version" : 91001,
   "subver-tx" : "/CACHecoinWM:0.7.6.14/",
   "subver" : "/CACHecoin-WM:0.7.6.14/",
   "inbound" : false,
   "releasetime" : 0,
   "startingheight" : 364024,
   "banscore" : 0
   },
   {
   "addr" : "31.43.218.102:2225",
   "services" : "00000001",
   "lastsend" : 1579769382,
   "lastrecv" : 1579769382,
   "bytessent" : 187,
   "bytesrecv" : 338,
   "conntime" : 1579769382,
   "version" : 91004,
   "subver-tx" : "/CACHEProject 2018:0.7.6.46/",
   "subver" : "/'CACHE'Project 2018:0.7.6.46/",
   "inbound" : false,
   "releasetime" : 0,
   "startingheight" : 365131,
   "banscore" : 0

its taken over 12 hours so far to sync this much....any ideas how i can speed it up please.

Thanks
J

oh yeah...i had to use Ubuntu 16.04.6 LTS, and i can't get the cloned version to compile (git clone https://github.com/DeffM/CACHeCoin.git) but can get the source to work (https://github.com/DeffM/CACHeCoin/archive/v_6.1.1.35.tar.gz)
I can't remember the errors since i've been at it for hours....but i think in the end this worked for me

sudo apt-get install build-essential libssl-dev libboost-all-dev libdb5.3 libdb5.3-dev libdb5.3++-dev libtool automake libevent-dev bsdmainutils -y
sudo apt-get install git ntp make g++ gcc autoconf cpp ngrep iftop sysstat autotools-dev pkg-config libminiupnpc-dev libzmq3-dev -y
sudo apt-get install libqt5gui5 libqt5core5a libqt5dbus5 qttools5-dev qttools5-dev-tools libprotobuf-dev protobuf-compiler libqrencode-dev -y
chmod +x build_release.sh
./build_release.sh

I have the following versions
gcc (Ubuntu 5.4.0-6ubuntu1~16.04.12) 5.4.0 20160609
OpenSSL 1.0.2g 1 Mar 2016
libboost1.58-dev

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

New version available - Hard Fork version

CACHE-Project, New protocol testing, To me already like

Version : v_6.1.1.35

Version of git : v_0.7.5.197

Subversion : v_0.7.6.47

https://github.com/DeffM/CACHeCoin/releases/tag/v_6.1.1.35

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Code:

05:08:43

getdifficulty


05:08:49

{
"proof-of-work" : 0.00000486,
"search-interval-powblock" : 276,
"search-twointerval-powblock" : 323,
"search-full-result-powblock" : 323,
"pow-target-spacing-variable" : 1107,
"UpperLower-pow" : 346,
"XUpper-pow" : 257,
"XLower-pow" : 1,
"proof-of-stake" : 3.07751346,
"search-interval-posblock" : 192,
"search-twointerval-posblock" : 193,
"search-full-result-posblock" : 193,
"pos-target-spacing-variable" : 735,
"UpperLower-pos" : 230,
"XUpper-pos" : 180,
"XLower-pos" : 1,
"search-interval-without pow block" : 2230,
"search-interval-without pos block" : 679,
"UnixCachChainTime" : 1579730840,
"study" : 0.00000000,
"studys" : 0.00000000
}

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Quote from: minerja on January 22, 2020, 09:11:32 AM

Hi, would you mind letting me know which version of linux this compiles on please.
Tried, Ubuntu 19.10, Mint 19.3 both fail with "big_num" errors"
I'm not a "linux" guy, but can start from scratch with any version, and follow instructions....also love "GUI versions"

Thanks
J

Quote from: Deff on January 21, 2020, 05:06:56 AM

New version available - Hard Fork version

CACHE-Project, HardFork stable version, new protocol testing

Version : v_6.1.1.34

Version of git : v_0.7.5.195

Subversion : v_0.7.6.46

https://github.com/DeffM/CACHeCoin/releases/tag/v_6.1.1.34

Hi!! Use under Windows, a newer version will be released tomorrow.

https://github.com/DeffM/CACHeCoin/releases/download/v_6.1.1.34/cacheproject-qt_Windows_x86.zip
https://github.com/DeffM/CACHeCoin/releases/download/v_6.1.1.34/cacheprojectd_Windows_x86.zip

minerja

sr. member

Activity: 1248

Merit: 297

Hi, would you mind letting me know which version of linux this compiles on please.
Tried, Ubuntu 19.10, Mint 19.3 both fail with "big_num" errors"
I'm not a "linux" guy, but can start from scratch with any version, and follow instructions....also love "GUI versions"

Thanks
J

Quote from: Deff on January 21, 2020, 05:06:56 AM

New version available - Hard Fork version

CACHE-Project, HardFork stable version, new protocol testing

Version : v_6.1.1.34

Version of git : v_0.7.5.195

Subversion : v_0.7.6.46

https://github.com/DeffM/CACHeCoin/releases/tag/v_6.1.1.34

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Solo....
https://github.com/JayDDee/cpuminer-opt/releases

taskkill /F /IM cpuminer-opt.exe

cpuminer-opt.exe -h

Pause

start cpuminer-opt.exe -a scryptjane:19 -o http://127.0.0.1:2224 -u USER -p PASS -t 8 --cpu-affinity ff --randomize --no-redirect -b 0 --no-gbt --coinbase-addr=address

exit

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

New version available - Hard Fork version

CACHE-Project, HardFork stable version, new protocol testing

Version : v_6.1.1.34

Version of git : v_0.7.5.195

Subversion : v_0.7.6.46

https://github.com/DeffM/CACHeCoin/releases/tag/v_6.1.1.34

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Hard Fork Block - 364000

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

New version available - Hard Fork version

CACHE-Project, Hard Fork date is set in this version. Block - 364000, Version fixing

Version : v_6.1.1.33

Version of git : v_0.7.5.190

Subversion : v_0.7.6.45

https://github.com/DeffM/CACHeCoin/releases/tag/v_6.1.1.33

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Transferring the image to the next page ..

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

I had to abandon the calculation of the trust. Today, the new code does not allow double spending, even the to owner of 100% hash power.

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

New version available

CACHE-Project, Pre hard fork version

Version : v_6.1.1.31

Version of git : v_0.7.5.156

Subversion : v_0.7.6.43

https://github.com/DeffM/CACHeCoin/releases/tag/v_6.1.1.31

Duncan.Idaho

member

Activity: 195

Merit: 17

Very Old Project!

Perhaps age has value? Wink

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Log of work ...

Code:

received block 6e0658f4f18135a77546
CheckStakeKernelHash() : using modifier 0x2b2f729637db0a62 at height=339249 timestamp=2019-05-21 00:55:54 UTC for block from height=338167 timestamp=2019-05-12 04:58:51 UTC
CheckStakeKernelHash() : check protocol=0.3 modifier=0x2b2f729637db0a62 nTimeBlockFrom=1557637131 nTxPrevOffset=158 nTimeTxPrev=1557637131 nPrevout=1 nTimeTx=1573505536 hashProof=0000e001dd9b09bea137ae463421f1702647d647c5d37e28b44b199a96adf262
ComputeNextStakeModifier: prev modifier=0x6e653eb3b765c0ff time=2019-11-11 20:43:04 UTC
 'AddToBlockIndex()' - The new block pretends to a height 357787, block chain height 357790
 'AddToBlockIndex()' - The protocol registered a new block with a height 357787, with an erarlier timestamp, but the information delayed, the height of the blockchain 357790, 'Trust' control enabled
 'AddToBlockIndex()' - A fork is formed, the height of the parent block 357781, hash child blocks hash(1)=d04031bf hash(2)=98a169c6, creation date block(1)=09.11.2019 12:08:47 block(2)=09.11.2019 13:11:43
ProcessBlock: ACCEPTED POS BLOCK

Code:

CheckStakeKernelHash() : using modifier 0xd396e9c53ce62d66 at height=348314 timestamp=2019-08-17 00:11:03 UTC for block from height=347143 timestamp=2019-08-08 04:29:58 UTC
CheckStakeKernelHash() : check protocol=0.3 modifier=0xd396e9c53ce62d66 nTimeBlockFrom=1565238598 nTxPrevOffset=158 nTimeTxPrev=1565238598 nPrevout=1 nTimeTx=1573505724 hashProof=0000de94d4e3453f043e6ed7b123cd7f2e9f3445a4ed0ab429fd71de2c81954b
ComputeNextStakeModifier: prev modifier=0x6e653eb3b765c0ff time=2019-11-11 20:43:04 UTC
 'AddToBlockIndex()' - The new block pretends to a height 357788, block chain height 357790
 'AddToBlockIndex()' - A fork is formed, the height of the parent block 357781, hash child blocks hash(1)=d04031bf hash(2)=98a169c6, creation date block(1)=09.11.2019 12:08:47 block(2)=09.11.2019 13:11:43
  priority has the first block, BestChainTrust=777261130088649 down
REORGANIZE
REORGANIZE: Disconnect 9 blocks; 8e3fd276723312c0e77b..00006e90cf1c1fcb7307
REORGANIZE: Connect 7 blocks; 8e3fd276723312c0e77b..27e58419356e66197085
     Delete redundant memory transactions that are in the connected branch
    ----------------------------------------------------------------------
REORGANIZE: done
SetBestChain: new best=27e58419356e66197085  height=357788  trust=777356722574480  date=11.11.2019 20:55:24
ProcessBlock: ACCEPTED POS BLOCK

Code:

received block 00008f9925cf1d2c07da
ComputeNextStakeModifier: prev modifier=0x95578fb9bd55c0ff time=2019-11-12 00:07:49 UTC
 'AddToBlockIndex()' - The new block pretends to a height 357829, block chain height 357809
 'AddToBlockIndex()' - This fork has an earlier timestamp, but the information was spread late - switching to a longer branch, the height of the blocks is 357809, the maximum height of the blocks is 357828
 'AddToBlockIndex()' - A fork is formed, the height of the parent block 357788, hash child blocks hash(1)=0001249b hash(2)=dc212e6b, creation date block(1)=11.11.2019 21:01:09 block(2)=11.11.2019 20:58:42
REORGANIZE
REORGANIZE: Disconnect 21 blocks; 27e58419356e66197085..6cc4aa9235efae01400c
REORGANIZE: Connect 41 blocks; 27e58419356e66197085..00008f9925cf1d2c07da
     Delete redundant memory transactions that are in the connected branch
     ---------------------------------------------------------------------
REORGANIZE: done

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

The decentralized checkpoint opened up opportunities that had not previously seemed possible to me. I envisioned a case in which a wallet or group of wallets for some reason delayed information about a new block. Now a new block having an earlier time stamp with a delay of information about itself, the network will accept, provided that the delay is no more than two new blocks. For blocks with an earlier timestamp and even greater delay, the “ChainTrust” counting is turned on and at a lower value the chain will be rejected by the protocol. Since the code now knows about the height of the parent block of the fork, it exits on its own by setting checkpoint to the longest chain.

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Added two modes ..

Set virtual decentralized checkpoint - setvirtualdecentralizedcheckpoint=1
Ignore later found blocks - ignorelaterfoundblocks=1

Enabled by default.

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Code being tested for today ..

Code:

    CBlockIndex* pblockindex = NULL;
    int nPossibleHeight = pindexNew->pprev->nHeight + 1;
    if (fDebug)
        printf(" 'AddToBlockIndex()' - The new block pretends to a height %d, block chain height %d\n", nPossibleHeight,
               pindexBest->nHeight);

    nMaxDepthReplacement = GetArg("-maxdepthreplacement", 50);

    int nFixPrev = 0;
    CBlockIndex* newblockindex = pindexNew;
    int nFixPindexBestnHeight = pindexBest->nHeight;
    if (fHardForkOne)
    {
        if (pindexBest->nHeight > nPossibleHeight)
            nFixPindexBestnHeight = nPossibleHeight;
        if (nPossibleHeight > pindexBest->nHeight)
        {
            nFixPrev = nPossibleHeight - pindexBest->nHeight;
            for (int i = nFixPrev; i > 0; i--)
            {
                 if (i == i)
                 {
                     newblockindex =  newblockindex->pprev;
                 }
            }
        }

        for (int k = nFixPindexBestnHeight; k > nFixPindexBestnHeight - nMaxDepthReplacement; k--)
        {
             CBlockIndex* bestblockindex = FindBlockByHeight(k);
             if (k == k)
             {
                 if (newblockindex->pprev->GetBlockHash() == bestblockindex->pprev->GetBlockHash())
                 {
                     if (nPossibleHeight <= pindexBest->nHeight - nMaxDepthReplacement)
                     {
                         pindexNew->bnChainTrust = 0;
                         if (fDebug)
                             printf(" 'AddToBlockIndex()' - The new block pretends to a height %d, maximum allowed block height for a competing chain %d\n", nPossibleHeight,
                             pindexBest->nHeight - nMaxDepthReplacement);
                         break;
                     }
                     else if (newblockindex->GetBlockTime() > bestblockindex->GetBlockTime())
                     {
                              pindexNew->bnChainTrust = 0;
                              if (fDebug)
                                  printf(" 'AddToBlockIndex()' - A fork is formed, the height of the parent block %d, hash child blocks hash(1)=%s hash(2)=%s, creation date block(1)=%s block(2)=%s,\n",
                                  bestblockindex->pprev->nHeight, newblockindex->GetBlockHash().ToString().substr(0,8).c_str(), bestblockindex->GetBlockHash().
                                  ToString().substr(0,8).c_str(), DateTimeStrFormat("%x %H:%M:%S", newblockindex->GetBlockTime()).c_str(), DateTimeStrFormat("%x %H:%M:%S",
                                  bestblockindex->GetBlockTime()).c_str());
                                  printf("  priority has a second block, NewChainTrust=%s down\n", pindexNew->bnChainTrust.ToString().c_str());
                              break;
                     }
                     else if (newblockindex->GetBlockTime() < bestblockindex->GetBlockTime() &&
                              nPossibleHeight > pindexBest->nHeight - nMaxDepthReplacement)
                     {
                              bnBestChainTrust = bestblockindex->pprev->bnChainTrust;;
                              if (fDebug)
                                  printf(" 'AddToBlockIndex()' - A fork is formed, the height of the parent block %d, hash child blocks hash(1)=%s hash(2)=%s, creation date block(1)=%s block(2)=%s,\n",
                                  bestblockindex->pprev->nHeight, newblockindex->GetBlockHash().ToString().substr(0,8).c_str(), bestblockindex->GetBlockHash().
                                  ToString().substr(0,8).c_str(), DateTimeStrFormat("%x %H:%M:%S", newblockindex->GetBlockTime()).c_str(), DateTimeStrFormat("%x %H:%M:%S",
                                  bestblockindex->GetBlockTime()).c_str());
                                  printf("  priority has the first block, BestChainTrust=%s down\n", bnBestChainTrust.ToString().c_str());
                              break;
                     }
                 }
                 newblockindex =  newblockindex->pprev;
             }
        }
    }

    if (nPossibleHeight < pindexBest->nHeight && fHardForkOne)
    {
        pblockindex = FindBlockByHeight(nPossibleHeight);
        if (pindexNew->GetBlockTime() > pblockindex->GetBlockTime())
        {
            if (fDebug)
                printf(" 'AddToBlockIndex()' - Generation time of a new block date=%s later than available in the database date=%s\n",
                DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str(), DateTimeStrFormat("%x %H:%M:%S",
                pblockindex->GetBlockTime()).c_str());
            pindexNew->bnChainTrust = 0;
        }
        else if (pindexNew->GetBlockTime() < pblockindex->GetBlockTime())
        {
                 if (nPossibleHeight < pindexBest->nHeight && nPossibleHeight > pindexBest->nHeight - nMaxDepthReplacement)
                 {
                     if (fDebug)
                         printf(" 'AddToBlockIndex()' - The generation time of a new block date=%s earlier than the one in the database date=%s\n",
                         DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str(), DateTimeStrFormat("%x %H:%M:%S",
                         pblockindex->GetBlockTime()).c_str());
                     bnBestChainTrust = pblockindex->pprev->bnChainTrust;
                 }
        }
    }

    // New best
    if (pindexNew->bnChainTrust > bnBestChainTrust)
    {
        if (!SetBestChain(state, txdb, pindexNew))
            return false;
    }
    else if (pindexNew->bnChainTrust == bnBestChainTrust && fHardForkOne && pindexPrevPos->GetBlockHash() >=
             pindexPrevPrevPos->GetBlockHash())
    {
             printf(" 'AddToBlockIndex()' - BestChainTrust %s\n", bnBestChainTrust.ToString().c_str());
             printf(" 'AddToBlockIndex()' - NewChainTrust %s\n", pindexNew->bnChainTrust.ToString().c_str());
             if (((pindexNew->IsProofOfStake() && pindexBest->IsProofOfStake()) ? (pindexNew->GetBlockHash() >
                 pindexBest->GetBlockHash()) : (hash > pindexBest->GetBlockHash())) ||
                 (pindexBest->IsProofOfWork() && pindexNew->IsProofOfStake()))
             {
                 printf(" 'AddToBlockIndex()' bnChainTrust = bnBestChainTrust - Block accepted\n");
                 if (!SetBestChain(state, txdb, pindexNew))
                 {
                     return false;
                 }
             }
             else
             {
                  printf(" 'AddToBlockIndex()' bnChainTrust = bnBestChainTrust - Block not accepted\n");
             }
    }
    else if (pindexNew->bnChainTrust == bnBestChainTrust && fHardForkOne && pindexPrevPos->GetBlockHash() <
             pindexPrevPrevPos->GetBlockHash())
    {
             printf(" 'AddToBlockIndex()_' - BestChainTrust %s\n", bnBestChainTrust.ToString().c_str());
             printf(" 'AddToBlockIndex()_' - NewChainTrust %s\n", pindexNew->bnChainTrust.ToString().c_str());
             if (((pindexNew->IsProofOfStake() && pindexBest->IsProofOfStake()) ? (pindexNew->GetBlockHash() <
                 pindexBest->GetBlockHash()) : (hash < pindexBest->GetBlockHash())) ||
                 (pindexBest->IsProofOfWork() && pindexNew->IsProofOfStake()))
             {
                 printf(" 'AddToBlockIndex()_' bnChainTrust = bnBestChainTrust - Block accepted\n");
                 if (!SetBestChain(state, txdb, pindexNew))
                 {
                     return false;
                 }
             }
             else
             {
                  printf(" 'AddToBlockIndex()_' bnChainTrust = bnBestChainTrust - Block not accepted\n");
             }
    }

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Log of work ...

Code:

received block 1652a05972b98e678461
CheckStakeKernelHash() : using modifier 0x35d696e7b209ef80 at height=349401 timestamp=2019-08-28 19:25:00 UTC for block from height=348699 timestamp=2019-08-19 21:11:31 UTC
CheckStakeKernelHash() : check protocol=0.3 modifier=0x35d696e7b209ef80 nTimeBlockFrom=1566249091 nTxPrevOffset=158 nTimeTxPrev=1566249091 nPrevout=1 nTimeTx=1572903179 hashProof=000001c1e2aca427813ef37c1bc66380e10d2afa0ba691c41d6947d2a4637ced
ComputeNextStakeModifier: prev modifier=0x3c2eb5bf4d3202fd time=2019-11-04 18:08:03 UTC
 'AddToBlockIndex()' - The new block pretends to a height 357245, block chain height 357285
 'AddToBlockIndex()' - A fork is formed, the height of the parent block 357233, hash child blocks hash(1)=46cba156 hash(2)=000084f2, creation date block(1)=04.11.2019 20:04:19 block(2)=04.11.2019 19:19:17,
  priority has a second block, NewChainTrust=0 down
 'AddToBlockIndex()' - Generation time of a new block date=04.11.2019 21:32:59 later than available in the database date=04.11.2019 20:19:24
ProcessBlock: ACCEPTED POS BLOCK
2019-11-06 19:34:49 UTC received: getblocks (997 bytes)

Code:

received block 0001b495e8c947f2aa67
ComputeNextStakeModifier: prev modifier=0x1673d3f6dc47f14c time=2019-11-07 00:10:33 UTC
 'AddToBlockIndex()' - The new block pretends to a height 357365, block chain height 357366
 'AddToBlockIndex()' - A fork is formed, the height of the parent block 357364, hash child blocks hash(1)=0001b495 hash(2)=045a8855, creation date block(1)=11/07/19 03:58:09 block(2)=11/07/19 03:59:48,
  priority has the first block, BestChainTrust=769420279357256 down
 'AddToBlockIndex()' - The generation time of a new block date=11/07/19 03:58:09 earlier than the one in the database date=11/07/19 03:59:48
REORGANIZE
REORGANIZE: Disconnect 2 blocks; 0d7c1fab0c6ac8e5150a..5729d05204aef49d6c0c
REORGANIZE: Connect 1 blocks; 0d7c1fab0c6ac8e5150a..0001b495e8c947f2aa67
     Delete redundant memory transactions that are in the connected branch
REORGANIZE: done
SetBestChain: new best=0001b495e8c947f2aa67  height=357365  trust=769420279357257  date=11/07/19 03:58:09
ProcessBlock: ACCEPTED POW BLOCK
2019-11-07 04:08:04 UTC received: block (335 bytes)

Code:

received block 0001b6228706fd79e42d
Flushed 123 addresses to peers.dat  31ms
ComputeNextStakeModifier: prev modifier=0x1673d3f6dc47f14c time=2019-11-07 00:10:33 UTC
 'AddToBlockIndex()' - The new block pretends to a height 357349, block chain height 357349
 'AddToBlockIndex()' - A fork is formed, the height of the parent block 357348, hash child blocks hash(1)=0001b622 hash(2)=5416c057, creation date block(1)=11/07/19 02:16:20 block(2)=11/07/19 02:19:22,
  priority has the first block, BestChainTrust=769144828228136 down
REORGANIZE
REORGANIZE: Disconnect 1 blocks; 741dae93a19fd2a2df2d..5416c057bc5860a31b1c
REORGANIZE: Connect 1 blocks; 741dae93a19fd2a2df2d..0001b6228706fd79e42d
     Delete redundant memory transactions that are in the connected branch
REORGANIZE: done
SetBestChain: new best=0001b6228706fd79e42d  height=357349  trust=769144828228137  date=11/07/19 02:16:20
ProcessBlock: ACCEPTED POW BLOCK

Deff

sr. member

Activity: 939

Merit: 261

Data HDD Repair - Recovery of lost information

Implemented a new principle of consensus in a dispute between blocks for placement in the main chain. Confidence comparison is used only when the time stamps of competitor blocks are exactly the same. In other cases, the check for the formation of a fork and for the presence of disputed blocks is carried out constantly with the advent of each new block in the network. The check is carried out at the specified depth and can be changed in the settings. When disputed blocks are found, information about the parent block is entered into the log file, and the hash and timestamps are logged for posterity. The block with the earlier timestamp wins. As far as I know, this method has not been used yet, but maybe I'm wrong. It is possible in the this mode the use of check points will not be appropriate.

Topic: 'CACHE'Project [VALM-Cache difficulty recalculation algorithm, SpamHash Control] - page 5. (Read 8135 times)