KR20200107881A - Method and server for managing testament - Google Patents

Abstract

The present invention relates to a computer program stored in a computer-readable storage medium. The computer program includes commands for a testament management server to execute the following operations including: receiving a testament registration request from a user terminal; generating a smart contract based on the registration request as a result of the reception of the registration request; transmitting the smart contract to at least one node included in a blockchain network and causing the nodes to validate the smart contract through a consensus algorithm and record the smart contract as a first transaction in a block when the smart contract is validated; confirming whether the execution conditions of the testament are satisfied; and performing an action corresponding to the content of the testament by executing the smart contract in a case where it is recognized that the testament execution conditions are satisfied.

Description

Server and method to manage wills {METHOD AND SERVER FOR MANAGING TESTAMENT}

The present disclosure relates to a server and method for managing a will using a block chain.

A will refers to an expression of intention that a person establishes in advance of his or her legal or property relations after his or her death. Wills containing the will of the deceased are required by law to prevent disputes and confusion, and actions that can be made with wills are also prescribed by law.

These wills are either written by the tester by hand or written by an agent. The existing method of preparing a will is to easily write out a notary's appointment fee, will management fee, court probate fee, submission fee, and other incidental expenses. It takes a huge amount of money to do so. Due to this problem, even in the United States, where wills are more common than Korea, according to a survey, there are statistics that the rate of writing wills is still only 50% or less among the middle class and below, and in Korea, the rate of writing wills is lower than that. Is expected.

In addition, legal disputes such as forgery, falsification, and fabrication may arise if the credibility between the testator and the notary or between the testator and the executioner is not guaranteed.

Thus, there is a need for a transparent and reliable way to provide wills.

Republic of Korea Patent Publication 10-2007-0108996

The present disclosure is conceived in response to the above-described background technology, and intends to provide a method for providing a transparent and reliable will using blockchain technology.

The technical problems of the present disclosure are not limited to the technical problems mentioned above, and other technical problems that are not mentioned will be clearly understood by those skilled in the art from the following description.

According to an embodiment of the present disclosure for solving the above-described problem, a computer program stored in a computer-readable storage medium is disclosed.

A computer program stored in a computer-readable storage medium, wherein the computer program includes instructions for causing a will management server to perform the following operations, the operations comprising: receiving a request for registration of a will from a user terminal; Upon receiving the registration request, generating a smart contract based on the registration request; By transmitting the smart contract to at least one node included in the blockchain network, a plurality of nodes verify the validity of the smart contract through a consensus algorithm, and the plurality of nodes block as the validity of the smart contract is verified. Causing to write the smart contract to a first transaction; Checking whether the execution condition of the will is satisfied; When it is recognized that the execution condition of the will is satisfied, executing the smart contract to perform an action corresponding to the content included in the will; It may include.

In addition, when it is recognized that the execution condition of the will is satisfied, the operation of executing the smart contract to perform an action corresponding to the content included in the will recognizes that the execution condition of the will is satisfied. In one case, calling the smart contract; And executing the smart contract according to the call of the smart contract to perform the action corresponding to the content included in the will. It may include.

In addition, the operation of receiving a request for registration of a will from the user terminal may include: checking identification information of the user terminal; And checking whether the user terminal is a terminal authorized to perform the registration request for the will based on the identification information. Further comprising, in response to receiving the registration request, the operation of generating a smart contract based on the registration request, the user terminal is a terminal authorized to perform the registration request of the will If it is recognized as, generating a smart contract based on the registration request; It may include.

In addition, upon receiving the registration request, the operation of generating a smart contract based on the registration request includes transmitting a first signal to check whether a registration request signal has been transmitted to the user terminal before creating the smart contract. Action; When receiving a second signal corresponding to the first signal from the user terminal, checking whether the registration request is transmitted from the user terminal based on the second signal; And when it is confirmed that the registration request has been transmitted from the user terminal, generating a smart contract based on the registration request. It may include.

In addition, the smart contract is included in a block and distributed to the blockchain network, and upon receiving the registration request, the operation of creating a smart contract based on the registration request is performed by the smart contract. Generating a contract account corresponding to the smart contract when distributed through a blockchain network; And as the smart contract is stored in the contract account on the blockchain network, activating a smart contract for performing a transaction on the description information on the blockchain network to be operable. It may include.

In addition, the operation of transmitting the smart contract to at least one node included in the blockchain network may include generating a first transaction signed with a private key of the will management server; And transmitting the generated first transaction to the at least one node. Further includes;

The first transaction includes: a first transaction input value including identification information generated from the private key; And address information in the blockchain network in which the first transaction including the smart contract is to be stored and a first transaction output value including the smart contract. It may include.

In addition, the operation of checking whether the execution condition of the will is satisfied may include: checking whether a predetermined action is performed by a user of the user terminal; And recognizing that the execution condition is satisfied when the preset action is not performed by the user for a preset period. It may include.

In addition, the operation of determining whether the execution condition of the will is satisfied may include: receiving a death signal of the user from an external terminal; Transmitting the user's death confirmation request signal to an external server; Receiving, from the external server, a third signal indicating whether the user has confirmed death in response to the death confirmation request signal; Determining whether the user is dead based on the third signal; And recognizing that the execution condition of the will is satisfied when it is recognized that a preset time has elapsed after the user's death based on the third signal. It may include.

In addition, when it is recognized that the execution condition of the will is satisfied, the operation of executing the smart contract to perform an action corresponding to the content included in the will is recognizing that the execution condition of the will is satisfied. In case, by transmitting first information indicating that the execution condition is satisfied to at least one node included in the blockchain network, a plurality of nodes verify the validity of the execution condition through a consensus algorithm, and the validity of the execution condition is Causing the plurality of nodes to write the execution condition to a block as a second transaction as verified; It may include.

In addition, the operation of transmitting the first information indicating that the execution condition is satisfied to the at least one node included in the blockchain network is to generate a second transaction signed with a private key of the will management server. action; And transmitting the generated second transaction to the at least one node. And the second transaction includes: a second transaction input value including the first information generated from the private key; And a second transaction output value including address information and first information in the blockchain network in which the second transaction including the first information is to be stored. It may include.

In addition, as a will management server, the communication unit for receiving a registration request of the will including the description information from the user terminal; And a processor generating a smart contract based on the description information. Including, the processor, by controlling the communication unit to transmit the smart contract to at least one will node included in the blockchain network, a plurality of will nodes verify the validity of the smart contract through a consensus algorithm, As the validity of the smart contract is verified, the plurality of will nodes causes the will to record the smart contract as a first transaction in the will block, and when it is recognized that the execution condition of the will is satisfied, the smart contract is executed and the You can control to perform an action corresponding to the content included in the will.

Technical solutions obtainable in the present disclosure are not limited to the above-mentioned solutions, and other solutions that are not mentioned are clearly to those of ordinary skill in the technical field to which the present disclosure belongs from the following description. It will be understandable.

This disclosure makes it possible to provide a transparent and reliable will.

The effects obtainable in the present disclosure are not limited to the effects mentioned above, and other effects not mentioned will be clearly understood by those of ordinary skill in the art from the following description. .

