A dual-level core chain platform for protecting and verifying blockchain data

Abstract

The present invention relates to a dual-level core chain platform for improving the security, robustness and / or verifiability of a blockchain through Proof of History (PoH), comprising: a first initial block having a node assigned to a shard address; a plurality of subsequent blocks including a new address for each subsequent block generated by a ladder exchange protocol using a previous address and a previous block header; a record stream having a plurality of stream values, each of which is a current record value hashed with a previous stream value; and a blockchain server for storing a plurality of modules.

Description

Technical Field

[0001] Embodiments of the present invention relate to the field of blockchain technology, and more specifically to a core chain (Crux chain) platform that provides a more secure and robust blockchain and protects and verifies blockchain data. Background Art

[0002] Generally speaking, blockchain technology refers to a technology that reliably and securely records and stores the content of transactions performed via network communications. A blockchain network is a distributed system that enables the exchange of digital assets or transactions and utilizes a shared ledger that records the history of electronic transactions or operations within the network. Because blockchain networks utilize a decentralized consensus mechanism, third-party forgery and tampering with transactions are virtually impossible, ensuring both reliability and transparency.

[0003] A blockchain network is a decentralized, distributed data storage system involving multiple nodes. Once data is written to the blockchain on each node, it becomes publicly available across the entire network. Furthermore, data written to the blockchain is difficult to delete or tamper with. This makes blockchain technology a promising technology for data storage.

[0004] In light of this, and to overcome these shortcomings, the present invention aims to provide a platform that allows sensitive data written to the blockchain to remain private while maintaining the integrity of other data stored in the blockchain. The core blockchain platform of the present invention is a simple, lean, and flexible blockchain designed to provide efficient and high-performance blockchain services. Summary of the Invention

[0005] Embodiments of the present invention relate to a dual-level core chain platform for efficient and high-performance blockchains that allows cross-chain transactions between other blockchains of distributed ledgers. The dual-level core chain platform includes: a first initial block having a node assigned to a shard address, and a first record value being a first stream value; a plurality of subsequent blocks including a new address for each of the plurality of subsequent blocks generated by a ladder swapping protocol using a previous address and a previous block header; a record stream having a plurality of stream values, each of which is a current record value hashed with a previous stream value; and a blockchain server for storing a plurality of modules.

[0006] According to one embodiment of the present invention, a blockchain server performs the following steps: assigning a unique address in a block to a node, including a shard number in section 1 and a shard address in section 2; linking blocks via a parallel proof of history (PoH) using a hash function of the block value to form a main chain; transforming the shard address into a shard number using a switching matrix, and linking user records by hashing the record value using a parallel proof of history (PoH) to form a record chain loaded into the address chain; and verifying the loaded record using a parallel proof of history (PoH). Specifically, the switching matrix includes the current shard number and the current block value, which are used to transform the current shard address to generate the shard number in the next block.

[0007] According to one embodiment of the present invention, the module includes a parallel history proof (PoH) module, an unpredictable traceable address chain module, an adjustment verification module, a bid average / pre-agreed percentile value module, a mathematics module and an encryption module.

[0008] The parallel history proof (PoH) module is configured to link user transaction records to form a parallel history proof (PoH) record stream with an address chain.

[0009] The unpredictable traceable address chain module is configured to generate an unpredictable traceable address by ladder exchange from the current address in the block and the current block value.

[0010] The adjustment verification module is configured to view the requester's transaction records in the shard and verify them through shard-level verification (SLV) or record-level verification (RLV).

[0011] The bidding mean / pre-agreed percentile value module is operable to allow shard-level bidding winners to participate and compare block-level mean / pre-agreed percentile values to determine the final winner of the bid and its block as the official version.

[0012] The math module is operatively configured to perform a hash function to form a block. The hash function is any one of a secure hash algorithm, ladder commutation, modular addition, or modular multiplication.

[0013] The cryptographic module is configured to generate cryptocurrencies to reward winners and collect revenue through shard transaction fees. Furthermore, if necessary, new coins may be generated as rewards for second-tier or first-tier winners. Specifically, the shard transaction fee (STF) is the total collected fees minus the total rebate amount. Furthermore, once the number of nodes reaches a certain level and the total transaction fees after rebates are substantial, shard representatives may retain a portion of the shard transaction fees as rewards.

[0014] According to one embodiment of the present invention, the dual-level core chain platform further includes: a checksum row for shard-level verification, wherein the shard record in the current block is the checksum row in the next block; and a binary table that is operably configured with a mathematical module to verify the hash of the transaction value based on the number of the address.

