KR102107237B1 - Method for providing internet service using proof-of-reliability based on block-chain and distributed infrastructure p2p model - Google Patents

Abstract

A method of providing Internet service using PoR proof based on a blockchain and distributed infrastructure P2P model is provided, and transmitting a request event for retrieving or storing information through an Internet browser, a node constituting a blockchain connected to a client terminal and distributed P2P A step of selecting at least one pool having a predetermined proximity between nodes among clustered pools, checking the reliability of at least one pool using PoR proof, and having the highest reliability value. And selecting a pool and receiving piece data corresponding to the request event based on an index asynchronously from a plurality of nodes included in the selected pool.

Description

Method for providing Internet service using PoR proof based on blockchain and distributed infrastructure P2P model

The present invention relates to a method for providing Internet service using PoR proof based on a blockchain and distributed infrastructure P2P model, verifying the reliability of each node to increase the availability and speed of resource requests and searches, and to compensate for the provision of resources. Provide a method.

Recently, data on the Internet is not only being controlled by the agency without being aware of it, but the agency is continuing to develop browsers and operating systems to monitor individuals, and large organizations that have sold information obtained as a result of monitoring It has been accumulated trillion units of assets, but individuals are not even entitled to claim it. In addition, in the Internet environment, there is a subtle nerve war between a company that wants to collect more customer information and a customer who wants to protect their privacy. For Internet services, companies collect and use customer information through terms and conditions and privacy policy Although the scope, purpose, and procedure for loss are announced, the Internet service cannot be used without consent, so it is difficult for an individual to exercise the rights of the data subject.

At this time, a technique was developed to improve the efficiency of personal information protection and search operations. In this regard, in Korean Patent Publication No. 2011-0056034 (published on May 26, 2011), which is a prior art, a user can search for a search site A search history storage means is provided to store the keyword entered in the search engine, and store link information of search results posted by the search site according to the keyword for each search site. The user inputs the keyword in connection with the Internet communication module of the web browser. Disclosed is a configuration for confirming and transmitting a search site and keywords, and checking and storing link information of a search result clicked by a user among search results posted by the search site.

However, the above-described configuration is merely to prevent others from viewing their keywords while using the existing Internet, and is a simple structure that cannot prevent information collected by browsers on the Internet. In addition, the information the user obtains through the Internet does not change the paradigm that is limited and controlled by the content provider, and by distributing personal information, only some large-scale enterprises maintain the structure called the ship, so data on the Internet It is required to develop a platform that has a profit structure that decentralizes and distributes the price for using information to information providers.

According to an embodiment of the present invention, data is distributed based on a blockchain and stored in a node constituting a blockchain, and the reliability of the stored node is measured to retrieve and provide data from a pool constituting a node with high reliability, A method of providing Internet services using PoR proof based on a blockchain and distributed infrastructure P2P model, which enables a node that shares data resources to be rewarded with cryptocurrency to prevent equitable wealth distribution and content from being controlled by some large enterprises. Can provide However, the technical problem to be achieved by the present embodiment is not limited to the technical problem as described above, and other technical problems may exist.

As a technical means for achieving the above technical problem, an embodiment of the present invention, transmitting a request event for retrieving or storing information through an Internet browser, a node constituting a block chain connected to a client terminal and distributed P2P A step of selecting at least one pool having a predetermined proximity between nodes among clustered pools, checking the reliability of at least one pool using PoR proof, and having the highest reliability value. And selecting a pool and receiving piece data corresponding to the request event based on an index asynchronously from a plurality of nodes included in the selected pool.

According to any one of the above-described problem solving means of the present invention, data is distributed from a pool constituting a node with high reliability by measuring the reliability of the stored node by distributing data based on the blockchain and storing it in a node constituting the blockchain. It is to be searched and provided, and rewards are given to the nodes that share data resources with cryptocurrency, so that some large enterprises can control the distribution of fair wealth and content.

1 is a view for explaining a system for providing Internet service using PoR proof based on a blockchain and distributed infrastructure P2P model according to an embodiment of the present invention.
2 is a block diagram illustrating a client terminal included in the system of FIG. 1.
3 is a diagram for explaining an embodiment in which data distribution and file storage processes are implemented among Internet services using PoR proof based on a blockchain and distributed infrastructure P2P model according to an embodiment of the present invention.
4 is a diagram for explaining a data fragment copy process and a Merkle tree used for data distribution among Internet services using PoR proof based on a blockchain and distributed infrastructure P2P model according to an embodiment of the present invention.
5 is a block chain and a distributed infrastructure according to an embodiment of the present invention according to an embodiment of a P2P model-based Internet service using a PoR proof and collecting data fragments from a distributed web server to serve as a client terminal and a process of accessing the Internet are implemented. It is a diagram for explaining one embodiment.
6 is a flowchart illustrating an Internet service providing method using PoR proof based on a blockchain and distributed infrastructure P2P model according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art to which the present invention pertains may easily practice. However, the present invention can be implemented in many different forms and is not limited to the embodiments described herein. In addition, in order to clearly describe the present invention in the drawings, parts irrelevant to the description are omitted, and like reference numerals are assigned to similar parts throughout the specification.