Various aspects are now described with reference to the drawings, wherein like reference numbers are used collectively to refer to like elements. In the examples that follow, for illustrative purposes, a number of specific details are presented to provide a holistic understanding of one or more aspects. However, it will be apparent that such aspect(s) may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form to facilitate describing one or more aspects.
1 illustrates an exemplary will management system for performing a will management method according to an embodiment of the present disclosure.
2 is a flowchart illustrating an example of a method of registering a will, according to some embodiments of the present disclosure.
3 is a flowchart illustrating an example of a method of performing an action corresponding to content included in a will, according to some embodiments of the present disclosure.
4 is a flowchart illustrating an example of a method of creating a smart contract according to some embodiments of the present disclosure.
5 is a flowchart illustrating an example of a method of recording a smart contract in a blockchain network based on a request for registration of a will, according to some embodiments of the present disclosure.
6 is a flowchart illustrating an example of a method of recognizing that an execution condition of a will is satisfied, according to some embodiments of the present disclosure.
7 is a flowchart illustrating an example of a method of recognizing that an execution condition of a will is satisfied based on a death signal of a user according to some embodiments of the present disclosure.
8 is a flowchart illustrating an example of a method of performing an action corresponding to content included in a will, according to some embodiments of the present disclosure.
9 exemplarily shows a connection structure of blocks stored in a blockchain network according to some embodiments of the present disclosure.
10 shows a general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented.

Various embodiments and/or aspects are now disclosed with reference to the drawings. In the following description, for illustrative purposes, a number of specific details are disclosed to aid in an overall understanding of one or more aspects. However, it will also be appreciated by those of ordinary skill in the art that this aspect(s) may be practiced without these specific details. The following description and the annexed drawings set forth in detail certain illustrative aspects of one or more aspects. However, these aspects are exemplary and some of the various methods in the principles of the various aspects may be used, and the descriptions described are intended to include all such aspects and their equivalents. Specifically, as used herein, "an embodiment", "example", "aspect", "example" and the like are not construed as having any aspect or design being better or advantageous than other aspects or designs. May not.

Hereinafter, the same or similar components are assigned the same reference numerals regardless of the reference numerals, and redundant descriptions thereof are omitted. In addition, in describing the embodiments disclosed in the present specification, when it is determined that detailed descriptions of related known technologies may obscure the subject matter of the embodiments disclosed in the present specification, detailed descriptions thereof will be omitted. In addition, the accompanying drawings are for easy understanding of the embodiments disclosed in the present specification, and the technical spirit disclosed in the present specification is not limited by the accompanying drawings.

Although the first, second, and the like are used to describe various devices or components, it goes without saying that these devices or components are not limited by these terms. These terms are only used to distinguish one device or component from another device or component. Therefore, it goes without saying that the first element or element mentioned below may be a second element or element within the technical idea of the present invention.

Unless otherwise defined, all terms (including technical and scientific terms) used in the present specification may be used as meanings that can be commonly understood by those of ordinary skill in the art to which the present invention belongs. In addition, terms defined in a commonly used dictionary are not interpreted ideally or excessively unless explicitly defined specifically.

In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless specified otherwise or is not clear from the context, "X employs A or B" is intended to mean one of the natural inclusive substitutions. That is, X uses A; X uses B; Or, when X uses both A and B, “X uses A or B” can be applied to either of these cases. In addition, the term "and/or" as used herein should be understood to refer to and include all possible combinations of one or more of the listed related items.

In addition, the terms "comprising" and/or "comprising" mean that the corresponding feature and/or element is present, but excludes the presence or addition of one or more other features, elements and/or groups thereof. It should be understood as not. In addition, unless otherwise specified or when the context is not clear as indicating a singular form, the singular in the specification and claims should be interpreted as meaning "one or more" in general.

In addition, the terms “information” and “data” as used herein may often be used interchangeably with each other.

When a component is referred to as being "connected" or "connected" to another component, it is understood that it is directly connected to or may be connected to the other component, but other components may exist in the middle. Should be. On the other hand, when a component is referred to as being "directly connected" or "directly connected" to another component, it should be understood that there is no other component in the middle.

The suffixes "module" and "unit" for constituent elements used in the following description are given or used interchangeably in consideration of only the ease of preparation of the specification, and do not have a distinct meaning or role by themselves.

Objects and effects of the present disclosure, and technical configurations for achieving them will become apparent with reference to embodiments described in detail later with reference to the accompanying drawings. In describing the present disclosure, if it is determined that a detailed description of a known function or configuration may unnecessarily obscure the subject matter of the present disclosure, a detailed description thereof will be omitted. In addition, terms to be described later are terms defined in consideration of functions in the present disclosure and may vary according to the intention or custom of users or operators.

The scope of rights to the method in the claims of the present disclosure is generated by the functions and features described in each step, and unless a precedence relationship of the order is specified in each step constituting the method, the claim It is not affected by the order of description of each step in the range. For example, in the claims described in a method including steps A and B, even if step A is described before step B, the scope of the rights is not limited to that step A must precede step B.

However, the present disclosure is not limited to the embodiments disclosed below, and may be implemented in various different forms. The present embodiments are provided only to make the present disclosure complete, and to completely inform the scope of the disclosure to those of ordinary skill in the art to which the present disclosure belongs, and the present disclosure is only defined by the scope of the claims. . Therefore, the definition should be made based on the contents throughout this specification.

1 illustrates an exemplary will management system for performing a will management method according to an embodiment of the present disclosure.

Referring to FIG. 1, the will management system may include a user terminal 100, a blockchain network 200, an external terminal 300, a will management server 400 and a network 500. However, the above-described components are not essential in implementing the will management system, and thus the will management system may have more or fewer components than the components listed above.

According to some embodiments of the present disclosure, the user terminal 100, the blockchain network 200, the external terminal 300, and the will management server 400 may be configured according to some embodiments of the present disclosure through the network 500. It is possible to mutually transmit and receive data for the will providing system according to.

The user terminal 100 may include a personal computer (PC), a notebook (note book), a mobile terminal, a smart phone, a tablet PC, etc. owned by the user. , It may include all types of terminals that can access wired/wireless networks.

The blockchain network 200 may refer to a network that records at least one of a first transaction including a smart contract generated based on a request for registration of a will, a second transaction including first information, and a will. .

The block chain network 200 is a network including a plurality of nodes, and nodes included in the block chain network 200 may be operated by a block chain core package according to a hierarchical structure. The above structure defines the structure of the data handled by the blockchain network 200, a data layer that manages the data, and performs mining to verify the validity of a block and generates a block, and the commission paid to the miner during the mining process. A consensus layer in charge of processing, a P2P network protocol, a hash function, a common layer implementing and managing digital signatures, encoding, and a common storage, and an application layer in which various applications are created, processed, and managed may be included.

Further, according to some embodiments of the present disclosure, a will management server 400 may be included in a node included in the blockchain network 200.

Meanwhile, in some embodiments of the present disclosure, a plurality of nodes included in the blockchain network 200 may be a full block chain node or a light weight node.

A full block chain node can contain all block information from the first block of the block chain to a block that is currently newly created. In addition, the full blockchain node collects and stores all blockchain information, and can verify the received block to add a new block.

The Lightweight Node does not have the originals of all block information, and may include only header information. In order for the Lightweight Node to verify the transaction, it can perform Simple Payment Verify (SPV).

