KR102349014B1 - Method and system for building fast synchronizable decentralized distributed database - Google Patents

Abstract

A method and system for configuring a decentralized distributed database using blockchain according to various embodiments relates to a method and system for configuring a decentralized distributed database managed by P2P network participants using blockchain technology, and modified Using the main chain, which is an impossible block chain, information about what kind of work should be done now is transparently provided to all participants, and the database status of the account along with account registration using the account chain in the form of a modifiable block chain is provided to all participants without leakage of personal information, the user requests synchronization of their data to the sidechain network without leakage of their personal information, and ‘approval’ required for synchronization of the entire database system using multiple sidechains is designed to proceed at high speed and to synchronize by configuring the commands required for synchronization into a smart contract. In the actual synchronization process, a local database that has completed synchronization provides data necessary for synchronization to other local databases that have not completed synchronization, thereby eliminating a bottleneck that appears when using a central database, and synchronizing accuracy of each local database We proposed a distributed database method and system that enables high-speed synchronization by allowing users to verify using the public main chain and account chain that cannot be forged or tampered with.

Description

Method and system for configuring a high-speed synchronization-capable decentralized distributed database

Various embodiments relate to a method and system for constructing a distributed database capable of high-speed synchronization managed by peer-to-peer (P2P) network participants using blockchain technology.

A distributed database is a type of database in which one database management system controls storage devices connected to several central processing units. In a small-scale distributed database, a fully centralized method in which the central server is in charge of managing each database distributed in several places is possible, but the centralized method is inefficient for databases of a certain size or larger. In databases larger than a certain size, each distributed database is managed independently, and a partial centralized method is widely used in which the contents of the entire database are synchronized by the command of the central server at regular intervals.

The role of the central database is absolute in both fully or partially centralized methods. A high reliance on a central database causes three disadvantages: The first disadvantage is the fact that large-scale facility investment is required to establish a centralized management system for managing large-scale distributed databases. This means that you have to pay a lot of money to use the database system. Also, due to the increase in facility investment, only a small number of database service providers can participate in the competition, which will cause the disadvantage of deepening the monopoly of the database industry. can The second disadvantage is that when a problem occurs in the central database, the entire distributed database system can be affected. For example, if the central database system goes down due to a natural disaster or cyber attack, the synchronization of the entire distributed database will also be delayed. The third and final disadvantage is that the high dependence of the central database increases the effectiveness of cyber attacks on the central database, which is a factor that causes more frequent cyber attacks. For example, forgery of specific data in the central database can have a forgery effect on the entire distributed database system, so the probability of being a target of a cyber attack is much higher than that of a local database.

If the contents recorded on the block chain are regarded as the contents recorded in the database, the block chain can be viewed as an example of a distributed database management system. The initial large-scale facility investment is not required for block chain configuration, and the distributed effort of P2P network participants ensures the reliability of the entire database even in the absence of reliable central management. In addition, since it is impossible to simultaneously forge and falsify databases distributed in numerous places other than the central database, the risk of forgery can be virtually eliminated. Depending on whether or not there are restrictions on the participants involved in block mining, the blockchain is divided into public blockchain (all participants in the P2P network can mine block) and private blockchain (only authorized participants can mine block). can be shared

There are several disadvantages to using a distributed database with the existing public blockchain developed as a distributed ledger of cryptocurrency. The first disadvantage is that the existing public blockchain cannot be modified and can only be added, so the problem is that the size of the blockchain must continue to increase. The second drawback is the lack of scalability. The existing public blockchain is slow to record and manage existing large-capacity data, and it is not suitable to directly record large-capacity data in the blockchain. The third disadvantage is that the data recorded on the blockchain must be disclosed due to the nature of the public blockchain, so it is not suitable for recording sensitive personal information on the blockchain.

가 복호과정에 사용하는 키(이하, 개인키라고 지칭됨)

와 다르다. 보다 구체적으로, 공개키 암호는 공개키

를 안다고 해도 개인키

를 구하는 것이 현실적으로 불가능하게 설계되어 있다. 이러한 성질을 이용하여 암호에 사용하는 키

를 공개하여 누구나 자신이 원하는 평문

을 암호문

를 하기 [수학식 1]과 같이 계산 할 수 있는데 반해, 하기 [수학식 2]와 같은 암호문

에 대한 복호화는 복호에 사용하는 키

의 소유자만이 가능하게 하는 암호체계를 구성할 수 있다.Unlike normal symmetric key cryptography, public key cryptography is the key used in the encryption process (hereinafter referred to as public key).

The key used in the decryption process (hereinafter referred to as the private key)

different from More specifically, public key cryptography is a public key

Even if you know the private key

It is designed to be practically impossible to obtain. Keys used for encryption using these properties

by making public the plain text that anyone wants

ciphertext

can be calculated as in [Equation 1], whereas the ciphertext as shown in [Equation 2] below

For decryption, the key used for decryption is

It is possible to construct a cryptosystem that only the owner of

의 소유자만이 할 수 있는 일을 시행하여 그것을 서명의 증거로 그 증거의 검증은 공개키를 이용하여 누구나 할 수 있게 하는 방법이다. 일부 공개키 암호들은 특정 연산에 대해 동형이다. 하기 [수학식 3]을 만족하는 경우 해당 공개키는 연산

에 대해 동형이라고 한다. The private key of public key cryptography is also used for digital signatures. in other words,

It is a method that can be done by anyone using a public key to do what only the owner of . Some public key ciphers are isomorphic for certain operations. If the following [Equation 3] is satisfied, the corresponding public key is calculated

is said to be homozygous for

의 예로는 덧셈, 곱셈, XOR등이 있다. 동형암호는 개별 암호문의 복화화 없이 연산

에 의한 계산결과에 대한 복호화를 하는 방법을 제공한다. Here, the operation

