KR20220041334A - Blockchain system with zero-knowledge proof virtual machine applied for general operation - Google Patents

Abstract

According to an embodiment of the present invention, a blockchain system to which a zero-knowledge proof based virtual machine is applied capable of general operation verification comprises: a circuit generator for general operation verification configured to generate a circuit for general operation verification having the reference number of commands, the reference number of machine steps, and a size of an existing system and configured to generate a proof key and a verification key by using the circuit for general operation verification and a zero-knowledge succinct non-interactive argument of knowledge (zk-SNARK) algorithm; a prover terminal configured to generate an evidence by using the proof key including the circuit for general operation verification, a coefficient of a polynomial function obtained through the zk-SNARK algorithm, and information necessary for verification and proof in the circuit for general operation verification; and a verifier terminal configured to verify whether the evidence is valid by using the verification key, the information necessary for verification and proof in the circuit for general operation verification, and the evidence.

Description

A blockchain system with a zero-knowledge proof-based virtual machine that can verify general operations {BLOCKCHAIN SYSTEM WITH ZERO-KNOWLEDGE PROOF VIRTUAL MACHINE APPLIED FOR GENERAL OPERATION}

The present invention relates to a blockchain system to which a zero-knowledge proof-based virtual machine capable of general operation verification is applied. It relates to a blockchain system to which a zero-knowledge proof-based virtual machine capable of general operation verification that can quickly verify that the contents of a block has not been forged/altered is applied.

Blockchain refers to a distributed digital ledger that secures the integrity of transaction details and allows participants to share details without the intervention of a trusted third party in a peer-to-peer (P2P) network.

Representative examples of blockchain applications are cryptocurrencies such as Bitcoin and Ethereum. After Ethereum introduced the Ethereum Virtual Machine (hereinafter referred to as EVM), EVM allows users to program directly according to the way they want, rather than performing a predefined set of tasks.

However, EVM has problems in that efficiency is very low compared to existing virtual machines such as JVM (Java Virtual Machine), and it is difficult to support complex application environments.

Numerous blockchain implementations have appeared in the past 10 years, but there has been no innovation in terms of accumulating and storing transactions.

In other words, since a separate verification algorithm is used for each type of transaction, the verification burden increases as the size of the transaction increases. There is a need to lead structural innovation.

Blockchain is divided into a simple block chain made of UTXO (Unspent Transaction Output), represented by Bitcoin, and a complex block chain that handles a state tree like Ethereum.

Currently, zero-knowledge proof is used only when processing some transactions in a simple blockchain. In this case, the zero-knowledge proof refers to a system that proves to the verifier that the prover knows the knowledge without disclosing the knowledge and information that the prover knows.

An object of the present invention is to provide a block chain system to which a zero-knowledge proof-based virtual machine capable of general operation verification by applying a circuit capable of general operation verification to a virtual machine is applied.

In addition, the present invention provides a block chain system to which a zero-knowledge proof-based virtual machine capable of general operation verification that enables zero-knowledge proof to be utilized not only in a predefined type of transaction but also in various types of transactions desired by a user. aim to

In addition, the present invention provides a general operation verification that enables the node that performs the role of proof and report among all nodes to quickly verify that the contents of the block are not forged/falsified even if the blockchain participants do not know the contents of the block. It aims to provide a blockchain system to which a zero-knowledge proof-based virtual machine that can verify possible general operations is applied.

In addition, an object of the present invention is to provide a blockchain system to which a zero-knowledge proof-based virtual machine capable of performing general operation verification that rapidly increases the block sync speed to participants so that new participants can quickly participate in the network.

In addition, when the zero-knowledge proof technique is applied to transactional data storage, the present invention prunes the actual data and compresses the data in a way that only leaves the proof of the data to save the data storage space. It aims to provide a blockchain system to which a verifiable zero-knowledge proof-based virtual machine is applied.

