Systems and methods for implementing deterministic finite automata (DFAS) via a blockchain

A blockchain, block technology, applied in transmission systems, digital transmission systems, data processing applications, etc., can solve problems such as cannot be changed or deleted, hash changes, etc.

Pending Publication Date: 2019-06-21
NCHAIN HLDG LTD
View PDF3 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

These blocks can be viewed publicly, but cannot be changed or deleted once they are part of the blockchain, as changes would result in changes to the hash

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Systems and methods for implementing deterministic finite automata (DFAS) via a blockchain
  • Systems and methods for implementing deterministic finite automata (DFAS) via a blockchain
  • Systems and methods for implementing deterministic finite automata (DFAS) via a blockchain

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0153] Example 1 of the Codification Technique of the Invention - Simple Scenario

[0154] As already explained, a DFA consists of a finite set {S,I,t,s 0 ,F}, which represent the possible state (S), input (I), transition (t), initial state (S), respectively. 0 ) and a final state (F) (also known as the receiving state). Additionally, a set of actions (a) can be defined that represent the side effects of execution and determine the output of the computation.

[0155] For the description and illustration of the present invention, we will consider a 3-period coupon bond. The elements (and symbols) of the DFA we consider for such contracts can be statically defined as given in Tables 2 to 4. Note that the initial state is specified by S in our notation, and the accepting state is F 0 and F 1 .

[0156] Table 2: List of Contract Status of Coupon Bonds:

[0157] state describe S The contract is created and signed, the execution has not started. T 1

...

example 2

[0174] Example 2 of the Codification Technique of the Invention - Recurrence State

[0175] As mentioned above, some subset of states or coupon bonds (T i and D i state) correspond to very similar interpretations of state machine states, except that they differ in the number of time periods or coupons (i) they involve; that is, in the sense that they can be viewed as states that are repeated multiple times (eg from i=1 to a given imax, where in our case imax=3). In view of this, it makes sense to simplify the representation of the DFA by including all those states in the recurring state (R) for separate processing. With this simplification, we present below the contract state list (Table 7), state transition table (Table 8), equivalent state diagram (Table 8) of our exemplary coupon bond Figure 11 ) and the state definition table of the DFA (Table 9); note that the other elements of the DFA (inputs and actions) are unchanged from the previous section.

[0176] Table 7: ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a technique for implementing, controlling and automating a task or process on a blockchain such as, but not limited to, the Bitcoin blockchain. The invention is particularly suited for, but not limited to, automated execution of contracts such as smart contracts for financial agreements. However, other types of tasks and non-financial contracts can be implemented. The invention can be viewed as the implementation or incarnation of a state machine or DFA on a blockchain by using the unspent outputs of blockchain Transactions to represents the states of the machine, andspending of those outputs as the transition of the machine from one state to another. The invention provides a technical realisation and implementation of a mathematical model of computation conceivedas an abstract machine that can be in one of a finite set of states, and can change from one state to another (transition) when a triggering event of a finite set (called input) occurs. The inventioncomprises compilation and codification techniques for the DFA implementation.

Description

technical field [0001] The present invention generally relates to systems and protocols for automating the execution of computer-based process computer protocols, and more particularly to the verification, enforcement and / or execution of condition-controlled processes such as, for example, those related to contracts. However, the present invention is not limited to use in connection with contracts. The present invention also relates to blockchain technology, such as but not limited to the Bitcoin blockchain, and can be used to benefit from smart contracts. Background technique [0002] Computers have long been desired to automate and control the execution of tasks and processes. This is particularly true, for example, in the execution of agreements between parties (eg, parties related to financial agreements). Smart contracts have been a subject of academic and practical interest since the realization that electronic versions of the essence of contracts can be better defin...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/448
CPCG06F9/4498H04L9/0637G06Q20/389H04L63/1416
Inventor 克雷格·史蒂文·赖特佩德罗·希门尼斯·德尔加多
Owner NCHAIN HLDG LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap