Locus Chain-Preis 

LOCUS

*DAG(Directed Acyclic Graph) - AWTC(Account-Wise Transaction Chain)

The AWTC, Account-Wise-Transaction-Chain, is a central data structure for Locus Chain's high capacity, distributed transaction processing. AWTC is a Directed-Acyclic-Graph (DAG) based data structure composed of multiple transaction chains, each for an account. Each account has its dedicated chain. A new transaction issued by an account is primarily added to the account's chain. Block grid structures, including DAG-AWTC, do not cause conflicts because there are as many points as the number of accounts to which the transaction is added, and only the owning account can record it exclusively. Also, the account that added the transaction becomes clear, so if the account holder himself is not a malicious user, the transaction is almost confirmed as soon as it is added. The ledger structure of the Locus Chain is one of the main technical features to fundamentally solve the problem of delayed transaction processing that the existing blockchains had.

• POS - BFT Consensus Algorithm * Given the time required for the data to propagate sufficiently to the network, the Locus Chain first implemented a BFT definitive consensus on the DAG by attempting to consent on a small amount of historical points of time. It also selects a new proposer committee that participates in the consensus algorithm every round by a random verifiable function (VRF) based on stochastic PoS (proof of stake: the more shares, the higher the probability of being elected as a committee). Since these methods cannot identify or predict the nodes (proposer, validator) to participate in the consensus, manipulation by malicious attacks is difficult, ensuring fairness and network stability of the consensus results.

*Verifiable Pruning

Unlike traditional pruning, which reduces the size of a ledger by simply deleting old data to address growing ledger sizes, Locus Chain's Verifiable Pruninng uses a Skewed Merkle Tree structure to validate the legitimacy of the data even when most of the previous data is deleted in the local environment. Verifiable pruning deletes outdated data on the ledger while still being able to provide full data verification by verifying previous data with hash values.

*Dynamic Sharding

Locus Chain has a ledger structure formed of each account (AWTC), making it easy to adjust the number and size of the shard, and the validator ratio by relocating the shard in the event of an imbalance between shards. With dynamic sharding, the network usage that a node has to cover is reduced to 2/N when the number of shards is N. The total network TPS for network usage on the same node will increase by that amount, plus the additional ledger state sharding, which will also divide the storage usage by the number of shards.