Throughout the specification, when a part is "connected" to another part, this includes not only "directly connected" but also "electrically connected" with another element in between. . Also, when a part is said to "include" a certain component, it means that the component may further include other components, not exclude other components, unless specifically stated otherwise. However, it should be understood that the existence or addition possibilities of numbers, steps, actions, components, parts or combinations thereof are not excluded in advance.

The terms "about", "substantially", and the like used throughout the specification are used in or at a value close to the value when manufacturing and substance tolerances unique to the stated meaning are given, and the understanding of the present invention. To aid, accurate or absolute figures are used to prevent unscrupulous use of the disclosed disclosure by unscrupulous infringers. The term "~(step)" or "step of" as used in the entire specification of the present invention does not mean "step for".

In the present specification, the term “unit” includes a unit realized by hardware, a unit realized by software, and a unit realized by using both. Further, one unit may be realized using two or more hardware, and two or more units may be realized by one hardware.

In the present specification, some of the operations or functions described as performed by the terminal, the device, or the device may be performed instead on a server connected to the corresponding terminal, device, or device. Similarly, some of the operations or functions described as being performed by the server may be performed in a terminal, apparatus, or device connected to the corresponding server.

In this specification, some of the operations or functions described as mapping or matching with the terminal means that the unique number of the terminal or identification information of the individual, which is identification data of the terminal, is mapped or matched. Can be interpreted as

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram for explaining an Internet service providing system using PoR proof based on a blockchain and distributed infrastructure P2P model according to an embodiment of the present invention. Referring to FIG. 1, a system for providing Internet service using PoR proof based on a blockchain and distributed infrastructure P2P model includes a client terminal 100, a distributed web server 300, a root DNS server 400, and a TLD (Top) -Level Domain) DNS server 500 and a pool (Pool, 600) may be included. However, since the Internet service providing system 1 using the PoR proof based on the blockchain and distributed infrastructure P2P model of FIG. 1 is only an embodiment of the present invention, the present invention is not limitedly interpreted through FIG. 1.

At this time, each component of FIG. 1 is generally connected through a network (network, 200). For example, as illustrated in FIG. 1, the client terminal 100 may distribute the web server 300, the root DNS server 400, the TLD DNS server 500, and the pool 600 through the network 200. And can be connected. In addition, the distributed web server 300 may be connected to the client terminal 100 and the pool 600 through the network 200. In addition, the root DNS server 400 may be connected to the client terminal 100 and the TLD DNS server 500 through the network 200. In addition, the TLD DNS server 500 may be connected to the root DNS server 400 and the client terminal 100 through the network 200. In addition, the pool 500 may be connected to the client terminal 100 through the network 200.

Here, the network means a connection structure capable of exchanging information between each node such as a plurality of terminals and servers, and examples of such a network include RF, 3GPP (3rd Generation Partnership Project) network, and LTE (Long Term) Evolution network, 5GPP (5rd Generation Partnership Project) network, WIMAX (World Interoperability for Microwave Access) network, Internet (Internet), Local Area Network (LAN), Wireless Local Area Network (LAN), Wide Area Network (WAN) , PAN (Personal Area Network), Bluetooth (Bluetooth) network, NFC network, satellite broadcasting network, analog broadcasting network, DMB (Digital Multimedia Broadcasting) network, and the like.

In the following, the term at least one is defined as a term including singular and plural, and even if the term at least one does not exist, each component may exist in singular or plural, and may mean singular or plural. It will be self-evident. In addition, it may be said that each component is provided in a singular or plural form, depending on the embodiment.

The method according to an embodiment of the present invention does not use an existing Internet browser, a search engine, an operating system, a web server, a domain system, but a browser, a search engine, an operating system, and a web based on a distributed infrastructure P2P model that is not centralized. It means that all the resources of the server, domain system, and storage space use computing resources or networking resources corresponding to the nodes constituting the blockchain. To this end, each node constituting the blockchain is evaluated for the reliability of whether a client can respond when requesting a file or performing a search, which is given reliability by PoR proof, and a node that is highly trusted. More and more resources can be provided to the client, and rewards can be provided for providing resources, which may be cryptocurrencies. At this time, since the client cannot grasp the reliability of all nodes, the node is divided into a pool including a plurality of nodes, and it is determined whether resources can be provided to the client based on the reliability of the pool. In this way, the resources are distributed and stored, and the stored fragmented data is collected and provided whenever a request is made by the client, and if there is an error in the data, it is checked. If there is a change in the data, all nodes in the blockchain will use the same file. By retaining the ability to detect it, it allows the same response to the same request anytime, anywhere.

