Block chain packing and storing method

Block chain packing and storing method

  • CN 105,630,609 A
  • Filed: 02/24/2016
  • Published: 06/01/2016
  • Est. Priority Date: 02/24/2016
  • Status: Active Application
First Claim
Patent Images

1. the packing storage means of block chain, it is characterized in that, in same block, when a PKI address has many to pay, must verify that whether remaining sum is enough successively, here by expenditure address by the interval classification of address, checkout transaction can be distinguished with different threads or process, can guaranteeing that same expenditure address is no more than remaining sum, step is as follows:

  • Step S1;

    packaged service device receives transaction record, according to address section segmentation according to the order of sequence (such as the server of A1, A2, A3, A4 and correspondence), puts into corresponding different threads or difference process or different server by expenditure address by address above mentioned Concourse Division;

    Step S2;

    by multi-thread journey, the expenditure address of same segmentation is carried out validity verification again, verifies whether every transaction can untie signature with PKI, and the cryptographic Hash of the cryptographic Hash untied and transaction content is contrasted, if unanimously just passing through authenticity verification;

    Step S3;

    after the transaction of authenticity verification, calculate each expenditure address in transaction successively and after deducting all amounts paid, pay the remaining sum of address, it is put in set B, the transaction exceeding remaining sum is put into pending in a wait set C or cancels, and the increase amount of money of receiver address is also put in a set D;

    Step S4;

    the calculation result (set B and D) of multi-thread for the machine journey or multi-process is merged into the remaining sum calculating accumulative account addresses in the machine thread, point three kinds of situations;

    (1) if there is again (set B and D have) of expenditure transaction certain address in the existing reception of this block simultaneously;

    The remaining sum of this address in B in the increase amount of money+this block of the remaining sum of receiver address=accumulative this block reception address(2) if certain address only receives at this block (only the having in set D, do not have in B) of not paying transaction;

    The remaining sum of this address of the increase amount of money of the remaining sum of receiver address=accumulative this block reception address+nearest history block(3) if (only the having in set B, do not have in D) that transaction does not receive transaction is only paid, at this block, in certain address;

    The remaining sum of this address in B in remaining sum=this block of expenditure addressStep S5;

    the remaining sum calculated by S4 is sent in the corresponding thread in address classification (such as A1, A2, A3, A4 etc.) or process or server (the corresponding thread of step S3 or process in);

    Step S6;

    each thread or process are pressed the sequence of block trading cryptographic Hash respectively and generated Mei Keer tree, calculate segmentation Mei Keer tree root cryptographic Hash, if consistent with Merkel'"'"'s tree root cryptographic Hash of other correspondences, are then stored into hard disk;

    Step S7;

    the Mei Keer tree root cryptographic Hash that step S6 generates is built a Mei Keer tree successively again, calculates the Mei Keer tree root cryptographic Hash of this block.

View all claims
    ×
    ×

    Thank you for your feedback

    ×
    ×