The objects of the present invention are not limited to the above-mentioned objects, and other objects and advantages of the present invention not mentioned may be understood by the following description, and will be more clearly understood by the examples of the present invention. It will also be readily apparent that the objects and advantages of the present invention may be realized by the means and combinations thereof indicated in the appended claims.

To achieve this purpose, a blockchain system to which a zero-knowledge proof-based virtual machine capable of general operation verification is applied creates a circuit for general operation verification having the number of reference instructions, the number of reference machine steps, and the size of the reference system, A circuit generator for general operation verification that generates a proof key and verification key using a circuit for general operation verification and zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) algorithm, and a proof including the general operation verification circuit A prover terminal that generates evidence using a key, a polynomial coefficient obtained through the zk-SNARK algorithm, and information necessary for verification and proof among the general operation verification circuit, and the verification key, the general operation verification circuit and a verifier terminal that verifies whether the evidence is valid by using the information and the evidence required for verification and verification.

The circuit generator for general operation verification includes a circuit generation module that generates a circuit for general operation verification that operates in any program having the number of reference instructions, the number of reference machine steps, and the size of the reference system, and the key generator information and prover information and a zk-SNARK key generation module that, after receiving the verifier information, generates a proof key and a verification key by using a security parameter and a circuit for general operation verification generated by the circuit generation module.

The zk-SNARK key module converts the verification rule into a mathematical form indicating a triple vector, and then converts the verification rule converted into the triple vector into a Lagrange polynomial or fast Fourier transform to generate a polynomial function, and the circuit generation module performs mathematical Using Equation 1, a circuit for general operation verification is created.

[Equation 1]

C =

C: circuit

: 기준 명령어의 개수,

: the number of standard commands,

T: number of reference machine steps,

n: size of reference system

In addition, in the method for generating a zero-knowledge proof circuit for general operation verification to achieve this purpose, the circuit generator for general operation verification generates a circuit for general operation verification having the number of reference instructions, the number of reference machine steps, and the size of the reference system. generating, by the circuit generator for general operation verification, a proof key and verification key using the general operation verification circuit and zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) algorithm, a prover terminal Generating evidence using a proof key including the general operation verification circuit, polynomial function coefficients obtained through the zk-SNARK algorithm, and information necessary for verification and verification among the general operation verification circuits and verification and executing, by the self-terminal, verifying whether the evidence is valid using the verification key, information necessary for verification and verification among the general operation verification circuit, and the evidence.

In the step of generating the proof key and verification key, after the circuit generator for general operation verification receives the key generator information, prover information, and verifier information, security parameters and general operation verification generated by the circuit generation module and generating a proof key and a verification key by using a circuit for use, wherein the circuit generating module generates a circuit for verification of general operations using Equation (1).

[Equation 1]

C =

C: circuit

: 기준 명령어의 개수,

: the number of standard commands,

T: number of reference machine steps,

n: size of reference system

The generating of the proof key and the verification key includes converting a verification rule into a mathematical form indicating a triple vector, and then converting the verification rule converted into the triple vector into a Lagrange polynomial or fast Fourier transform to generate a polynomial function and verification and generating a polynomial function by transforming the rule into a mathematical form indicating the triple vector, and then transforming the verification rule converted into the triple vector into a Lagrange polynomial or fast Fourier.

According to the present invention as described above, there is an advantage that general operation verification is possible.

In addition, according to the present invention, there is an advantage that zero-knowledge proof can be utilized not only for a predefined type of transaction but also for various types of transactions desired by a user.

In addition, according to the present invention, even if the block chain participant does not know the contents of the block, there is an advantage that the node performing the role of proof and reporting among all nodes can quickly verify that the contents of the block are not forged/falsified.

In addition, according to the present invention, there is an advantage that new participants can quickly join the network by rapidly increasing the block sync speed for the participants.

In addition, according to the present invention, when the zero-knowledge proof technology is applied to transactional data storage, the data storage space can be saved by compressing the data in a way that prunes the actual data and leaves only the proof of the data. there is.