For example, a lightweight node can request block information from a full blockchain node, and the authentication content of a transaction can be verified through Merkle Root.

However, for convenience of explanation, it is assumed that the plurality of content nodes included in the blockchain network 200 are full blockchain nodes, and will be described below.

The will in the present disclosure is a will created in a form that can be transmitted through the network 500, and is a document file, a recording file, an image file created through the user terminal 100, a scan file of a document notarized offline, and online authentication. It may include at least one of the received document files.

In addition, each of the nodes included in the blockchain network 200 may record a smart contract as a first transaction in a block through a consensus algorithm.

The smart contract is written in a digital language for performing an action corresponding to the content included in the will and can be executed on any computing device. That is, when at least one of the code and the function included in the smart contract is executed, an arbitrary type of operation according to some embodiments of the present disclosure may be performed.

The smart contract may be executed by at least one of a method of creating a new smart contract, a method of executing a function on a specific smart contract, or a method of transmitting a token operable in the blockchain network 200. In addition, smart contracts can be executed by transactions or other contracts generated by externally owned accounts.

Meanwhile, according to some embodiments of the present disclosure, when it is recognized that the execution condition of the will is satisfied, the will management server 400 may execute an action corresponding to the content of the will. In this case, when the will management server 400 executes the action, when the function of the smart contract is included in the transaction in the form of compiled code and synchronized through the blockchain, the information included in the transaction is used as the input of the function. A smart contract can be implemented by executing a function expressed in code and storing the result in a separate state.

When the contents of the function and the input of the function are shared by a smart contract shared in the blockchain network 200, the integrity of the data can be guaranteed even if the result of the function is not separately shared.

A plurality of nodes included in the blockchain network 200 may share and store at least one of a generated transaction and a smart contract through the network 500. In addition, a plurality of nodes can perform a function of recording a transaction in a block when at least one of a transaction and a smart contract is verified through the consensus algorithm of the blockchain technology.

A block is a unit in which a smart contract is stored in the block chain network 200, and can form a block chain as it is connected with adjacent blocks.

The consensus algorithm performed in the blockchain network 200 is: PoW (Proof of Work) algorithm, PoS (Proof of Stake) algorithm, DPoS (Delegated Proof of Stage) algorithm, PBFT (Practical Byzantine Fault Tolerance) algorithm, DBFT (Delegated It may include at least one of the Byzantine Fault Tolerance (RBFT) algorithm, Redundant Byzantine Fault Tolerance (RBFT) algorithm, Sieve algorithm, Tendermint algorithm, Paxos algorithm, Raft algorithm, PoA (Proof of Authority) algorithm, and PoET (Proof of Elapsed Time) algorithm. have.

Since at least one of smart contracts and transactions including wills is recorded in a block using the consensus algorithm of the blockchain technology, the effect of preventing forgery or alteration of the wills occurs.

Meanwhile, the structure of the blockchain network 200 according to some embodiments of the present disclosure may be of a public type or a private type. In the case of the public blockchain network 200, there is a disadvantage that it is inefficient in terms of consensus time, transaction processing speed, and efficiency of use of computing resources, as it must perform verification work on all nodes to verify transactions. Because the participation of the data is possible, there may be an advantage in the transparency and integrity of the stored data. In addition, in the case of a private (or consortium) block chain, since the operating entity is clear, there is an advantage of being efficient in terms of consensus time, transaction processing speed, and efficiency of use of computing resources, but transparency about the transaction processing process and results There may be advantages in terms of

The consensus algorithm in some embodiments of the present disclosure may be a private or consortium-type blockchain network, but is not limited thereto, in order to improve the user experience through efficient use of computing resources and increase in transaction processing speed. Depending on the implementation, public type may be used as the consensus algorithm when it is desired to further emphasize the transparency of transactions or smart contracts.

When a smart contract is recorded on the blockchain network 200, it is virtually impossible for the smart contract to be forged or altered. Accordingly, it is possible to prevent malicious testament, notary public, agent, and external terminal 300 from hacking and modifying at least one of the will and the smart contract through the network 500.

The external terminal 300 is a personal computer (PC), a notebook (note book), a mobile terminal, a smart phone, a tablet PC, etc. owned by an agent or a testament. It may include, and may include all types of terminals capable of accessing a wired/wireless network.

The will management server 400 may generate a smart contract based on the registration request of the will received from the user terminal 100 or perform an action corresponding to the content of the will upon receiving a death signal of the user.

According to some embodiments of the present disclosure, the will management server 400 may transmit a query or a transaction to the blockchain network 200. Here, the query may be used to inquire the smart contract stored in the blockchain network 200. In addition, the transaction in the present disclosure can be used to perform an update (modification/change/delete/add) on data recorded in the blockchain network 200.

Will management server 400 may include any type of computer system or computer device, such as, for example, microprocessors, mainframe computers, digital processors, portable devices and device controllers, and the like.

The will management server 400 may include a processor 410, a storage unit 420 and a communication unit 430. However, since the above-described components are not essential in implementing the will management server 400, the will management server 400 may have more or fewer components than the components listed above. Here, each component may be composed of a separate chip, module or device, or may be included in a single device.

The processor 410 may typically process the overall operation of the will management server 400. The processor 410 provides or processes appropriate information or functions to a user by processing signals, data, information, etc. that are input or output through the above-described components or by driving an application program stored in a memory (not shown in FIG. 1). can do.

In addition, when the processor 410 recognizes at least one will registration request, the processor 410 may control the communication unit to transmit the smart contract generated based on the will registration request to at least one node included in the blockchain network 200. have. When a smart contract is verified through a consensus algorithm, a block can be created in each of a plurality of nodes and the smart contract can be recorded in the block. Meanwhile, the processor 410 generates a first transaction signed with the private key of the will management server 400 when transmitting the smart contract to at least one node, and transmits the generated first transaction to at least one node. You can control 430. Here, the identification information generated from the private key of the will management server 400 may be recorded in the input value of the first transaction. In addition, address information in the blockchain network 200 in which a first transaction including at least one user's smart contract is to be stored and a first transaction including the smart contract may be recorded in the output value.

The storage unit 420 may store information in an arbitrary form generated or determined by the processor 410 and information in an arbitrary form received by the communication unit 430 in the will management server 400. The storage unit 420 is a device that stores data on a magnetic disk such as a hard disk drive (HDD, Hard Disk Drive), a solid state drive (SSD), a semiconductor memory, especially a nonvolatile memory, etc. It may include a device for storing data.

The communication unit 430 is between the will management server 400 and the communication system, between the will management server 400 and the user terminal 100, between the will management server 400 and the blockchain network 200, the will management server 400 ) And the external terminal 300 or between the will management server 400 and the network 500 may include one or more modules.

The communication unit 430 may include at least one of a mobile communication module, a wired Internet module, and a wireless Internet module.

The network 500 according to the embodiments of the present disclosure includes a public switched telephone network (PSTN), x Digital Subscriber Line (xDSL), Rate Adaptive DSL (RADSL), Multi Rate DSL (MDSL), and Very Various wired communication systems such as High Speed DSL), Universal Asymmetric DSL (UADSL), High Bit Rate DSL (HDSL), and local area network (LAN) can be used.