Each configuration will be described based on the basic concept according to an embodiment of the present invention.

The client terminal 100 uses a web page, an app page, a program or an application related to the Internet service using a blockchain and distributed infrastructure P2P model-based PoR proof to store data through a node consisting of a distributed infrastructure P2P and blockchain. It may be a terminal that requests, requests an Internet search, or uses a streaming service. In addition, the client terminal 100 may be a terminal that selects a pool 600 having the closest and best reliability among a plurality of pools 600 connected around the client terminal 100 and requests data. Also, when a domain request is made from the client terminal 100, that is, when searching for a url, it may be a terminal that obtains the response through the root DNS server 400 or the TLD DNS server 500. Of course, it may be a node in terms of providing resources to the client terminal, but the role of requesting and receiving resources is defined as a client, and the role of providing resources is defined as a node. Of course, it will be apparent that the client terminal may be a node in the case of providing self-portrait, and the node may also be a client terminal.

Here, the client terminal 100 may be implemented as a computer that can access a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like. In this case, the client terminal 100 may be implemented as a terminal that can access a remote server or terminal through a network. The client terminal 100 is, for example, a wireless communication device in which portability and mobility are guaranteed, navigation, PCS (Personal Communication System), GSM (Global System for Mobile communications), PDC (Personal Digital Cellular), PHS (Personal) Handyphone System), PDA (Personal Digital Assistant), IMT(International Mobile Telecommunication)-2000, CDMA(Code Division Multiple Access)-2000, W-CDMA(W-Code Division Multiple Access), Wibro(Wireless Broadband Internet) terminal, It may include all kinds of handheld-based wireless communication devices such as a smart phone, a smart pad, and a tablet PC.

The distributed web server 300 may be a server that always responds to a file request of the client terminal 100 using an Internet service web page, app page, program, or application using PoR proof based on a blockchain and distributed infrastructure P2P model. . In the blockchain, all are defined as nodes, but among them, it can be defined as a server for responding to requests from the client terminal 100 anytime, anywhere. The distributed web server 300 may be a dynamic or static web server, and when there is a request from the client terminal 100, data fragments distributed in the pool 600 are collected, arranged, and sorted using a fragment collector to compile. After completing the processing, it may be a server that transmits to the client terminal 100.

Here, the distributed web server 300 may be implemented as a computer that can access a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like.

The root DNS server 400 may be a name server for an Internet DNS root region using a web page, an app page, a program or an application related to Internet services using PoR proof based on a blockchain and distributed infrastructure P2P model. At this time, the root DNS server 400 may directly respond to a record request of the client terminal 100 occurring in the root zone, and other requests may be a server that grants authority to the TLD DNS server 400 and responds proxyly. . As the distributed web server 300 is a node that is a component in the blockchain, the root DNS server 400 is a component in the blockchain, and the corresponding element is defined as a pool, not a node. Accordingly, the root DNS server 400 may include a plurality of nodes. That is, among the plurality of nodes, a node capable of waiting for 24 hours is a distributed web server 300, and among a pool in which a plurality of nodes are pooled, a set pool of nodes responding to a record request occurring in the root zone is a root DNS server 400). The pool at this time has a difference from the pool 600, which means that the condition for forming the root DNS server 400 should be a pool with high reliability ranking, for example, ranking 10. In addition, the root DNS server 400 may store address information of all valid TLD DNS servers 500. Accordingly, the root DNS server 400 may directly transmit and receive information to and from the TLD DNS server 500.

Here, the root DNS server 400 may be implemented as a computer that can access a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like.

The TLD DNS server 500 may be a server that has a top ranked pool using a web page, an app page, a program, or an application related to Internet services using a PoR proof based on a blockchain and distributed infrastructure P2P model, or a server that is a top ranked pool. At this time, the TLD DNS server 500 provides the information requested by the root DNS server 400 or holds a piece of content data that matches the information received from the TLD DNS server 500 in the root DNS server 400 When the pool is requested, it may be a server that provides information corresponding thereto.

Here, the TLD DNS server 500 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like.

The pool 600 may be a set of nodes that request data from the client terminal 100 using a web page, an app page, a program or an application related to Internet service using PoR proof based on a blockchain and distributed infrastructure P2P model. At this time, a manager managing the pool 600 may exist, and the manager may be a node, of course. In addition, the pool 600 has a reliability based on the reliability of each node, and based on this, an opportunity to provide data to the client terminal 100 is given, and a set day to receive compensation for this Can be.