1 is a block diagram for explaining the internal structure of a blockchain system to which a zero-knowledge proof-based virtual machine capable of general operation verification according to an embodiment of the present invention is applied.
2 is a block diagram for explaining the internal structure of a circuit generator for general operation verification according to an embodiment of the present invention.
3 is a flowchart for explaining an embodiment of a method for generating a zero-knowledge proof circuit for general arithmetic verification according to the present invention.
4 is an exemplary diagram for explaining a process of generating a zero-knowledge proof circuit for general arithmetic verification according to the present invention.

The above-described objects, features and advantages will be described below in detail with reference to the accompanying drawings, and accordingly, those of ordinary skill in the art to which the present invention pertains will be able to easily implement the technical idea of the present invention. In describing the present invention, if it is determined that a detailed description of a known technology related to the present invention may unnecessarily obscure the gist of the present invention, the detailed description will be omitted. Hereinafter, preferred embodiments according to the present invention will be described in detail with reference to the accompanying drawings. In the drawings, the same reference numerals are used to indicate the same or similar components.

Among the terms used in this specification, “zero knowledge proof (ZKP)” means that in cryptography, when a prover proves that a certain proposition is true to the other verifier, any knowledge is exposed except whether the proposition is true or false. It means a procedure of interaction that does not let it happen.

The party who wants to prove that a proposition is true is called the prover, and the party who participates in the proof process and exchanges information with the prover is called the verifier. If the parties participating in the zero-knowledge proof arbitrarily change the protocol for the purpose of deceiving the other party, the parties are said to be dishonest or dishonest. Otherwise, it is said to be honest.

1 is a block diagram for explaining the internal structure of a blockchain system to which a zero-knowledge proof-based virtual machine capable of general operation verification according to an embodiment of the present invention is applied. 2 is a block diagram for explaining the internal structure of a circuit generator for general operation verification according to an embodiment of the present invention.

Referring to FIG. 1 , a blockchain system to which a zero-knowledge proof-based virtual machine capable of general operation verification is applied includes a circuit generator 100 for general operation verification, a prover terminal 200 and a verifier terminal 300 .

The circuit generator 100 for general operation verification is a device for generating a circuit for general operation verification. The circuit generator 100 for general operation verification includes a circuit generating module 110 and a zk-SNARK key generating module 120 as shown in FIG. 2 .

The circuit generation module 110 receives the number of reference instructions, the number of reference machine steps, and the size of the reference system, and verifies general operations that operate in any program having the number of reference instructions, the number of reference machine steps, and the size of the reference system. After generating a circuit for use, a circuit for general operation verification is provided to the zk-SNARK key generation module 120 .

이하의 명령어, T 이하의 머신 스텝, n 이하의 크기를 갖는 어떤 프로그램에서도 동작하는 서킷을 생성할 수 있다.In an embodiment, the circuit generating module 110 generates a circuit for general operation verification satisfying the following [Equation 1]. That is, the circuit generator 100 for general operation verification is

You can create a circuit that runs on any program with the following instructions, machine steps less than T, and size less than n.

[Equation 1]

C =

C: circuit

: 기준 명령어의 개수,

: the number of standard commands,

T: number of reference machine steps,

n: size of reference system

이하의 명령어, T 이하의 머신 스텝, n 이하의 크기를 갖는 어떤 프로그램에서도 동작하는 서킷 C는 프로그램이나 주요 입력 값에 의존하지 않고,

, T, n 값에만 의존하기 때문에 유니버셜. zk-SNARK 키 생성 모듈(120)과 결합한다면 검증 시스템의 파라미터 또한 유니버셜하게 된다.As above, based on [Equation 1]

Circuit C, which runs on any program with the following instructions, T or less machine steps, and size n or less, does not depend on the program or the main input values,

, universal because it depends only on the values of T, n. When combined with the zk-SNARK key generation module 120, the parameters of the verification system are also universal.