Examples include addition, multiplication, and XOR. Homomorphic ciphers are computed without decryption of individual ciphertexts.

It provides a method of decoding the calculation result by

Various embodiments relate to a method and a system for configuring a distributed database that can be synchronized by distributed effort and consensus of P2P network participants without the use of a central database, and a centralized database that occurs due to high dependence on the central database It provides a method to solve the shortcomings of the system and prevent damage due to leakage of database contents that may occur during the decentralization process.

A method for configuring a high-speed synchronization-capable decentralized distributed database according to various embodiments includes: configuring a main-chain based on nodes participating in a P2P network; accounts related to users of the nodes constructing an account-chain consisting of may include the step of configuring a distributed database by connecting to the main chain.

A system for configuring a high-speed synchronization-capable decentralized distributed database according to various embodiments includes nodes that participate in a P2P network and jointly configure and manage a distributed database, wherein the nodes are based on the nodes. , composing a main chain, composing an account chain composed of accounts related to users of the nodes, composing at least one side chain composed of a plurality of segments based on the main chain, and starting of the segments A distributed database can be constructed by connecting the and the end to the main chain.

According to various embodiments, there is an effect of solving the disadvantages of the centralized database system caused by the high dependence on the central database. Specifically, it reduces the need for large-scale facility investment required for the use of a centralized database system and allows database synchronization and management to be performed in a P2P network, thereby establishing an ecosystem where many small businesses can compete in the database service business. has the effect of In addition, even if some distributed database systems malfunction due to natural disasters or cyberattacks, damage is minimized by limiting the impact on the entire system, and the entire system is synchronized more quickly than the centralized database system in the recovery process after malfunction. To expand the advantages of a decentralized distributed database system, such as maintaining robustness and reliability against attacks against forgery and falsification of the entire decentralized distributed database at the same level or superior to those of the centralized database It works.

In addition, in an environment in which distributed collection and learning of data occurs, a decentralized distributed database structure may be used to provide services such as data integrity and authenticity guarantee for learning data in an individual environment. Through this, it is possible to determine the authenticity of the collected data, the authenticity of the learning data, and the like, and a tracking verification function for the model change of the federated learning can be provided.

1 is a diagram conceptually illustrating the relationship between a main chain and a side chain for configuring a distributed database according to various embodiments.
2 is a diagram exemplarily illustrating the relationship between a main chain and a side chain for configuring a distributed database according to various embodiments.
3 is a diagram illustrating a method of configuring distributed data in a system according to various embodiments of the present disclosure;

Hereinafter, various embodiments of the present document will be described with reference to the accompanying drawings.

Various embodiments relate to a method and system for configuring a high-speed synchronization-capable decentralized distributed database, and a method for configuring a synchronization-enabled distributed database managed by P2P network participants using multiple blockchain and off-chain data storage technology; provide that system.