Here, the plurality of nodes included in the pool 600 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like. At this time, the plurality of nodes included in the pool 600 may be implemented as a terminal capable of accessing a remote server or terminal through a network. The plurality of nodes included in the pool 600 is, for example, a wireless communication device in which portability and mobility are guaranteed, navigation, Personal Communication System (PCS), Global System for Mobile communications (GSM), Personal Digital Cellular (PDC) ), PHS (Personal Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless) It may include all types of handheld-based wireless communication devices such as a Broadband Internet terminal, a smartphone, a smartpad, and a Tablet PC.

FIG. 2 is a block diagram illustrating a client terminal included in the system of FIG. 1, and FIGS. 3 to 5 are Internet services using PoR proof based on a blockchain and distributed infrastructure P2P model according to an embodiment of the present invention It is a diagram for explaining one embodiment implemented. Hereinafter, description will be given with reference to FIG. 2, but with reference to FIGS. 3 to 5 to describe each component or concept included in FIG. 2.

Referring to FIG. 2, the client terminal 100 may include a transmission unit 110, a selection unit 120, a confirmation unit 130, and a reception unit 140.

A distributed web server 300 or another server (not shown) operating in cooperation with the client terminal 100, the root DNS server 400, the TLD DNS server 500, and the pool 600 according to an embodiment of the present invention When transmitting Internet service application, program, app page, web page, etc. using PoR proof based on P2P model of blockchain and distributed infrastructure, client terminal 100, root DNS server 400, TLD DNS server 500, The pool 600 may install or open Internet service applications, programs, app pages, web pages, etc. using PoR proof based on a blockchain and distributed infrastructure P2P model. In addition, the service program may be driven in the client terminal 100, the root DNS server 400, the TLD DNS server 500, and the pool 600 using a script executed in a web browser. Here, the web browser is a program that enables the use of the world wide web (WWW) service, and refers to a program that receives and displays hypertext described in a hypertext mark-up language (HTML), for example, Netscape. , Explorer, Chrome, and the like. Further, the application means an application on the terminal, and includes, for example, an app that is executed on a mobile terminal (smartphone).

Referring to FIG. 2, the transmission unit 110 may transmit a request event for retrieving or storing information through an Internet browser. At this time, the Internet browser is an Internet browser developed according to an embodiment of the present invention, which is a browser that can access both the existing website and the platform-based website of the present invention, and collects user data and does not transmit it to other organizations without permission. It is a browser with improved security and freedom using PoR protocol. At this time, PoR will be described later.

The selector 120 may select at least one pool 600 having a predetermined adjacency between nodes among the clustered pools (Pool, 600) in which the nodes constituting the blockchain connected by the client terminal 100 and the distributed P2P are clustered. have. At this time, the node may be a miner located in the pool, and may be responsible for the mobility that provides network resources and computing resources for the client terminal 100 while lending their own fast bandwidth and extra hard disk space from the pool. It may be a terminal that is granted an incentive virtual currency in exchange for. And, the node is responsible for the distributed part of the data, and the new merkle tree is continued to the previously created merkle tree. In addition, the pool 600 is a collection space of nodes as described above, and one pool manager may be included in one pool 600. The pool 600 may communicate directly with the client terminal 100, which may be through an application or a browser. And, the pool manager can be randomly determined within a trusted node range. Due to the introduction of the concept of this pool, it can be efficiently operated when data distributed to different nodes is reflected. The number of nodes that can be included in each pool 600 is limited, and the introduction of the concept of the pool 600 may be much easier to find a node suitable for itself in the client terminal 100. That is, it is far more beneficial to search 10 pools than to search all 1000 nodes. At this time, one pool can accommodate 1000 nodes, but the number may be increased or decreased according to embodiments.

The verification unit 130 may confirm the reliability of the selected at least one pool 600 using PoR proof. At this time, the PoR proof means a formula (R=Ut+Sr) in which the reliability (R) of the node is calculated as the sum of uptime and storage space reputation for each node. Uptime for each node (Ut) may be calculated as a percentage of the total time (T) that one node can perform a data storage function for every hour (P). The storage space reputation (Sr) is calculated as a percentage of the ratio of the average capacity of the storage space (S) of one node to the minimum storage space (Mms) that must be maintained at each node for 1 hour. Can be. The reliability of the pool 600 is a value obtained by dividing the sum of the reliability Ri of the plurality of nodes included in the pool 600 (Σ, i is from 1 to n) by the number of nodes (n). The average of the reliability of the node, and a node that transmits and receives messages to and from the client terminal 100 may be a pool 600 manager node, which is a node belonging to the pool 600 while managing a plurality of nodes in the pool 600.