In the above case, since all programs can be verified with one key generation, and after that, a key suitable for a given calculation range can be selected, thereby reducing the cost of generating a key for each program.

) 및 서킷 생성 모듈(110)에 의해 생성된 서킷(

)를 이용하여 증명 키(pk) 및 검증 키(vk)를 생성한다. The zk-SNARK key generation module 120 receives the key generator information, prover information, and verifier information, and then receives the security parameter (

) and the circuit generated by the circuit creation module 110 (

) to generate a proof key (pk) and a verification key (vk).

First, the zk-SNARK key generation module 120 uses the zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) algorithm to generate evidence that can prove ownership of specific information, such as a secret key, without disclosing the information. create

That is, the zk-SNARK key generation module 120 converts the verification rule into a mathematical form indicating a triple vector, and then converts the verification rule converted into the triple vector into a Lagrange polynomial or fast Fourier to generate a polynomial function. .

More specifically, the zk-SNARK key generation module 120 converts the verification rule into a rank-1 constraint system (R1CS) format, and then converts the R1CS into a quadratic arithmetic program (QAP). At this time, the verification rules relate to whether the input amount is greater than the output amount, whether the transaction has an appropriate signature, or whether the input belongs to UTXO.

를 통해 각

를 값을 산출할 수 있다. Then, the zk-SNARK key generation module 120 generates a random element

through each

value can be calculated.

는 QAP 인스턴스이며 증명 키(pk) 및 검증 키(vk)를 생성하는데 사용된다. 즉, 본 발명은 증명 키(pk)의 크기를 줄이기 위해 산술 회로로부터 파생된 QAP의 구조적 특성을 이용한 것이다. From here,

is a QAP instance and is used to generate the proof key (pk) and verification key (vk). That is, the present invention uses the structural characteristics of QAP derived from an arithmetic circuit in order to reduce the size of the proof key pk.

In addition, R1CS is a triple vector (A, B, C). Such a triple vector means a mathematical form of the verification rule, and QAP is expressed as [Equation 2] through Lagrange polynomial or fast Fourier transform.

At this time, the zk-SNARK key generation module 120 generates a proof key (pk) and a verification key (vk) only once per circuit.

)를 생성할 수 있고, 어느 검증자 단말(300)이 검증 키(vk)를 이용하여 증거(

)를 검증할 수 있는 것이다.Therefore, after being created once, a certain prover terminal 200 uses the proof key (pk) to

), which verifier terminal 300 uses the verification key vk to generate evidence (

) can be verified.

The present invention will achieve additional efficiencies in space rather than time. Specifically, the structural characteristics of QAP derived from an arithmetic circuit are used to reduce the size of the proof key pk.

Therefore, all programs can be verified by creating a circuit once, and after that, a key suitable for a given calculation range can be selected. In this way, it is possible to reduce the cost of generating a key for each program.

)를 생성하는 단말이다. 이러한 증명자 단말(200)은 일반연산 검증용 서킷 생성기(100)에서 생성된 증명 키(pk), zk-SNARK 알고리즘을 통해 획득된 다항함수의 계수 및 검증과 증명에 필요한 정보(

)를 이용하여 증거(

)를 생성한다. The prover terminal 200 uses the proof key (pk) generated by the circuit generator 100 for general operation verification,

) is the terminal that generates it. The prover terminal 200 includes the proof key (pk) generated by the circuit generator 100 for general operation verification, the coefficients of the polynomial function obtained through the zk-SNARK algorithm, and information required for verification and proof (

) using the evidence (

) is created.

)를 생성할 수 있다. In an embodiment, the prover terminal 200 provides evidence (

) can be created.

[Equation 2]

: QAP 인스턴스인

와 QAP의 증거

에서 파생

: QAP instance

and proof of QAP