[0015] According to one embodiment of the present invention, shard-level verification (SLV) involves a requestor providing a complete set of records (record values and stream values) for a shard, followed by verification by a verifier, which verifies that the shard values of the requested set match and that the records in the provided complete set match the corresponding records in the verification row by applying the previous stream value to the record value. Shard-level verification can also be performed using a binary table of the shards using the modulo value of the corresponding address digit.

[0016] According to one embodiment of the present invention, record-level verification (RLV) includes the requester providing a record (record value and stream value) and the complete address of the record, and the verifier verifying whether the record is in a shard or in a check row, and verifying the previous stream value of the record, or the verifier forwarding a request for verification by other verifiers that have this record in their shards or check rows to nodes and check rows in the same shard.

[0017] According to an embodiment of the present invention, the minimum requirement for block-level participating nodes to generate a block value includes the previous block header and the current shard value of all shards belonging to the current block.

[0018] According to an embodiment of the present invention, the minimum requirement for a shard-level participating node includes a flow value and a record value in the same shard.

[0019] According to one embodiment of the present invention, the minimum data requirements for a verification request include the stream value and record value of a shard for which a record is requested for shard-level verification (SLV). Furthermore, the minimum data requirements for a verification request include the record value and stream value, as well as the full address of the requested record for which a record is requested for record-level verification (RLV).

[0020] According to one embodiment of the present invention, a node has a unique address in a block, including a shard number in section 1 and a shard address in section 2.

[0021] According to an embodiment of the present invention, the switching matrix uses either forward switching or reverse switching.

[0022] According to an embodiment of the present invention, the address chain uses any one of a forward process and / or a reverse process.

[0023] According to one embodiment of the present invention, the forward process includes forming a switching matrix using the current block and the shard number, creating a switching matrix, and changing the shard address of the block's section 2 via switching. Specifically, the switching shard number of the current address is the shard address in the next block.

[0024] According to one embodiment of the present invention, the reverse process includes swapping the current shard address with the previous block header to form a swap matrix, and generating a shard number in the previous block through reverse mapping. Specifically, the current shard number is the previous shard address.

[0025] Another embodiment of the present invention relates to a method for transmitting information in blocks of a distributed ledger in a dual-level core chain platform. The method includes the following steps: assigning a unique address in a block to a node, including a shard number in section 1 and a shard address in section 2; linking blocks via a parallel proof of history (PoH) using a hash function of the block value to form a main chain; transforming the shard address into a shard number using a switching matrix, and linking user records by hashing the record value using a parallel proof of history (PoH) to form a record chain loaded into the address chain; and verifying the loaded record using the parallel proof of history (PoH). Specifically, the switching matrix includes the current shard number and the current block value, which are used to transform the current shard address to generate the shard number in the next block.

[0026] According to one embodiment of the present invention, the method further includes: generating a complete address in the next block of the address chain by adding one to the current block number as the next block number, wherein the shard number in the current block is the shard address in the next block; and generating the shard number in the next block by inputting the current shard address into a switching matrix. The switching matrix is composed of the current block header and the current shard number, and the shard number has the same number of bits as the shard address.

[0027] It is to be understood that both the foregoing general description and the following detailed description of the present invention are exemplary and explanatory and are intended to provide further explanation of the invention as claimed. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] For a detailed understanding of the above-described features of the present invention, the invention, briefly summarized above, will be described in more detail with reference to embodiments, some of which are illustrated in the accompanying drawings. It should be noted, however, that the accompanying drawings illustrate only typical embodiments of the invention and are not to be construed as limiting the scope of the invention, which may admit to other equally effective embodiments.

[0029] Figure 1 is a diagram showing an overview of the conventional structure of a blockchain platform according to one or more embodiments of the present invention, in which a core chain with improvements made in various aspects of the present disclosure may be implemented;

[0030] Figure 2 is a diagram illustrating generating a complete address for the next block in an address chain according to an embodiment of the present invention;

[0031] Figure 3 An exemplary embodiment of a switch matrix for address allocation according to an embodiment of the present invention is shown;

[0032] Figure 4 Shows forward swapping and reverse swapping according to an embodiment of the present invention;

[0033] Figure 5 Shows the forward and reverse processes of address chaining according to one embodiment of the present invention;

[0034] Figure 6 Shows the core chain platform operation of the main chain and record flow according to one embodiment of the present invention;

[0035] Figure 7 The following illustrates a hash function of a core chain platform according to an embodiment of the present invention;

[0036] Figure 8 An exemplary example of a check row according to an embodiment of the present invention is shown;

[0037] Figure 9 shows the minimum data requirements for verification using a check row according to an embodiment of the present invention;

