CN110751555A - Method and device for realizing contract calling based on FPGA - Google Patents

Method and device for realizing contract calling based on FPGA Download PDF

Info

Publication number
CN110751555A
CN110751555A CN201910913486.0A CN201910913486A CN110751555A CN 110751555 A CN110751555 A CN 110751555A CN 201910913486 A CN201910913486 A CN 201910913486A CN 110751555 A CN110751555 A CN 110751555A
Authority
CN
China
Prior art keywords
fpga
chip
code program
transaction
contract
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910913486.0A
Other languages
Chinese (zh)
Other versions
CN110751555B (en
Inventor
潘国振
魏长征
闫莺
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alipay Hangzhou Information Technology Co Ltd
Original Assignee
Alipay Hangzhou Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Alipay Hangzhou Information Technology Co Ltd filed Critical Alipay Hangzhou Information Technology Co Ltd
Priority to CN202110221182.5A priority Critical patent/CN112927077B/en
Priority to CN201910913486.0A priority patent/CN110751555B/en
Publication of CN110751555A publication Critical patent/CN110751555A/en
Priority to PCT/CN2020/107119 priority patent/WO2021057272A1/en
Application granted granted Critical
Publication of CN110751555B publication Critical patent/CN110751555B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored program computers
    • G06F15/78Architectures of general purpose stored program computers comprising a single central processing unit
    • G06F15/7807System on chip, i.e. computer system on a single chip; System in package, i.e. computer system on one or more chips in a single package
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored program computers
    • G06F15/78Architectures of general purpose stored program computers comprising a single central processing unit
    • G06F15/7867Architectures of general purpose stored program computers comprising a single central processing unit with reconfigurable architecture
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • G06F2009/45583Memory management, e.g. access or allocation

Abstract

One or more embodiments of the present specification provide a method and an apparatus for implementing contract invocation based on an FPGA, where the method may include: the FPGA structure acquires the transaction received by the block chain node to which the FPGA structure belongs; the FPGA structure determines a contract address of the intelligent contract called by the transaction; and the FPGA structure acquires a code program corresponding to the contract address from a local space so as to run the code program on the FPGA structure.

Description

Method and device for realizing contract calling based on FPGA
Technical Field
One or more embodiments of the present disclosure relate to the field of block chain technologies, and in particular, to a method and an apparatus for implementing contract invocation based on an FPGA.
Background
The blockchain technique is built on top of a transport network, such as a point-to-point network. Network nodes in a transport network utilize a chained data structure to validate and store data and employ a distributed node consensus algorithm to generate and update data.
The two biggest challenges in the current enterprise-level blockchain platform technology are privacy and performance, which are often difficult to solve simultaneously. Most solutions trade privacy for loss of performance or do not consider privacy much to pursue performance. Common encryption technologies for solving privacy problems, such as Homomorphic encryption (Homomorphic encryption) and Zero-knowledge proof (Zero-knowledge proof), have high complexity and poor universality, and may cause serious performance loss.
Trusted Execution Environment (TEE) is another way to address privacy concerns. The TEE can play a role of a black box in hardware, a code and data operating system layer executed in the TEE cannot be peeped, and the TEE can be operated only through an interface defined in advance in the code. In the aspect of efficiency, due to the black box property of the TEE, plaintext data is operated in the TEE instead of complex cryptography operation in homomorphic encryption, and the efficiency of the calculation process is not lost, so that the safety and privacy of a block chain can be improved to a great extent on the premise of small performance loss by combining with the TEE. The industry is concerned with TEE solutions, and almost all mainstream chip and Software consortiums have their own TEE solutions, including Software-oriented TPM (Trusted Platform Module) and hardware-oriented Intel SGX (Software Guard Extensions), ARM Trustzone (Trusted zone), and Platform Security Processor (Platform Security Processor).
Disclosure of Invention
In view of this, one or more embodiments of the present disclosure provide a method and an apparatus for implementing a contract invocation based on an FPGA.
To achieve the above object, one or more embodiments of the present disclosure provide the following technical solutions:
according to a first aspect of one or more embodiments of the present specification, there is provided a method for implementing a contract invocation based on an FPGA, including:
the FPGA structure acquires the transaction received by the block chain node to which the FPGA structure belongs;
the FPGA structure determines a contract address of the intelligent contract called by the transaction;
and the FPGA structure acquires a code program corresponding to the contract address from a local space so as to run the code program on the FPGA structure.
According to a second aspect of one or more embodiments of the present specification, there is provided an apparatus for implementing a contract invocation based on an FPGA, including:
the transaction acquisition unit enables the FPGA structure to acquire the transactions received by the block chain nodes to which the FPGA structure belongs;
the address determination unit enables the FPGA structure to determine a contract address of the intelligent contract called by the transaction;
and the program acquisition unit is used for enabling the FPGA structure to acquire the code program corresponding to the contract address from a local space so as to run the code program on the FPGA structure.
According to a third aspect of one or more embodiments of the present specification, there is provided an electronic apparatus including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor implements the method of the first aspect by executing the executable instructions.
According to a fourth aspect of one or more embodiments of the present description, a computer-readable storage medium is presented, having stored thereon computer instructions which, when executed by a processor, implement the steps of the method according to the first aspect.
Drawings
FIG. 1 is a flowchart of a method for implementing a contract invocation based on an FPGA in accordance with an illustrative embodiment.
Fig. 2 is a schematic structural diagram of a blockchain node according to an exemplary embodiment.
Fig. 3 is a schematic diagram of forming a functional module on an FPGA chip according to an exemplary embodiment.
Fig. 4 is a schematic structural diagram of another blockchain node according to an exemplary embodiment.
Fig. 5 is a block diagram of an apparatus for implementing a contract invocation based on an FPGA according to an exemplary embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with one or more embodiments of the present specification. Rather, they are merely examples of apparatus and methods consistent with certain aspects of one or more embodiments of the specification, as detailed in the claims which follow.
It should be noted that: in other embodiments, the steps of the corresponding methods are not necessarily performed in the order shown and described herein. In some other embodiments, the method may include more or fewer steps than those described herein. Moreover, a single step described in this specification may be broken down into multiple steps for description in other embodiments; multiple steps described in this specification may be combined into a single step in other embodiments.
Blockchains are generally divided into three types: public chain (Public Blockchain), private chain (PrivateBlockchain) and alliance chain (Consortium Blockchain). In addition, there are various types of combinations, such as private chain + federation chain, federation chain + public chain, and other different combinations. The most decentralized of these is the public chain. The public chain is represented by bitcoin and ether house, and the participators joining the public chain can read the data record on the chain, participate in transaction, compete for accounting right of new blocks, and the like. Furthermore, each participant (i.e., node) is free to join and leave the network and perform related operations. Private chains are the opposite, with the network's write rights controlled by an organization or organization and the data read rights specified by the organization. Briefly, a private chain can be a weakly centralized system with strictly limited and few participating nodes. This type of blockchain is more suitable for use within a particular establishment. A federation chain is a block chain between a public chain and a private chain, and "partial decentralization" can be achieved. Each node in a federation chain typically has a physical organization or organization corresponding to it; participants jointly maintain blockchain operation by authorizing to join the network and forming a benefit-related alliance.
Whether public, private, or alliance, nodes in a blockchain network may perform received transactions within a TEE (Trusted Execution Environment) for privacy protection purposes through a solution in which the blockchain is combined with the TEE. The TEE is a trusted execution environment that is based on a secure extension of the CPU hardware and is completely isolated from the outside. TEE was originally proposed by Global Platform to address the secure isolation of resources on mobile devices, providing a trusted and secure execution environment for applications parallel to the operating system. The Trust Zone technology of ARM realizes the real commercial TEE technology at the earliest. Along with the rapid development of the internet, the security requirement is higher and higher, and more requirements are provided for the TEE by mobile equipment, cloud equipment and a data center. The concept of TEE has also been developed and expanded at a high rate. The concept now referred to as TEE has been a more generalized TEE than the concept originally proposed. For example, server chip manufacturers Intel, AMD, etc. have introduced hardware-assisted TEE in turn and enriched the concept and characteristics of TEE, which have gained wide acceptance in the industry. The mention of TEE now is more generally directed to such hardware assisted TEE techniques.
Taking the Intel SGX technology as an example, SGX provides an enclosure (also called enclave), that is, an encrypted trusted execution area in memory, and a CPU protects data from being stolen. Taking the example that the first block link point adopts a CPU supporting SGX, a part of an area EPC (enclosure Page Cache, Enclave Page Cache, or Enclave Page Cache) may be allocated in the memory by using a newly added processor instruction, and data therein is encrypted by an Encryption engine mee (memory Encryption engine) in the CPU. The encrypted content in the EPC is decrypted into plaintext only after entering the CPU. Therefore, in the SGX, a user may not trust an operating System, a VMM (Virtual Machine Monitor), or even a BIOS (basic input Output System), and only need to trust the CPU to ensure that private data is not leaked. The enclosure thus corresponds to the TEE produced under SGX technology.
Unlike the mobile terminal, the cloud access requires remote access, and the end user is not visible to the hardware platform, so the first step of using the TEE is to confirm the authenticity and credibility of the TEE. For example, a remote attestation mechanism for the SGX techniques described above is provided in the related art to prove that the SGX platform on the target device deploys the same configuration file as the challenger. However, since the TEE technology in the related art is implemented in software or a combination of software and hardware, even though a remote attestation method may indicate to some extent that the configuration file deployed in the TEE is not tampered with, the operating environment on which the TEE itself depends cannot be verified. For example, on a blockchain node which needs to implement a privacy function, a virtual machine for executing an intelligent contract needs to be configured in the TEE, and the instruction executed by the virtual machine is not directly executed, but actually executes a corresponding number of X86 instructions (assuming that the target device adopts an X86 architecture), thereby posing a certain security risk.
Therefore, the present specification proposes a hardware TEE technique implemented based on an FPGA, where the FPGA implements the hardware TEE by loading a circuit logic configuration file. Because the contents of the circuit logic configuration file can be viewed and checked in advance, and the FPGA is configured to operate completely based on the logic recorded in the circuit logic configuration file, the hardware TEE realized by the FPGA can be ensured to have relatively higher safety. However, in the related art, the code programs of the intelligent contracts are all deployed at the block link points, so that the FPGA needs to frequently acquire the code programs from the block link points, which results in consumption of a large amount of resources.
The following describes, with reference to an embodiment, a method for implementing contract invocation based on an FPGA to reduce the number of data interactions.
FIG. 1 is a flowchart of a method for implementing a contract invocation based on an FPGA in accordance with an illustrative embodiment. As shown in fig. 1, the method applied to the FPGA structure may include the following steps:
and step 102, the FPGA structure acquires the transaction received by the block chain node to which the FPGA structure belongs.
The block link points comprise node masters. The FPGA structure is connected with the node host, so that data interaction between the FPGA structure and the node host can be realized, and the data interaction between the FPGA structure and the block link points can also be described. For example, the block link points may transmit the received transaction to the FPGA fabric for execution by the FPGA fabric of the smart contract involved in the transaction. The FPGA structure can be plugged into a PCIE interface on a node host of the block link node so as to realize the connection relation; alternatively, other types of interfaces may be used, and even wireless connection may be established, which is not limited in this specification.
The transaction initiator may submit the transaction at the blockchain node. Alternatively, the transaction initiator may submit the transaction at other blockchain nodes and transmit the transaction to the blockchain node by the other blockchain nodes. Alternatively, the blockchain node may obtain the transaction in other manners, which is not limited in this specification.
And 104, determining the contract address of the intelligent contract called by the transaction by the FPGA structure.
The transaction may be in an encrypted state. For example, the block nodes may identify whether a received transaction is encrypted and transmit the encrypted transaction to the FPGA fabric for processing, while unencrypted transactions are processed locally at the block nodes.
The FPGA structure comprises an FPGA chip, and a decryption module can be formed on the FPGA chip by loading the circuit logic configuration file deployed on the FPGA structure onto the FPGA chip. Then, in the case that the transaction is in the encrypted state, the FPGA structure may transfer the transaction into the decryption module, and extract the contract address of the intelligent contract called by the transaction from the decrypted transaction content output by the decryption module, for example, the contract address is usually located in the to field of the decrypted transaction content.
And 106, the FPGA structure acquires a code program corresponding to the contract address from a local space so as to run the code program on the FPGA structure.
The FPGA fabric contains local space that can be used to maintain at least a portion of the deployed code programs of the intelligent contracts. Therefore, the FPGA structure can directly obtain the required code program from the local space in at least a part of scenes without interacting with the block chain nodes, so that the resource consumption caused by the interaction can be saved, the obtaining speed of the code program is accelerated, and the transaction execution efficiency is improved. In some scenarios, if the local space stores only part of the code programs of the intelligent contracts, and the rest of the code programs of the intelligent contracts are deployed at the block link points, the FPGA fabric may encounter a situation where the code program corresponding to the contract address cannot be acquired in the local space, and the FPGA fabric may further request the block link points to acquire the code program corresponding to the contract address.
There may be a variety of situations in the local space described above. For example, the local space may include: the FPGA structure comprises an on-chip storage space of an FPGA chip, or an external storage space of the FPGA chip, or comprises the on-chip storage space and the external storage space at the same time. The on-chip storage space is positioned inside the FPGA chip and is formed by a storage device on the FPGA chip. The external storage space is located outside the FPGA chip and can be plugged into an interface of the FPGA structure, for example, the external storage space may include an external DDR and the like.
The internal part of the FPGA chip is considered to be in a safe range, and the external part of the FPGA chip is considered to have a safety risk, so when the code program is stored in the on-chip storage space, the code program can be directly stored in a plaintext form, and when the code program is stored in the external storage space, the code program needs to be encrypted by an encryption module on the FPGA chip and then stored, wherein the encryption module is formed by loading the deployed circuit logic configuration file by the FPGA chip. Therefore, in the process of obtaining the code program from the local space, if the code program is cached in the on-chip cache space, the code program may be directly read from the on-chip cache space and read into the on-chip processor, and if the code program is cached in the external storage space, the code program read from the external storage space needs to be decrypted by the decryption module on the FPGA chip and the decrypted code program needs to be read into the on-chip processor.
When the FPGA architecture stores the code program of the intelligent contract into the local space, the original code program may be directly stored, for example, the original code program may be a bytecode program. Alternatively, the FPGA architecture may preprocess the original code program and store the preprocessed code program in the local space. The preprocessing refers to processing operations which must be performed in advance before the original code program is executed, and by performing the preprocessing before the preprocessing is stored in the local space, the operation resources and the processing time which are consumed by the temporary preprocessing can be saved when the FPGA structure executes the code program subsequently, which is beneficial to accelerating the execution speed of the code program. Wherein the pretreatment may include at least one of: each field included in the code program is analyzed and converted into a preset data structure, and the offset (offset) of a jump instruction (jump instruction) in the code program is adjusted.
In the process of executing the transaction, for a code program obtained from a local space or a node of a block chain, the FPGA structure may transfer the code program onto an FPGA chip included in the FPGA structure to form an on-chip processor for implementing virtual machine logic, for example, the virtual machine logic may include an execution logic of an ethernet virtual machine or an execution logic of a WASM virtual machine, and the like, which is not limited in this specification; the on-chip processor is formed by loading a circuit logic configuration file deployed on an FPGA structure by an FPGA chip.
The FPGA chip comprises a plurality of editable hardware logic units, and the hardware logic units can be realized as corresponding functional modules after being configured by a circuit logic configuration file so as to realize corresponding logic functions. Specifically, the circuit logic configuration file may be burned into the FPGA fabric based on the form of the bit stream. For example, the decryption module, the encryption module, and the on-chip processor are formed by the deployed circuit logic configuration file, and the FPGA structure may be configured as a hardware TEE on the blockchain node by further deploying the relevant other functional modules. Since the functional modules are completely configured by the circuit logic configuration file, the information of all aspects such as logic and the like realized by the configured functional modules can be determined by checking the circuit logic configuration file, and the functional modules can be ensured to be formed and operated according to the requirements of complete users.
After the user generates the circuit logic configuration file, if the circuit logic configuration file is located at the site of the FPGA structure, the circuit logic configuration file may be locally deployed to the FPGA structure, for example, the deployment operation may be performed in an offline environment to ensure security. Alternatively, a user may remotely deploy the circuit logic configuration file to the FPGA fabric in the case where the FPGA fabric is in an online environment.
Fig. 2 is a schematic structural diagram of a blockchain node according to an exemplary embodiment. Based on the technical solution of the present specification, an FPGA structure may be added to a block chain node to implement the hardware TEE, for example, the FPGA structure may be an FPGA board card as shown in fig. 2. The FPGA board card can be connected to the block link nodes through the PCIE interface so as to realize data interaction between the FPGA board card and the block link nodes. The FPGA board card can comprise structures such as an FPGA chip, a Flash chip, a close-pipe chip and the like; of course, in some embodiments, only a portion of the remaining Flash chips, the crypto-chips, and the like may be included, or more structures may be included, in addition to the FPGA chip, which is only used for example.
In the initial stage, no logic defined by a user is burned on the FPGA chip, which is equivalent to that the FPGA chip is in a blank state. A user can form corresponding functions or logics on the FPGA chip by burning a circuit logic configuration file on the FPGA chip. When a circuit logic configuration file is burned for the first time, the FPGA board card does not have a safety protection capability, so that a safety environment is usually provided externally, for example, a user can burn the circuit logic configuration file in an offline environment to realize physical safety isolation, rather than remotely burn on line.
And aiming at the functions or logics required to be realized by the user, corresponding logic codes can be formed through an FPGA hardware language, and the logic codes are subjected to mirroring treatment, so that the circuit logic configuration file can be obtained. Before burning the logic codes to the FPGA board card, a user can check the logic codes. Particularly, when a plurality of users are involved at the same time, the logic codes can be checked by the plurality of users respectively, so that the FPGA board card can meet the requirements of all the users finally, and abnormal problems such as security risk, logic errors and fraud are prevented.
After determining that the code is correct, the user can burn the circuit logic configuration file to the FPGA board card in the off-line environment. Specifically, the circuit logic configuration file is transmitted from the block link point to the FPGA board, and is further deployed in the Flash chip shown in fig. 2, so that even if the FPGA board is powered off, the Flash chip can still store the circuit logic configuration file.
Fig. 3 is a schematic diagram of forming a functional module on an FPGA chip according to an exemplary embodiment. By loading the circuit logic configuration file deployed in the Flash chip to the FPGA chip, the hardware logic unit included in the FPGA chip can be configured, so that a corresponding functional module is formed on the FPGA chip, for example, the formed functional module may include an on-chip cache module, a preprocessing module, a plaintext calculation module, a key negotiation module, a decryption and signature verification module, an encryption and decryption module, and the like shown in fig. 3. Meanwhile, the circuit logic configuration file can also be used for transmitting information to be stored to the FPGA board card, for example, a preset certificate can be stored on the FPGA chip, an authentication root key can be stored in the crypto-tube chip (the authentication root key can also be stored on the FPGA chip), and the like.
Based on a key agreement module formed on the FPGA chip and an authentication root key deployed on the FPGA board, the FPGA board can implement remote key agreement with a user, and the key agreement process can be implemented by using any algorithm or standard in the related art, which is not limited in this specification. By way of example, the key agreement procedure may include: the user can generate a key Ka-1 at a local client, the key negotiation module can generate a key Kb-1 at the local client, the client can calculate key negotiation information Ka-2 based on the key Ka-1, the key negotiation module can calculate key negotiation information Kb-2 based on the key Kb-1, then the client sends the key negotiation information Ka-2 to the key negotiation module, the key negotiation module sends the key negotiation information Kb-2 to the client, so that the client can generate a secret value based on the key Ka-1 and the key negotiation information Kb-2, the key negotiation module can generate the same secret value based on the key Kb-1 and the key negotiation information Ka-2, and finally the client and the key negotiation module derive the same configuration file deployment key from the same secret value based on a key derivation function respectively, the configuration file deployment key can be stored in an FPGA chip or a close-pipe chip. In the above process, although the key agreement information Ka-2 and the key agreement information Kb-2 are transmitted between the client and the key agreement module via the block chain node, since the key Ka-1 is grasped by the client and the key Kb-1 is grasped by the key agreement module, it can be ensured that the block chain node cannot acquire the finally obtained secret value and the configuration file deployment key, thereby avoiding the security risk that may be caused.
In addition to the configuration file deployment key, the secret value is used to derive a business secret deployment key; for example, the secret value may derive a 32-bit value, and the first 16 bits may be used as a configuration file deployment key and the last 16 bits may be used as a service secret deployment key. The user can deploy the service key to the FPGA card through the service secret deployment key, for example, the service key may include a node private key and a service root key. For example, a user can sign and encrypt the node private key or the service root key by using the service secret deployment key on the client, and send the signed and encrypted service root key to the FPGA board, so that the FPGA board deploys the obtained node private key or the service root key after decrypting and verifying the signature by the decryption and verification module.
Based on the deployed node key, the service root key, the encryption and decryption module on the FPGA chip and the plaintext calculation module, the FPGA board card can be realized as TEE on block chain link points to meet privacy requirements. For example, when a block link point receives a transaction, if the transaction is a plaintext transaction, the block link point may directly process the plaintext transaction, and if the transaction is a privacy transaction, the block link point may transmit the privacy transaction to the FPGA board for processing.
The transaction content of the clear text transaction is in a clear text form, and the contract state and the like generated after the transaction is executed are stored in a clear text form. The transaction content of the privacy transaction is in a ciphertext form, the transaction initiator encrypts the plaintext transaction content to obtain the encrypted plaintext transaction content, and contract states and the like generated after the transaction is executed need to be stored in the ciphertext form, so that the transaction privacy protection is ensured. For example, the transaction initiator may generate a symmetric key randomly or based on other manners, and similarly, the service public key corresponding to the service private key is disclosed, then the transaction initiator may perform digital envelope encryption on the plaintext transaction content based on the symmetric key and the service public key: the transaction initiator encrypts plaintext transaction content through a symmetric key, and encrypts the symmetric key through a service public key to obtain two parts of content which are both contained in the privacy transaction; in other words, the privacy transaction includes two parts: the clear text transaction content encrypted by adopting the symmetric key and the symmetric key encrypted by adopting the service public key.
Therefore, after receiving the private transaction transmitted by the block chain link point, the FPGA board can decrypt the symmetric key encrypted by the service public key through the service private key by the encryption and decryption module to obtain the symmetric key, and then decrypt the plaintext transaction content encrypted by the symmetric key through the symmetric key by the encryption and decryption module to obtain the plaintext transaction content. The private transaction may be used to deploy an intelligent contract, and then the data field of the content of the clear text transaction may contain the contract code of the intelligent contract to be deployed; alternatively, the private transaction may be used to invoke an intelligent contract, and then the to field of the plaintext transaction content may contain a contract address of the invoked intelligent contract, and the FPGA board may invoke a corresponding contract code based on the contract address.
When the privacy transaction is used for deploying the intelligent contract, the FPGA board card can deploy the contract code contained in the data field of the plaintext transaction content to the on-chip cache module. Then, when the FPGA board subsequently receives the privacy transaction for invoking the intelligent contract, the FPGA board may search for a corresponding contract code from the on-chip cache module based on the contract address included in the to field of the plaintext transaction content, so as to execute the contract code through the plaintext calculation module. The plaintext calculation module formed on the FPGA chip is used for realizing the logic of the virtual machine in the related technology, namely the plaintext calculation module is equivalent to a hardware virtual machine on the FPGA board card. Thus, after the contract code is determined based on the plaintext transaction content, the contract code may be passed into a plaintext calculation module for execution by the plaintext calculation module. The plaintext calculation module corresponds to an on-chip processor formed on an FPGA chip in this specification.
For the privacy transaction for deploying the intelligent contract, the FPGA board card can be directly stored in the on-chip cache module after obtaining the contract code to be deployed, or can be preprocessed by the preprocessing module and then store the preprocessed contract code in the on-chip cache module. If the contract code is not preprocessed by the preprocessing module before being stored in the on-chip cache module, the plaintext computing module needs to temporarily implement preprocessing operation by the preprocessing module before being used for executing the contract code, and then the preprocessed contract code is processed by the plaintext computing module. It can be seen that if the contract code after being preprocessed by the preprocessing module is stored in the on-chip cache module, the plaintext computing module can directly obtain the preprocessed contract code from the on-chip cache module, and can directly execute the contract code without temporarily performing preprocessing operation, thereby accelerating transaction execution speed and reducing delay.
Preprocessing for contract code may include several dimensions, and for contract code written in different languages or rules, the involved preprocessing dimensions may differ. Taking the contract code of the wasm intelligent contract as an example, the preprocessing may include the following two aspects:
1) and (4) converting the data format. And analyzing the contract code by using a data structure, and converting the contract code into a data structure in a required preset format so as to facilitate subsequent execution.
2) The offset of the jump instruction is adjusted. The following two aspects may result in the offset of the jump instruction being updated: analyzing a jump instruction in the contract code, converting a symbol identifier corresponding to the jump instruction into address information which can be identified by the on-chip processor, so that the length of the contract code is changed; the encoded operands in the contract code are decoded to change the length of the contract code, which may include, for example, LEB (Little-Endian Base) encoding or other encoding.
Besides configuring the on-chip cache module on the FPGA chip, an external storage space can be configured for the FPGA chip. For example, fig. 4 is a schematic structural diagram of a blockchain node according to an exemplary embodiment. As shown in fig. 4, on the basis of the embodiment shown in fig. 2, the FPGA board may further include an external DDR, and the external DDR may implement data interaction with the FPGA chip. Then, the external DDR can implement the related functions of the on-chip cache module, such as caching for contract codes. However, since the external DDR is not on the FPGA chip, the data on the FPGA chip needs to be encrypted by the encryption and decryption module before being transmitted to the external DDR, so as to ensure that only ciphertext data exists on the external DDR, and the obtained plaintext data can be applied to processing operations of the on-chip processor after the data on the external DDR is decrypted by the encryption and decryption module. Although the external DDR is involved in data encryption and decryption and the data transmission efficiency is relatively lower than that of the on-chip cache module, the external DDR is relatively superior to the data transmission efficiency between the FPGA board card and the block link point.
In contrast, the memory space of the external DDR is often larger or even much larger than that of the on-chip cache module, so that the external DDR can help to cache more data. Certainly, the FPGA board may include both the on-chip cache module and the external DDR, for example, the contract code with relatively higher heat rate may be cached in the on-chip cache module, and the contract code with relatively lower heat rate may be maintained in the external DDR.
For some reasons, a user may wish to perform version update on a circuit logic configuration file deployed on an FPGA board, for example, an authentication root key included in the circuit logic configuration file may be known by a risky user, and for example, the user may wish to upgrade a functional module deployed on the FPGA board, which is not limited in this specification. For the sake of distinction, the circuit logic configuration file already deployed in the above process may be referred to as an old version of circuit logic configuration file, and the circuit logic configuration file to be deployed may be referred to as a new version of circuit logic configuration file.
Similar to the old version of the circuit logic configuration file, a user can generate a new version of the circuit logic configuration file through the processes of writing codes, mirroring and the like. Furthermore, a user can sign the new circuit logic configuration file through a private key owned by the user, and then encrypt the signed new circuit logic configuration file through a configuration file deployment key issued by the above-mentioned assistant, so as to obtain the encrypted new circuit logic configuration file. In some cases, multiple users may exist at the same time, and then the preset certificates corresponding to the users need to be deployed to the FPGA board card for the old version of circuit logic configuration file, and the users need to sign the new version of circuit logic configuration file by using their own private keys.
The user can remotely send the encrypted new circuit logic configuration file to the block chain nodes through the client, and the encrypted new circuit logic configuration file is further transmitted to the FPGA board card through the block chain nodes. In the process, the decryption and signature checking module formed on the FPGA chip is located on a transmission path between the PCIE interface and the Flash chip, so that the encrypted new version of circuit logic configuration file can be transmitted into the Flash chip to realize credible update after being successfully processed by the decryption and signature checking module, and the Flash chip cannot be directly updated by bypassing the decryption and signature checking process.
After receiving the encrypted new version circuit logic configuration file, the decryption and signature verification module decrypts the encrypted new version circuit logic configuration file by using the configuration file deployment key deployed on the FPGA board card, and if the decryption is successful, the decryption and signature verification module further performs signature verification on the decrypted new version circuit logic configuration file based on a preset certificate deployed on the FPGA chip. If the decryption fails or the signature verification fails, the received file is not from the user or is tampered, and the decryption signature verification module triggers to terminate the current updating operation; and under the conditions that decryption is successful and the verification passes, the obtained new version of circuit logic configuration file can be determined to come from the user and is not tampered in the transmission process, and the new version of circuit logic configuration file can be further transmitted to the Flash chip so as to update and deploy the old version of circuit logic configuration file in the Flash chip.
After the new circuit logic configuration file is loaded to the FPGA chip, information such as the plaintext calculation module, the on-chip cache module, the key negotiation module, the encryption/decryption module, the decryption and signature verification module, a preset certificate is stored into the FPGA chip, and an authentication root key is stored into the crypto-tube chip can be formed on the FPGA chip. The formed plaintext calculation module, on-chip cache module, key negotiation module, encryption/decryption module, decryption and signature verification module and the like can change and upgrade the realized function logic, and the stored information such as the deployed preset certificate, the authentication root key and the like can be different from the information before updating. Then, the FPGA board may perform remote negotiation with the user based on the updated key negotiation module, the authentication root key, and the like to obtain a new configuration file deployment key, and the configuration file deployment key may be used in a next updateable process. Similarly, trusted update operations for the FPGA board can be continuously implemented accordingly.
After the updating and the deployment are completed, the FPGA board card can generate an authentication result aiming at the new version circuit logic configuration file. For example, the key agreement module may calculate, by using an algorithm such as sm3 or another algorithm, a hash value of the new version of circuit logic configuration file, a hash value of the configuration file deployment key negotiated based on the new version of circuit logic configuration file, and the obtained calculation result may be used as the authentication result, and the key agreement module sends the authentication result to the user. Correspondingly, the user can verify the authentication result on the client based on the maintained new version circuit logic configuration file and the configuration file deployment key negotiated according to the new version circuit logic configuration file, if the verification is successful, the new version circuit logic configuration file is successfully deployed on the FPGA board card, and the user and the FPGA board card successfully negotiate according to the configuration file deployment key to obtain the consistent configuration file deployment key, so that the successful completion of the updating and the deployment aiming at the circuit logic configuration file is confirmed.
Fig. 5 is a schematic block diagram of an apparatus for implementing a contract invocation based on an FPGA according to an exemplary embodiment. Referring to fig. 5, in a software implementation, the apparatus for implementing contract invocation based on FPGA may include:
a transaction acquisition unit 501, configured to enable the FPGA structure to acquire transactions received by the block link node to which the FPGA structure belongs;
an address determination unit 502, which enables the FPGA structure to determine a contract address of the intelligent contract called by the transaction;
a program obtaining unit 503, configured to enable the FPGA structure to obtain, from a local space, a code program corresponding to the contract address, so as to run the code program on the FPGA structure.
Optionally, the local space includes: the FPGA structure comprises an on-chip storage space of an FPGA chip and/or an external storage space of the FPGA chip.
Optionally, the code program in the on-chip storage space is stored in a plaintext form.
Optionally, the code program in the external storage space is stored in a ciphertext form; the program obtaining unit 503 is specifically configured to:
enabling the FPGA structure to acquire an encrypted code program corresponding to the contract address from the external storage space;
enabling the FPGA structure to decrypt the encrypted code program through a decryption module on the FPGA chip to obtain the code program; the decryption module is formed by loading a deployed circuit logic configuration file on the FPGA structure by the FPGA chip.
Optionally, the code program in the local space is obtained by preprocessing an original code program.
Optionally, the pre-treatment comprises at least one of: analyzing and converting each field contained in the code program into a preset data structure; and adjusting the offset of the jump instruction in the code program.
Optionally, the address determining unit 502 is specifically configured to:
under the condition that the transaction is in an encrypted state, the FPGA structure transmits the transaction to a decryption module on an FPGA chip contained in the FPGA structure, and the decryption module is formed by loading a deployed circuit logic configuration file on the FPGA structure by the FPGA chip;
and enabling the FPGA structure to extract the contract address from the decrypted transaction content output by the decryption module.
Optionally, the method further includes:
a program transmitting unit 504, configured to transmit the code program to an FPGA chip included in the FPGA structure to form an on-chip processor for implementing virtual machine logic;
the on-chip processor is formed by loading a deployed circuit logic configuration file on the FPGA structure by the FPGA chip.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
In a typical configuration, a computer includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic disk storage, quantum memory, graphene-based storage media or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The foregoing description has been directed to specific embodiments of this disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The terminology used in the description of the one or more embodiments is for the purpose of describing the particular embodiments only and is not intended to be limiting of the description of the one or more embodiments. As used in one or more embodiments of the present specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used in one or more embodiments of the present description to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of one or more embodiments herein. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
The above description is only for the purpose of illustrating the preferred embodiments of the one or more embodiments of the present disclosure, and is not intended to limit the scope of the one or more embodiments of the present disclosure, and any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the one or more embodiments of the present disclosure should be included in the scope of the one or more embodiments of the present disclosure.

Claims (11)

1. A method for realizing contract calling based on FPGA comprises:
the FPGA structure acquires the transaction received by the block chain node to which the FPGA structure belongs;
the FPGA structure determines a contract address of the intelligent contract called by the transaction;
and the FPGA structure acquires a code program corresponding to the contract address from a local space so as to run the code program on the FPGA structure.
2. The method of claim 1, the local space comprising: the FPGA structure comprises an on-chip storage space of an FPGA chip and/or an external storage space of the FPGA chip.
3. The method of claim 2, the code program within the on-chip storage space being stored in clear text.
4. The method of claim 2, wherein the code program in the external storage space is stored in a ciphertext form; the FPGA structure acquires a code program corresponding to the contract address from a local space, and the method comprises the following steps:
the FPGA structure acquires an encrypted code program corresponding to the contract address from the external storage space;
the FPGA structure decrypts the encrypted code program through a decryption module on the FPGA chip to obtain the code program; the decryption module is formed by loading a deployed circuit logic configuration file on the FPGA structure by the FPGA chip.
5. The method of claim 1, wherein the code program in the local space is pre-processed by an original code program.
6. The method of claim 5, the pre-processing comprising at least one of: analyzing and converting each field contained in the code program into a preset data structure; and adjusting the offset of the jump instruction in the code program.
7. The method of claim 1, the FPGA fabric determining a contract address for the smart contract invoked by the transaction, comprising:
under the condition that the transaction is in an encrypted state, the FPGA structure transmits the transaction to a decryption module on an FPGA chip contained in the FPGA structure, and the decryption module is formed by loading a deployed circuit logic configuration file on the FPGA structure by the FPGA chip;
and the FPGA structure extracts the contract address from the decrypted transaction content output by the decryption module.
8. The method of claim 1, further comprising:
the FPGA structure transmits the code program to an FPGA chip contained in the FPGA structure to form an on-chip processor for realizing the logic of a virtual machine;
the on-chip processor is formed by loading a deployed circuit logic configuration file on the FPGA structure by the FPGA chip.
9. An apparatus for implementing contract calling based on FPGA, comprising:
the transaction acquisition unit enables the FPGA structure to acquire the transactions received by the block chain nodes to which the FPGA structure belongs;
the address determination unit enables the FPGA structure to determine a contract address of the intelligent contract called by the transaction;
and the program acquisition unit is used for enabling the FPGA structure to acquire the code program corresponding to the contract address from a local space so as to run the code program on the FPGA structure.
10. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor implements the method of any one of claims 1-9 by executing the executable instructions.
11. A computer readable storage medium having stored thereon computer instructions which, when executed by a processor, carry out the steps of the method according to any one of claims 1 to 9.
CN201910913486.0A 2019-09-25 2019-09-25 Method and device for realizing contract calling based on FPGA Active CN110751555B (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CN202110221182.5A CN112927077B (en) 2019-09-25 2019-09-25 Method and device for realizing contract calling based on FPGA
CN201910913486.0A CN110751555B (en) 2019-09-25 2019-09-25 Method and device for realizing contract calling based on FPGA
PCT/CN2020/107119 WO2021057272A1 (en) 2019-09-25 2020-08-05 Method and apparatus for implementing contract invoking based on fpga

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910913486.0A CN110751555B (en) 2019-09-25 2019-09-25 Method and device for realizing contract calling based on FPGA

Related Child Applications (1)

Application Number Title Priority Date Filing Date
CN202110221182.5A Division CN112927077B (en) 2019-09-25 2019-09-25 Method and device for realizing contract calling based on FPGA

Publications (2)

Publication Number Publication Date
CN110751555A true CN110751555A (en) 2020-02-04
CN110751555B CN110751555B (en) 2021-01-12

Family

ID=69277097

Family Applications (2)

Application Number Title Priority Date Filing Date
CN201910913486.0A Active CN110751555B (en) 2019-09-25 2019-09-25 Method and device for realizing contract calling based on FPGA
CN202110221182.5A Active CN112927077B (en) 2019-09-25 2019-09-25 Method and device for realizing contract calling based on FPGA

Family Applications After (1)

Application Number Title Priority Date Filing Date
CN202110221182.5A Active CN112927077B (en) 2019-09-25 2019-09-25 Method and device for realizing contract calling based on FPGA

Country Status (2)

Country Link
CN (2) CN110751555B (en)
WO (1) WO2021057272A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110751555B (en) * 2019-09-25 2021-01-12 支付宝(杭州)信息技术有限公司 Method and device for realizing contract calling based on FPGA

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115987513B (en) * 2023-03-17 2023-06-20 山东浪潮科学研究院有限公司 Distributed database fragment encryption and decryption methods, devices, equipment and media

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107103472A (en) * 2017-04-26 2017-08-29 北京计算机技术及应用研究所 A kind of algorithm processing module for block chain
US20180203629A1 (en) * 2017-01-19 2018-07-19 Intel Corporation Mrc training in fpga-in-memory-controller
US20190043050A1 (en) * 2018-06-29 2019-02-07 Intel Corporation Protection of Information in an Information Exchange
CN109670335A (en) * 2018-12-20 2019-04-23 众安信息技术服务有限公司 For in the method and device interacted between data outside block chain and chain
CN109886682A (en) * 2019-01-31 2019-06-14 阿里巴巴集团控股有限公司 The method and node, storage medium that contract calls are realized in block chain
WO2019120315A2 (en) * 2019-03-26 2019-06-27 Alibaba Group Holding Limited Field-programmable gate array based trusted execution environment for use in a blockchain network
CN110008735A (en) * 2019-01-31 2019-07-12 阿里巴巴集团控股有限公司 The method and node, storage medium that contract calls are realized in block chain
CN110187827A (en) * 2018-02-23 2019-08-30 三星电子株式会社 Programmable data storage device and programmable network data-storage system

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2992458A1 (en) * 2015-07-14 2017-01-19 Fmr Llc Computationally efficient transfer processing, auditing, and search apparatuses, methods and systems
US11488121B2 (en) * 2017-05-11 2022-11-01 Microsoft Technology Licensing, Llc Cryptlet smart contract
US10681033B2 (en) * 2017-10-16 2020-06-09 Microsoft Technology Licensing, Llc Selecting and securing proof delgates for cryptographic functions
CN108833398B (en) * 2018-06-08 2020-12-15 深圳智链未来科技有限公司 Block chain intelligent contract updating method, device and equipment
CN109376541A (en) * 2018-09-21 2019-02-22 上海点融信息科技有限责任公司 For running the method, apparatus and computer storage medium of intelligent contract
CN109358859B (en) * 2018-09-27 2021-07-30 上海点融信息科技有限责任公司 Method, device and storage medium for installing intelligent contract in block chain network
CN111614464B (en) * 2019-01-31 2023-09-29 创新先进技术有限公司 Method for safely updating secret key in blockchain, node and storage medium
CN110751555B (en) * 2019-09-25 2021-01-12 支付宝(杭州)信息技术有限公司 Method and device for realizing contract calling based on FPGA

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180203629A1 (en) * 2017-01-19 2018-07-19 Intel Corporation Mrc training in fpga-in-memory-controller
CN107103472A (en) * 2017-04-26 2017-08-29 北京计算机技术及应用研究所 A kind of algorithm processing module for block chain
CN110187827A (en) * 2018-02-23 2019-08-30 三星电子株式会社 Programmable data storage device and programmable network data-storage system
US20190043050A1 (en) * 2018-06-29 2019-02-07 Intel Corporation Protection of Information in an Information Exchange
CN109670335A (en) * 2018-12-20 2019-04-23 众安信息技术服务有限公司 For in the method and device interacted between data outside block chain and chain
CN109886682A (en) * 2019-01-31 2019-06-14 阿里巴巴集团控股有限公司 The method and node, storage medium that contract calls are realized in block chain
CN110008735A (en) * 2019-01-31 2019-07-12 阿里巴巴集团控股有限公司 The method and node, storage medium that contract calls are realized in block chain
WO2019120315A2 (en) * 2019-03-26 2019-06-27 Alibaba Group Holding Limited Field-programmable gate array based trusted execution environment for use in a blockchain network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
MARCUS BRANDENBURGER: "Blockchain and trusted computing:problems,pitfalls,and a solution for hyperledger fabric", 《COMPUTER SCIENCE》 *
张阀东: "基于FPGA的数字图像复原研究及实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110751555B (en) * 2019-09-25 2021-01-12 支付宝(杭州)信息技术有限公司 Method and device for realizing contract calling based on FPGA
WO2021057272A1 (en) * 2019-09-25 2021-04-01 支付宝(杭州)信息技术有限公司 Method and apparatus for implementing contract invoking based on fpga

Also Published As

Publication number Publication date
CN110751555B (en) 2021-01-12
CN112927077B (en) 2022-05-24
CN112927077A (en) 2021-06-08
WO2021057272A1 (en) 2021-04-01

Similar Documents

Publication Publication Date Title
US11048825B2 (en) Managing a smart contract on a blockchain
CN110992027B (en) Efficient transaction method and device for realizing privacy protection in block chain
CN113438068B (en) Method and device for realizing dynamic encryption based on block height
CN110263544B (en) Receipt storage method and node combining transaction type and judgment condition
CN110690963B (en) Key agreement method and device based on FPGA
CN110245947B (en) Receipt storage method and node combining conditional restrictions of transaction and user types
CN110716728B (en) Credible updating method and device for FPGA (field programmable Gate array) logic
CN110245942B (en) Receipt storage method and node combining user type and judgment condition
CN110717203B (en) Method and device for realizing privacy block chain based on FPGA
CN110750488B (en) Method and device for realizing external calling in FPGA
CN110750329B (en) Method and device for realizing operation of virtual machine based on FPGA
CN110704368B (en) Efficient operation method and device of safe intelligent contract processor based on FPGA
CN110738567B (en) Transaction processing method and device of safe intelligent contract processor based on FPGA
WO2021057124A1 (en) Fpga-based privacy block chain implementing method and device
CN110751555B (en) Method and device for realizing contract calling based on FPGA
WO2021057273A1 (en) Method and apparatus for realizing efficient contract calling on fpga
WO2021057221A1 (en) Method and apparatus for realizing state update based on fpga
CN110750303B (en) Pipelined instruction reading method and device based on FPGA
CN114866409B (en) Password acceleration method and device based on password acceleration hardware

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 40023012

Country of ref document: HK

GR01 Patent grant
GR01 Patent grant