derived from

), QAP의 증거 (

) 및 공개키 (

) 를 이용해서 증거(

)를 생성할 수 있다. That is, the prover terminal 200 calculates the coefficient (

), evidence of QAP (

) and public key (

) using Evidence (

) can be created.

) 및 증거(

)를 수신하면 증거(

)가 유효한지 검증하는 역할을 수행한다. The verifier terminal 300 includes a verification key (vk), information required for verification and proof (

) and evidence (

) upon receipt of evidence (

) is used to verify that the

) 를 이용하여 [수학식 3]을 산출하고, 검증 키(vk) 및 [수학식 3]의 결과 값을 이용하여 12개의 페어링을 계산하고 필요한 점검을 수행한다.First, the verifier terminal 300 includes a part of the verification key (vk) and information (

), calculates [Equation 3], calculates 12 pairings using the verification key vk and the result value of [Equation 3], and performs necessary checks.

[Equation 3]

vk: validation key,

n: input size,

C: circuit

In the calculation process of [Equation 3], a variable-based multiscalar multiplication technique can be used to reduce the amount of computation required for the calculation of , which is the calculation result of [Equation 3], and a constant time is required for pairing evaluation regardless of the input size n. Even if it takes, these ratings are very expensive and prevail for small circuits.

In a blockchain system to which a zero-knowledge proof-based virtual machine that can perform general operation verification is applied, verification of evidence is performed to confirm that the transaction is a valid transaction. At this time, since zero-knowledge proof technology capable of verifying general operations is applied to the opcode execution module of the virtual machine, even if the transaction is not executed, if the zero-knowledge evidence is verified, it can be known whether the transaction is a valid transaction.

For this purpose, the blockchain system to which a zero-knowledge proof-based virtual machine that can perform general operation verification is applied includes a code generator, a compiler, a storage, a stack, and a code execution unit.

The code generating unit generates a code coded in the soliditor language based on the zero-knowledge evidence stored in the storage unit. At this time, since Soliditor is a language created to be understood by humans, it is necessary to change the language to a machine language that the virtual machine can understand in order to operate in a virtual machine. Accordingly, the code generated by the code generator is compiled by the compiler and converted into Ethereum bytecode for operation in the virtual machine.

The compiler compiles the code generated by the code execution unit to generate Ethereum bytecode, and provides the Ethereum bytecode to the code execution unit.

The storage unit stores the zero-knowledge evidence generated by the prover terminal. When the virtual machine verifies the zero-knowledge evidence stored in the storage unit, it can know whether the corresponding transaction is a valid transaction. That is, since the zero-knowledge proof technology is applied to the virtual machine according to an embodiment of the present invention, it is possible to know whether the corresponding transaction is a valid transaction through verification of the zero-knowledge evidence without executing the transaction.

In the stack, the opcode separated from the Ethereum bytecode is stored in the process of executing the Ethereum bytecode by the code execution unit.

The code execution unit executes the Ethereum bytecode generated by the compilation unit to verify zero-knowledge evidence. At this time, the code execution unit separates the Ethereum bytecode into opcodes and stores them in the stack, and the opcodes stored in the stack are sequentially executed.

According to the present invention, since zero-knowledge proof technology is applied to the code execution unit, even if the transaction is not executed, if the zero-knowledge proof is verified, it can be known whether the transaction is a valid transaction.

As described above, when zero-knowledge proof technology capable of verifying general operations is applied to the opcode execution module of the virtual machine, TX data among data stored in the storage module is replaced with zero-knowledge proof. Therefore, in the present invention, since zero-knowledge proof technology that can verify general operation is applied to the opcode execution module of the virtual machine, even if the transaction is not executed, if the verification of the zero-knowledge evidence is performed, it is possible to know whether the transaction is a valid transaction. there will be

3 is a flowchart for explaining an embodiment of a method for generating a zero-knowledge proof circuit for general arithmetic verification according to the present invention.

Referring to FIG. 3 , the general operation verification circuit generator 100 generates a general operation verification circuit having the number of reference instructions, the number of reference machine steps, and the size of the reference system (step S310 ).