In addition, the network 500 presented herein is CDMA (Code Division Multi Access), TDMA (Time Division Multi Access), FDMA (Frequency Division Multi Access), OFDMA (Orthogonal Frequency Division Multi Access), SC-FDMA (Single Carrier- FDMA) and other systems can be used.

The network 500 according to the embodiments of the present disclosure may be configured regardless of its communication mode, such as wired and wireless, and various types of short-range communication networks (PAN: Personal Area Network), local area networks (WAN: Wide Area Network), etc. It can be configured as a communication network. In addition, the network may be a known World Wide Web (WWW), and may use a wireless transmission technology used for short-range communication such as infrared (IrDA: Infrared Data Association) or Bluetooth (Bluetooth).

The techniques described herein may be used not only in the networks mentioned above, but also in other networks.

2 is a flowchart illustrating an example of a method of registering a will, according to some embodiments of the present disclosure.

Referring to FIG. 2, the communication unit 430 of the will management server 400 may receive a registration request for a will from the user terminal 100 (S110). Here, the request for registration of the will may be a series of signals requesting that the will written by the user be recorded in the blockchain network 200. In addition, a will may be included in the request for registration of a will.

The will is a will created in a form that can be transmitted through the network 500, among document files, recorded files, image files, scanned files of documents notarized offline, and document files certified online. It may include at least one.

The will is the content of the gift of real estate to the testator (for example, the gift of the building in Nonhyeon-dong, Gangnam-gu, Seoul to the eldest son), the content of the gift of cash, the content of remittance of a preset amount through account transfer, and a preset amount. It may include at least one of contents for transmitting a token (cryptocurrency). However, it is not limited thereto, and various contents may be included in the will.

Meanwhile, according to some embodiments of the present disclosure, as the will management server 400 receives the registration request signal from the user terminal 100, it may check whether the user terminal 100 has transmitted the registration request signal. A detailed description of this will be described later with reference to FIG. 5.

Meanwhile, the processor 410 of the will management server 400 may generate a smart contract based on the registration request received from the user terminal 100 (S120).

For example, the request for registration of a will contains a will in the form of a document file, and the will says, "At the death of the will A, a certain amount in the first account of A will be transferred to the second account of the will B." It is assumed that the contents are disclosed and will be described below. However, the content included in the will is not limited thereto, and various contents may be included in the will.

When the processor 410 receives the will registration request in step S110, the processor 410 may analyze the will in the form of a document file included in the will registration request. In this case, the processor 410 may recognize that the will includes an execution condition of the will “at the death of the will”. In addition, the processor 410 may record the first code for checking whether the execution condition of the will of “at the death of the will” is satisfied in the smart contract.

In addition, the processor 410, when the will is satisfied with the execution condition of the will'at the death of the willer A', the processor 410 performs a first action of withdrawing the predetermined amount from the first account and the withdrawn predetermined amount to the second account. It may be recognized that the content that the second action of depositing should be performed is included. In this case, the processor 410 may record in the smart contract a second code that performs the first action and the second action when it is recognized that the execution condition of the will is satisfied by the first code.

Meanwhile, the processor 410 may control the communication unit 430 to transmit the generated smart contract to at least one node included in the blockchain network (S130).

Specifically, the smart contract created in step S120 is transmitted to at least one node included in the blockchain network in step S130, so that it may be included in the block and distributed to the blockchain network 200.

More specifically, when the will management server 400 transmits the smart contract to at least one node, a plurality of nodes may verify the validity of the smart contract through a consensus algorithm. In addition, as the validity of the smart contract is verified in the plurality of nodes, the plurality of nodes may record the smart contract in the block as a first transaction.

Meanwhile, each of the nodes included in the blockchain network 200 may record the smart contract as a first transaction in the block when the validity of the smart contract is verified through a consensus algorithm. Here, blocks may be connected by chains referred to in blockchain technology. And when the smart contract is recorded on the blockchain network 200, it is virtually impossible for the smart contract to be forged or altered. Accordingly, it is possible to prevent at least one of a malicious probate, notary public, and agent from hacking and modifying the smart contract, and the information contained in the recorded first transaction can be stored in a state where integrity can be guaranteed. .

On the other hand, the will management server 400 may generate a contract account corresponding to the smart contract when the smart contract is distributed through a blockchain network.

In addition, as the smart contract is stored in the contract account on the blockchain network 200, a smart contract for performing an action corresponding to the content included in the will can be activated on the blockchain network 200 to enable operation. .

For example, the contract account in which the smart contract is stored may include the number of smart contracts created to execute the contents included in the will and a hash value for the byte code of the smart contract.

The address of the contract account may be generated based on the private key of the will management server 400. According to some embodiments of the present disclosure, the address of the contract account may be generated based on a private key paired with the private key of the will management server 400. For example, the address of the contract account may be generated from the private key using at least one of SHA 256 (Secure Hash Algorithm 256) and RIPEME (RACE Integrity Primitives Evaluation Message Digest).

3 is a flowchart illustrating an example of a method of performing an action corresponding to content included in a will, according to some embodiments of the present disclosure.

Referring to FIG. 3, the processor 410 of the will management server 400 may check whether the execution condition of the will is satisfied (S210).

Specifically, the processor 410 may periodically or aperiodically check whether the execution condition of the will is satisfied based on the code included in the smart contract (eg, the first code described above in FIG. 2 ).

For example, when the processor 410 receives the death signal of the will A from at least one of the user terminal 100 and the external terminal 300 through the communication unit 430, the will It can be recognized that the execution condition is satisfied.

According to some embodiments of the present disclosure, the processor 410 may check whether a predetermined action is performed by the user of the user terminal 100 to recognize whether the execution condition of the will is satisfied. A detailed description of this will be described later with reference to FIG. 6.

According to some other embodiments of the present disclosure, when the processor 410 receives the death signal of the will A from at least one of the user terminal 100 and the external terminal 300 through the communication unit 430, the will The communication unit 430 may be controlled to transmit a death confirmation request signal to the external server 600 (eg, a medical institution server or a government office server) in order to check whether the person A has died. In this case, the communication unit 430 may receive a signal corresponding to the death confirmation request signal from the external server 600. A detailed description of this will be described later with reference to FIGS. 6 to 7.

According to still another embodiment of the present disclosure, when receiving a request to execute a will from the external terminal 300 through the communication unit 430, the processor 410 transmits a signal for confirming the death of the user to the user terminal 100. Can be transferred to. In this case, the communication unit 430 may receive a signal corresponding to the death confirmation request signal from the user terminal 100. A detailed description of this will be described later with reference to FIGS. 6 to 7.

When it is recognized that the execution condition of the will is satisfied (S210, Yes), the processor 410 may execute the smart contract to perform an action corresponding to the content included in the will (S220).

For example, if the processor 410 recognizes that the will A has died, it may recognize that the execution condition of the will is satisfied. In addition, the processor 410 may recognize the second code recorded in the smart contract and perform the first action and the second action described above in FIG. 2. Specifically, the processor 410 controls the communication unit 430 to withdraw a certain amount described in the will from the first account, generate a transaction for depositing the withdrawn certain amount into the second account, and transmit it to at least one node. can do. After a transaction is transmitted to at least one node, a plurality of nodes verify the validity of the transaction through a consensus algorithm, and the transaction may be recorded in a block included in the plurality of nodes.