In other words, the key to a successful distributed application starts with maintaining the reliability of the distributed node as the best activation step, and a highly reliable node can guarantee a fast and stable connection to the distributed network. One node must be able to provide storage space for a piece of data corresponding to at least one storage request. In other words, the minimum storage space requirement must be met in line with the average demand for storage requests that will occur without notice at any given time. For this, reliability and PoR proofs are used, where P is 1 hour and units are expressed in seconds. At this time, the value of P can be increased or decreased depending on the implementation, and it will be apparent that the values are not written to exclude other times.

Among the above-described parameters, the unit of T is also seconds, and the unit of Ut is also defined as seconds. S, which is the average capacity for one spare space, requires at least 15 gigabytes of storage space for miners. In addition, when the concept of Sr is necessary, it is to prevent a high reliability score from having only one element of storage space. That is, the node needs to prepare enough storage space for the data host whenever there is a storage request, and thus, it can prepare for the storage request for a large amount of data to be concentrated on some nodes, which improves the speed of the Internet. Can lead naturally. Mms may be, for example, 1,000 GB if the condition is to keep 1,000 GB continuously.

As mentioned above, the concept of the pool can significantly reduce the search time of a specific node of the client in the distributed hash table. The node that can send and receive messages to and from the client is not a large number of general nodes, but is defined as a node that holds the position of full manager. Because. At this time, the full manager can be selected based on the uptime reputation and response rate, and the pool manager can continuously monitor the performance status and abnormality of the nodes existing in the corresponding pool while sending messages to the node at regular intervals. Whenever a client requests, the pool manager should always be ready to respond immediately.

To this end, files must be distributed and stored on each node. This is called data fragmentation, which will be described with reference to FIG. 3. First, referring to (a) of FIG. 3, a schematic diagram of a system including a client terminal 100 and a pool 600 is shown. In order to respond to the request of the client terminal 100 in such a network structure, files stored in the nodes must exist. This is defined as decentralized storage components.

The data partitioning process refers to a process of dividing data into smaller pieces for easier management, and is a method of applying a distributed algorithm to a storage network. At this time, the distribution algorithm can take into account the parameters of the pool location, bandwidth, uptime rank, and storage number. Here, the factor to be considered as the priority is the reliability of the nearest pool, and the reliability is as described. At this time, the maximum size of the distributed data may be 4 MB, but it can be increased or decreased according to an embodiment. For example, it takes approximately 0.07 seconds to load data based on the average network speed in Korea of 60.58 MBps. The location of the pool is one of the most important factors for speed and reliability. When the client terminal 100 stores and retrieves data, the closest pool is selected based on the client terminal 100 as described above. In addition, factors such as the number of storage devices, reliability, bandwidth, and uptime can be considered.

At this time, since the pool 600 continuously keeps the record by synthesizing the storage devices to be used by nodes existing in the pool, it can help to find a pool 600 capable of sufficiently storing the data distributed at a given time. , This can eliminate unnecessary communication between the client terminal 100 and the node. And, it is possible to avoid using data contained in other pools that do not meet the conditions. At this time, if there is no storage device to accommodate the data distributed in the adjacent pool, it can be stored in another pool, and nodes existing in the same pool can communicate with more frequency and period than nodes existing in the other pool. At this time, if the bandwidth condition does not satisfy the reference value, the size of the fragment of the distributed data may be reduced when the data distribution process is performed.

When the data distribution process is operated, one file of the client terminal 100 is divided into data pieces, and the divided data pieces must be extracted from the client terminal 100 to be distributed to each node. b). Through the Merkle Tree debris inspection, heavy hashes that burden the I/O device and the processing device can be lightly processed. In addition, the data fragment distribution process may store the Merkle tree root and length of the client terminal 100 and improve the transmission of the data fragment and the Merkle tree leaf node. When the data is divided and distributed in parallel, the pieces of data can be efficiently distributed to nodes in the pool 600. At this time, it may be based on the open source IPFS protocol to facilitate fragment storage in the pool 600. Meanwhile, data fragment copying refers to replicating and maintaining fragments. That is, the node can replicate a piece of data from a node in the adjacent pool 600, because it is to ensure the practicality of the piece of data and to prepare for the case where some nodes do not synchronize.

Returning to FIG. 2 again, the receiving unit 140 selects the pool 600 having the highest reliability value, and asynchronously stores fragment data corresponding to the request event from a plurality of nodes included in the selected pool 600. It can be received based on the index. At this time, the receiving unit 140 may transmit a request event to a node existing in the other pool 600 when one of the plurality of nodes cannot process the request event. In addition, a plurality of nodes in each pool 600 may be retained by executing data fragmentation mirroring, which maintains a plurality of copies of data fragments in a mirror site format. At this time, the reason for receiving based on the index asynchronously from the receiving unit 140 is because a plurality of nodes included in the pool 600 broadcasts through P2P Gossip protocols with different or equal clocks. to be. Here, the Gossip protocol is a Peer that receives a single message and sends a message to any Peer in its periphery. It is developed to provide scalability while providing high reliability of message transmission, and is a well-known technology. Will be omitted.