In one embodiment for step S310, the circuit generator 100 for general operation verification receives the number of reference instructions, the number of reference machine steps, and the size of the reference system, and the number of reference instructions, the number of reference machine steps, and the reference system It is possible to create a circuit for general operation verification that works in any program with a size of .

이하의 명령어, T 이하의 머신 스텝, n 이하의 크기를 갖는 어떤 프로그램에서도 동작하는 서킷을 생성할 수 있다.At this time, the circuit generator 100 for general operation verification is performed as in [Equation 1].

You can create a circuit that runs on any program with the following instructions, machine steps less than T, and size less than n.

이하의 명령어, T 이하의 머신 스텝, n 이하의 크기를 갖는 어떤 프로그램에서도 동작하는 서킷 C는 프로그램이나 주요 입력 값에 의존하지 않고,

, T, n 값에만 의존하기 때문에 유니버셜. zk-SNARK 키 생성 모듈(120)과 결합한다면 검증 시스템의 파라미터 또한 유니버셜하게 된다.As above, based on [Equation 1]

Circuit C, which runs on any program with the following instructions, T or less machine steps, and size n or less, does not depend on the program or the main input values,

, universal because it depends only on the values of T, n. When combined with the zk-SNARK key generation module 120, the parameters of the verification system are also universal.

In the above case, since all programs can be verified with one key generation, and after that, a key suitable for a given calculation range can be selected, thereby reducing the cost of generating a key for each program.

The general operation verification circuit generator 100 generates a proof key and a verification key using the general operation verification circuit and zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) algorithm (step S320).

In an embodiment for step S320, the circuit generator 100 for general operation verification receives the key generator information, prover information, and verifier information, and then provides security parameters and general operation verification for verification generated by the circuit generation module. The circuit is used to generate a proof key and a verification key.

At this time, the circuit generator 100 for general operation verification converts the verification rule into a mathematical form indicating a triple vector, and then converts the verification rule converted into the triple vector into a Lagrange polynomial or fast Fourier to generate a polynomial function. .

The prover terminal generates evidence using the proof key including the general operation verification circuit, the polynomial function coefficients obtained through the zk-SNARK algorithm, and the information necessary for verification and verification among the general operation verification circuits. (Step S330).

The verifier terminal verifies whether the evidence is valid by using the verification key, information necessary for verification and verification among the general operation verification circuit, and the evidence (step S340).

4 is an exemplary diagram for explaining a process of generating a zero-knowledge proof circuit for general arithmetic verification according to the present invention.

Referring to FIG. 4 , to prove the validity of a single proof is to prove the validity of other proofs (many proofs) associated with it. For example, we will explain with reference to a scenario in which the prover correctly solves five problems presented to the prover by the verifier.

In the conventional zero-knowledge proof, as shown in FIG. 4A , prover A must create and submit four pieces of evidence. And, verifiers B, C, D, and E must verify using the Proof they received.

However, if recursive zero-knowledge proof is used as shown in FIG. 4B according to the present invention, prover A submits only the finally calculated last Proof_4, and verifiers B, C, D, and E verify using this.

4B, when the verifier terminal 300 presents a plurality of problems to the prover terminal 200, the prover terminal 200 uses a recursive zero-knowledge proof to display the plurality of problems. Proof 1 (Proof 1) corresponding to the first problem (Question 1) is generated, and Proof 2 (Proof 2) is generated using the second problem (Question 2) and the above evidence 1 (Proof 1) among the plurality of problems. Generates the final proof 3 (Proof 3) for the final third problem (Question 3) using the third final problem (Question 3) and the evidence 2 (Proof 2) among the plurality of problems,

The prover terminal 200 generates final evidence 3 (Proof 3) corresponding to the third final problem (Question 3) using evidence 1 (Proof 1) corresponding to the first problem (Question 1), Submit only the final evidence 3 (Proof 3) except for evidence 1, 2, and 3 without submitting each evidence for a plurality of problems to the verifier terminal 300,

