Cryptographic methods implementing proofs of work in systems of interconnected nodes
The present invention is notably directed to methods, systems and computer program products for securing data operations in a computerized system comprising interconnected nodes, wherein the nodes are configured to transmit, receive and store data, and wherein the method comprises executing computerized cryptographic methods to implement two or more proofs of work that comprises: provably crawling, from each node of at least a subset of the interconnected nodes, a respective subset of data stored on nodes of the system; and provably acquiring, at each node of the subset, data in the subset of data.
1. A method performing proof of works (PoWs) using cryptography comprising:
assigning addresses to a plurality of active nodes, wherein each active node triggers crawling operations;
providing the assigned addresses of each active node to the plurality of nodes, wherein the assigned addresses correspond to a data corpus graph;
assigning crawlers to one or more subgraphs of the data corpus graph;
crawling the plurality of active nodes for a subset of data;
acquiring the subset of data;
storing the acquired subset of data at each active node;
indexing the stored subset of data at each active node;
ranking the indexed subset of data at each active node; and
configuring the ranked subset of data for receiving and processing data search queries.
2. The method of claim 1 , further comprising:
receiving the data search queries;
distributing the data search queries to each active node; and
transmitting the results of the search queries.
3. The method of claim 1 , further comprising:
managing the data search queries, wherein managing the data search queries include organizing search queries, processing search query results or organizing search query results.
4. The method of claim 1 , wherein the crawling operations are performed from each active node according to the address assigned to each active node.
5. The method of claim 1 , wherein assigning crawlers to the one or more subgraphs of the data corpus graph is achieved by using distributed hash tables, wherein the distributed hash tables are used in a decentralized network, wherein the distributed hash tables prevent undesired interferences.
6. The method of claim 1 , wherein assigning crawlers to the one or more subgraphs of the data corpus graph is achieved by using a hierarchical topology system combined with a peer-to-peer network.
7. The method of claim 1 , wherein assigning addresses to a plurality of active nodes includes assigning the same address to two or more nodes in the plurality of nodes.
8. The method of claim 7 , wherein assigning the same address to two or more nodes in the plurality of nodes creates redundant crawling operations, wherein redundant crawling operations improves a reliability of a result.
9. A computer system for performing proof of works (PoWs) using cryptography, comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage media, and program instructions stored on at least one of the one or more computer-readable tangible storage media for execution by at least one of the one or more processors via at least one of the one or more computer-readable memories, wherein the computer system is capable of performing a method comprising:
assigning addresses to a plurality of active nodes, wherein each active node triggers crawling operations;
providing the assigned addresses of each active node to the plurality of nodes, wherein the assigned addresses correspond to a data corpus graph;
assigning crawlers to one or more subgraphs of the data corpus graph;
crawling the plurality of active nodes for a subset of data;
acquiring the subset of data;
storing the acquired subset of data at each active node;
indexing the stored subset of data at each active node;
ranking the indexed subset of data at each active node; and
configuring the ranked subset of data for receiving and processing data search queries.
10. The computer system of claim 9 , further comprising:
receiving the data search queries;
distributing the data search queries to each active node; and
transmitting the results of the search queries.
11. The computer system of claim 9 , further comprising:
managing the data search queries, wherein managing the data search queries include organizing search queries, processing search query results or organizing search query results.
12. The computer system of claim 9 , wherein the crawling operations are performed from each active node according to the address assigned to each active node.
13. The computer system of claim 9 , wherein assigning crawlers to the one or more subgraphs of the data corpus graph is achieved by using distributed hash tables, wherein the distributed hash tables are used in a decentralized network, wherein the distributed hash tables prevent undesired interferences.
14. The computer system of claim 9 , wherein assigning crawlers to the one or more subgraphs of the data corpus graph is achieved by using a hierarchical topology system combined with a peer-to-peer network.
15. The computer system of claim 9 , wherein assigning addresses to a plurality of active nodes includes assigning the same address to two or more nodes in the plurality of nodes.
16. The computer system of claim 15 , wherein assigning the same address to two or more nodes in the plurality of nodes creates redundant crawling operations, wherein redundant crawling operations improves a reliability of a result.
17. A computer program product for performing proof of works (PoWs) using cryptography, comprising:
one or more computer-readable tangible storage media and program instructions stored on at least one of the one or more computer-readable tangible storage media, the program instructions executable by a processor to cause the processor to perform a method comprising:
assigning addresses to a plurality of active nodes, wherein each active node triggers crawling operations;
providing the assigned addresses of each active node to the plurality of nodes, wherein the assigned addresses correspond to a data corpus graph;
assigning crawlers to one or more subgraphs of the data corpus graph;
crawling the plurality of active nodes for a subset of data;
acquiring the subset of data;
storing the acquired subset of data at each active node;
indexing the stored subset of data at each active node;
ranking the indexed subset of data at each active node; and
configuring the ranked subset of data for receiving and processing data search queries.
18. The computer program product of claim 17 , further comprising:
receiving the data search queries;
distributing the data search queries to each active node; and
transmitting the results of the search queries.
19. The method of computer program product of claim 17 , further comprising:
managing the data search queries, wherein managing the data search queries include organizing search queries, processing search query results or organizing search query results.
20. The computer program product of claim 17 , wherein the crawling operations are performed from each active node according to the address assigned to each active node.