[0038] Figure 10 Shows the minimum data requirements for verification using a binary table according to an embodiment of the present invention;

[0039] Figure 11 The bidding incentive and mean / pre-agreed percentile mechanism according to one embodiment of the present invention is shown. DETAILED DESCRIPTION

[0040] By reference Figures 1 to 11 The principles and advantages of the present invention can be most clearly understood.In the following detailed description of illustrative or exemplary embodiments of the present disclosure, specific embodiments in which the present disclosure can be practiced are described in sufficient detail to enable those skilled in the art to practice the disclosed embodiments.

[0041] Therefore, the following detailed description should not be construed in a limiting sense, and the scope of the present disclosure is defined by the appended claims and their equivalents. References in the specification to "one embodiment," "an embodiment," "an embodiment," or "one or more embodiments" are intended to indicate that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present disclosure.

[0042] Figure 1: This is a diagram showing an overview of a traditional blockchain structure according to one or more embodiments of the present invention, in which improvements have been made to the core chain platform and various aspects of the present disclosure can be implemented. Specifically, the transaction record section of the lower level is called Shard. Each participating node in the core chain platform is assigned a specific unique position as the address (shard number + shard address) in the block (block number) being built. Blocks are linked to form a main chain through a parallel history proof (PoH) by hashing the block value. Furthermore, the current address of the node is linked to the address in the next block through the shard number to become a shard address, and the shard address is transformed into a shard number via an exchange matrix. The exchange matrix consists of the current shard number and the current block value, and is used to transform the current shard address to generate the shard number of the next block. In addition, the exchange algorithm is a modified ladder exchange to ensure the uniqueness of the participating nodes in the traceable address chain and the bidirectional traceable address.

[0043] In addition to the main chain, each participant's records are linked by hashing the record values of the Parallel History Proof (PoH) to form a record chain loaded into the address chain. The address chain has bidirectional traceability, and the loaded records can be verified by the Parallel History Proof (PoH), thus providing high security and easy verification.

[0044] In addition, the parallel Proof of History (PoH) on the address chain examines the individual record chains of each participating node as part of the inter-blockchain structure. Subsequently, the inter-blockchain structure is examined.

[0045] According to an embodiment of the present invention, the two-level core chain platform can be expanded to multiple levels.

[0046] Figure 2 is a diagram illustrating the generation of a complete address for the next block in an address chain according to an embodiment of the present invention. Specifically, the complete address in the next block in the address chain is generated by adding one to the current block number (Bn) to obtain the next block number (Bn+1). The shard number (Sn) in the current block (Bn) becomes the shard address (An) in the next block. Furthermore, the current shard address (An) is used as input to a switching matrix to generate the shard number (Sn) in the next block. In addition, the switching matrix consists of the current block header and the current shard number (Sn). Subsequently, the shard number (Sn) has the same number of bits as the shard address (An).

[0047] Specifically, the address chain is an unpredictable and bidirectionally traceable address chain of participating nodes.

[0048] According to one embodiment of the present invention, the shard number (Sn+1) waits until the block header (Bn) is available, so the complete address in the block (Bn+1) is unknown until the block header (Bn) is available.

[0049] According to another embodiment of the present invention, as long as the full addresses in the (Bn+1) and (Bn) block headers are available, the shard address (An) can be generated in reverse, so the addresses of participating nodes are bidirectionally traceable.

[0050] Figure 3 An exemplary ladder switching example of a switching matrix for address allocation according to an embodiment of the present invention is shown. Specifically, ladder lottery is based on group theory, ensuring collision-free operation to maintain uniqueness. Furthermore, a cylindrical switching matrix connects the rightmost column to the leftmost column. Furthermore, switching lines traverse the cylinder by jumping columns. Furthermore, the number 1 in the matrix represents a switching line; consecutive 1s indicate that the switching line "jumps" columns. Subsequently, a descending line cuts through consecutive 1s.

[0051] exist Figure 3 In the exemplary example of , the number 6 follows the ladder draw and maps down to the number 4. And, the number 4 in the input address is swapped to the number 6 in the output address. Therefore, in order to generate the swap section

[0052] Switching matrix: A175 59D2 F463 8B0E

[0053] Input section: 4C82E

[0054] Output section: 6D2F4

[0055] 4=>6C=>D 8=>2 2=>FE=>4

[0056] According to one embodiment of the present invention, address uniqueness is maintained within a block. This address includes the fragment number (Sn) in section 1 and the fragment address (An) in section 2. Specifically, each section 2 is unique within the same section 1 because the complete address is unique. Furthermore, the uniqueness of section 2 within the same section 1 remains unchanged after swapping. Thus, address uniqueness is subsequently maintained.

[0057] In addition, after the swap, the swapped addresses are grouped into shard numbers by the new section 2, and section 1 becomes the shard address in the next block.

[0058] Figure 4 The forward exchange and the reverse exchange according to one embodiment of the present invention are shown. Specifically, the forward exchange and the reverse exchange provide bidirectional traceability.

[0059] According to one embodiment of the present invention, forward exchange under block Bn uses a switching matrix, and each shard has its own unique matrix as the shard number used in the matrix to prevent the entire block from changing the same number in the same way (for example, all numbers 7 are changed to numbers A). Specifically, the complete address in Bn includes the shard number in section 1 and the shard address in section 2. Furthermore, section 2 of the same section 1 is exchanged through the switching matrix composed of the Bn block header and section 1, so that section 2 of different sections 1 are exchanged through different switching matrices.

[0060] In addition, sections 1 and 2 are swapped to form a new address, and section 2 becomes the shard number of the next block Bn+1. Moreover, the nodes in the same shard in this block will not be in the same shard in the next block.

[0061] According to one embodiment of the present invention, the reverse swap under block (Bn+1) involves reverse swapping sections 1 and 2 to obtain the shard number from the previous block. Specifically, the shard number and the swap matrix for the previous Bn block header are available. Furthermore, the original section 2 is found through the reverse mapping in the swap matrix.

[0062] Figure 5 The forward and reverse processes of the address chain according to an embodiment of the present invention are shown.

[0063] According to one embodiment of the present invention, the forward process of the address chain includes forming a swap matrix using the current block and the shard number, using the shard address to create the shard number of the next block via the swap matrix, and then changing the shard address in section 2 of the block via the swap. Specifically, the shard number of the current address becomes the shard address of the next block.

[0064] According to another embodiment of the present invention, the reverse process of the address chain includes swapping the current shard address with the previous block header to form a swap matrix, and generating a shard number in the previous block through reverse mapping. Specifically, the current shard number is the previous shard address.

[0065] Figure 6 The core chain platform operation of the main chain and the record flow according to one embodiment of the present invention is shown. Specifically, the core chain platform includes a first block, multiple subsequent blocks, a record flow, and a historical proof of the record flow.

[0066] The first initial block includes the node assigned to the shard address, and the first record value is the first stream value. For example, node A is assigned to address 1 of shard 12. Therefore, the first record value "a1" of node A is the stream value "A1" and is uploaded to address 1.

[0067] The plurality of subsequent blocks include a new address for each of the plurality of subsequent blocks generated from the previous address and the previous block through a ladder exchange protocol.

[0068] In one example, the new address of the second block address 2 is generated by ladder swapping address 1 and block header 1. Furthermore, node A's second record value "a2" is hashed using "A1" as the stream value "A2." Furthermore, both "a2" and "A2" are uploaded to address 2.

[0069] According to an embodiment of the present invention, users and / or participants may skip some blocks by using blank record values to create stream values for upload.

[0070] A record stream includes multiple stream values. Each of the multiple stream values, except for the first record, is a current record value hashed with the previous stream value. Users and / or participants save all record values and stream values of all other participants in the same shard for verification.

[0071] The Proof of History (PoH) of the record stream ensures that each participating node has its own unique record stream to upload its transaction records. Similarly, in the main chain of the core chain platform, the record stream consists of the Proof of History (PoH).

[0072] According to one embodiment of the present invention, the core chain platform also includes a blockchain server (not shown). Specifically, the blockchain server performs the following steps: assigning a unique address in the block to the node, including the shard number in section 1 and the shard address in section 2; linking the blocks to form a main chain through a hash function of the block value via parallel history proof (PoH); transforming the shard address into a shard number through a switching matrix, and linking user records by hashing the record value through parallel history proof (PoH) to form a record chain loaded into the address chain; and verifying the loaded record through parallel history proof (PoH). Specifically, the switching matrix includes the current shard number and the current block value, which are used for the current shard address transformation to generate the shard number in the next block.

[0073] According to one embodiment of the present invention, the blockchain server (not shown) further stores multiple modules (not shown). The multiple modules include a parallel history proof (PoH) module, an unpredictable traceable address chain module, an adjustment verification module, a bid average / pre-agreed percentile value module, a mathematics module, and an encryption module.

[0074] The parallel history proof (PoH) module is configured to link user transaction records to form a parallel history proof (PoH) record stream with an address chain.

[0075] The unpredictable traceable address chain module is configured to generate an unpredictable traceable address by ladder exchange from the current address in the block and the current block value.

