Abstract: The present disclosure relates to an inter-shard transaction system and method capable of verifying the legitimacy of an inter-shard transaction in the inter-shard transaction between accounts belonging to different shards in a blockchain network.

Abstract: A directed acyclic graph account-wise transaction chain (DAG-AWTC) ledger system includes a transaction-for-consensus configuration module which is for selecting a transaction for consensus for which a byzantine fault tolerance (EFT) consensus is to be executed with respect to a transaction of a DAG-A WTC, real-time configuring same, and outputting the real-time configured transaction for consensus to a BFT consensus execution module.

Abstract: A ledger verifiable pruning system includes a skewed Merkle tree production module in which according to a linked list scheme, root hash value Rn?1 of a previous sub-tree is included in data block Tn, data block Tn in which root has value Rn?1 is included is hashed, thereby obtaining h(Tn), obtained h(Tn) and root hash value Rn?1 of the previous sub-tree are summated and then hashed, thereby obtaining h(h(Tn)|Rn?1), and obtained h(h(Tn)|Rn?1) is successively added to respective nodes of a binary Merkle tree structure to expanding and produces a skewed Merkle tree.

Abstract: A directed acyclic graph account-wise transaction chain (DAG-AWTC) ledger system includes a transaction-for-consensus configuration module which is for selecting a transaction for consensus for which a byzantine fault tolerance (EFT) consensus is to be executed with respect to a transaction of a DAG-A WTC, real-time configuring same, and outputting the real-time configured transaction for consensus to a BFT consensus execution module.

Abstract: A ledger verifiable pruning system includes a skewed Merkle tree production module in which according to a linked list scheme, root hash value Rn?1 of a previous sub-tree is included in data block Tn, data block Tn in which root has value Rn?1 is included is hashed, thereby obtaining h(Tn), obtained h(Tn) and root hash value Rn?1 of the previous sub-tree are summated and then hashed, thereby obtaining h(h(Tn) |Rn?1), and obtained h(h(Tn) |Rn?1) is successively added to respective nodes of a binary Merkle tree structure to expanding and produces a skewed Merkle tree.