The verifier terminal 300 verifies only the final proof 3 (Proof 3) to prove the validity of the final proof 3 (Proof 3) and the remaining proofs 1, 2, and 3 associated with the final proof 3 (Proof 3).

Although it has been described with reference to the limited embodiments and drawings, the present invention is not limited to the above embodiments, and various modifications and variations are possible from these descriptions by those of ordinary skill in the art to which the present invention pertains. Accordingly, the spirit of the present invention should be understood only by the claims described below, and all equivalents or equivalent modifications thereof will fall within the scope of the spirit of the present invention.

100: Circuit generator for general operation verification
110: circuit creation module
120: zk-SNARK key generation module
200: prover terminal
300: verifier terminal

Claims (4)

In a virtual machine to which zero-knowledge proof technology is applied, which can perform general operation verification that enables zero-knowledge proof to be used not only for predefined types of transactions, but also for transactions of any type desired by the user,
A circuit for general operation verification having the number of reference instructions, the number of reference machine steps, and the size of the reference system is generated, and the general operation verification circuit and zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) algorithm are generated. a circuit generator 100 for general operation verification that generates a proof key and a verification key by using;
A prover terminal ( 200); and
A verification key including the general operation verification circuit, information necessary for verification and proof among the general operation verification circuit, and a verifier terminal 300 that verifies whether the evidence is valid using the evidence,
The general operation verification circuit generator 100 includes: a circuit generation module 110 for generating a general operation verification circuit that operates in any program having the number of reference instructions, the number of reference machine steps, and the size of the reference system; And after receiving the key generator information, prover information, and verifier information, zk-SNARK key generation that generates a proof key and a verification key using a security parameter and a circuit for general operation verification generated by the circuit generation module comprising a module 120,
The zk-SNARK key generation module 120 converts the verification rule into a mathematical form indicating a triple vector, and then converts the verification rule converted into the triple vector into a Lagrange polynomial or fast Fourier to generate a polynomial function,
The circuit generating module 110 is a block chain system to which a zero-knowledge proof-based virtual machine capable of general operation verification, characterized in that it generates a circuit for general operation verification by using Equation (1).

[Equation 1]
C =

C: circuit

: the number of standard commands,
T: number of reference machine steps,
n: size of reference system
According to claim 1,
The prover terminal 200 generates evidence using the proof key generated by the circuit generator 100 for general operation verification, and generates the evidence using Equation 2, Calculate the coefficient, and generate evidence using the coefficient of the polynomial function, the evidence of QAP, and the public key,
The verifier terminal 300 calculates Equation 3 using a part of the verification key and information required for verification and proof, calculates 12 pairings using the verification key and the result value of Equation 3, and performs necessary checks A zero-knowledge proof-based virtual machine capable of performing general arithmetic verification, characterized in that it is possible to reduce the amount of computation required for the calculation of Eq. Blockchain system to which this is applied.

[Equation 2]

: QAP instance

and proof of QAP

derived from

[Equation 3]

vk: validation key,
n: input size,
C: circuit
According to claim 1,
The virtual machine includes a code generation unit, a compiler, a storage unit, a stack and a code execution unit,
The code generation unit generates a code coded in a solidity language using the zero-knowledge evidence stored in the storage unit,
The compiler compiles the code generated by the code generation unit to generate an Ethereum bytecode, and provides the Ethereum bytecode to the code execution unit,
Zero-knowledge evidence generated by the prover terminal 200 is stored in the storage unit,
In the stack, the opcode separated from the Ethereum bytecode is stored in the process of executing the Ethereum bytecode by the code execution unit,
The code execution unit executes the Ethereum bytecode generated by the compiler to verify zero-knowledge evidence.
4. The method of claim 3,
The virtual machine can check whether the transaction is a valid transaction by applying the zero-knowledge proof to the code execution unit, so that the zero-knowledge proof is verified without executing the transaction.
The code execution unit separates the Ethereum bytecode into opcodes, stores it in the stack, and sequentially executes the opcodes stored in the stack. blockchain system.

Images