[0076] The adjustment verification module is configured to view the requester's transaction records in the shard and verify them through shard-level verification (SLV) or record-level verification (RLV).

[0077] The bidding mean / pre-agreed percentile value module can be operated to allow the shard-level bidding winners to participate and compare the block-level mean / pre-agreed percentile value to determine the final winner. The final winner wins the bid and its block is used as the official version.

[0078] The math module is operatively configured to perform a hash function to form a block. The hash function is any one of a secure hash algorithm, ladder commutation, modular addition, or modular multiplication.

[0079] The cryptographic module is configured to generate cryptocurrencies for rewarding winners and collect revenue by levying shard transaction fees. Furthermore, if necessary, it can generate new coins as rewards for second-tier or first-tier winners.

[0080] Figure 7 The hash function of the core chain platform according to one embodiment of the present invention is shown. Specifically, the five areas of hash algorithm review include but are not limited to transaction record encryption, historical proof of participating node record flow, address chain of record flow, block history proof, and the creation of shards and blocks based on uploaded data.

[0081] The following table illustrates the various hash functions and expected characteristics of the core chain platform:

[0082]

[0083] Table 1: Hash functions and expected properties

[0084] After reviewing the security requirements and properties of the Secure Hash Algorithm (SHA), as well as the desired characteristics, the following two functions were identified for use in other types of hashing:

[0085] The address chain during ladder exchange satisfies the requirements of being unpredictable but bidirectionally traceable. Specifically, the address chain can be used to record flows.

[0086] Creating shards and blocks involves modular arithmetic, such as modular addition or modular multiplication, which satisfies associativity and commutativity requirements. Specifically, creating shards and blocks depends on the uploaded data.

[0087] Additionally, as long as record encryption and Proof of History (PoH) continue to use the Secure Hash Algorithm (SHA), the overall security level will not be affected and performance will be significantly improved.

[0088] Figure 8The following illustrates an exemplary parity row implementation according to one embodiment of the present invention. In this example, participating node A is "An" in block Bn and "An+1" in block Bn+1. Other members of the same shard within block Bn become parity row members for "An+1" in block Bn+1. Therefore, the parity row members for "An+1" reside in different shards within block Bn+1 and cover all shards.

[0089] Specifically, the shard address in block Bn becomes the shard number in block Bn+1, meaning that nodes in the same shard in block Bn may not be in a different shard in block Bn+1. The shard address in block Bn+1 is obtained using the shard number in block Bn and the block header of block Bn. Furthermore, when there are few or no empty nodes, each participating node has, in addition to the record value and stream value of members in the same shard, the previous block stream value of a member in another shard.

[0090] Authentication of the requester record in a shard is performed through either shard-level verification (SLV) or record-level verification (RLV).

[0091] According to one embodiment of the present invention, in shard-level verification (SLV), the requester provides a complete set of records (record values and flow values) for a shard, and the verifier verifies whether the shard values in the requested set match the records. Additionally, the verifier verifies the records in the verification row and applies the previous flow value along with the record value.

[0092] In an exemplary instance, the verifier verifies the record "Vn+1" in its verification row and applies the previous stream value "Vn" together with the record value and the stream value "Vn+1".

[0093] Additionally, shard-level verification (SLV) verifies either the checksum row or the binary table.

[0094] According to one embodiment of the present invention, in record-level verification (RLV), the requester provides the record (record value and stream value) and the complete address of the record. The verifier verifies whether the record is in the shard and the check row, and also verifies the previous stream value of the record. Otherwise, the verifier forwards the request to a node in the same shard and check row for verification.

[0095] Figure 9 The following figure illustrates the minimum data requirements for verification using a check line according to one embodiment of the present invention. Specifically, the check line used in the verification has the minimum data requirements for verification. At the block level, the minimum data required for verification by participating nodes is the block header and the shard value to generate the block value.

[0096] At the shard level, the stream value and record value in the same shard are the minimum data requirements for participating nodes to verify.

[0097] According to one embodiment of the present invention, the minimum data requirements for a verification request include the stream value and record value of a shard for which a record is requested for shard-level verification (SLV). Furthermore, the minimum data requirements for a verification request include the record value and stream value, as well as the full address of the requested record for which a record is requested for record-level verification (RLV).

[0098] Table 2 below illustrates the binary table logic according to one embodiment of the present invention. Hashing is allowed to be performed in any order, thereby speeding up the verification process through modular hashing with associativity and commutativity, which in turn speeds up the block formation process.

[0099]

[0100]

[0101] Table 2: Binary table logic