Various embodiments include the steps of constructing a block chain that provides progress control and time stepping information of the entire system (let's call this the main-chain), information necessary to search the user's data in the local database (the account (let's call it an account) and configure a modifiable blockchain (let's call it an account-chain) to record the user's real data and a local off-chain datastore to store the user's real data, changes made in the user's database In accordance with this step, the user himself configures the contents performed in the local database's account chain and local off-chain data storage into a command set for the contents performed when synchronizing according to the A separate block chain (let's call this a side-chain. Such a side-chain can be used multiple times if necessary) is created by connecting it to the main chain, and at the same time creating a fragment of the side chain in progress. connecting to the main chain and terminating, requesting the sidechain network to approve the instruction set required for user database synchronization, and network participants constructing and mining blocks composed of smart contracts with the requested instruction set; and It is characterized in that when a chain segment is connected to the main chain, smart contracts belonging to the side chain fragment are executed to synchronize the entire distributed database.

1) Overall structure

In the distributed database according to various embodiments, the purpose of maintaining the same data through regular synchronization for a certain period of time regardless of whether the user is connected or not is the purpose of maintaining the same data of all local data storages to which the user is subscribed. It is to be noted here that it is assumed that the entire distributed database is not managed by a single database service provider, but is jointly managed by a plurality of database service providers and a plurality of data storage managers.

While managing one or more data storage, the data storage manager synchronizes the accounts that have signed up for their services using the contents of the account chain and the smart contract of the side chain connected to the main chain, which will be described later.

The database service provider manages one or more data storage management companies and synchronizes the accounts that have signed up for their services by using the smart contract of the side chain connected to the main chain and the contents of the account chain.

In order to protect their data, users can encrypt all data in block units, including the structure information of data such as directory or database schema, and store it in data storage. In addition, the user can have his or her account managed jointly by multiple database service providers and multiple local data storage managers.

2) Main chain

Various embodiments use the main chain that provides the progress control and time-stamping function of the entire system. This main chain can be composed of various types of block chains, and in this specification, as an example, the block chain model using the proof-of-work method used in Bitcoin will be used for explanation. It is obvious from the content that the technology according to various embodiments is applicable to other types of proof methods (eg, proof of stake).

(

)을 이용하여, 회전을

으로, 이 회전에서 추가되는 블록을

으로, 이 블록

이 추가된 메인체인을

으로 표시하자. 이 기호를 이용하여 회전

이 진행되는 상황에서 각 메인노드(메인체인 네트워크에 참여하는 개별 기기, 예: 참여자의 컴퓨터)가 가지고 있는 메인체인은

으로 표시할 수 있다. 상기한 기호들은 하기 [표 1]과 같이 정의된다. In the main chain according to various embodiments, a new block is calculated and added to the main chain every predetermined time (every 10 minutes in the case of Bitcoin) similar to the case of Bitcoin, and a cryptocurrency that is paid as a reward for the calculation is assumed to exist. At this time, the set time is called rotation, and the

(

) to rotate

, the block being added in this rotation

into this block

This added main chain

Let's mark it as Rotate using this symbol

In this situation, the main chain that each main node (individual devices participating in the main chain network, e.g., the participant's computer) has is

can be displayed as The above symbols are defined as in [Table 1] below.

second turn

rotation

block added from

rotation

main chain of each node in

blockchain

block on

main chain connecting

의 데이터는 바로 앞 블록

의 해쉬값

, 현 회전의 번호

, 그리고 현 회전이 시작되기 직전의 정보로 예측 불가능하지만 공개적으로 확인 가능한 정보(예: 태양의 흑점 활동정보, 현 회전이 시작되기 직전의 비트코인 블록)의 해쉬값

과, 현 블록의 해쉬값

의 포인터와 이 해쉬값을 구하는데 사용한 넌스값

등으로 구성되어 있다. 구체적으로, 메인체인에서의 해쉬값

과 넌스값

은 주어진

에 대하여, 하기[수학식 4]와 같은 작업증명의 해답으로 정의된다. block

data in the immediately preceding block

hash value of

, number of chord turns

, and the hash value of unpredictable but publicly verifiable information (e.g. sunspot activity information, Bitcoin block just before the start of the current rotation) as information just before the start of the current rotation.

and the hash value of the current block

A pointer to and the nonce value used to obtain this hash value.

It consists of etc. Specifically, the hash value in the main chain

and nonce value

is given

, is defined as the solution of the proof-of-work as shown in [Equation 4] below.

'은 비트열의 접합을 의미하고,

는 어떤 입력에 대해서든 출력으로 256 비트열을 생성하는 SHA-256 해쉬함수이고,

은

개의 0으로만 구성된 비트열을 의미하고,

는 256 비트열 중에서 처음

비트가

인 비트열의 집합을 의미한다(

= 비트열

의 길이). 즉,

은 256 비트열 중에서 처음

개의 비트가 모두 0인 비트열의 집합이다. 상기 [수학식 4]의 해쉬퍼즐을 만족하는 넌스값

에 대한 결과가 하기 [수학식 5]와 같이 블록

의 해쉬값이다.here, '

' means concatenation of bit strings,

is a SHA-256 hash function that generates a 256-bit string as an output for any input,

silver

It means a bit string consisting of only zeros,

is the first of the 256-bit strings

a bit

It means a set of bit strings (

= bit string

length of). in other words,

is the first of the 256-bit strings

It is a set of bit strings in which all bits are 0. A nonce value that satisfies the hash puzzle of [Equation 4]

The result for the block is as follows [Equation 5]

is the hash value of

은 해쉬퍼즐의 난이도를 결정하는데, 그 값이 크면 클수록 해당 해쉬퍼즐을 만족하는 넌스값을 계산하는 것이 어려워진다. 회전

에서 작업증명의 해답

을 가장 먼저 계산한 채굴자(작업증명에 참여하는 노드를 지칭함)는 블록

을 발표하고 이를 메인체인

에 연결하여 자신이 가지고 있는 메인체인을 하기[수학식 6]과 같이 확장한다. 다른 참여자들은 발표된 블록

을 검증하고 이에 대한 합의로 자신들의 메인체인에 추가한다. Coefficient of [Equation 4]

determines the difficulty of the hash puzzle, and the larger the value, the more difficult it is to calculate the nonce value that satisfies the hash puzzle. rotation

The answer to proof of work in

The first miner (referring to the node participating in the proof-of-work) who calculated

announced the main chain

Connect to and expand your main chain as shown in [Equation 6] below. The other participants are the blocks that have been announced

, and add them to their main chain as a consensus.

3) Account, data storage and account chain

The account includes information about the database user (e.g., the user's public key), information about the user's data (e.g., file reference information, hash pointer of a file in the data storage, reference information about the content to be changed during the synchronization process, and user's digital signature). The account itself does not contain the user's personal information or data directly, so there is no risk of information leakage when the account is disclosed.

회전(이 회전은 메인체인의 회전과 동일한 것이 아니다. 이 회전이 시작되었을 때의 계정체인을

으로 표시하자)에서 채굴되는 블록

은 바로 앞 블록

의 해쉬값

, 현 회전에서 생성되는 계정들

(여기서,

는 블록

에 포함될 계정의 수를 의미한다)의 목표값

(이에 대한 설명은 곧 등장할 것이다)과, 현 블록의 해쉬값

의 포인터와 이 해쉬값을 구하는데 사용한 넌스값

등으로 구성되어 있다. 계정

는 하기 [표 2]와 같은 정보를 가지고 있다. Various embodiments provide an account chain, which is a block chain consisting of accounts, along with an integrity verification method using a user's digital signature (this method is a well-known method, so a description thereof will be omitted in this specification) for defense against forgery attacks Forgery prevention method using homomorphic encryption is used. Specifically, the account chain

Rotation (This rotation is not the same as the rotation of the main chain. The account chain when this rotation started

(Let's denote it as ) blocks mined from

is the block just before

hash value of

, accounts created in the current rotation

(here,

is the block

refers to the number of accounts to be included in

(Explanation for this will appear soon) and the hash value of the current block

A pointer to and the nonce value used to obtain this hash value.

It consists of etc. account

has the same information as in [Table 2] below.

sign Contents

account

user's public key

account

target value of

account

target value of

input to

account

of data stored off-chain

electronic signature for

의 데이터의 오프체인 데이터스토리지에서의 저장정보

는 계정

가 동기화에 필요한 현재 상태를 가리킨다. 즉,

와 변경된 디렉토리, 파일 또는 변경된 내용의 (데이터스토리지에서의) 저장위치와 크기 등의 정보를 가지고 동기화를 진행한다. 이때, 실제 데이터 내용은 노출시키지 않게 동기화 직전의 상태를 표현하는데 필요한 모든 정보를 포함하고 있는 것이 바로

이다. 목표값을 설정하고 이를 블록의 해쉬값을 계산하는데 사용하여 블록체인에 수정 가능성을 제공하는 방법이 있다. 다양한 실시예들에서는 절단 해쉬값을 이용하는 방법을 제안한다. 다양한 실시예들에서는 동형암호를 이용한 방법을 제안한다. account

Stored information in off-chain data storage of data of

is the account

indicates the current state required for synchronization. in other words,

Synchronization is carried out with information such as the changed directory, file, or storage location and size (in data storage) of the changed contents. At this time, it is just that it contains all the information necessary to express the state immediately before synchronization so as not to expose the actual data content.

to be. There is a way to set a target value and use it to calculate the hash value of the block, giving the blockchain the possibility of modification. Various embodiments propose a method of using a truncated hash value. Various embodiments propose a method using homomorphic encryption.

의 목표값

에 대한 입력값

은 실제 구현에서 사용할 동형암호에 따라 결정된다. 이 명세서에서는 실시예로 1024비트 길이의 정수

에 대한 모듈로 덧셈에 동형인 Paillier 공개키 암호(이 공개키 암호를

로 표시하자)를 기준으로 설명하고자 한다. 계정

의 목표값

는 하기[수학식 7]과 같이 정의된다. account

target value of

input to

is determined according to the homomorphic cipher to be used in actual implementation. In this specification, an integer of 1024 bits in length as an embodiment

Paillier public-key cryptography homomorphic to modulo addition to

Let's denote it as ). account

target value of

is defined as follows [Equation 7].

는 1024비트를 생성하는 해쉬함수이고,

는 계정

의 사용자의 공개키이고,

의 덧셈은 정수

에 대한 모듈로 덧셈이다. here,

is a hash function that generates 1024 bits,

is the account

is the public key of the user of

The addition of is an integer

is a modulo addition to .

의 목표값

는 한 번 계산된 이후에는 변화하지 않는다. 계정

의 목표값

,

에 대한 입력값

, 그리고 현재의

에 대한 무결성 검증은 하기 [수학식 8]과 같이 계정

의 사용자의 전자서명으로 한다. 이에 대한 검증은 공개키

를 이용하여 시행한다.account

target value of

does not change once calculated. account

target value of

,

input to

, and the current

Integrity verification for the account as shown in [Equation 8]

of the user's electronic signature. Verification of this is public key

is implemented using

의 해쉬값

과 넌스값

은 주어진

에 대하여, 하기 [수학식 9]와 같은 작업증명의 해답으로 정의된다. block of account chain

hash value of

and nonce value

is given

, is defined as a solution to the proof of work as in [Equation 9] below.

은 계정체인의 채굴자에게 알려진 가장 최근의 메인체인의 블록 해쉬값으로,

이 메인체인에서 블록 해쉬값

이 계산된 이 후에 생성되는 계정들임을 증명하는데 사용한다. 만약, 계정체인의 어떤 채굴자가 상기 [수학식 9]에서 고의적으로 가장 최근의 메인체인의 블록 해쉬값보다 훨씬 더 오래된(메인체인의 블록 해쉬값의 전파지연을 감안한 것보다도 더 오래된) 블록 해쉬값을 사용하여 자신이 등록하고자 하는

의 등록시점을 앞당기려는 시도는 계정체인의 다른 채굴자들이 검증과정에서 사용된

의 계산시점과 현시점과의 차이를 고려하여 탈락시키는 규칙을 만들어 억제한다. 상기 [수학식 9]의 해쉬퍼즐을 만족하는 넌스값

에 대한 결과가 하기 [수학식 10]과 같이 블록

의 해쉬값이다.here,

is the most recent block hash value of the main chain known to miners of the account chain,

Block hash value in this main chain

It is used to prove that the accounts are created after this calculation. If a miner in the account chain deliberately has a block hash value that is much older than the most recent block hash value of the main chain in [Equation 9] above (older than that considering the propagation delay of the block hash value of the main chain) you want to register using

Attempts to advance the registration time of

In consideration of the difference between the calculation time of A nonce value that satisfies the hash puzzle of [Equation 9]

A block as in [Equation 10]

is the hash value of

번째 회전의 작업증명의 해답

을 가장 먼저 계산한 계정체인의 채굴자는 블록

을 발표하고 이를 계정체인

에 연결하여 자신이 가지고 있는 계정체인을 하기 [수학식 11]과 같이 확장한다. 다른 참여자들은 발표된 블록

을 검증하고 이에 대한 합의로 자신들의 계정체인을

로 업데이트한다. account chain

The answer to the proof-of-work of the second rotation

The miner of the account chain who first calculated

announced and the account chain

Connect to and expand your account chain as shown in [Equation 11] below. The other participants are the blocks that have been announced

verify their account chains and agree to them

update to

All nodes of the P2P network can participate in the main chain and the account chain. Through block mining, block rewards will be the main motivation for participation. For this, you can use cryptocurrencies and configure a separate blockchain to record those transactions.

On the other hand, local data storage managers and data service providers do not necessarily participate in the mining of the main chain and account chain, but they must participate in the management of the main chain and account chain. This is because they must participate in the synchronization of the entire database after verifying the stored information of each account using the main chain and the account chain.

의 해쉬값

이 해당 블록에 속해있는 계정들

자체가 아닌 그것들의

에 의존하기 때문에 목표값을 변화시키지 않는 수정은 전체 계정체인의 해쉬값에 의한 연결에 위배되지 않는다. The account chain is a modifiable blockchain. because the block

hash value of

Accounts belonging to this block

of them, not themselves

Modifications that do not change the target value do not violate the connection by hash value of the entire account chain because it depends on

Actual data of account users is stored in off-chain data storage to prevent actual leakage of user data.

4) Synchronization request

의 사용자가 특정 로컬 데이터베이스(이를 DB_A라고 하자)에 접속하여 데이터의 저장정보를

에서

가 되었다고 가정하자. 이 경우에 사용자의 데이터베이스 클라이언트 소프트웨어는 변화된 상황에 맞게 DB_A에 기록되어 계정

의 내용을 변화시킨다. 즉, 계정

의 데이터의 저장정보가

에서

로 변화를 사용자가 승인했다는 증거로 하기 [수학식 12]를 만족하는

로 계정

의

를 교체하고, 변화된 상황에 맞게

를 하기 [수학식 13]과 같이 교체한다. account

user of , connects to a specific local database ( _{let's call this DB A)}

at

Let's assume that In this case, the user's database client software is recorded in _{DB A according to the changed situation and}

change the content of i.e. account

data storage information of

at

As proof that the user has approved the change to [Equation 12]

account as

of

to replace and adapt to the changed situation

is replaced with the following [Equation 13].

의 소유자인 계정

의 사용자만이 상기 [수학식 12]를 만족하는

를 하기 [수학식 14]로 계산할 수 있다는 점이다.Here, it should be noted that the private key

account that is the owner of

Only users of [Equation 12] are satisfied

can be calculated by the following [Equation 14].

에서

로 변화시키는 필요한 작업(이하,

'라고 지칭됨)에 필요한 정보를 하기[수학식 15]와 같이 계산한다. This replacement _{only happened in DB A} , and it should be done in other databases as well. To this end, your database client software is stored

at

necessary work to change to (hereinafter,

') is calculated as follows [Equation 15].

는 두 저장정보

,

사이의 차이를 표현하는 정보이다. here,

is the two stored information

,

Information representing the difference between

를 다른 데이터베이스에서도 수행시켜 전체 분산 데이터베이스에서 계정

의 데이터 저장정보가

에서

로 변화된 것에 맞추어 계정

를 변화시켜야 한다. 이러한 요청을 사이드체인 네트워크라고 지칭할 P2P 네트워크에 요청한다. this

is also performed in other databases to account for the entire distributed database.

data storage information of

at

account in accordance with the change to

should change These requests are made to the peer-to-peer network, which we will refer to as the sidechain network.

5) Side-chain

Various embodiments try to perform 'approval' required for synchronization of the entire database system at high speed in a parallel processing method using multiple sidechains. Here, "approval" means deciding whether to propagate changes occurring in a specific local database to the entire distributed database.

There is a method to modify the contents recorded in a block using multiple blockchains. Various embodiments propose a method of modifying an account chain that exists separately from the main chain and modifying data located off-chain using a side chain.

의 목표값

의 끝 3자리 비트(이들은 000, 001, ..., 111중에 하나이다)를 이용하여 어느 사이드체인에 의해 동기화에 대한 승인이 이루어질지가 결정된다. As an example, let's assume that 8 sidechains are used. Each account allows a pre-determined by which sidechain to synchronize.

target value of

Using the last 3 bits of (these are one of 000, 001, ..., 111), it is determined by which sidechain will approve the synchronization.

이 결정한다. 구체적으로,

-사이드체인(목표값

의 끝 3자리 비트가 000인 계정들의 동기화의 승인을 담당할 사이드체인)의 첫 단편은

로 표시하는데, 이는 메인체인의 블록 해쉬값

의 끝 3자리 비트가 처음으로 000이 되는

에서 시작하여 그 다음으로 000이 되는

이 등장할 때까지 계속된다는 의미이다. 같은 방법으로

으로 표시되는

-번째 단편은 메인체인의 블록 해쉬값

의 끝 3자리 비트가

-번째로 000이 되는

에서 시작하여 그 다음으로 메인체인의 블록 해쉬값

의 끝 3자리 비트가 000이 되는

이 등장할 때까지 계속된다. A sidechain consists of segments connected to the main chain at the beginning and the end, and the start and end of each segment is the block hash value of the main chain.

this decides Specifically,

-Sidechain (target value)

The first fragment of the sidechain that will be responsible for authorizing the synchronization of accounts with the last 3 bits of 000) is

, which is the block hash value of the main chain.

where the last three bits of the first become 000

starting at , then 000

This means that it will continue until it appears. in the same way

displayed as

-The first fragment is the block hash value of the main chain

the last 3 bits of

- the first to be 000

Starting with , then the block hash value of the main chain

where the last 3 bits of

This continues until this appears.

내의 블록에 대해서 살펴보도록 하자. 메인체인에서 블록 해쉬값

(이 해쉬값의 끝 3자리비트가 000이었다)가 발표되면 바로

-사이드체인 네트워크의 채굴자들은

-사이드체인에 동기화에 대한 승인 요청

(상기 [수학식 15] 참조)을 검증하고 검증이 통과된 것들을 블록

에 포함시켜 해당 블록을 채굴하려고 시도한다. 여기서, 블록을 표현하는

는

-사이드체인의

-번째 단편의

-번째 블록을 의미한다. Now, the sidechain fragment

Let's take a look at the blocks within. Block hash value on the main chain

(The last 3 bits of this hash value were 000) When it is announced

- Miners in the sidechain network

- Request approval for sync to sidechain

(Refer to [Equation 15] above) and block those that have passed the verification

Attempts to mine the block by including it in Here, the block representing

Is

- of side chain

- of the second fragment

- means the second block.

가 채굴되는 과정은, 하기 [수학식 16]과 같이 주어진

에 대하여, 작업증명방식으로 정의된다. block

The process in which is mined is given as in [Equation 16]

For , it is defined as a proof-of-work method.

은 직전 블록

의 해쉬값이고

은 현 블록에서 검증하고자 하는 계정의 저장정보의 변경 요청들이다. 사이드체인의 채굴자들은 요청

에 대한 검증을 실시하는데 그 대상은 상기 [수학식 15]의

의 예를 가지고 설명한다면 다음과 같다. here,

the previous block

is the hash value of

are requests to change the stored information of the account to be verified in the current block. Sidechain miners request

, and the target of [Equation 15] above is

To explain with an example of

의 위치를 이용하여 계정

의 저장정보 확인(데이터 변경이 실제로 진행된 로컬 데이터베이스를 제외하고 계정

의 사용자가 가입한 모든 데이터베이스에서는

이어야 함).(One)

account using the location of

Check the stored information of

In all databases subscribed by users of

should be).

를 진행하면

로 변화하는지 검증.(2)

If you proceed

verify that it changes to .

가

에 맞게 제시되었는지 확인.(3) input value

go

Make sure it is presented in accordance with the

의 전자서명

검증 (4) account

electronic signature of

Verification

에 대한 결과가 하기 [수학식 17]과 같이 블록

의 해쉬값이다.A nonce value that satisfies the hash puzzle of [Equation 16]

The result for the block is as follows [Equation 17]

is the hash value of

-사이드체인의 해쉬퍼즐의 해답

을 가장 먼저 계산한

-사이드체인의 채굴자는 블록

을 발표하고 이를 사이드체인 단편에 연결하여 확장한다. 다른

-사이드체인의 참여자들은 발표된 블록

을 검증하고 이에 대한 합의로 자신들의 사이드체인 단편에 연결하여 확장한다.

-The answer to the hash puzzle of the sidechain

was first calculated

- The miner of the sidechain is a block

, and extend it by linking it to a sidechain fragment. Different

-Participants in the sidechain will participate in the announced block

Validate and expand by connecting to their sidechain fragments with consensus.

은 스마트 계약으로 기록되어 이것들이 기록된 블록

을 포함하고 있는 사이드체인 단편

이 메인체인에 연결될 때 전체 시스템에 적용되도록 설계된다. 예를 들어, 계정체인에서의 계정정보의 수정은 스마트 계약

이 메인체인에 연결되는 즉시 실시된다. request for change

is recorded as a smart contract and the block in which these are recorded

A sidechain fragment containing

It is designed to be applied to the entire system when connected to the main chain. For example, the modification of account information in the account chain is a smart contract

It will be implemented as soon as it is connected to this main chain.

-사이드체인의

-번째 단편

의 블록은 하기 [수학식 18]과 같다.connected to the main chain

- of side chain

-th fragment

The block of [Equation 18] is as follows.

은 메인체인의 연결되는 블록

이고, 즉,

이고, 맨 마지막 블록

도 메인체인의 연결되는 블록

이다. 이때, 사이드체인 단편을 메인체인에 연결시키기 위해 메인체인의 해쉬값을 하기[수학식 19]와 같이 변화시킨다. Here, the first block

is a block connected to the main chain

is, that is,

and the last block

Blocks connected to the domain chain

to be. At this time, in order to connect the sidechain fragment to the main chain, the hash value of the main chain is changed as follows [Equation 19].

Fragments of other sidechains can also be defined in the manner described so far.

1 is a diagram conceptually illustrating the relationship between a main chain and a side chain for configuring a distributed database according to various embodiments. 2 is a diagram exemplarily illustrating the relationship between a main chain and a side chain for configuring a distributed database according to various embodiments.

Referring to FIG. 1 , at least one side chain may be connected to one main chain. In this case, one side chain or a plurality of side chains may be connected to one main chain. The configuration of a decentralized distributed database with a high-speed synchronization function can be operated in an individual independent system environment or in a cloud environment. For example, as shown in Figure 2, the main chain (B) and side chains ( S ₀ , S ₃ ) operate in a cloud-based instance environment, and the side chains ( S ₁ , S ₂ ) are separate independent systems. This is an example of a structure that works with This structure can be applied to a configuration in which the main chain operates as a separate and independent system, and some or all of the side chains operate in a cloud environment. In addition, when data collection in the edge computing environment or services such as federated learning using individual data are provided, it can be used as a structure for data integrity and guarantee in each edge environment.

6) Synchronization progress

의 사용자가 DB-A에서 데이터의 저장정보를

에서

로 변화시키는 작업을 진행하였고 이를 전체 분산 데이터베이스에서 동일하게 하는 동기화를 요청하였다고 가정하자. 이를 위해 사용자의 클라이언트 소프트웨어는 동기화에 필요한 요청

를 자신의 계정의 수정을 다루는 사이드체인 네트워크에 요청하였고, 해당 요청은 사이드체인에서 검증된 후에 메인체인에 연결되어 메인체인의 모든 참여자들(로컬 데이터스토리지 관리자들과 데이터서비스 제공자들은 반듯이 참여해야 한다고 가정하였다)에게 알려지게 되었다고 가정하자. account

user of DB-A saves data

at

Assume that the task of changing to . To do this, the user's client software makes the necessary requests for synchronization.

requested to the sidechain network that handles the modification of one's account, and the request is verified on the sidechain and then connected to the mainchain, saying that all participants in the mainchain (local data storage administrators and data service providers must participate) Assume that it became known to

의 동기화는 실제 데이터에 대한 접근을 요구한다. 이때 사용자의 개인정보의 유출이 우려된다면 앞에서 언급한 바와 같이 사용자는 디렉토리를 포함한 전체 데이터를 블록단위로 나누어 암호화하여 보관하고 동기화 과정에서는 교체가 필요한 암호화된 블록을 교체하여 동기화를 완료할 수 있다. account

Synchronization of data requires access to real data. At this time, if there is a concern about the leakage of the user's personal information, as mentioned above, the user can encrypt and store the entire data including the directory by block unit, and replace the encrypted block that needs to be replaced during the synchronization process to complete the synchronization.

의 동기화의 과정에 참여한 데이터스토리지 관리자가 해야 할 활동을 살펴보도록 하자. 먼저, 관리자는 메인체인과 그것에 연결되어 종료된 사이드체인 단편을 검색하여 현 메인체인의 회전에서 자신이 동기화해야 할 계정이 있는지 파악한다. 만약, 계정

의 동기화를 자신이 담당(자신의 서비스에 가입되어 있는 계정이므로)해야 하고 해당 동기화 필요한 실제 데이터가 DB_A에 있다면 그곳에 접속하여 해당 데이터를 얻으려 할 것이다. 이는 병목현상을 야기할 수 있는데, 본 발명에서는 반드시 DB_A에서만 해당 데이터를 얻을 필요가 없게 하여 해당 문제를 해결하고자 한다. 만약, 다른 데이터베이스 DB_B에서 해당 데이터를 DB_A에서 얻어 동기화를 완료하였다면 일부 다른 데이터스토리지 관리자들은 DB_B에서 해당 데이터를 얻어 동기화를 진행하면 된다. 이 과정에서 DB_B의 동기화가 최신의 것인지 또는 정상적인 것인지는 계정체인과 메인체인을 이용하여 확인할 수 있다. 물론, 데이터서비스 제공업체 또는 그들의 연합체가 좀 더 신속한 동기화에 도움을 줄 수도 있다. Now, account

Let's take a look at the activities that the data storage administrator who participated in the process of synchronization of First, the administrator searches for the main chain and the fragments of the sidechains that are connected to it and finds out if there are accounts that they need to synchronize in the current main chain rotation. If the account

If you have to be in charge of synchronization (because it is an account that is subscribed to your service) and the actual data required for synchronization is in DB _A , you will try to access it and get the data. This may cause a bottleneck, and in the present invention, it is not necessary to obtain the corresponding data only from _{DB A, thereby solving the problem.} If synchronization is completed by obtaining the corresponding data from DB _A from another database, DB _B , some other data storage managers can obtain _{the data from DB B} and proceed with synchronization. In this process, _{whether the synchronization of DB B} is up-to-date or normal can be checked using the account chain and the main chain. Of course, data service providers or their associations can help with faster synchronization.

When a user accesses a local data service, he or she can immediately check whether the database is up to date by searching the account chain and main chain.

[Table 3] below shows the process of synchronizing the entire system from a user's request.

order sign Contents One

in DBAU:

in DBA A user _{connects to DB A} , changes data, and synchronizes the data.

write One U

SCN:

user

request SCN to approve 2 SCN:

in

SCN

block containing

Mining the sidechain fragment

connect to 3 MCN:

in MC MCN

by connecting to MC

notifies system participants of the 4 All update MC and AC MC and AC updates of system participants themselves 5 DBB

DBA: data DB _B receives the data required for synchronization from DB _{A and completes the synchronization.} 6 DB _C

DB _B : data DB _C is Synchronization is completed by receiving the data required for synchronization from DB _B. In this process, MC and AC are used to verify _{DB B.}

Here, U means user, MC means main chain, AC means account chain, SC means side chain, MCN means main chain network, CAN means account chain network, , SCN means sidechain network, DBA means database-A (where the user changes data), DB _B means database-B ( _{receiving data from DB A} and synchronizing), DB _C stands for Database-C ( _{receiving data from DB c} and proceeding with synchronization).

7) Storage of main chain, account chain, and side chain

Participants in the distributed database system proposed in various embodiments need to keep the entire account chain, but in the case of the main chain and side chain, it is sufficient to keep only the latest data. On the other hand, the account chain itself is mainly for the purpose of modifying account contents, and the size does not increase. Therefore, the burden of costs required for the storage of the main chain, account chain, and side chain is limited.

8) Compensation for block mining using cryptocurrency

As a reward for block mining of the main chain, account chain, and side chain, cryptocurrency is created and compensated, and a separate blockchain can be used to manage the cryptocurrency. In addition, it is possible to construct a compensation system for the operation of the entire system by having users of the database system pay all or part of the cost to be paid in exchange for service provision in cryptocurrency.

3 is a diagram illustrating a method of configuring distributed data in a system according to various embodiments of the present disclosure;

Referring to FIG. 3 , nodes of the P2P network may configure a main chain in step 310 . At this time, the main chain can be configured based on nodes. Here, the main chain may be configured in the form of a block chain.

The nodes of the P2P network may configure a local database as an account chain and a local off-chain data storage in step 320 . In this case, the account chain may consist of accounts related to users of nodes. Here, the account chain may be configured in the form of a block chain. And, the local off-chain data storage can store data about users.

Nodes of the P2P network may configure at least one sidechain based on the main chain in step 330 . At this time, each side chain is configured based on the main chain and may consist of a plurality of segments. Here, the side chain can be configured using the block hash value of the main chain.

Nodes in the P2P network can configure a distributed database by connecting the sidechain to the main chain in step 340. Through this, nodes of the P2P network can jointly manage the distributed database. At this time, nodes in the P2P network can synchronize the distributed database through the sidechain. A sidechain can synchronize the distributed database based on the approval of changes to the data of any one of the users in the local off-chain datastore. For example, multiple sidechains can process authorization in parallel to synchronize distributed databases. Here, when the sidechain constructs a smart contract based on approval, and the smart contract is connected to the main chain, the account chain can change the account of any one of the users.

The distributed database configuration method according to various embodiments uses the main chain, which is an unmodifiable public blockchain, to transparently provide information about what kind of work should be done to all participants, and the account chain, which is a public blockchain that can be modified. At the same time, it is possible to transparently provide all participants with information stored in the data storage for the user's data recorded in the account (eg, a hash pointer of the stored data) while registering an account using

According to various embodiments, real data is stored off-chain and only hash pointers of the stored data are recorded in the account chain, so that the user can request data synchronization from the sidechain network without leaking his or her personal information.

According to various embodiments, the 'approval' required for synchronization of the entire database system is performed at high speed in a parallel processing method using multiple sidechains, and the commands required for synchronization are configured into a smart contract so that the sidechain fragment is converted to the main chain. Synchronization can proceed when connected to

According to various embodiments, the local database that has completed synchronization in the synchronization process provides data necessary for synchronization to other local databases that have not completed synchronization, thereby eliminating a bottleneck that appears when using the central database, and each local database Synchronization accuracy can be checked using the main chain and the account chain.

According to various embodiments, consensus on the database change timing of each account can be provided to all participants (users, database service providers, data storage administrators, account chain miners, side miners) using the main chain .

According to various embodiments, it is possible to dramatically reduce the size of the storage space required to store the account chain by using a block chain that can be modified in the account chain.

According to various embodiments, a method of setting a target value using a homomorphic password to configure an account chain, which is a modifiable block chain, and using it, only a user can make a synchronization request (the [Equation 14 above] ] Reference).

According to various embodiments, a cryptocurrency is created and compensated for block mining of the main chain, account chain, and side chain, a separate block chain for managing the cryptocurrency is used, and the user of the database system It is possible to establish a compensation system for the operation of the entire system by having them pay all or part of the cost they have to pay in exchange for service in cryptocurrency.

According to various embodiments, it is possible to transparently check the synchronization accuracy of each local database using the main chain and the account chain.

According to various embodiments, the main chain and account chain are used to transparently manage the accuracy of synchronization to provide an ecosystem in which multiple database service providers and data storage managers can compete, while several companies provide services as a federation. can provide

The various embodiments of this document and the terms used therein are not intended to limit the technology described in this document to a specific embodiment, but it should be understood to include various modifications, equivalents, and/or substitutions of the embodiments. In connection with the description of the drawings, like reference numerals may be used for like components. The singular expression may include the plural expression unless the context clearly dictates otherwise. In this document, expressions such as “A or B”, “at least one of A and/or B”, “A, B or C” or “at least one of A, B and/or C” refer to all of the items listed together. Possible combinations may be included. Expressions such as “first”, “second”, “first” or “second” can modify the corresponding components regardless of order or importance, and are only used to distinguish one component from another. It does not limit the corresponding components. When an (eg, first) component is referred to as being “connected (functionally or communicatively)” or “connected” to another (eg, second) component, the component is It may be directly connected to the component or may be connected through another component (eg, a third component).

As used herein, the term “module” includes a unit composed of hardware, software, or firmware, and may be used interchangeably with terms such as, for example, logic, logic block, component, or circuit. A module may be an integrally formed part or a minimum unit or a part of performing one or more functions. For example, the module may be configured as an application-specific integrated circuit (ASIC).

According to various embodiments, each component (eg, a module or a program) of the described components may include a singular or a plurality of entities. According to various embodiments, one or more components or operations among the above-described corresponding components may be omitted, or one or more other components or operations may be added. Alternatively or additionally, a plurality of components (eg, a module or a program) may be integrated into one component. In this case, the integrated component may perform one or more functions of each component of the plurality of components identically or similarly to those performed by the corresponding component among the plurality of components prior to integration. According to various embodiments, operations performed by a module, program, or other component are executed sequentially, in parallel, repeatedly, or heuristically, or one or more of the operations are executed in a different order, omitted, or , or one or more other operations may be added.

Claims (15)

A method for constructing a high-speed synchronization capable decentralized distributed database, the method comprising:
configuring a main-chain based on the nodes participating in the P2P network;
constructing an account-chain comprising accounts associated with users of the nodes;
constructing at least one side-chain comprising a plurality of segments based on the main chain;
connecting the beginning and the end of the segments to the main chain to configure a distributed database; and
Synchronizing the distributed database based on the sidechain's approval of changes to data of any one of the users;
Synchronizing the distributed database comprises:
constructing, by the sidechain, a smart contract based on the approval; and
and when the smart contract is connected to the main chain, the account chain changing the account of any one of the users.
delete The method of claim 1,
A method in which the main chain and the account chain are configured in the form of a block chain.
The method of claim 1,
and configuring a local off-chain datastore to store data about the users.
5. The method of claim 4, wherein configuring the account chain and configuring the local off-chain data storage comprises:
A method of configuring a local database with the account chain and the local off-chain data storage.
The method of claim 1, wherein the step of constructing the sidechain comprises:
and constructing the side chain by using the block hash value of the main chain.
The method of claim 1, wherein synchronizing the distributed database comprises:
A method in which a plurality of sidechains process the authorization in parallel to synchronize the distributed database.
delete A system for constructing a high-speed synchronization capable decentralized distributed database,
It includes nodes that participate in the P2P network and jointly configure and manage a distributed database,
The nodes are
Based on the nodes, the main chain is constructed,
construct an account chain consisting of accounts related to users of the nodes;
Based on the main chain, at least one side chain consisting of a plurality of segments is configured,
By connecting the start and end of the segments to the main chain, a distributed database is constructed,
Synchronize the distributed database based on the approval of changes to the data of any one of the users through the sidechain;
The nodes are
Through the sidechain, construct a smart contract based on the approval,
A system for changing the account of any one of the users in the account chain when the smart contract is connected to the main chain.
delete 10. The method of claim 9, wherein the nodes are:
A system for configuring local off-chain data storage for storing data about the users.
12. The method of claim 11, wherein the nodes are:
A system for configuring a local database with the account chain and the local off-chain data storage.
10. The method of claim 9, wherein the nodes are:
A system for configuring the sidechain by using the block hash value of the main chain.
10. The method of claim 9, wherein the nodes are:
A system for synchronizing the distributed database by processing the authorization in parallel through a plurality of sidechains. delete

Images