[go: up one dir, main page]

WO2019231408A1 - Balance block chain transaction system and recording method - Google Patents

Balance block chain transaction system and recording method Download PDF

Info

Publication number
WO2019231408A1
WO2019231408A1 PCT/TH2019/000016 TH2019000016W WO2019231408A1 WO 2019231408 A1 WO2019231408 A1 WO 2019231408A1 TH 2019000016 W TH2019000016 W TH 2019000016W WO 2019231408 A1 WO2019231408 A1 WO 2019231408A1
Authority
WO
WIPO (PCT)
Prior art keywords
recording method
previous
block
transaction system
block chain
Prior art date
Application number
PCT/TH2019/000016
Other languages
French (fr)
Inventor
Monai METTKARUCHIT
Original Assignee
Mettkaruchit Monai
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
Priority claimed from TH1801003232A external-priority patent/TH1801003232A/en
Application filed by Mettkaruchit Monai filed Critical Mettkaruchit Monai
Publication of WO2019231408A1 publication Critical patent/WO2019231408A1/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/02—Payment architectures, schemes or protocols involving a neutral party, e.g. certification authority, notary or trusted third party [TTP]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/401—Transaction verification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/12—Accounting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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
    • G06Q2220/00—Business processing using cryptography

Definitions

  • Bfockchain technology is a new technology used in digital currencies and will be used in electronic cash systems.
  • Blockchain technology is a data structure that stores transactions and can be used as separate electronic accounts that record transactions between identification cards and destination numbers. Transactions are collected in the block and every block (except the first), meaning transactions return to or are connected with the previous block in the chain.
  • Computer nodes cryptographically store block chains by checking each new block and making transactions in related blocks. All transactions are stored from the origin of the transaction to the destination of the transaction, which will be disclosed to the public and can be exam ined. This examination step is considered evidence of transaction.
  • Completeness is confidence that previously recorded transactions have no block chain corrections and all recorded transactions remain because each block stores data and can be checked to confirm the accuracy of the previous block.
  • the previous block is difficult for data revisions or interference such as changes to transactions currently in the block because even minor adjustments to data will have effects on causing values to be changed for the entire group.
  • Each additional block increases difficulty in revising previous content. Therefore, even though the block chain content may be ready for use by any person who views it, block chains cannot be changed in practice.
  • the indicators used for block chain transactions are created through coding.
  • the user when keying codes in public, the user can specify destinations according to private keys.
  • the relationship between private keys and destination indicators can subsequently be used as evidence of the user’s connection with outcomes from the transaction created. In other words, the user can create new transactions to“spend” the content of previous transactions.
  • the relationship between destination indicators and related private keys are known by users, the number of users is not disclosed because several destination indicators can be created by connecting through only private keys.
  • the overall relationship between users and multiple transactions included in the block chain may be hidden from other users, even though transaction information may be publicly disclosed in accounts separating participants. Addresses under the aforementioned transactions may be hidden because indicators connected to private keys are only known among the participants involved.
  • blockchain technology has the capacity to introduce new benefits
  • blockchain technology has problems in calculating and checking to confirm the accuracy of the previous blocks.
  • blockchain technology may require computers with high processing power and may take many days.
  • the first block has 1,000,000 baht. There are a total of five blocks. Each block has 200,000 baht.
  • A has 200,000 baht.
  • B has 200,000 baht.
  • C has 200,000 baht.
  • D has 200,000 baht.
  • E has 200,000 baht.
  • a single simple confirmation model is used to confirm the authenticity of all previous transactions.
  • E* transfers 50,000 baht to C.
  • C transfer 40,000 baht to D.
  • A must confirm a transfer of 100,000 baht to B.
  • Examinations to confirm the accuracy of the previous block may require computers with high processing power and may need several days, because each additional block without limited amounts may have several hundred million blocks, several billion blocks, tens of billions of blocks, trillions of blocks previously or an infinite number of blocks. These conditions will create difficulty in checking to confirm the accuracy of previous blocks. Therefore, although examinations to confirm the accuracy of previous blocks have been cut shorter because it is sufficient to be confident that blocks cannot be changed in practice, several days wilt still be needed for safely and management of malicious access to computer systems to make changes in a complicated system.
  • the block chain system s major problem is confirming the accuracy of previous blocks, which takes a long time and needs computers with an advanced operating system for calculations.
  • this invention therefore, the problem is solved by conducting transactions from the previous block to the next block by transferring numbers to the next block in an inclusive relationship between users and multiple transactions included in the block chain. Transactions from the previous block to the next block need to be calculated and require time to check and report on the accuracy of the previous block in order to gain approval from the next block.
  • the special characteristic is transactions of the previous block to the next block by transferring numbers to the next block by bringing the entire sum forward in order for ali transactions to be on the surface along with reducing need for examinations to confirm the accuracy of previous blocks and becoming unchangeable in practice.
  • A has 200,000 baht and wants to transfer 100,000 baht to B, A must perform the following actions:
  • A must transfer 100,000 baht to B.
  • A must transfer 100,000 baht to A.
  • C transfers 40,000 baht to D.
  • D transfers 30,000 baht to E.
  • Previous blocks There are five previous blocks. These five blocks are divided into a section. This section will be checked to confirm the accuracy of the previous block by independent operators or users who can access with private keys, which will drastically reduce time in checking to confirm the accuracy of previous blocks. Previous blocks divided into sections are called Data 1, Data 2 and Data 3, etc., and will be checked to confirm the accuracy of the previous block by Admin 1, Admin 2 mid Admin 3, respectively, etc.
  • Figure 1 shows plans of the Balance Block Chain Transaction System and Recording Method with two major characteristics:
  • Previous blocks (10) divided into sections are called Data consisting of at least Data 1 (11), Data 2 (12) and Data 3 (13), etc. and will be checked to confirm die accuracy of the previous block (.10) at least by Admin 1 (21), Admin 2 (22) and Admin 3 (23), respectively, etc.
  • the first block has 1,000,000 baht. There are a total of five blocks. Each block has 200,000 baht.
  • A has 200,000 baht.
  • B has 200,000 baht.
  • C has 200,000 baht.
  • D has 200,000 baht.
  • E has 200, 000 baht.
  • A has 200,000 baht.
  • A transfers 100,000 baht to B and A transfers 100,000 baht to A (himself/herself).
  • the total is 200,000 baht.
  • A’s transaction is made by bringing the entire sum forward in order for all transactions to be on the surface (20).
  • T herefore, 200,000 baht will be a display of the current status of A’s sum on the surface (20).
  • B has 100,000 baht.
  • B transfers 50,000 baht to C and B transfers 50,000 baht to B (himself/herself).
  • B’s transaction is made by bringing the entire sum forward in order for all transactions to be on the surface (20). Therefore, 200,000 baht will be a display of the current status of B’s sum on the surface (20).
  • C has 50,000 baht.
  • C transfers 40,000 baht to D and C transfers 10,000 baht to C (himself/herself).
  • D transfers 30,000 baht to E and D transfers 10,000 baht to D (himself/herself).
  • D’s transaction is made by bringing the entire sum forward in order for all transactions to be on the surface (20). Therefore, 40,000 baht will be a display of the current status of D’s sum on the surface (20).
  • E has 30,000 baht.
  • E transfers 20,000 baht to F and E transfers 10,000 baht to E (himself/herself).
  • At least one previous block (10) of data will be designated Data 1 (1 1).
  • Data 1 will be checked by an odd number of independent administrators (Admin) (30) such as 3, 5, 7, 9, 1 1, etc., with Admin 1 (21 ), (Admin 2 (22) and Admin 3 (23), respectively, etc., to confirm accuracy of the previous block (10).
  • An odd number of independent administrators (Admin) (30) will have the duty of checking to confirm accuracy of the previous block (10) in order for transactions of destination blocks to be approved.
  • An odd number of independent administrators (30) will enter private keys to check and confirm accuracy of the previous block (10) in order for transactions of destination blocks to be approved.
  • a higher number of independent administrators (30) will approve transactions of die destination block.
  • An odd number of independent administrators (30) will be able to specify destinations according to private keys and an odd number of independent administrators (Admin) (30) will be unable to specify destinations according to private keys.
  • An amount of data functions to divide the previous block (10) into sections and independent administrators (30) will have data to perform the duty of checking to confirm data accuracy in order for transactions of the destination block to be approved.
  • each additional block with an unlimited number may have several hundred million, billions, tens of billions, trillions or an infinite number of previous blocks (10). Specification of conditions with these characteristics will not create problems because transaction data is created at all times on the surface (20), checks to confirm accuracy of previous blocks ( 10) are easy to perform and cannot be changed in practice. Brief drawing description
  • Figure 1 shows the Balance Block Chain Transaction System and Recording Method in this invention. Best Invention Method

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Development Economics (AREA)
  • Technology Law (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Debugging And Monitoring (AREA)

Abstract

A balance block chain transaction system and a recording method are provided. The method includes: conducting transactions from previous block (10) to next block by transferring numbers to the next block in an overall relationship between users and multiple transactions included in the block chain. Transactions from the previous block (10) to the next block needs to be calculated and needs time to check accuracy of the previous block in order to gain approval from the next block. Transactions of the previous block (10) to the next block are conducted by bringing the entire sum forward in order for all transactions to be on the surface (20). The method can reduce need for examinations to confirm the accuracy of previous blocks (10) and become unchangeable in practice.

Description

BALANCE BLOCK CHAIN TRANSACTION SYSTEM AND RECORDING METHOD
Branch of Science Associated with the Invention
Computer engineering as related to the Balance Block Chain Transaction System and Recording Method. Background of related art or science
Bfockchain technology is a new technology used in digital currencies and will be used in electronic cash systems.
Blockchain technology is a data structure that stores transactions and can be used as separate electronic accounts that record transactions between identification cards and destination numbers. Transactions are collected in the block and every block (except the first), meaning transactions return to or are connected with the previous block in the chain.
Computer nodes cryptographically store block chains by checking each new block and making transactions in related blocks. All transactions are stored from the origin of the transaction to the destination of the transaction, which will be disclosed to the public and can be exam ined. This examination step is considered evidence of transaction.
Completeness is confidence that previously recorded transactions have no block chain corrections and all recorded transactions remain because each block stores data and can be checked to confirm the accuracy of the previous block.
Therefore, the previous block is difficult for data revisions or interference such as changes to transactions currently in the block because even minor adjustments to data will have effects on causing values to be changed for the entire group. Each additional block increases difficulty in revising previous content. Therefore, even though the block chain content may be ready for use by any person who views it, block chains cannot be changed in practice.
The indicators used for block chain transactions are created through coding. For example, when keying codes in public, the user can specify destinations according to private keys. The relationship between private keys and destination indicators can subsequently be used as evidence of the user’s connection with outcomes from the transaction created. In other words, the user can create new transactions to“spend” the content of previous transactions. Furthermore, because the relationship between destination indicators and related private keys are known by users, the number of users is not disclosed because several destination indicators can be created by connecting through only private keys.
Therefore, the overall relationship between users and multiple transactions included in the block chain may be hidden from other users, even though transaction information may be publicly disclosed in accounts separating participants. Addresses under the aforementioned transactions may be hidden because indicators connected to private keys are only known among the participants involved.
While blockchain technology has the capacity to introduce new benefits, blockchain technology has problems in calculating and checking to confirm the accuracy of the previous blocks. In addition, blockchain technology may require computers with high processing power and may take many days.
For example, the first block has 1,000,000 baht. There are a total of five blocks. Each block has 200,000 baht.
A has 200,000 baht.
B has 200,000 baht.
C has 200,000 baht.
D has 200,000 baht.
E has 200,000 baht.
A single simple confirmation model is used to confirm the authenticity of all previous transactions.
For example:
A transfers 100,000 baht to B.
E* transfers 50,000 baht to C. C transfer 40,000 baht to D.
D transfers 30,000 baht to E.
E transfers 20,000 baht to F.
The final transaction between E and F at the amount of 20,000 baht will be complete only when there is confirmation from the previous block of the transaction. In other words:
A must confirm a transfer of 100,000 baht to B.
B must confirm a transfer of 50,000 baht to C.
C must confirm a transfer of 40,000 baht to D.
D must confirm a transfer of 30,000 baht to E.
Examinations to confirm the accuracy of the previous block may require computers with high processing power and may need several days, because each additional block without limited amounts may have several hundred million blocks, several billion blocks, tens of billions of blocks, trillions of blocks previously or an infinite number of blocks. These conditions will create difficulty in checking to confirm the accuracy of previous blocks. Therefore, although examinations to confirm the accuracy of previous blocks have been cut shorter because it is sufficient to be confident that blocks cannot be changed in practice, several days wilt still be needed for safely and management of malicious access to computer systems to make changes in a complicated system.
Therefore, the block chain system’s major problem is confirming the accuracy of previous blocks, which takes a long time and needs computers with an advanced operating system for calculations. in this invention, therefore, the problem is solved by conducting transactions from the previous block to the next block by transferring numbers to the next block in an inclusive relationship between users and multiple transactions included in the block chain. Transactions from the previous block to the next block need to be calculated and require time to check and report on the accuracy of the previous block in order to gain approval from the next block. In this action, the special characteristic is transactions of the previous block to the next block by transferring numbers to the next block by bringing the entire sum forward in order for ali transactions to be on the surface along with reducing need for examinations to confirm the accuracy of previous blocks and becoming unchangeable in practice. Invention Characteristics and Objectives
The Balance Block Chain Transaction System and Recording Method has the following two major characteristics:
1. Transactions of the previous block must be made by bringing the entire sum forward.
For example:
If A has 200,000 baht and wants to transfer 100,000 baht to B, A must perform the following actions:
A must transfer 100,000 baht to B.
A must transfer 100,000 baht to A.
This is to ensure that all transactions are on the surface and to reduce the need to check and confirm accuracy of the previous block. When all transactions are on the surface, meaning transactions brought entirely forward, calculations back to the previous block will be less important because all transactions are on the surface and numbers on the surface can be calculated easily and become practically unchangeable.
2. Examinations to confirm the accuracy of previous blocks will be maintained to ensure that all transactions become practically unchangeable. Examinations to confirm the accuracy of previous blocks will be carried out by independent operators or users who will divide the previous block into a number of sections. For example:
A transfers 100,000 baht to B.
B transfers 50,000 baht to C.
C transfers 40,000 baht to D. D transfers 30,000 baht to E.
E transfers 20,000 baht to F.
There are five previous blocks. These five blocks are divided into a section. This section will be checked to confirm the accuracy of the previous block by independent operators or users who can access with private keys, which will drastically reduce time in checking to confirm the accuracy of previous blocks. Previous blocks divided into sections are called Data 1, Data 2 and Data 3, etc., and will be checked to confirm the accuracy of the previous block by Admin 1, Admin 2 mid Admin 3, respectively, etc.
This means checks can be performed quickly and create motivation for many users. The aforementioned characteristics are only examples and other characteristics will appear more clearly in other information.
Full Disclosure of the invention
Figure 1 shows plans of the Balance Block Chain Transaction System and Recording Method with two major characteristics:
1. Transactions of the previous block (10) must be made by bringing the entire sum forward in order for all transactions to be on the surface (20) and to reduce the need to check and confirm accuracy of the previous block (10). When all transactions are on the surface (20), meaning transactions brought entirely forward, calculations back to the previous block (10) will be less important because all transactions are on the surface (20) and the numbers on the surface (20) can be calculated easily and become practically unchangeable.
2. Examinations to confirm the accuracy of previous blocks (10) will be maintained to ensure that all transactions become practically unchangeable. Examinations to confirm the accuracy of previous blocks (10) will be carried out by independent operators (30) or users who will divide the previous block ( 10) into a number of sections. Previous blocks ( 10) divided into sections are called Data consisting of at least Data 1 (11), Data 2 (12) and Data 3 (13), etc. and will be checked to confirm die accuracy of the previous block (.10) at least by Admin 1 (21), Admin 2 (22) and Admin 3 (23), respectively, etc.
With the following information: For example, the first block has 1,000,000 baht. There are a total of five blocks. Each block has 200,000 baht.
A has 200,000 baht.
B has 200,000 baht.
C has 200,000 baht.
D has 200,000 baht.
E has 200, 000 baht.
A total of 1 ,000,000 baht.
According to the following example of A's transaction:
A has 200,000 baht.
A transfers 100,000 baht to B and A transfers 100,000 baht to A (himself/herself).
The total is 200,000 baht. A’s transaction is made by bringing the entire sum forward in order for all transactions to be on the surface (20). T herefore, 200,000 baht will be a display of the current status of A’s sum on the surface (20).
A’s previous block with 200,000 baht will sink under the surface and no longer be considered as data showing current status.
B has 100,000 baht.
B transfers 50,000 baht to C and B transfers 50,000 baht to B (himself/herself).
A total of 100,000 baht. B’s transaction is made by bringing the entire sum forward in order for all transactions to be on the surface (20). Therefore, 200,000 baht will be a display of the current status of B’s sum on the surface (20).
B’s previous block with 100,000 baht will sink under the surface and no longer be considered as data showing current status.
C has 50,000 baht.
C transfers 40,000 baht to D and C transfers 10,000 baht to C (himself/herself).
A total of 50,000 baht. C’s transaction is made by bringing the entire sum forward in order for all transactions to be on the surface (20). Therefore, 50,000 baht will be a display of the current status of C’s sum on the surface (20).
C’s previous block with 50,000 baht will sink under the surface and no longer be considered as data showing current status.
D has 40,000 baht.
D transfers 30,000 baht to E and D transfers 10,000 baht to D (himself/herself).
A total of 40,000 baht. D’s transaction is made by bringing the entire sum forward in order for all transactions to be on the surface (20). Therefore, 40,000 baht will be a display of the current status of D’s sum on the surface (20).
D’s previous block with 40,000 baht will sink under the surface and no longer be considered as data showing current status.
E has 30,000 baht.
E transfers 20,000 baht to F and E transfers 10,000 baht to E (himself/herself).
A total of 30,000 baht. E’s transaction is made by bringing the entire sum forward in order for all transactions to be on the surface (20). Therefore, 30,000 baht will be a display of the current status of E’s sum on the surface (20).
E’s previous block with 30,000 baht will sink under the surface and no longer be considered as data showing current status.
At least one previous block (10) of data will be designated Data 1 (1 1).
A’s previous block (10) with 200,000 baht will sink under the surface.
B’s previous block (10) with 100,000 baht will sink under the surface.
C’s previous block ( 10) with 50,000 baht will sink under the surface.
D’s previous block (10) with 40,000 baht will sink under the surface.
E’s previous block ( 10) with 30,000 baht will sink under the surface.
Data 1 will be checked by an odd number of independent administrators (Admin) (30) such as 3, 5, 7, 9, 1 1, etc., with Admin 1 (21 ), (Admin 2 (22) and Admin 3 (23), respectively, etc., to confirm accuracy of the previous block (10). An odd number of independent administrators (Admin) (30) will have the duty of checking to confirm accuracy of the previous block (10) in order for transactions of destination blocks to be approved.
An odd number of independent administrators (30) will enter private keys to check and confirm accuracy of the previous block (10) in order for transactions of destination blocks to be approved. A higher number of independent administrators (30) will approve transactions of die destination block.
An odd number of independent administrators (30) will be able to specify destinations according to private keys and an odd number of independent administrators (Admin) (30) will be unable to specify destinations according to private keys.
An odd number of independent administrators (30) will be unable to connect via private keys.
An amount of data functions to divide the previous block (10) into sections and independent administrators (30) will have data to perform the duty of checking to confirm data accuracy in order for transactions of the destination block to be approved.
A number of data and independent administrators (Admin) (30) will be match-paired and have checking groups divided.
Therefore, each additional block with an unlimited number may have several hundred million, billions, tens of billions, trillions or an infinite number of previous blocks (10). Specification of conditions with these characteristics will not create problems because transaction data is created at all times on the surface (20), checks to confirm accuracy of previous blocks ( 10) are easy to perform and cannot be changed in practice. Brief drawing description
Figure 1 shows the Balance Block Chain Transaction System and Recording Method in this invention. Best Invention Method
This section is written in accordance with the statement in the sufficiency of disclosure section.

Claims

Claims
1. The Balance Block Chain Transaction System and Recording Method has the following characteristics:
Transactions of the previous block (10) to the next block will be conducted by transferring numbers to the next block in an overall relationship between users and multiple transactions included in the block chain. Transactions from the previous block ( 10) to the next block needs to be calculated and needs time to check accuracy of the previous block in order to gain approval from the next block.
'fhe special characteristics are as follows:
Transactions of the previous block (10) to the next block by transferring numbers to the next block by bringing the entire sum forward in order for all transactions to be on the surface (20) along with reducing need for examinations to confirm the accuracy of previous blocks (10) and becoming unchangeable in practice.
2. The Balance Block Chain Transaction System and Recording Method in Claim 1 is such that the transactions of the previous block (10) will be made to the next block by transferring numbers to at least one adjacent block.
3. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-2 is such that checks to confirm accuracy of the previous block (10) will be performed by independent administrators (Admin) (30).
4. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-3 is such that checks to confirm accuracy of the previous block (10) will be performed by a number of users who will divide the previous block into sections.
5. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-4 is such that previous blocks (10) will be divided into sections with a number of Data 1 (1 1), Data 2 ( 12) and Data 3 (13).
6. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-5 is such that checks to confirm accuracy of previous blocks ( 10) will be performed by at least one Admin 1 (1 1), at least one Admin 2 (12) and at least one Admin 3 (13).
7. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-6 is such that transactions of the previous block (10) to the next block are performed by transferring numbers to the next block by bringing the entire sum forward. The previous block (10) will sink under the surface and no longer be considered as data showing current status.
8. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-7 is such that data will be managed and checked to confirm die accuracy of previous blocks ( 10) by an odd number of independent administrators (30) in order for transactions of destination blocks to be approved.
9. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-8 is such that an odd number of independent administrators (Admin) (30) will enter private keys to check and confirm accuracy of previous blocks (10) in order for transactions of destination blocks to be approved.
10. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-9 is such that a group of independent administrators (Admin) (30) with larger numbers will approve the transactions of destination blocks.
11. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-10 is such that an odd number of independent administrators (Admin) (30) will be persons with specified destinations according to private keys.
12. 1'he Balance Block Chain Transaction System and Recording Method in any of Claims 1-1 1 is such that an odd number of independent administrators (30) will be unable to specify destinations according to private keys.
13. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-12 is such that an odd number of independent administrators (Admin) (30) will be unable to connect through private keys.
14. The Balance Block Chain Transaction System and Recording Method in any of Claims 1 - 13 is such that a number of data functions to divide previous blocks into sections.
15. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-14 is such that a number of independent administrators (Admin) (30) will perform the duty of checking to confirm data accuracy to allow transactions of destination blocks to be approved.
16. The Balance Block Chain Transaction System and Recording Method in any of Claims 1 -15 is such that a number of data and independent administrators (Admin) (30) will be match-paired to divide checking groups.
17. The Balance Block Chain Transaction System and Recording Method in any of Claims 1 -16 is such that additional blocks will be infinite.
18. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-17 is such that new transaction data will be created on the surface at all times (20).
19. The Balance Block Chain I'ransaction System and Recording Method in any of Claims 1-18 is such that checks to confirm accuracy of the previous block (10) will be performed only for parts of the previous block (10) that ate sunk under the surface.
20. The Balance Block Chain Transaction System and Recording Method in any of Claims 1-19 is such that the Balance Block Chain Transaction System and Recording Method is used for the electronic cash system.
PCT/TH2019/000016 2018-06-01 2019-05-29 Balance block chain transaction system and recording method WO2019231408A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
TH1801003232A TH1801003232A (en) 2018-06-01 System and method for recording transactions in a balanced blockchain (BALANCE BLOCK CHAIN)
TH1801003232 2018-06-01

Publications (1)

Publication Number Publication Date
WO2019231408A1 true WO2019231408A1 (en) 2019-12-05

Family

ID=68698919

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/TH2019/000016 WO2019231408A1 (en) 2018-06-01 2019-05-29 Balance block chain transaction system and recording method

Country Status (1)

Country Link
WO (1) WO2019231408A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111488350A (en) * 2020-04-08 2020-08-04 北京瑞策科技有限公司 Entity relation storage method and device of business data block chain
US11743327B2 (en) 2021-02-05 2023-08-29 International Business Machines Corporation Topological ordering of blockchain associated proposals

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106548330A (en) * 2016-10-27 2017-03-29 上海亿账通区块链科技有限公司 Transaction verification method and system based on block chain
CN107196900A (en) * 2017-03-24 2017-09-22 阿里巴巴集团控股有限公司 A kind of method and device for verification of knowing together
CN107240017A (en) * 2017-07-20 2017-10-10 捷德（中国）信息科技有限公司 Block chain trade managing system and method
CN107679863A (en) * 2017-09-19 2018-02-09 中国银行股份有限公司 A kind of method of block catenary system and fast verification block
US20180115428A1 (en) * 2016-10-26 2018-04-26 Acronis International Gmbh System and method for verification of data transferred among several data storages
CN108053211A (en) * 2017-12-27 2018-05-18 北京欧链科技有限公司 Transaction processing method and device based on block chain

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180115428A1 (en) * 2016-10-26 2018-04-26 Acronis International Gmbh System and method for verification of data transferred among several data storages
CN106548330A (en) * 2016-10-27 2017-03-29 上海亿账通区块链科技有限公司 Transaction verification method and system based on block chain
CN107196900A (en) * 2017-03-24 2017-09-22 阿里巴巴集团控股有限公司 A kind of method and device for verification of knowing together
CN107240017A (en) * 2017-07-20 2017-10-10 捷德（中国）信息科技有限公司 Block chain trade managing system and method
CN107679863A (en) * 2017-09-19 2018-02-09 中国银行股份有限公司 A kind of method of block catenary system and fast verification block
CN108053211A (en) * 2017-12-27 2018-05-18 北京欧链科技有限公司 Transaction processing method and device based on block chain

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111488350A (en) * 2020-04-08 2020-08-04 北京瑞策科技有限公司 Entity relation storage method and device of business data block chain
US11743327B2 (en) 2021-02-05 2023-08-29 International Business Machines Corporation Topological ordering of blockchain associated proposals

Similar Documents

Publication Publication Date Title
Williamson et al. Will working from home become the ‘new normal’in the public sector?
Grigoli et al. Waste not, want not: the efficiency of health expenditure in emerging and developing economies
Kerkouche et al. Privacy-preserving and bandwidth-efficient federated learning: An application to in-hospital mortality prediction
Roughead The nature and extent of drug‐related hospitalisations in Australia
Lundereng et al. Nurses’ experiences and perspectives on collaborative discharge planning when patients receiving palliative care for cancer are discharged home from hospitals
KR102017739B1 (en) Blockchain system and method of creating blockchain
CN103562851A (en) Data perturbation and anonymization using one-way hash
Whelan “Ask for more time”: big data chronopolitics in the Australian welfare bureaucracy
CN110445845A (en) It is a kind of distribution account book in the system architecture based on boss's account book
CN111582653A (en) Government affair service evaluation processing method, system, device and storage medium
WO2019231408A1 (en) Balance block chain transaction system and recording method
Mirel et al. A methodological assessment of privacy preserving record linkage using survey and administrative data
Wang et al. Use of the SONET score to evaluate high volume emergency department overcrowding: a prospective derivation and validation study
Podani Tree thinking, time and topology: comments on the interpretation of tree diagrams in evolutionary/phylogenetic systematics
Shepard et al. Public health nurses' responses to domestic violence: a report from the Enhanced Domestic Abuse Intervention Project
WO2020003174A2 (en) Semantic graph textual coding
Sharaff et al. Deep learning‐based smishing message identification using regular expression feature generation
Yu et al. Optimal matching for observational studies that integrate quantitative and qualitative research
Zadeh Preliminary draft notes on a similarity‐based analysis of time‐series with applications to prediction, decision and diagnostics
Matta et al. Embedding representations of diagnosis codes for outlier payment detection
CN115393105A (en) A claim settlement automatic verification method, device, computer equipment and storage medium
Alirezaee et al. Trade‐offs in integer data envelopment analysis
CN112685770A (en) Data processing method, device and system based on block chain
CN119669488B (en) An integrated data aggregation optimization method based on cloud computing
Van den Ende et al. Effect of applying a treatment threshold in a population. An example of pulmonary tuberculosis in Rwanda

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19812468

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19812468

Country of ref document: EP

Kind code of ref document: A1