At this time, the data fragment copy will be described with reference to FIG. 4. In this case, referring to (a) of FIG. 4, when a node in the pool 600 is exhausting available resources owned by it or no longer accepts a request, the node requests help from a node existing in another pool. For example, the first pool (Pool 1) is the closest pool with average reliability in the whole, and the third pool (Pool3) is the pool having the highest reliability among the entire nodes, but the longest. At this time, the strategy of borrowing a node is that each node maintains a plurality of copies of data fragments in a mirror site format so that files can be easily recovered even if an Internet connection fails. Therefore, even if one node stops working, the adjacent node informs the other node, and since each node contains a history of data fragments, the information of the node that maintains (owns, owns) a copy of the data fragment and the currently active mirror. The number of sites can be included, and through this, it is possible to process requests from itself with help from other nodes.

In addition, referring to (b) of FIG. 4, a diagram for explaining a Merkle tree used for data distribution, which is a family tree of a data structure composed of hashes, that is, a hash list, is a kind of tree structure, and is a leaf. A node is a hash of a block containing data, and a non-leaf node is a hash of a child node. At this time, the Merkle tree can have two branches, that is, up to two child nodes of each node. The leaf and data of the Merkle tree may be stored in the node, and the root of the Merkle tree may be stored in the wallet. The Merkle proof may be used to execute PoR proof in the client terminal 100. In other words, the most important factor in a distributed P2P system is data proof, because if the same data is distributed in multiple regions and some of the data located in one location is changed, data in all regions must be changed. Accordingly, the data proof serves to prove that the same data exists everywhere, but it is impossible to go through the data proof procedure every time a system wants to verify the data. It can prevent consumption. To this end, the amount of data transmitted through the network is limited as much as possible, but a method of transmitting a hash contained in the corresponding file is used rather than transmitting the entire file through the network.

Therefore, when data held by any one of the plurality of nodes is changed, data of all nodes in the blockchain is changed, and data proof held by the plurality of nodes is retrieved via a Merkle tree and a Merkle tree (Retrievability via Merkle Tree) and Merkle Proof), when the first node constituting the blockchain transmits a hash of the data file to the second node, the second node compares the hash stored in the Merkle tree root and the transmitted hash, and there is a change. If there is a change as a result of the verification, until the found data is changed, two subtree roots of the transmitted hash are requested to the first node, and the first node generates a hash in response to the request, and Can be sent to 2 nodes.

In the case of using the above-described method, since the computers are operated at the same time, a large number of hashes can be calculated at once, and the computer is much faster because only the hashes are transmitted over the network, not the entire file. In addition, if data with different contents is found, correcting only the error portion rather than rewriting the entire file to fix the error helps to save time. In other words, Merkle Tree is useful in distributed systems because it does not need to verify the entire file every time, and it can help to determine whether an unproven source is found or authentic.

Meanwhile, a distributed web server 300 will be described with reference to FIG. 5A. In order to respond to the request of the client terminal 100, the distributed web server 300 for a plurality of nodes constituting a blockchain and the client terminal 100 may be interlocked. The distributed web server 300 is connected to a fragment collector that collects and arranges pieces of data held by a plurality of nodes, and arranges pieces of data requested by the client terminal 100 through the piece collector to form a single file. And sorted, and the distributed web server 300 may transmit to the client terminal 100 when processing of the arrayed and sorted data is completed.

At this time, when requesting dynamic content from the client terminal 100, that is, in the case of a script or code of a type that performs driving before the content is operated on the web browser, the client terminal 100 searches and checks the DNS address If it is confirmed, you can request content. At this time, the distributed web server 300 owns information on the requested content based on the DNS address, and the owned information also includes content type and metadata on how to respond to each request. In this case, the static website can be sufficiently provided as a request to the general pool 600 even without going through the distributed web server 300.

Referring to (b) of FIG. 5, when the client terminal 100 searches for a URL address through a browser, the root DNS server, which is a pool 600 in charge of the Domain Name System (DNS) in the blockchain, is a DNS root zone. My record request can be directly responded to the client terminal 100, and if it is not a DNS root zone, a TLD DNS server (Top-Level Domain Domain Name System Server) that includes a pool 600 whose ranking is set to a reliability is within a reference value You can authorize them to respond by proxy.

At this time, DNS is a hierarchical naming system for computers, services, or multiple resources connected to the Internet or a private network, and the DNS server connects other information to domains assigned to objects participating in the Internet or networks, and all network participants. It registers domain information assigned to each domain with different information, and it can convert a domain name into a numeric IP address using a network protocol to find and identify blockchain services and devices of a specific computer. The domain format according to an embodiment of the present invention may be “d” +IANA (Internet allocation number management institution).