In addition, when information indicating that the first action and the second action have been performed is recorded in the blockchain network 200, it is virtually impossible to forge or alter the information indicating that the first action and the second action have been performed. Therefore, it is possible to prevent at least one of a malicious testament, a notary, and an agent from receiving more than the amount disclosed in the will through hacking, etc., and the integrity of the information contained in the recorded transaction can be guaranteed. It can be stored as it is.

According to some embodiments of the present disclosure, the processor 410 of the will management server 400 may call a smart contract when it recognizes that the execution condition of the will is satisfied.

Specifically, the processor 410 calls a smart contract when it recognizes that the execution condition of the will has been satisfied before executing the smart contract to perform an action corresponding to the content contained in the will, and calls the smart contract according to the call of the smart contract. You can execute the action corresponding to the content contained in the will.

In this case, since the operation of recognizing the content contained in the will and the operation of calling the smart contract is performed only when the execution condition of the will is satisfied, efficient use of network resources and computing resources may be possible.

Meanwhile, when the execution condition of the will is not satisfied (S210, No), the processor 410 may periodically or aperiodically check whether the execution condition of the will is satisfied.

4 is a flowchart illustrating an example of a method of creating a smart contract according to some embodiments of the present disclosure.

Referring to FIG. 4, the processor 410 of the will management server 400 may check the identification information of the user terminal 100 that has transmitted the registration request for the will (S310). Here, the identification information may be identification information used to recognize the user of the user terminal 100 that has transmitted the will registration request signal. For example, the identification information may be user identification information, user personal information, user account information, user identification information, and the like.

The processor 410 of the will management server 400 may recognize whether the user terminal 100 is a terminal authorized to perform a registration request for a will based on the identification information (S320).

For example, the processor 410 may recognize a user of the user terminal 100 based on the identification information. In addition, the processor 410 may recognize whether the user matches a person authorized to perform a request for registration of a will (eg, testator A, an agent of testator A, etc.). When the processor 410 recognizes that the user and the person authorized to perform the registration request for the will match, the user terminal 100 recognizes that the user terminal 100 is a terminal authorized to perform the registration request for the will. I can. In addition, when the processor 410 recognizes that the user and the authorized person who can perform the registration request for the will do not match, the user terminal 100 that has transmitted the registration request signal for the will will perform the registration request for the will. It can be recognized that the terminal is not authorized to do so.

On the other hand, according to some embodiments, when the user recognizes that it is different from the will of the will, the processor 410 can verify the relationship with the will to the user terminal 100 that has transmitted the registration request signal of the will. The communication unit 430 may be controlled to transmit a signal for requesting data.

On the other hand, if the processor 410 recognizes in step S320 that the user terminal 100 has the authority to perform the registration request of the will (S320, Yes), the smart contract is based on the registration request of the will. Can be generated (S330).

In this case, the processor 410 transmits the smart contract to at least one node through the communication unit 430, so that a plurality of nodes verify the validity of the smart contract through a consensus algorithm, and as the validity of the smart contract is verified, You can cause the node of to write the smart contract to the block as the first transaction.

On the other hand, if the processor 410 recognizes that the user terminal 100 is a terminal that does not have the authority to perform the registration request for a will (S320, No), the smart contract may not be generated based on the registration request. However, the present invention is not limited thereto, and the processor 410 may reconfirm whether or not the user terminal 100 is a terminal having the authority to perform the registration request of the testator a predetermined number of times.

Meanwhile, according to some embodiments, when the processor 410 recognizes that the user terminal 100 is a terminal that does not have the right to perform the registration request for a will (S320, No), the user terminal 100 has It is also possible to control the communication unit 430 to transmit a signal including a reason for recognizing that the terminal is not present.

As described above in FIG. 4, when a smart contract is transmitted to at least one node, a plurality of nodes verify the validity of the smart contract through a consensus algorithm, and as the validity of the smart contract is verified, the plurality of nodes are smart in the block. The contract can be recorded as a first transaction. In addition, when the smart contract is recorded in the blockchain network 200, it is virtually impossible to forge or alter the smart contract, and the information included in the recorded first transaction may be stored in a state in which integrity can be guaranteed.

5 is a flowchart illustrating an example of a method of recording a smart contract in a blockchain network based on a request for registration of a will, according to some embodiments of the present disclosure. For features that overlap with the features described above with respect to FIGS. 1 to 4 among the features of the content illustrated in FIG. 5, the descriptions thereof will be omitted herein with reference to the content described in FIGS. 1 to 4.

Referring to FIG. 5, a user may write a will through the user terminal 100 (S410). In this case, the user terminal 100 may display a user interface for receiving a will from the user on the screen.

Here, the will created by the user may include a document created in a form that can be transmitted through the network 500, a voice recording file, an image file, and a scan file of a document notarized offline.

On the other hand, when the user completes the creation of the will, the user terminal 100 may transmit a registration request signal of the will including the will created by the user to the will management server (S420). Here, the request for registration of the will may be a series of signals requesting that the will written by the user be recorded in the blockchain network 200

According to some embodiments, when the processor 410 of the will management server 400 receives a will registration request in step S420, the user terminal 100 transmits a first signal to determine whether a registration request signal has been transmitted. It is possible to control the communication unit 430 to transmit to (S430).

Here, the first signal may include at least one of a response request signal for a message, a connection request signal for a linked site, and an e-mail reply request signal. However, the first signal is not limited thereto, and various confirmation request signals may be included.

The user may transmit a second signal corresponding to the first signal received through the user terminal 100 to the will management server 400 (S440).

Here, the second signal may include at least one of a reply of a text corresponding to the first signal, a connection to a linked site, and a reply of an e-mail.

The processor 410 of the will management server 400 may check whether the request for registration of the will is transmitted from the user terminal 100 based on the second signal (S450).

Specifically, the processor 410 may check whether the second signal received through the communication unit 430 is received from the user terminal 100 requesting registration based on the user identification information.

For example, even if the communication unit 430 receives a second signal corresponding to the first signal, the processor 410 may receive a will, if the user terminal 100 requesting the registration of the will and the terminal transmitting the second signal are different. You can decline your registration request.

In addition, according to some embodiments of the present disclosure, when the processor 410 of the will management server 400 fails to receive a second signal corresponding to the first signal from the user terminal 100 through the communication unit 4340, The first signal may be retransmitted or the request for registration of a will may be rejected.

On the other hand, if the processor 410 of the will management server 400 recognizes that the terminal that has transmitted the second signal in step S450 matches the user terminal 100 requesting the registration of the will, the smart contract is based on the registration request. Can be generated (S460). Here, the smart contract may be a smart contract including the first code and the second code described above in FIG. 2.

The processor 410 of the will management server 400 may control the communication unit 430 to transmit the generated smart contract to at least one node (S470).

When the will management server 400 transmits the smart contract to at least one node included in the blockchain network 200, a plurality of nodes may verify the validity of the smart contract through a consensus algorithm.

When the processor 410 of the will management server 400 transmits the smart contract to at least one node in step S470, the smart contract may be recorded as a first transaction in the blockchain network 200 (S480). .

Specifically, a smart contract that has undergone a consensus algorithm by a plurality of nodes included in the blockchain network 200 and validated by the consensus algorithm will be recorded in the block created as the first transaction in the blockchain network 200. I can.

6 is a flowchart illustrating an example of a method of recognizing that an execution condition of a will is satisfied, according to some embodiments of the present disclosure.

According to some embodiments of the present disclosure, the processor 410 of the will management server 400 may request a user to perform a preset action when registering a will according to a request for registration of a will. Further, the processor 410 may check whether the execution condition of the will described in FIG. 3 is satisfied based on whether a preset action is performed.

Referring to FIG. 6, the processor 410 of the will management server 400 may periodically or aperiodically check whether a predetermined action is performed by the user of the user terminal 100 (S510).

Specifically, the processor 410 may request the user to perform a predetermined action through the user terminal 100 after the user's will is recorded in the blockchain network.

Here, the preset actions include transmission of a signal to the will management server 400 through the user terminal 100, access to a homepage operated by the will management server 400, and transmission of an email to the will management server 400. can do. However, the preset action is not limited to the above-described example, and various actions that the user can perform through the user terminal 100 may be included.

The processor 410 of the will management server 400 may recognize that the execution condition of the will is satisfied according to whether the preset action is performed for a preset period (S520, No) (S530).

Specifically, if a preset action is not performed from the user terminal 100 for a preset period, the processor 410 may recognize that the user who requested the registration of the will is dead and that the execution condition of the will is satisfied.

Meanwhile, according to some embodiments of the present disclosure, if a preset action is not performed for a preset period, the processor 410 transmits a signal for confirming the user's death to the user terminal 100 and the external terminal 300. It is possible to control the communication unit 430. When the user has not died, but cannot perform the preset action through the user terminal 100 due to physical difficulties, or cannot perform the preset action due to damage or loss of the user terminal 100 This is because special situations such as when a user simply forgets to perform a preset action may occur.

On the other hand, the processor 410 may recognize that the execution condition of the will is not satisfied if it is confirmed that a preset action is being performed from the user terminal 100 through the communication unit 430 (S530, Yes).

7 is a flowchart illustrating an example of a method of recognizing that an execution condition of a will is satisfied based on a death signal of a user according to some embodiments of the present disclosure.

Referring to FIG. 7, the external terminal 300 may transmit a user's death signal to the will management server 400 (S610).

Here, the death signal may include a transmission of data that can prove the user's death, a signal requesting execution of a will, and the like.

The processor 410 of the will management server 400 receiving the death signal may control the communication unit 430 to transmit a death confirmation request signal for confirming the user's death to the external server 600 (S620).

The external server 600 may include a medical institution server or a government office server that can confirm the death of the user.

When receiving the user's death confirmation request signal in step S620, the external server 600 may check whether the user has actually died in the database.

The external server 600 may receive a third signal indicating whether the user has died after checking whether the user has actually died (S630).

Here, the third signal may include at least one of a survival confirmation letter, a life return report, a basic certificate, a death certificate, and a corpse optometrist for the user. However, the third signal is not limited to the above-described example, and may include various certificates or signals for confirming the death of the user.

Meanwhile, the processor 410 of the will management server 400 may check whether the user is dead based on the third signal received through the communication unit 430 (S640).

Specifically, the processor 410 may check whether the user dies based on at least one of the received survival confirmation, resuscitation report, basic certificate, death confirmation, and corpse optometry.

On the other hand, according to some embodiments of the present disclosure, the will management server 400 includes at least one of the external terminal 300 (for example, a spokesperson of a testament, a relative of the testament, and a testament) through the communication unit 430. When a user's death signal signal is received from one terminal), the communication unit 430 may be controlled to transmit a fourth signal for confirming the user's death to the user terminal 100.

Specifically, when the processor 410 receives a request to execute a will from the external terminal 300 through the communication unit 430, the processor 410 may transmit a user's death confirmation request signal to the user terminal 100. In addition, if the processor 410 receives the fifth signal corresponding to the fourth signal from the user terminal 100 through the communication unit 430, the processor 410 may check the death information of the user based on the fifth signal.

Here, the fourth signal may be a signal for confirming the authenticity of at least one of a death signal transmitted from the external terminal 100, an inquiry signal for a will, and a signal for requesting execution of a will. In addition, the fifth signal may be a signal capable of confirming that at least one of a death signal transmitted from the external terminal 100, an inquiry signal of a will, and an execution request signal of a will is not forged.

Meanwhile, if the fifth signal corresponding to the fourth signal is not received, the processor 410 may control the communication unit 430 to transmit a death confirmation request signal for confirming the user's death to the external server 600.

The processor 410 of the will management server 400 may receive a third signal indicating whether the user's death has been confirmed from the external server 600 through the communication unit 430 (S630).

Here, the third signal may include at least one of a survival confirmation letter, a life return report, a basic certificate, a death certificate, and a corpse optometrist for the user. However, the third signal is not limited to the above-described example, and may include various certificates or signals for confirming the death of the user.

Meanwhile, the processor 410 of the will management server 400 may recognize that the execution condition of the will is satisfied through a case where a preset time has elapsed after the user dies (S650, Yes) (S660).

Here, the preset time may be a predetermined time from when the user requests registration of the will or after the death of the user included in the will. In addition, the preset time may not be a time set by a user, but may be a time required to register in a government office server after a death confirmation is determined by a medical institution server among the external servers 600, a time required to hold a funeral, and the like.

In addition, the processor 410 may recognize that the execution condition of the will is not satisfied when a preset time has not elapsed after the user dies (S650, No).

8 is a flowchart illustrating an example of a method of performing an action corresponding to content included in a will, according to some embodiments of the present disclosure. For features that overlap with the features described above with respect to FIGS. 1 to 7 among the features of the content illustrated in FIG. 8, reference to the content described in FIGS. 1 to 7 will be omitted herein.

Referring to FIG. 8, the will management server 400 may receive a request to execute the will (S710). Specifically, the processor 410 may receive a request to execute a will through the communication unit 430 from the external terminal 300 and the user terminal 100 as described above with reference to FIG. 7.

Further, the processor 410 may check whether the execution condition of the will is satisfied based on the examples described above in FIGS. 3 and 6.

When the execution condition of the will is satisfied (S720, Yes), the processor 410 of the will management server 400 transmits first information indicating that the execution condition of the will is satisfied to at least one node included in the blockchain network 200. The communication unit 430 can be controlled to transmit (S730).

Specifically, when the processor 410 transmits the first information to at least one node, a plurality of nodes may verify the validity of the first information through an agreement algorithm.

In addition, the processor 410 of the will management server 400 may record first information indicating that the execution condition of the will is satisfied in the blockchain network 200 as a second transaction (S740).

As the validity of the first information is verified, each of the nodes included in the blockchain network 200 may record the first information in the block as a second transaction through a consensus algorithm. Here, blocks may be connected by chains referred to in blockchain technology.

In addition, when the first information is recorded in the blockchain network 200, it is virtually impossible for the first information to be forged or altered. Therefore, it is possible to prevent at least one of a malicious testament, notary, and agent from hacking and modifying the first information, and the information contained in the recorded second transaction can be kept in a state where integrity can be guaranteed. have.

When the processor 410 recognizes first information indicating that at least one execution condition is satisfied, the processor 410 may transmit the first information generated based on the execution condition to at least one node included in the blockchain network 200. When the first information is verified through the consensus algorithm, a block may be generated in each of a plurality of nodes and the first information may be recorded in the block.

Meanwhile, when transmitting the first information to at least one node, the processor 410 generates a second transaction signed with a private key associated with the will management server 400, and transmits the generated second transaction to at least one node. The communication unit 430 can be controlled so as to be performed.

Here, the identification information generated from the private key of the will management server 400 may be recorded in the input value of the second transaction. In addition, address information in the blockchain network 200 in which a second transaction including first information of at least one user is to be stored and a second transaction including the first information may be recorded in the output value.

On the other hand, when it is recognized that the will execution condition is satisfied in step S720, the processor 410 of the will management server 400 may execute a smart contract to perform an action corresponding to the content included in the will. Yes (S750).

Specifically, the processor 410 may recognize the content contained in the will registered in the blockchain network 200 and perform an action corresponding to the content related to the smart contract.

Here, the action corresponding to the content related to the smart contract may include an account transfer, a token transfer, a document transfer, and the like. However, the action is not limited to the above-described content, and may include various actions that can be performed through a smart contract.

For this, detailed descriptions described in detail in FIGS. 1 to 7 will be omitted.

9 exemplarily shows a connection structure of blocks stored in a blockchain network according to some embodiments of the present disclosure.

Referring to FIG. 9, blocks 1400a, 1400b and 1400c, which are storage units in the blockchain network 200, may be connected to each other in a chain form to form a blockchain. Referring to FIG. 9, the blocks 1400a, 1400b, and 1400c may mean the blocks described above in FIGS. 1 to 8.

Blocks 1400a, 1400b, and 1400c may be composed of a block header and a transaction. The block header may include, for example, a hash value of a previous block header, a nonce value, and a hash value of a transaction group. The nonce value is a value that a node in the blockchain network 200 changes to create a block, and may be used as an input value of a specific hash function along with other values of the block header. When a specific nonce value is used, if the hash value of the block header is smaller than the predetermined difficulty value (which can be stored in the block header), the hash value for the corresponding block header may be determined. The hash value of the transaction group may mean the root hash value of data included in the transaction.

Since the block hash value of the block 301 (1400a) is used as an input value to obtain the block hash value of the block header of the block 302 (1400b), the block 302 (1400b) and the block 301 (1400a) may be connected to each other. In addition, in obtaining the block hash value, since the hash value of the transaction group, which is a hash value representing transactions, is used as an input value, if any forgery behavior occurs on the transaction, the hash value of the transaction group is changed. In this way, adjacent blocks can be connected to each other, and transaction information within the block can be stored with integrity.

The transaction of the blocks 1400a, 1400b and 1400c is the transaction(s) included in the block among issued transactions, and when the transaction is included in the block, the operation related to the transaction will be performed in the blockchain network 200. I can. Here, when the blocks 1400a, 1400b, and 1400c are chunk blocks, the transaction is information about the address of at least one source having each of a plurality of chunk data, and information about the download speed when downloading from each of the at least one source. And information about the latency of each of the at least one source. In addition, when the blocks 1400a, 1400b, and 1400c are compensation blocks, each of the compensation information for at least one source and each contribution information for at least one source may be included as a transaction. However, the present invention is not limited thereto, and various pieces of information may be recorded as transactions in the blocks 1400a, 1400b, and 1400c.

As an additional embodiment, although not shown in FIG. 9, the block header of the blocks 1400a, 1400b, and 1400c has a hash value (ParentHash) of the parent block (previous block), and an uncle block of the current block (block difficulty is relatively low. Hash value (UncleHash) of blocks that were not accepted as blocks), Merkle Tree's root node hash value (TxHash) for all transactions in the block, Merkle Tree's root node hash value (ReceiptHash) of all transactions in the block , 32-byte bloom filter information used to use log information (Bloom), block difficulty (Difficulty) calculated by the difficulty and timestamp of the previous block, current block number (Number), the total number of tokens that can be paid per block (TokenLimit ), the total number of tokens used in transactions within the block (TokenUsed), the initial creation time of the block (Time), other information of the block (Extra), and/or the number of calculations sufficient to calculate the hash value from the proof of work. It may also include a value (MixDigest, Nonce). However, the present invention is not limited thereto, and the block header may further include data or information other than those described above.

According to some embodiments of the present disclosure, a block may be generated at a specific time interval (eg, 5 minutes, 1 minute), wherein the specific time may be changed based on the difficulty of generating the block.

10 shows a general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented.

While the present disclosure has generally been described above with respect to computer-executable instructions that may be executed on one or more computers, those skilled in the art will appreciate that the present disclosure may be implemented in combination with other program modules and/or as a combination of hardware and software. I will know.

In general, modules herein include routines, procedures, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Further, to those skilled in the art, the method of the present disclosure is not limited to single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, handheld computing devices, microprocessor-based or programmable household appliances, and the like (each of which It will be appreciated that it may be implemented with other computer system configurations, including one or more associated devices).

The described embodiments of the present disclosure may also be practiced in a distributed computing environment where certain tasks are performed by remote processing devices that are connected through a communication network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

Computers typically include a variety of computer-readable media. A computer-accessible medium includes volatile and non-volatile media, transitory and non-transitory media, and removable and non-removable media. By way of example, and not limitation, computer-readable media may include computer-readable storage media and computer-readable transmission media.

Computer-readable storage media include volatile and nonvolatile media, transitory and non-transitory media, removable and non-removable media implemented in any method or technology for storing information such as computer-readable instructions, data structures, program modules or other data. Includes the medium. Computer-readable storage media include RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage, magnetic cassette, magnetic tape, magnetic disk storage, or other magnetic storage. Devices, or any other medium that can be accessed by a computer and used to store desired information.

Computer-readable transmission media typically implement computer-readable instructions, data structures, program modules or other data on a modulated data signal such as a carrier wave or other transport mechanism. Includes all information delivery media. The term modulated data signal refers to a signal in which one or more of the characteristics of the signal is set or changed to encode information in the signal. By way of example, and not limitation, computer-readable transmission media include wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media. Combinations of any of the above-described media are also intended to be included within the scope of computer-readable transmission media.

An exemplary environment 1100 is shown that implements various aspects of the present disclosure, including a computer 1102, which includes a processing device 1104, a system memory 1106, and a system bus 1108. do. System bus 1108 couples system components, including but not limited to, system memory 1106 to processing device 1104. The processing unit 1104 may be any of a variety of commercially available processors. Dual processors and other multiprocessor architectures may also be used as processing unit 1104.

The system bus 1108 may be any of several types of bus structures that may be additionally interconnected to a memory bus, a peripheral bus, and a local bus using any of a variety of commercial bus architectures. System memory 1106 includes read-only memory (ROM) 1110 and random access memory (RAM) 1112. The basic input/output system (BIOS) is stored in non-volatile memory 1110 such as ROM, EPROM, EEPROM, etc. This BIOS is a basic input/output system that helps transfer information between components in the computer 1102, such as during startup. Includes routines. RAM 1112 may also include high speed RAM such as static RAM for caching data.

Computer 1102 also includes internal hard disk drive (HDD) 1114 (e.g., EIDE, SATA)-This internal hard disk drive 1114 can also be configured for external use within a suitable chassis (not shown). Yes--, magnetic floppy disk drive (FDD) 1116 (for example, to read from or write to removable diskette 1118), and optical disk drive 1120 (e.g., CD-ROM For reading the disk 1122 or reading from or writing to other high-capacity optical media such as DVD). The hard disk drive 1114, magnetic disk drive 1116, and optical disk drive 1120 are each connected to the system bus 1108 by a hard disk drive interface 1124, a magnetic disk drive interface 1126, and an optical drive interface 1128. ) Can be connected. The interface 1124 for implementing an external drive includes, for example, at least one or both of USB (Universal Serial Bus) and IEEE 1394 interface technologies.

These drives and their associated computer readable media provide non-volatile storage of data, data structures, computer executable instructions, and the like. In the case of computer 1102, drives and media correspond to storing any data in a suitable digital format. Although the description of the computer-readable storage medium above refers to a removable optical medium such as a HDD, a removable magnetic disk, and a CD or DVD, those skilled in the art may include a zip drive, a magnetic cassette, a flash memory card, a cartridge, It will be appreciated that other types of computer-readable storage media, such as etc., may also be used in the exemplary operating environment and that any such media may contain computer-executable instructions for performing the methods of the present disclosure. .

A number of program modules, including the operating system 1130, one or more application programs 1132, other program modules 1134, and program data 1136, may be stored in the drive and RAM 1112. All or part of the operating system, applications, modules, and/or data may also be cached in RAM 1112. It will be appreciated that the present disclosure may be implemented on a number of commercially available operating systems or combinations of operating systems.

A user may input commands and information to the computer 1102 through one or more wired/wireless input devices, for example, a pointing device such as a keyboard 1138 and a mouse 1140. Other input devices (not shown) may include a microphone, IR remote control, joystick, game pad, stylus pen, touch screen, and the like. These and other input devices are often connected to the processing unit 1104 through the input device interface 1142, which is connected to the system bus 1108, but the parallel port, IEEE 1394 serial port, game port, USB port, IR interface, It can be connected by other interfaces such as etc.

A monitor 1144 or other type of display device is also connected to the system bus 1108 through an interface such as a video adapter 1146. In addition to the monitor 1144, the computer generally includes other peripheral output devices (not shown) such as speakers, printers, etc.

Computer 1102 may operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 1148 via wired and/or wireless communication. The remote computer(s) 1148 may be a workstation, server computer, router, personal computer, portable computer, microprocessor-based entertainment device, peer device, or other common network node, and is generally referred to as a computer 1102. Although including many or all of the described components, only memory storage device 1150 is shown for simplicity. The logical connections shown include wired/wireless connections to a local area network (LAN) 1152 and/or to a larger network, eg, a wide area network (WAN) 1154. Such LAN and WAN networking environments are common in offices and companies, and facilitate an enterprise-wide computer network such as an intranet, all of which can be connected to a worldwide computer network, for example the Internet.

When used in a LAN networking environment, the computer 1102 is connected to the local network 1152 via a wired and/or wireless communication network interface or adapter 1156. Adapter 1156 may facilitate wired or wireless communication to LAN 1152, which also includes a wireless access point installed therein to communicate with wireless adapter 1156. When used in a WAN networking environment, the computer 1102 may include a modem 1158, connected to a communication server on the WAN 1154, or through the Internet, etc. to establish communication through the WAN 1154 Have means. The modem 1158, which may be an internal or external and a wired or wireless device, is connected to the system bus 1108 through a serial port interface 1142. In a networked environment, program modules described for the computer 1102 or portions thereof may be stored in the remote memory/storage device 1150. It will be appreciated that the network connections shown are exemplary and other means of establishing communication links between computers may be used.

Computer 1102 is associated with any wireless device or entity deployed and operated in wireless communication, e.g., a printer, scanner, desktop and/or portable computer, portable data assistant (PDA), communication satellite, wireless detectable tag. It operates to communicate with any device or place and phone. This includes at least Wi-Fi and Bluetooth wireless technologies. Thus, the communication may be a predefined structure as in a conventional network or may simply be ad hoc communication between at least two devices.

Wi-Fi (Wireless Fidelity) allows you to connect to the Internet, etc. without wires. Wi-Fi is a wireless technology such as a cell phone that allows such devices, for example computers, to transmit and receive data indoors and outdoors, ie anywhere within the coverage area of a base station. Wi-Fi networks use a wireless technology called IEEE 802.11 (a,b,g, etc.) to provide a secure, reliable and high-speed wireless connection. Wi-Fi can be used to connect computers to each other, to the Internet, and to a wired network (using IEEE 802.3 or Ethernet). Wi-Fi networks can operate in unlicensed 2.4 and 5 GHz radio bands, for example at 11 Mbps (802.11a) or 54 Mbps (802.11b) data rates, or in products that include both bands (dual band). have.

A person of ordinary skill in the art of the present disclosure includes various exemplary logical blocks, modules, processors, means, circuits and algorithm steps described in connection with the embodiments disclosed herein, electronic hardware, (convenience). For the sake of clarity, it will be appreciated that it may be implemented by various forms of program or design code or a combination of both (referred to herein as "software"). To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the particular application and design constraints imposed on the overall system. A person of ordinary skill in the art of the present disclosure may implement the described functions in various ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

The various embodiments presented herein may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term “article of manufacture” includes a computer program, carrier, or media accessible from any computer-readable device. For example, computer-readable storage media include magnetic storage devices (e.g., hard disks, floppy disks, magnetic strips, etc.), optical disks (e.g., CD, DVD, etc.), smart cards, and flash Memory devices (eg, EEPROMs, cards, sticks, key drives, etc.), but are not limited thereto. The term “machine-readable medium” includes, but is not limited to, wireless channels and various other media capable of storing, holding, and/or transmitting instruction(s) and/or data.

It is to be understood that the specific order or hierarchy of steps in the presented processes is an example of exemplary approaches. Based on the design priorities, it is to be understood that within the scope of the present disclosure a specific order or hierarchy of steps in processes may be rearranged. The appended method claims provide elements of the various steps in a sample order, but are not meant to be limited to the specific order or hierarchy presented.

The description of the presented embodiments is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these embodiments will be apparent to those of ordinary skill in the art, and general principles defined herein may be applied to other embodiments without departing from the scope of the present disclosure. Thus, the present disclosure is not limited to the embodiments presented herein, but is to be interpreted in the widest scope consistent with the principles and novel features presented herein.

Claims (1)

A computer program stored on a computer-readable storage medium, comprising:
The computer program includes instructions for causing the will management server to perform the following operations, the operations:
Receiving a request for registration of a will from a user terminal;
Upon receiving the registration request, generating a smart contract based on the registration request;
By transmitting the smart contract to at least one node included in the blockchain network, a plurality of nodes verify the validity of the smart contract through a consensus algorithm, and the plurality of nodes block as the validity of the smart contract is verified. Causing to write the smart contract to a first transaction;
Checking whether the execution condition of the will is satisfied;
When it is recognized that the execution condition of the will is satisfied, executing the smart contract to perform an action corresponding to the content included in the will;
Containing,
A computer program stored on a computer-readable storage medium.

Images