WO2021010720A1 - 채굴 장치 - Google Patents
채굴 장치 Download PDFInfo
- Publication number
- WO2021010720A1 WO2021010720A1 PCT/KR2020/009222 KR2020009222W WO2021010720A1 WO 2021010720 A1 WO2021010720 A1 WO 2021010720A1 KR 2020009222 W KR2020009222 W KR 2020009222W WO 2021010720 A1 WO2021010720 A1 WO 2021010720A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- block
- mining
- generic
- mining device
- proof
- Prior art date
Links
- 238000005065 mining Methods 0.000 title claims abstract description 124
- 230000007246 mechanism Effects 0.000 claims abstract description 6
- 238000000034 method Methods 0.000 claims description 33
- 230000006870 function Effects 0.000 description 58
- 239000011159 matrix material Substances 0.000 description 21
- 239000013598 vector Substances 0.000 description 10
- 230000008569 process Effects 0.000 description 9
- 238000012795 verification Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 6
- 238000012937 correction Methods 0.000 description 5
- 238000013507 mapping Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 241001522296 Erithacus rubecula Species 0.000 description 1
- XUIMIQQOPSSXEZ-UHFFFAOYSA-N Silicon Chemical compound [Si] XUIMIQQOPSSXEZ-UHFFFAOYSA-N 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 229910052710 silicon Inorganic materials 0.000 description 1
- 239000010703 silicon Substances 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
Images
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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
-
- 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/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
-
- 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/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
- G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
-
- 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
- G06Q2220/10—Usage protection of distributed data files
Definitions
- a distributed consensus mechanism is needed to ensure system integrity by mutually verifying results between peer nodes. This consensus mechanism should be able to determine who created the new block and whether the chain is valid.
- Bitcoin is a representative cryptocurrency that uses the Proof-of-work (PoW) [2] algorithm.
- PoW Proof-of-work
- Proof-of-work is the most commonly used consensus algorithm in blockchain-based cryptocurrencies. In short, computing power is used to reach consensus by finding and checking hash values that meet specific requirements.
- Proof-of-work is the process of finding a nonce value that makes the block hash value smaller than the target value. Nonce is one of the information specified in the block header.
- a nonce set which is a set of nonce values, is defined, and a nonce value is selected one by one from the nonce set and assigned to the hash function. At this time, the nonce value used once is excluded from the nonce set and is not used again.
- the target value represents the difficulty of calculating the nonce value, and is adjusted to generate a single block every 10 minutes on average.
- a mining device that forms a block chain by performing proof of work through a proof of work consensus mechanism creates a block chain when the network unit and the transaction occurs, and any one of a plurality of generic IDs in the ID pool And a control unit for broadcasting the generated block to another mining device corresponding to the selected generic ID.
- the plurality of generic IDs may be IDs corresponding to members of a closed blockchain community who have agreed on an operation method.
- the control unit may broadcast the generated block only to mining devices corresponding to the plurality of generic IDs.
- the plurality of generic IDs may be generated using fingerprints of mining devices owned by the members.
- control unit may return to the previous mining device.
- the controller may insert the selected generic ID into a block header and broadcast the block including the block header into which the generic ID is inserted.
- FIG. 1 shows a general block and a block chain to which blocks are connected.
- FIG. 2 is a flowchart showing an improved proof-of-work algorithm according to an embodiment of the present invention.
- FIG. 6 is a block diagram showing a mining apparatus according to an embodiment of the present invention.
- Block chain (2) is a form in which a number of blocks (1) are connected.
- Block 1 is a bundle of a number of valid transaction information.
- the block header 3 displays block information.
- the block header contains the hash value of the previous block.
- the block hash (4) is a value obtained by calculating the block header with a hash function.
- the hash function is a function that maps data of an arbitrary length to data of a fixed length.
- the peer node is also referred to as a miner or mining device, and means a computing device or a set of computing devices that perform proof of work.
- the computing device could be a computer with a high-performance graphics card and processor.
- a block can be created at the same time in several peer nodes and the chain can be branched.
- the peer nodes reach consensus using a predetermined consensus algorithm and expand the consensus chain.
- the Bitcoin consensus mechanism considers only the longest chain to be the correct chain.
- the difficulty of the crypto puzzle is gradually increasing because the number of companies participating in bitcoin mining increases, and the hash power of the entire mining network increases.
- the higher the hash power the faster the proof-of-work speed and consequently the faster the speed of generating blocks.
- the Bitcoin protocol aims to fill the block generation time by one block every 10 minutes on average. To this end, the bitcoin protocol reconstructs the hash difficulty level every 2016 block [1]. Therefore, as the hash power increases, the difficulty level increases. Due to this, more power is consumed for mining.
- the proof-of-work method in the Bitcoin consensus mechanism is based on a fixed hash function (e.g. SHA-256) algorithm, resulting in an ASIC chip optimized for the Bitcoin proof-of-work algorithm [4].
- the ASIC chip is relatively expensive, but the hash power of the few miners who mine through the ASIC chip is optimized for proof of work in Bitcoin, which accounts for a large portion of the hash power of the entire network, and has overwhelming mining influence. I got it.
- the new proof-of-work algorithm is required to solve the re-centralization of such a blockchain network.
- the new proof-of-work algorithm is required to meet the following requirements.
- the difficulty level of the puzzle must be adjustable.
- FIG. 2 is a flowchart showing a proof-of-work algorithm that satisfies an improved condition according to an embodiment of the present invention.
- the proof-of-work algorithm described in FIG. 2 may be performed through the above-described mining device, and specifically, may be performed in a processor such as a CPU provided in the mining device.
- the mining apparatus generates a check matrix based on the first value included in the acquired data value (S1003).
- the first value used to generate the check matrix may be a hash value of the previous block.
- the mining apparatus may generate the check matrix Ft by using the hash value ht-1 of the previous block at the current block index t (positive integer).
- the check matrix one generally known in the field of code theory can be used.
- the mining device generates a hash tree based on the second value included in the acquired data value (S1005).
- the second value used to generate the hash tree may be transaction set information.
- the mining device may generate a hash tree value based on the second value.
- the mining apparatus generates an input set S based on the generated hash tree and the third value included in the acquired data value (S1007).
- the third value used herein may be at least one of version information, difficulty level information, or timestamp information of a previous block. Also, other information included in the block header may be additionally used as the third value.
- the mining device applies the input set to the hash function to obtain a result vector r (S1009).
- the hash function used here may be the SHA 256 [5] function, and other functions whose security has been verified may be used.
- the mining device generates a result vector that is an output of the hash function for a specific nonce value.
- the Error-Correction Code is used when a transmitter and a receiver communicate through a noisy channel.
- the word received through the noisy channel is different from the transmitted word due to an error generated by the channel.
- An error correction code is used to catch and correct this error.
- the transmitter generates a codeword by 1-to-1 mapping, that is, encoding a message vector, and transmits the generated codeword to the receiver instead of the message vector.
- the receiver can remove the error occurring in the channel by decoding the received word including the received error.
- a decoder or decoding function is called a decoding function that recovers the transmitted codeword by solving the inverse problem of the encoding function.
- the size of the codeword vector Nc is made longer than the size of the message vector Nm.
- R Nm/Nc is called code rate. The smaller the code rate, the more robust it is to channel errors; But decoding requires more computing.
- the synthesized function created in this way satisfies 1) of the requirements of the proof-of-work algorithm.
- graph-decoder may be used as the decoding function.
- an algorithm capable of the fastest codeword mapping in the linear graph-decoder field may be used as an additional decoding function.
- the mining device determines that proof of work has been completed, creates a new block while recording the current nonce value, and broadcasts it to other mining devices (S1017). . Therefore, in contrast to determining whether the proof of work is completed only with the output value of the hash function in the existing proof of work in Bitcoin, the process of verifying the output word value using a decoding function is added. A problem that may occur in a standardized algorithm (using ASIC Re-centralization).
- the check matrix which is one of the inputs of the decoder part
- a different decoder puzzle must be performed for each block as proof of work.
- the check matrix depends on the previous block hash value
- a different input value is used for each block, and as a result, the appearance of ASIC chips can be suppressed.
- anyone with a relatively low hash power can participate in proof-of-work, thus satisfying the requirement 5) of the new proof-of-work algorithm.
- the function used for decoding can also be changed to another type of function having a one-way characteristic, which is also a factor that suppresses the appearance of ASIC chips due to a fixed algorithm. Also, even if a nonce value for a specific puzzle problem is found, a different input value for each block is used to create the puzzle, so the existing nonce value cannot be reused as the nonce value of a new block. That is, it satisfies the requirement 3) of the new work algorithm.
- the mining apparatus excludes the previously used nonce value from the nonce set, selects a new nonce value not used in the nonce set, and returns to step S1009 (S1015). .
- the mining apparatus repeats each step while selecting a new nonce value until the mapped output word satisfies the condition.
- FIG. 4 is a flowchart illustrating a verification process of a mining apparatus according to an embodiment of the present invention.
- the steps described above in FIGS. 2 to 3 are the mining process of the mining device, and the mining device broadcasts the newly created block to other mining devices when proof of work is completed. In addition, if the broadcasted block is verified by other mining devices and recognized as a legitimate block, the mining devices update the blockchain ledger by adding the block to the existing block chain.
- the mining device acquires block header data of a block broadcast from another mining device that has generated the block (S2001).
- the block header data acquired by the mining device is the same as described above.
- the mining apparatus generates a check matrix based on the hash value included in the block header data (S2003).
- the method of generating the check matrix is the same as described above.
- the mining apparatus obtains an output value of the hash function based on the block header data (S2005).
- the step of obtaining the output value of the hash function is the same as described above.
- the mining apparatus obtains an output word as an output value of a hash function and an output value of a decoding function using a check matrix as an input value (S2007).
- the decoding function used here is the same as described above.
- the mining device determines whether the output word satisfies the condition (S2009).
- the conditions are set to the same conditions as those in the previous mining process.
- the set of conditions for verification may be collectively set for all mining devices, and may be transmitted together when a block is broadcast.
- the mining device approves the broadcast block and updates the ledger by extending it to the existing block chain (S2011).
- FIG. 5 is a diagram illustrating a method of adjusting the mining difficulty in the proof-of-work algorithm according to an embodiment of the present invention through an 8 by 16 check matrix.
- 5(a) is an example of an 8 by 16 check matrix.
- a check matrix of a much larger size is used, but an 8 by 16 check matrix is described as an example for ease of explanation.
- Fig. 5(b) is a table in which codeword values are summarized based on the check matrix in (a).
- n represents the Hamming weight of the codeword, that is, the number of non-zero numbers included in the codeword.
- Vn represents a condition set having 1 as much as the number indicated by the Hamming weight.
- p represents the ratio of the number of codewords included in the Vn condition set among the total number of codewords.
- the size of the condition set including n number of 1s is different, and the respective occupancy rate for it can be known. Therefore, it is possible to determine the Hamming weight according to the difficulty of the cryptographic puzzle to be adjusted. For example, when the difficulty level is lowered, the Hamming weight may be set to 7 to 10. Conversely, if you want to increase the difficulty, you can set the Hamming weight to 3. In each case, the probability of selecting a codeword that satisfies the set of conditions differs by about 55% and 2.5%, respectively.In the latter case, more operations are required to obtain a codeword value that satisfies the set of conditions. As a result, the difficulty of proof-of-work increases. That is, the difficulty level of the puzzle can be flexibly adjusted by changing the code rate and adjusting the size of the matrix to adjust the amount of computing required to solve the decoder puzzle, thus satisfying the requirement 4) of the new proof-of-work algorithm.
- FIG. 6 is a block diagram showing a mining apparatus according to an embodiment of the present invention.
- the mining apparatus includes a control unit 110, a network unit 120, and a storage unit 130.
- the control unit 110 may refer to a processor, and may include a microprocessor or a controller.
- the current block header data acquisition unit 111 obtains data included in the header by extracting the header of the current block to be mined.
- the data acquired by the current block header data acquisition unit 111 may include at least one of version information, difficulty level information, timestamp information, nonce information, hash value information of a previous block, or transaction set information.
- the input value generator 112 generates a plurality of input values based on the current block header data.
- the input value generator 112 may generate a check matrix based on a previous block hash value.
- the input value generator 112 may generate a hash tree value based on a transaction set.
- the input value generator 112 may generate a hash function input set based on a hash tree value and other header data.
- the other header data value may be at least one of version information, difficulty level information, and timestamp information, for example.
- the hash function application unit 113 obtains an output of the hash function by using the input set generated by the input value generation unit 112 as an input value.
- the hash function may be a SHA function, and other functions with secured security can also be applied.
- the network unit 120 is a wired/wireless communication device.
- the network unit 120 connects with other mining devices and broadcasts the generated block.
- the network unit 120 may receive a block generated by another mining device and transmit it to the current block header data acquisition unit 111.
- the storage unit 130 stores various instructions used by the control unit 110.
- the storage unit 130 stores a block chain ledger to which blocks generated by the control unit 110 are connected.
- the storage unit 130 may be a memory device.
- FIG. 7 is a diagram for describing a method of establishing block chain governance.
- the physical copy protection function cannot replicate the pattern and thus can be utilized as a fingerprint. Therefore, the owner of the chip can create a private key using the physical copy protection function.
- a hybrid policy that combines on-chain policy and off-chain policy can be used to break away from centralization and realize an equal blockchain.
- the off-chain policy may mean political, economic, and social agreements between people.
- on-chain policy is the insertion of the policy into the blockchain in the form of computer code through programming.
- the policy is automatically realized through the computer API.
- third party In the off-chain policy, there may be a third party that manages registration of generic IDs for each mining device. This is to prevent Sybil Attacks, such as registering multiple registrations on a single computer.
- third party may be used interchangeably with the term third party server.
- a plurality of generic IDs corresponding to a plurality of mining devices may be stored in the blockchain. And only mining devices with a generic ID may be allowed to participate in mining.
- the off-chain policy there may be a third party that manages registration of each individual's generic ID.
- fingerprints of each user may be registered with a third party.
- the third party can generate a generic ID of the mining device representing each member. That is, one member can have one registered generic ID.
- the generated generic IDs can be stored in the blockchain. And only mining devices with a generic ID may be allowed to participate in mining.
- an ID pool composed of a plurality of generic IDs may be configured.
- the generic ID can be composed of a 256-bit string.
- the mining device to perform the mining operation may be determined by selecting any one generic ID from among a plurality of generic IDs in the ID pool. That is, by using a third party, immutability can be maintained.
- the controller 110 of the mining device may determine the next mining device with a unique ID called to mine the next block.
- the input may be a block header excluding the ID field and a set of all IDs.
- the output may be the following ID.
- control unit 110 may acquire all field elements of the block header of the first block #1 except for the ID.
- the controller 110 may determine a single ID from a set of all ID vectors. As one method of determining a single ID, the control unit 110 may select a method having the smallest Hamming distance to the hash function output y.
- the selected single ID may be the ID (ID_next) of the next mining device (miner).
- controller 110 may return the ID (ID_next) of the next mining device.
- a mining device hereinafter referred to as a second mining device
- the second mining device may start a mining routine for the second block #2.
- the controller of the second mining apparatus may read the ID field of the block header of the announced first block.
- the controller of the second mining device may collect transactions to form the body of the second block #2.
- the above-described mining routine may fail.
- the on-chain policy may include a time limit for the next block generation.
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Educational Administration (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Accounting & Taxation (AREA)
- Operations Research (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Game Theory and Decision Science (AREA)
- Primary Health Care (AREA)
- Quality & Reliability (AREA)
- Finance (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
Description
Claims (9)
- 거래가 발생하면 작업 증명 합의 메커니즘을 통해 작업 증명을 수행하여 블록 체인을 형성하는 채굴 장치에 있어서,네트워크부; 및상기 거래가 발생하면 블록을 생성하고, ID 풀 내 복수의 제네릭 ID 중 어느 하나의 제네릭 ID를 선택하고, 상기 선택된 제네릭 ID에 대응하는 다른 채굴 장치로 상기 생성된 블록을 브로드캐스팅 하는 제어부;를 포함하는채굴장치.
- 제 1항에 있어서,상기 복수의 제네릭 ID는,운영 방법을 합의한 닫힌 블록 체인 커뮤니티의 구성원들에 대응하는 ID인채굴장치.
- 제 1항에 있어서,상기 제어부는,상기 복수의 제네릭 ID에 대응하는 채굴장치 들에만 상기 생성된 블록을 브로드캐스팅 하는채굴 장치.
- 제 2항에 있어서,상기 복수의 제네릭 ID는,상기 구성원들이 소유한 채굴 장치들의 핑거 프린트을 이용하여 생성되는채굴 장치.
- 제 2항에 있어서,상기 복수의 제네릭 ID는,상기 구성원들의 핑거 프린트를 이용하여 생성되는채굴 장치.
- 제 5항에 있어서,상기 구성원들은, 각각 하나의 제네릭 ID를 가지는채굴 장치.
- 제 1항에 있어서,상기 제어부는,이전 채굴 장치로부터 블록을 수신하고, 상기 수신된 블록의 블록 헤더에 포함되는 제네릭 ID가 상기 채굴 장치의 제네릭 ID와 일치하면 작업을 수행하는채굴 장치.
- 제 7항에 있어서,상기 제어부는,특정 시간 안에 블록이 생성되지 않는 경우, 상기 이전 채굴 장치에 리턴하는채굴 장치.
- 제 1항에 있어서,상기 제어부는,상기 선택된 제네릭 ID를 블록 헤더에 삽입하고, 상기 제네릭 ID가 삽입된 블록 헤더를 포함하는 상기 블록을 브로드캐스팅 하는채굴 장치.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020217033618A KR102720562B1 (ko) | 2019-07-12 | 2020-07-13 | 채굴 장치 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR10-2019-0084800 | 2019-07-12 | ||
KR20190084800 | 2019-07-12 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2021010720A1 true WO2021010720A1 (ko) | 2021-01-21 |
Family
ID=74210991
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/KR2020/009222 WO2021010720A1 (ko) | 2019-07-12 | 2020-07-13 | 채굴 장치 |
Country Status (1)
Country | Link |
---|---|
WO (1) | WO2021010720A1 (ko) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20160300234A1 (en) * | 2015-04-06 | 2016-10-13 | Bitmark, Inc. | System and method for decentralized title recordation and authentication |
US20170352027A1 (en) * | 2016-06-07 | 2017-12-07 | Cornell University | Authenticated data feed for blockchains |
KR20190012969A (ko) * | 2017-07-31 | 2019-02-11 | 서강대학교산학협력단 | 블록체인을 기반으로 한 데이터 접근 관리 시스템 및 데이터 접근 관리 방법 |
KR20190074666A (ko) * | 2017-12-20 | 2019-06-28 | 주식회사 유니로보틱스 | 블록체인시스템을 이용한 사물간 재화 또는 서비스 제공방법 |
KR20190075264A (ko) * | 2017-12-21 | 2019-07-01 | 최명수 | 블록체인 플랫폼에서 분산 트랜잭션 처리 및 트레이딩을 위한 장치 및 방법 |
-
2020
- 2020-07-13 WO PCT/KR2020/009222 patent/WO2021010720A1/ko active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20160300234A1 (en) * | 2015-04-06 | 2016-10-13 | Bitmark, Inc. | System and method for decentralized title recordation and authentication |
US20170352027A1 (en) * | 2016-06-07 | 2017-12-07 | Cornell University | Authenticated data feed for blockchains |
KR20190012969A (ko) * | 2017-07-31 | 2019-02-11 | 서강대학교산학협력단 | 블록체인을 기반으로 한 데이터 접근 관리 시스템 및 데이터 접근 관리 방법 |
KR20190074666A (ko) * | 2017-12-20 | 2019-06-28 | 주식회사 유니로보틱스 | 블록체인시스템을 이용한 사물간 재화 또는 서비스 제공방법 |
KR20190075264A (ko) * | 2017-12-21 | 2019-07-01 | 최명수 | 블록체인 플랫폼에서 분산 트랜잭션 처리 및 트레이딩을 위한 장치 및 방법 |
Also Published As
Publication number | Publication date |
---|---|
KR20210134408A (ko) | 2021-11-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110998556B (zh) | 区块链网络中的数据隔离 | |
US6996712B1 (en) | Data authentication system employing encrypted integrity blocks | |
CN110300112A (zh) | 区块链密钥分层管理方法 | |
US9294473B1 (en) | Server methods and apparatus for processing passcodes generated by configurable one-time authentication tokens | |
US20230216661A1 (en) | Data block modification | |
US20050210248A1 (en) | Method and device for generating approximate message authentication codes | |
CN111786812B (zh) | 节点管理方法、装置、计算机设备和存储介质 | |
JPH0816104A (ja) | 分散化した照合子による情報保全検証方法及び装置 | |
CN112383389B (zh) | 一种区块链随机数生成方法及系统 | |
WO2017116062A1 (ko) | 파일에 대한 공증 및 검증을 수행하는 방법 및 서버 | |
US6941461B2 (en) | System and method of uniquely authenticating each replication of a group of soft-copy documents | |
WO2020138733A1 (ko) | 개인정보의 익명성을 제공하는 블록체인 시스템 및 블록체인에서 개인정보의 익명성을 제공하는 방법 | |
KR20210063378A (ko) | 공통 비밀을 공유하는 컴퓨터 구현 시스템 및 방법 | |
EP3465528B1 (en) | Apparatus and method of creating a data chain in a data structure that can be cryptographically proven to contain valid data | |
WO2018038444A1 (ko) | 생체 코드를 등록 및 인증하는 방법 및 장치 | |
Bray | Implementing cryptography using Python | |
US11895222B1 (en) | Systems and methods for data encryption, decryption, and authentication | |
WO2019125069A1 (ko) | 블록체인을 이용한 개인정보 분리 후 조합을 통한 인증 시스템 | |
CN117978376A (zh) | 一种数字身份标识符的生成及更新方法 | |
WO2021010720A1 (ko) | 채굴 장치 | |
CN117792765A (zh) | 一种身份认证方法及电子设备 | |
CN115943609A (zh) | 区块链网络中中毒交易的区块传播 | |
TW202034651A (zh) | 分散式系統中資訊驗證方法 | |
US20230224150A1 (en) | Bio-locked seed | |
WO2020017908A1 (ko) | 채굴 장치, 및 채굴 장치 동작 방법 |
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: 20839611 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 20217033618 Country of ref document: KR Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 19.04.2022) |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20839611 Country of ref document: EP Kind code of ref document: A1 |