In addition, we will explain the cryptocurrency given as a reward. The virtual currency is given in exchange for each of the above-described node providing actions, such as each node providing piece data at the request of the client terminal 100 or collecting piece data and providing it to the client terminal 100 as a single file. . At this time, in the Internet service according to an embodiment of the present invention, there is no need to provide advertising revenue to a third party because it has a self-sufficiency system with self-sufficiency by collecting virtual currency. Currently, a large-scale enterprise does not want an individual to possess important information, and censorship and control are performed. In the case of applying a virtual currency according to an embodiment of the present invention, in order to obtain a virtual currency, content in the blockchain The node providing the data or the node providing the data fragment will own or provide more valuable content or data fragments, and will increase the quality of computing resources and networking resources in order to obtain higher reliability.

At this time, the parameters for evaluating the value of the content may include the number of contents, emotional participation, the total number of views, the single number of views, the duration of viewing, suitability for search ability, the number of links, the number of requests, and the like. Here, emotional engagement (Emotional Engagement, E) is an index that measures the preference for content through emotional indicators that are interactive on the Internet. At this time, an emoticon with preference may be assigned +1, and a negative emoticon including half-path may be assigned -1. The number of views (Vc) is the number of views per day of the content. For example, if a 2-hour movie records 2 million views, 2 million can be an arithmetic number of content viewing demand. It can be interpreted as meaning high value. In addition, the single view count (Unique View Count, Vu), compared to the view count (View Count), if the number of views is an arithmetic value based on visitors, the single view count is an arithmetic value based on content. Refers to the number of visits per viewer for one content, and excludes viewing of duplicate content. The duration of viewing (Stickiness, S) is the time that content viewers, pages, and website visitors stay.

Relevance (R) is the suitability of content. In other words, the suitability of search ability is determined by the transparency of search engines and algorithms. Since search engines such as Google are designed to generate advertising revenue, inevitably bring in search results irrelevant to the user's original interests and deteriorated query content. It may also result in overcompensation for the inappropriate creator who produced. On the other hand, in an embodiment of the present invention, a part of the mined virtual currency, for example, 10% is used for maintenance and development, so there is no third party institution at all. Linked (L) is the number of times mentioned or referenced on the Internet, and SPC is the economic value of cryptocurrency.

Using the above-described parameter and Equation 1, the value Cv for the creative content CC given at a specific time S may be calculated. At this time, Dv means the demand for the Internet service of the present invention in the market, and SPC means the value of cryptocurrency in the market. The higher the Dv, the higher the real value of the SPC, and the lower the Dv, the lower the real value of the SPC.

The method of providing Internet service using PoR proof based on the block chain and distributed infrastructure P2P model of FIGS. 2 to 5 is not described above. Internet service using PoR proof based on blockchain and distributed infrastructure P2P model through FIG. The description of the method is omitted because it can be easily inferred from the contents described or described.

FIG. 6 is a diagram illustrating a process in which data is transmitted and received between each of the components included in the Internet service providing system using PoR proof based on the blockchain and distributed infrastructure P2P model of FIG. 1 according to an embodiment of the present invention. Hereinafter, an example of a process in which data is transmitted/received between respective components will be described with reference to FIG. 6, but the present application is not limited to such an embodiment, and illustrated in FIG. 6 according to various embodiments described above. It is apparent to those skilled in the art that the process of transmitting and receiving data can be changed.

Referring to FIG. 6, the client terminal transmits a request event for retrieving or storing information through an Internet browser (S6100).

In addition, the client terminal selects at least one pool having a predetermined adjacency between nodes among the clustered pools in which the nodes constituting the blockchain connected by the client terminal and the distributed P2P are clustered (S6200), and the selected at least one pool. Check the reliability of the PoR using the proof (S6300).

Further, the client terminal selects a pool having the highest reliability value, and receives fragment data corresponding to the request event from a plurality of nodes included in the selected pool based on an index asynchronously (6400).

The order between the above-described steps (S6100 to S6400) is only an example, and is not limited thereto. That is, the order between the above-described steps (S6100 ~ S6400) may be mutually variable, some of which may be executed or deleted simultaneously.

Such a method of providing an Internet service using the PoR proof based on the blockchain and distributed infrastructure P2P model of FIG. 6 is not described above. The Internet service using the PoR proof based on the blockchain and distributed infrastructure P2P model through FIGS. The description of the method is omitted because it can be easily inferred from the contents described or described.

Such a method of providing an Internet service using the PoR proof based on the blockchain and distributed infrastructure P2P model of FIG. 6 is not described above. The Internet service using the PoR proof based on the blockchain and distributed infrastructure P2P model through FIGS. The description of the method is omitted because it can be easily inferred from the contents described or described.