[0102] Specifically, row P uses the record with the corresponding digit of 1 in the address to maintain the modulo hash, and row N uses the record with the corresponding digit of 0 in the address to maintain the modulo hash. The content area explains the hash relationship corresponding to the binary digit of the address of the check value. In operation, only node values P1 to P4 and N1 to N4 are required. In addition, the same row P and row N ensure the same block, and the required memory space is 2 times the total number of nodes. * log, and the Merkle Tree is the total number of nodes.

[0103] The values in the binary table are then P1 to P4 and N1 to N4. For example, P3 = mod(a4, a5, a6, a7, a12, a13, a14, a15), where mod() is a mathematical modulus with associative and commutative properties.

[0104] Specifically, a binary table can be used for value checking. For example, if a6 is different, then P3 & P2 and N4 & N1 will be different. Through P3 & P2, the address of the different node can be a6 or (a6 & a4) or (a6 & a2) or (a2 & a4) or (a2 & a4 & a6). And, through N4 & N1, the address of the different node can be a6 or (a6 & a7) or (a6 & a14) or (a7 & a14) or (a6 & a7 & a14). Then, the unique intersection is a6.

[0105] Figure 10 This figure shows the minimum data requirements for verification using a binary table according to one embodiment of the present invention. Specifically, the binary table used in verification reduces memory requirements. The minimum data requirements for participating nodes include the block header and shard values, as well as the binary tables for all shards. Furthermore, this includes the stream values and record values for the same shard.

[0106] The minimum data requirements for a validation request include the stream value and record value for a shard where the requested record is subject to shard-level validation (SLV). Furthermore, the minimum data requirements for a validation request include the record value and stream value, as well as the full address when the requested record is subject to record-level validation (RLV).

[0107] Specifically, if Figure 10 As shown in Figure 2, binary table verification is divided into two levels: shard-level verification (SLV) and record-level verification (RLV).

[0108] In shard-level verification (SLV), the requester provides a complete set of record values and stream values for the shard, including the request record, for the verifier to verify consistency with the shard binary table.

[0109] In record-level verification (RLV), the requester provides the record (record value and stream value) and the record's complete address. The verifier directly verifies whether the record is in its shard and then verifies the record's previous stream value. Otherwise, the verifier forwards the request to a node in the same shard and / or verification row for verification.

[0110] Figure 11 This figure illustrates a bidding incentive and mean / pre-agreed percentile mechanism according to one embodiment of the present invention. The mean / pre-agreed percentile bidding mechanism allows shard-level bidding winners to participate and compare the block-level mean / pre-agreed percentile to determine the final winner. The winner's bid is awarded, and their block is designated as the official version. This ensures that participating nodes are incentivized to earn reasonable profits and avoids significant energy waste.

[0111] This is accomplished in two steps. First, shard-level bidding allows participants to bid on the rebate amount for delegates or share representatives. The winner pays the rebate to all other participants in the shard. Shard representatives compete in the second level for the shard transaction fee (STF). Specifically, the shard transaction fee (STF) is the fees collected in the shard minus the rebate amount.

[0112] In the second step, a block-level competition mechanism awards the shard representative whose STF is closest to the average or a pre-agreed percentile of all shard STFs as the winner of the total STF. This winner is then confirmed to have its block version broadcast to all participating shards. To avoid intentional bidding, the winner can be the one closest to the pre-agreed percentile.

[0113] If the shard representative fails to attend, the overall shard record is not blocked, and it returns the collected shard transaction fee (STF), including the rebate paid as its penalty.

[0114] According to one embodiment of the present invention, the generated cryptocurrency can be used to pay transaction fees. Furthermore, if necessary, new coins can be generated as rewards for second-tier or first-tier winners. Once the number of nodes reaches a certain level and the total transaction fees after rebates are substantial, shard representatives can retain a portion of the shard transaction fees as rewards.

[0115] The dual-level core chain platform of this invention offers advantages such as low bootstrapping costs, economical operation, and high throughput, making it ideal for applications with frequent information transmission, such as nanopayment platforms, supply chain management, and insurance / reinsurance information sharing. Furthermore, bidding and averaging / pre-agreed percentile value mechanisms replace energy-consuming mining operations. Furthermore, binary tables replace Merkel trees, increasing computation speed and reducing memory usage.

[0116] Several key innovative features enhance economic value by reducing memory requirements and accelerating incentive mechanisms. Its unique addressing technology provides a traceable yet unpredictable chain of addresses for transaction records, making it robust against intentional errors such as double spending. Furthermore, the concept of timestamping the resulting blocks can also be applied to record streams, making the Core Chain platform ideal for cross-chain transactions that allow other blockchains to participate. Furthermore, the use of hash functions has been reviewed and adjusted to leverage the mathematical properties of associativity and commutativity to further accelerate processing time.

[0117] It will be readily understood by those skilled in the art that various modifications and variations may be made to the present invention without departing from the spirit and scope of the present invention. Therefore, the present invention is intended to encompass the modifications and variations of the present invention provided within the scope of the appended claims and their equivalents.

[0118] Although some features and examples of this document have been described in terms of language specific to structural features or method steps, it should be understood that the subject matter of the present invention is not necessarily limited to the specific features or steps described. Any process description, element, or flow chart block described herein or depicted in the accompanying drawings should be understood to represent modules, fragments, or code portions that include one or more executable instructions for implementing specific logical functions or elements in the process. Alternative implementations are within the scope of the examples described herein. As will be understood by those skilled in the art, in these examples, depending on the functions involved, some elements or functions may be deleted, or these elements or functions may be performed in a different order than that illustrated or discussed (including substantially synchronously or in reverse order).

[0119] It should be emphasized that many variations and modifications may be made to the above examples, and elements of such variations and modifications should be understood as elements of other permissible examples. All such variations and modifications are intended to be included within the scope of this disclosure and to be protected by the appended claims. Furthermore, in the claims, any reference to a group of items provided by the terms of a prior claim is a reference to at least some of the items in that group, unless expressly stated otherwise. Alternatives to each of the claims appended hereto are expressly contemplated herein, and in any claim, any such reference refers to each item in the corresponding group. In addition, in the claims, an operation described as "based on" a listed item may be performed solely based on that item or at least in part based on that item, unless expressly stated otherwise.

[0120] Alternatives are expressly contemplated herein for each of the appended claims, and in any claim, any reference to the language "based on" refers to the listed items and nothing else. Furthermore, in any claim using the transitional language "comprising," reciting a specific number of components is not limited to embodiments including exactly that number of components, unless expressly stated otherwise. However, such a claim does describe embodiments including exactly those components in the specified number, as well as embodiments containing at least the specified number of those components.

Claims

1. A dual-level core chain platform that improves the security, robustness, performance, and / or verifiability of blockchains through parallel Proof of History (PoH), comprising: A first initial block, comprising a node assigned to the shard address; wherein the first record value is a first stream value; a plurality of subsequent blocks, comprising a new address for each of the plurality of subsequent blocks generated by a ladder exchange protocol using the previous address and the previous block header; A record stream comprising a plurality of stream values, wherein each of the plurality of stream values is a current record value hashed with a previous stream value; and A blockchain server, configured to store multiple modules; and the blockchain server is configured to execute: Assigning a unique address in the block to the node, including the shard number in section 1 and the shard address in section 2; Linking the blocks via the parallel Proof of History (PoH) through a hash function of the block value to form a main chain; Transforming the shard address through a switching matrix to generate a shard number in the next block; Linking user transaction records by hashing the record values through the parallel history proof (PoH) to form a loaded record chain in the address chain; and Verifying the load record chain in the address chain through the parallel history proof (PoH); In which, the dual-level core chain platform is operably configured to allow one or more cross-chain transactions.

2. The dual-level core chain platform according to claim 1, wherein: The plurality of modules further comprises: a parallel Proof of History (PoH) module configured to link the user transaction records to form a parallel Proof of History (PoH) record stream having the address chain; An unpredictable traceable address chain module, configured to generate an unpredictable traceable address from the current address in the block and the current block value through a ladder exchange protocol; Adjust the verification module, which is configured to check the requester's user transaction records in the shard and verify them through either Shard-Level Verification (SLV) or Record-Level Verification (RLV); A bid average / pre-agreed percentile value module operable to allow shard-level bid winners to participate and compare block-level averages / pre-agreed percentile values to determine the final winner; a math module operably configured to perform a hash function to form a block, wherein the hash function is any one of a secure hash algorithm, a ladder switching protocol, modular addition, or modular multiplication; and An encryption module is operably configured with the bid average / pre-agreed percentile value module and generates a cryptographic currency for rewarding the final winner and collecting shard transaction fees.

3. The dual-level core chain platform according to claim 1, wherein: The dual-level core chain platform further includes: A checksum line for shard-level verification (SLV), where the shard record in the current block becomes the checksum line in the next block; and A binary table operably configured with a mathematical module to verify a hash of a transaction value against an address digit.

4. The dual-level core chain platform according to claim 3, wherein: The shard-level verification (SLV) includes: The requester provides a complete set of records (record values and stream values) for the shard. Verifying, by the verifier, whether the shard value of the request set matches the record; and The verifier verifies the record in the verification row and applies the previous stream value together with the record value; The shard-level verification further verifies the check row or binary table.