A method for providing Internet service using PoR proof based on a blockchain and distributed infrastructure P2P model according to an embodiment described with reference to FIG. 6 includes a record including instructions executable by a computer such as an application or a program module executed by a computer It can also be implemented in the form of a medium. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. Also, the computer-readable medium may include any computer storage medium. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data.

The method for providing Internet service using PoR proof based on a blockchain and distributed infrastructure P2P model according to an embodiment of the present invention described above is an application installed in a terminal (which is a program included in a platform or an operating system basically installed in the terminal). It may be included), or may be executed by an application (i.e., a program) that the user directly installed on the master terminal through an application providing server such as an application store server, an application, or a web server related to the corresponding service. In this sense, the above-described method for providing Internet service using PoR proof based on the blockchain and distributed infrastructure P2P model according to an embodiment of the present invention is implemented as an application (that is, a program) basically installed on a terminal or directly installed by a user It can be recorded on a computer-readable recording medium such as a terminal.

The above description of the present invention is for illustration only, and those skilled in the art to which the present invention pertains can understand that the present invention can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are illustrative in all respects and not restrictive. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is indicated by the following claims rather than the above detailed description, and it should be interpreted that all changes or modified forms derived from the meaning and scope of the claims and equivalent concepts thereof are included in the scope of the present invention. do.

Claims (7)

In the Internet service providing method executed in the client terminal,
Transmitting a request event for retrieving or storing information through an internet browser;
Selecting at least one pool having a predetermined proximity between nodes among the clustered pools in which the nodes constituting the blockchain connected by the client terminal and the distributed P2P are clustered;
Checking the reliability of the selected at least one pool using PoR proof;
Selecting a pool having the highest reliability value, and receiving fragment data corresponding to the request event based on an index asynchronously from a plurality of nodes included in the selected pool,
The receiving step includes the step of transmitting the request event to a node existing in another pool when the one of the plurality of nodes cannot process the request event.
Internet service using PoR proof based on blockchain and distributed infrastructure P2P model, in which multiple nodes of each pool are executed and retained by Data Fragmentation Mirroing, which maintains multiple copies of data fragments in a mirror site format. How to provide.
According to claim 1,
The PoR proof means a formula (R=Ut+Sr) in which the reliability (R) of the node is calculated as a sum of uptime and storage space reputation for each node,
The operation time (Ut) for each node is calculated as a percentage of the total time (T) at which one node can perform a data storage function every 1 hour (P),
The storage space reputation (Sr) is calculated as a percentage of the ratio of the average capacity to the storage space (S) of one node to the minimum storage space (Mms) that must be maintained at each node for 1 hour. Internet service providing method using PoR proof based on P2P model of blockchain and distributed infrastructure.
According to claim 2,
The reliability of the pool is obtained by dividing the sum of the reliability (Ri) of a plurality of nodes included in the pool (Σ, i is from 1 to n) by the number of nodes (n). Average of reliability,
A node that transmits and receives messages to and from the client terminal is a pool manager node that is a node belonging to the pool while managing a plurality of nodes in the pool, and provides a method for providing Internet service using PoR proof based on a blockchain and distributed infrastructure P2P model.
delete According to claim 1,
When data held by any one of the plurality of nodes is changed, data of all nodes in the blockchain is changed,
The data proof possessed by the plurality of nodes is verified using a retrievability via Merkle Tree and Merkle Proof,
When the first node constituting the blockchain transmits a hash of a data file to the second node, the second node compares the hash stored in the Merkle tree root with the transmitted hash to check whether a change exists,
If there is a change as a result of the check, until the changed data is found, two subtree roots of the transmitted hash are requested to the first node, and the first node generates a hash in response to the request, and then the Method of providing Internet service using PoR proof based on P2P model of blockchain and distributed infrastructure, which is transmitted to the second node.
According to claim 1,
In order to respond to the request of the client terminal, the distributed web server for a plurality of nodes constituting the blockchain and the client terminal are interlocked,
The distributed web server is connected to a fragment collector that collects and arranges pieces of data held by the plurality of nodes, and arranges and arranges pieces of data requested by the client terminal through the piece collector to form a single file. Become,
The distributed web server is to transmit to the client terminal when processing of the arranged and sorted data is completed, a method of providing Internet service using PoR proof based on a blockchain and distributed infrastructure P2P model.
According to claim 1,
When the client terminal searches for a URL address through a browser, the root DNS server, which is the pool responsible for the Domain Name System (DNS) in the blockchain, responds directly to the client terminal for a record request in the DNS root zone,
If it is not the DNS root zone, it is to authorize and respond to the TLD DNS server (Top-Level Domain Domain Name System Server) containing the pool whose ranking is set within the standard value is within the reference value, so that it can respond in a proxy manner, blockchain and distributed infrastructure P2P Internet service provision method using model-based PoR proof.

Images