5. The dual-level core chain platform according to claim 4, wherein: The minimum data requirements for verifying a request in Shard-Level Verification (SLV) include the request record and the stream value and record value of the shard.

6. The dual-level core chain platform according to claim 2, wherein: The record-level verification (RLV) includes: The requester provides the record (record value and stream value) and the complete address of the record; The verifier verifies whether the record is in the shard or in the verification row, and verifies the previous stream value of the record; or The verifier forwards the request to nodes in the same shard and check row for verification.

7. The dual-level core chain platform according to claim 6, wherein: The minimum data requirements for the verification request in the record-level verification (RLV) include the request record and record value, stream value and complete address.

8. The dual-level core chain platform according to claim 1, wherein: The block header and shard value are the minimum data requirements for node verification at the block level.

9. The dual-level core chain platform according to claim 1, wherein: The stream value and record value in the same shard are the minimum data requirements for participating in node verification at the shard level.

10. The dual-level core chain platform according to claim 1, wherein: The switching matrix performs forward switching or reverse switching.

11. The dual-level core chain platform according to claim 1, wherein: The address chain performs any one of a forward process and / or a reverse process.

12. The dual-level core chain platform according to claim 11, wherein: The forward process of the address chain includes: Use the current block and shard number to form a switching matrix; Using the shard address to create a shard number in the next block via the switch matrix; and Changing the slice address in section 2 of the current block via swapping; The shard number of the current address is the shard address in the next block.

13. The dual-level core chain platform according to claim 1, wherein: The reverse process of the address chain includes: Swap the current shard address with the previous block header to form a swap matrix; and Generate the shard number through reverse mapping in the previous block; Among them, the current shard number is the previous shard address.

14. The dual-level core chain platform according to claim 1, wherein: The dual-level core chain platform is a multi-level core chain platform.

15. A method for improving the security, robustness and / or verifiability of a blockchain via parallel Proof of History (PoH) in a dual-level core chain platform, wherein: The method comprises the following steps: Assign the node a unique address in the block, including the shard number in section 1 and the shard address in section 2; Linking blocks via the parallel Proof of History (PoH) through a hash function of the block value to form a main chain; Transforming the shard address through a switching matrix to generate a shard number in a next block; wherein the switching matrix includes a current shard number and a current block value; Linking user records by hashing the record values using parallel Proof of History (PoH) to form a chain of loaded records in the address chain; and Verifying the load record chain in the address chain through the parallel history proof (PoH); Among them, the dual-level core chain platform allows one or more cross-chain transactions.

16. The method according to claim 15, wherein The method further includes generating a complete address in the next block of the address chain by: Incrementing the current block number by one to obtain the next block number, wherein the shard number in the current block is the shard address in the next block; and Generating a shard number in the next block by inputting the current shard address into the exchange matrix; The shard number and shard address in the switching matrix have the same number of bits.

17. The method according to claim 15, wherein: The forward process of the address chain includes the following steps: Use the current block and shard number to form a switching matrix; Using the shard address to create a shard number in the next block via the switch matrix; and Changing the slice address in section 2 of the current block via swapping; The shard number of the current address is the shard address in the next block.

18. The method according to claim 15, wherein The reverse process of the address chain includes the following steps: Swap the current shard address with the previous block header to form a swap matrix; and Generate the shard number through reverse mapping in the previous block; The current fragment number is the previous fragment address.

19. The method according to claim 15, wherein The dual-level core chain platform further includes: A checksum line for shard-level verification (SLV), where the shard record in the current block becomes the checksum line in the next block; and a binary table operably configured with a mathematical module to verify a hash of a transaction value against an address digit; Transaction records are verified through Shard-Level Verification (SLV), which includes the following steps: The requester provides a complete set of records (record values and stream values) for the shard; Verifying, by the verifier, whether the shard value of the request set matches the record; and The verifier verifies the record in the verification row and applies the previous stream value together with the record value; The shard-level verification further verifies the check row or binary table, and the minimum data requirement for verifying the request in shard-level verification (SLV) includes the stream value and record value of the request record and the shard.

20. The method according to claim 15, wherein Transaction records are verified through record-level verification (RLV), which includes the following steps: The requester provides the record (record value and stream value) and the complete address of the record; The verifier verifies whether the record is in the shard or in the verification row, and verifies the previous stream value of the record; or The verifier forwards the request to nodes in the same shard and verification row for verification; The minimum data requirements for the verification request in the record-level verification (RLV) include the request record and record value, stream value and complete address.

Images