Computer-implemented system and method for data storage, retrieve, and communication through a peer-to-peer network
A blockchain-based system efficiently stores, retrieves, and shares data through peer-to-peer networks using spendable and unspendable outputs, Rabin signatures, and hierarchical structures, addressing the need for decentralized data management beyond cryptocurrency applications.
Patent Information
- Application Number
- KR1020217019723
- Authority / Receiving Office
- KR · KR
- Patent Type
- Patents
- Current Assignee / Owner
- Priority Date
- 2018-11-27
- Filing Date
- 2019-11-14
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2039-11-14
Smart Images

Figure 112021073157785-PCT00062_ABST
Abstract
Description
Technology Field
[0001] This invention generally relates to data enhancement for data communication and exchange over electronic networks, particularly peer-to-peer networks such as blockchain networks. It relates to storage, access, retrieval, and processing, particularly these data-related activities on a blockchain. The invention is particularly suitable, but not limited to, for use in processing data in a manner similar to that provided by websites and web pages, but using a blockchain as an underlying mechanism or platform rather than a web server(s). Accordingly, the invention provides a secure, efficient, and encrypted alternative infrastructure for data processing and transmission. Background Technology
[0002] In this document, we use the term "blockchain" to encompass all forms of electronic, computer-based, distributed ledgers. This includes consensus-based blockchain and transaction chain technologies, permissioned and permissionless ledgers, shared ledgers, and variations thereof. Although other blockchain implementations have been proposed and developed, the most widely known application of blockchain technology is the Bitcoin ledger. While Bitcoin may be referred to herein for convenience and illustrative purposes, it should be noted that the invention is not limited to use with the Bitcoin blockchain, and alternative blockchain implementations and protocols fall within the scope of the invention. The term "user" may refer herein to a person or a processor-based resource. As used herein, "Bitcoin" includes all versions and variations of protocols derived from the Bitcoin protocol.
[0003] A blockchain is a peer-to-peer electronic ledger implemented as a computer-based, decentralized, distributed system composed of blocks of transactions. Each transaction is a data structure that encodes the transfer of control over digital assets between participants in the blockchain system and contains at least one input and at least one output. Each block contains the hash of the previous block, and the blocks are linked together to create a permanent and immutable record of all transactions recorded on the blockchain from the beginning. Transactions contain small programs known as scripts embedded in their inputs and outputs, which specify how and to what extent the transaction's output can be accessed. On the Bitcoin platform, these scripts are written using a stack-based scripting language.
[0004] For a transaction to be recorded on the blockchain, it must be "validated." Network nodes (miners) perform tasks to verify whether each transaction is valid, and invalid transactions are rejected by the network. Software clients installed on the nodes perform this validation for unused transactions (UTXOs) by executing lock and unlock scripts. If the execution of the lock and unlock script evaluates to TRUE, the transaction is valid and recorded on the blockchain. Therefore, for a transaction to be recorded on the blockchain, it must i) be validated by a first node receiving the transaction—once the transaction is validated, the node relays it to other nodes in the network, ii) be added to a new block constructed by miners, and iii) be mined, that is, added to the public ledger of past transactions.
[0005] While blockchain technology is most widely known for its use in cryptocurrency implementations, digital entrepreneurs have begun exploring ways to utilize both the cryptographic security systems underlying Bitcoin and the data that can be stored on the blockchain to implement new systems. It would be highly advantageous if blockchain could be used for tasks and processes not limited to the cryptocurrency domain. Such solutions can be utilized more diversely in applications while leveraging the benefits of blockchain (e.g., permanent tamper-proof records of events, distributed processing, etc.).
[0006] One of these areas of interest is the use of blockchain for the storage, sharing, access, and control of data among users. Today, this is typically achieved via the Internet, using servers that host the websites and pages that users visit to access desired data, often utilizing search engines.
[0007] However, some experts have begun to anticipate the use of blockchain to address some of the shortcomings of the Internet, such as the control of large amounts of data and content by centralized parties. For example, see “Life After Google: The Fall of Big Data and the Rise of the Blockchain Economy”, George Gilder, Gateway Editions, July 2018, ISBN-10: 9781621575764 and ISBN-13: 978-1621575764.
[0008] Therefore, it is desirable to provide an arrangement that leverages the decentralized, immutable, and permanent characteristics of the blockchain to the advantage of enabling such data to be stored, processed, retrieved, searched, and / or shared on the blockchain. Such an improved solution has now been devised.
[0009] Embodiments of the present disclosure provide at least an alternative, efficient, and secure technology for implementing a blockchain solution and storing, processing, retrieving, and / or retrieving data on or from the same. Embodiments also provide at least an alternative blockchain implementation technology infrastructure for storing, processing, retrieving, transmitting, retrieving, and / or sharing data among computing nodes. Since the invention utilizes a blockchain network in a novel way and can provide improved and technical results, the invention provides an improved blockchain implementation network.
[0010] The embodiment also provides a solution for securely controlling access to digital resources through technically different and improved computing platforms, including peer-to-peer networks such as blockchains and blockchain protocols.
[0011] The invention is defined in the appended claims.
[0012] According to the invention, a computer-implemented method / system may be provided. The method may be configured to store, retrieve, and / or share data across a peer-to-peer network such as a blockchain. Data may be stored across one or more blockchain transactions. Traditionally or alternatively, the invention may be referred to as a retrieval system. It may be configured to operate as or in conjunction with a blockchain retrieval protocol. The blockchain retrieval protocol may substantially follow as described herein in relation to the "Metanet" protocol.
[0013] In this document, "sharing" may include transmitting, communicating, transferring, or providing access to a portion of the data to a node or user. The term "processing" may be interpreted as meaning any activity related to a transaction or its associated data, including creation, transmission, validation, access, retrieval, sharing, submission to a blockchain network, and / or identification.
[0014] The system may be configured to allow a user (human or machine) to retrieve, access, view, retrieve, and / or otherwise process a portion of data provided within or referenced by at least one blockchain transaction (Tx). Accordingly, blockchain transaction(s) may contain a portion of data or a reference to a portion of data. A reference to a portion of data may be a pointer, address, or other indicator of the location where the data is stored. The portion of data may be any type of data or digital content, e.g., computer executable items, text, video, images, sound files, etc. The portion of data may be referred to as "content." The portion of data or a reference thereto may be in a processed format. For example, it may be a hash digest of the portion of data. The data may be stored on the blockchain or externally (i.e., "off-chain").
[0015] Preferably, the system includes a transaction index (TX) containing a public key and a transaction ID associated with a transaction (Tx). index It is configured to identify at least one transaction (Tx) based on ).
[0016] As will be readily understood by those skilled in the art, each blockchain transaction (TX) has its own unique identifier (ID) that can be identified on the blockchain. Advantageously, the present invention combines this existing ID with a public key associated with and / or provided therein so that the combination forms a unique identifier for the transaction. This enables the blockchain to be searched quickly and efficiently.
[0017] Preferably, the system includes a search function configured to be provided within a blockchain search system (i.e., native or internal) or to interface with and / or communicate with a blockchain search system (i.e., outside the search system).
[0018] Preferably, the system includes at least one cryptocurrency wallet. Preferably, at least one wallet is configured to generate, store, and / or process hierarchical deterministic keys. At least one cryptocurrency wallet may be configured to store at least one encryption key and / or at least one token in a Trusted Execution Environment (TEE).
[0019] Preferably, the system includes a decompression component configured to decompress when part of the data is compressed, a recombination component, and / or a decryption component configured to decrypt when part of the data is encrypted. The recombination component may be configured to recombine parts of the data retrieved from one or more transactions on the blockchain.
[0020] Preferably, the system includes at least one presentation component configured to display a portion of the data to the user in an auditory and / or visual form.
[0021] Preferably, the search system includes means for inputting or generating a search path that identifies at least one transaction (Tx) on the blockchain, and the search path is:
[0022] i) Transaction Index (TX) index ); and
[0023] ii) Includes at least one attribute associated with a transaction (Tx).
[0024] Preferably, at least one of the attributes is a mnemonic associated with the transaction and / or at least one attribute is null.
[0025] Preferably, the (search) system is configured to communicate with a cryptocurrency wallet or other resources to facilitate the processing, storage, and / or generation of encryption keys, blockchain transactions, and / or digital signatures.
[0026] Preferably, the system has a transaction index (TX index It is configured to store ). Preferably, the system is configured to store each transaction index for more than one transaction.
[0027] Preferably, the system is further configured to transfer control of a portion of the cryptocurrency to a destination before accessing a portion of the data. Advantageously, this allows the system to avoid using separate infrastructure for different activities and enables the blockchain to be used as both a storage / retrieval / retrieval mechanism and a payment and control mechanism.
[0028] Preferably, the system is further configured to send a request to a peer on the blockchain for a portion of the data, and / or receive a portion of the data from a peer on the blockchain. This enables the creation of an infrastructure that involves a third party interacting with the blockchain, providing desired data to the user, and / or writing data to the blockchain on behalf of the user.
[0029] Preferably, multiple transactions are provided to the blockchain, each having or providing a reference to part of the data or part of the data. Preferably, one, part, or all of the multiple transactions (TX) are:
[0030] A parent public key (PPK) associated with a logical parent transaction (LPTx) identified by a random transaction ID (DTxID); and
[0031] Includes an input containing a signature generated using the parent public key (PPK).
[0032] This enables the formation of a logical hierarchical structure between transactions and their contained data. Consequently, multiple associated or logically linked transactions within the blockchain can be processed efficiently, securely, and rapidly. While logically linked transactions may not be stored in the blockchain at consecutive block heights, they can be easily and securely identified and / or accessed.
[0033] Preferably, the system is further configured to use a time lock mechanism to control access to portions of the data. This provides a greater degree of control over access to the data in the blockchain.
[0034] The invention also provides a corresponding system arranged and configured to perform the steps of any embodiment of the method(s) described herein. This includes:
[0035] processor; and
[0036] A computer implementation system may include a memory containing executable instructions that, as a result of execution by a processor, cause the system to perform any embodiment of the computer implementation method described herein.
[0037] The invention also provides a non-transient computer-readable storage medium that stores an executable instruction, as a result of being executed by a processor of a computer system, that causes the computer system to at least perform an embodiment of the method described herein.
[0038] Some embodiments of the method / system of the invention may include one or more features as described below, particularly in the section titled "Browser / Wallet Application".
[0039] Accordingly, the disclosure can provide an improved solution for storing, retrieving, identifying, communicating, and / or accessing data through a blockchain. The embodiment provides improvements to data communication and exchange through electronic networks, in particular peer-to-peer blockchain networks.
[0040] These and other aspects of the present invention are evident from the embodiments described herein and will be understood by reference thereto. Now, embodiments of the present invention will be described, merely as examples, with reference to the accompanying drawings. Brief explanation of the drawing
[0041] FIG. 1 illustrates a blockchain transaction implementing the present invention in which data is stored in multiple outputs. FIG. 2 illustrates a blockchain transaction implementing the present invention in which data is stored in the input. FIG. 3 illustrates a series of blockchain transactions implementing the present invention in which data is stored in the output of a plurality of blockchain transactions. FIG. 4 illustrates a blockchain transaction implementing the present invention that transmits a cryptocurrency payment to enable access to data through an atomic swap. FIG. 5 illustrates a blockchain transaction implementing the present invention to redeem the payment of the transaction of FIG. 4. FIG. 6 illustrates a secret value held by a participant in a blockchain transaction implementing the present invention to issue a token to access data through an atomic swap. FIGS. 7 and 8 illustrate a blockchain transaction implementing the present invention to issue tokens to enable access to data through atomic swaps. FIGS. 9 and 10 illustrate a blockchain transaction implementing the present invention to redeem tokens issued by the transaction of FIGS. 7 and 8. FIGS. 11 and 12 illustrate blockchain transactions for accessing secrets exchanged by the transactions of FIGS. 9 and 10. FIG. 13 provides an example of a Metanet graph structure according to one embodiment of the present invention. FIG. 14 illustrates an example of a Metanet graph tree for the domain 'bobsblog' including a MURL search path according to one embodiment of the present invention. FIG. 15 illustrates a schematic diagram of an exemplary embodiment of a browser wallet according to one example of the invention and a method in which the core functions thereof can be divided across different components of an application. FIG. 16 provides a diagram illustrating a method in which content search can be performed within the infrastructure of an embodiment of the invention. FIG. 17 illustrates an exemplary interaction between local and global full copy peers according to one embodiment of the invention. FIG. 18 illustrates a metanet tree (or graph) for use with reference to the exemplary use case described below. FIG. 19 illustrates a flowchart describing a process implemented by an exemplary use case provided below. FIG. 20 is a schematic diagram showing a computing environment in which various embodiments can be implemented. Specific details for implementing the invention
[0042] The term "Bitcoin" is used herein solely for convenience and is intended to include all cryptocurrency / blockchain protocols, including but not limited to all variations derived from the Bitcoin protocol and any alternative protocols for other blockchains. For the remainder of this document, the protocol determination operation of the embodiments of the present invention will be referred to as the "Metanet Protocol."
[0043] The terms “content,” “digital content,” and “data” may be used interchangeably herein to refer to data that is stored in a blockchain transaction, referenced by a blockchain transaction, or otherwise accessed through a blockchain transaction, in accordance with embodiments of the present invention. Data is additional / optional data transmitted, communicated, or stored through the blockchain, unlike data required by the underlying blockchain protocol as part of the transaction code itself.
[0044] outline
[0045] As mentioned above, there is a recognized need for improved and / or alternative infrastructure for storing, writing, accessing, and reviewing data between or by computing nodes. It would be advantageous to utilize the inherent benefits of blockchain technology (e.g., immutable records, encrypted control and access, built-in payment mechanisms, the ability to publicly inspect the ledger, distributed architecture, etc.). However, building a "blockchain-implemented internet" is challenging from several technical perspectives.
[0046] These challenges may include, but are not limited to: methods for locating specific parts of data within a network; methods for protecting and controlling access to data so that only authorized parties can access it; methods for transmitting data from one party to another in a peer-to-peer manner; methods for arranging data so that it is logically associated but can be stored in different locations within a network, and subsequently combining data from different locations to provide collective and augmented results; methods for providing and / or storing data in a hierarchical manner; methods for allowing users and parties with different computing platforms to access desired data; and methods for storing, providing, and sharing data in a (potentially global) computing network without relying on or needing large-scale storage servers and centralized data controllers.
[0047] The present invention provides such an improved solution by using a hardware and software component platform that is similar to the Internet in some respects but is entirely different from that known in the prior art, thereby achieving the result in a completely different way. According to an embodiment of the present invention, a server that stores Internet / Web data and provides it to end users is replaced by blockchain transactions residing in a blockchain network. To achieve this, several innovations had to be devised. These are described in the following section.
[0048] Insertion of data into the blockchain "Metanet". Referring to FIG. 1, a blockchain transaction implementing the present invention is illustrated, wherein first data to be stored in the blockchain is stored in one or more first outputs of the transaction, and second data representing the attributes of the first data is stored in one or more second outputs of the transaction. One or more first parts of the first data.<Content 1> It is stored in the transaction's spendable output. Data representing each attribute of the first data.<Attribute 1> and<Attribute 2> It is stored in the unspendable second output of the transaction, along with a flag indicating that data is being stored in accordance with the Metanet protocol. The term "unspendable" is used to indicate that at least one first and / or second output of the transaction may contain a script command code (OP RETURN) to mark the output as invalid for subsequent use as input to a subsequent transaction.
[0049] It is advantageous to store the content and attribute parts of the data separately in a separate output of the transaction.
[0050] Figure 2 shows the first data to be stored on the blockchain.<Content 1> This illustrates a blockchain transaction implementing the present invention stored in this transaction input. Metanet flag and attribute data<Attribute 1> and<Attribute 2> It is stored in the non-expendable output of the transaction in a manner similar to the array illustrated in Fig. 1.
[0051] Insert data
[0052] Data insertion method
[0053] The following data must be able to be inserted into the blockchain.
[0054] a) Metanet flag
[0055] b) Attributes
[0056] c) Content
[0057] Content is data stored on the blockchain, Metanet Flag is a 4-byte prefix that serves as an identifier for all data associated with the Metanet protocol, and Attributes include indexing, permission, and encoding information for the content. This may include, but is not limited to, data types and encryption and / or compression schemes. These attributes are also often referred to as metadata. To avoid confusion with transaction metadata, this document will avoid using this term.
[0058] You can include this data in a Bitcoin script using the following techniques.
[0059] 1. OP_RETURN - In this method, all data (attributes and content) is placed after OP_RETURN within the lock script of the verifiable non-spent transaction output.
[0060] An example of an output script using this operator is as follows.
[0061] UTXO0: OP_RETURN<Metanet Flag> <attributes> <content>
[0062] 2. OP_RETURN with OP_DROP - In this case, OP_RETURN contains attributes, while the content is stored before OP_DROP within a spendable transaction script (lock or unlock). The content can be split into multiple data packets within the transaction input and output. However, since this is merely an output script that can be signed with the Bitcoin protocol, it is advantageous to insert the data into the transaction output. When data is inserted into the transaction input, OP_MOD can be used as a checksum for the data to verify its validity in place of miner validation. For example, a 32-bit OP_MOD operation can be performed to check if it matches a pre-calculated value.
[0063] In this case, the attribute may include information on how the content data packet is reassembled. Additionally, by providing the hash of the reassembled data packet H (content1 + content2) as an attribute, it is possible to verify whether the recommended reassembly scheme was used.
[0064] A transaction implementing a second data insertion method is illustrated in FIG. 1. For simplicity, this transaction includes only content inserted into the output, signed with a single input. Content inserted into additional inputs may also be possible using this method with an OP_DROP statement, as illustrated in FIG. 2.
[0065] If the content is very large, it may be advantageous to divide it into multiple transactions. Such an arrangement is illustrated in FIG. 3. FIG. 3 shows the first data to be stored on the blockchain. <content>two chunks<Content chunk 1> class<Content chunk 2> It is divided into and afterwards <content>=<Content chunk 1> ∥<Content chunk 2> Illustrating a pair of blockchain transactions embodying the present invention that can be recombined as follows, wherein the operator '∥' concatenates two chunks of content data. This concatenation operator may be replaced with any desired bitwise or similar piecewise binary operator. Then, the two chunks<Content chunk 1> class<Content chunk 2> It is stored in the respective spendable output of a separate blockchain transaction, and data related to the attributes of the content data is stored in the respective non-spendable output of the blockchain transaction. Again, the attributes may include information about the recombination scheme. For example, the content may be raw data, an executable program, or an HTML web page. Additionally, Content 1 may include a pointer to the location of Content 2 on the blockchain, which functions in the same way as an HTML link included in a web page.
[0066] Since both transactions use the same public key P (and ECDSA signature) as input,<Content chunk 1> and<Content chunk 2> It should be noted that although they are stored in different transactions as TxID1 and TxID2 respectively, they can be associated with the same public key P.
[0067] Utilizing the role of miner validation
[0068] Here, the transaction validation process performed by miners is used to gain an advantage when storing this data. This is because all data in the transaction output will be signed by the owner of public key P in at least one transaction input (if the SIGHASH | ALL flag is present), and this signature will be verified in the transaction validation process performed by all miners.
[0069] This guarantees the following.
[0070] . Data integrity - If data is corrupted, the CHECKSIG operation fails.
[0071] . Data Authenticity - The owner of P verifiably witnessed and signed the data.
[0072] This is particularly useful for content divided into multiple transactions, as described above with reference to the array shown in Figure 3, because the input signature of P provides a verifiable link between the divided components of the data.
[0073] Rabin's signature
[0074] Another method to guarantee data authenticity is to use Rabin signatures, which can be used to sign the data itself rather than the entire message. This can be advantageous because the signer does not need to sign every individual transaction in which the data appears, and the signature can be reused across multiple transactions.
[0075] Rabin signatures can be easily validated in a script. They can be incorporated into the above example (2) by inserting the Rabin signature validation before the OP_DROP command.
[0076] <content1><Rabin Sig (content1)>FUNC_CHECKRABSIG OP_DROP <H( )> [CheckSig ]
[0077] It should be noted that this cannot be done in the above case (1) because a script containing OP_RETURN will eventually fail and cannot perform validation.
[0078] Specific examples of using Rabin signatures
[0079] introduction
[0080] Digital signatures are a fundamental part of the Bitcoin protocol. They ensure that every Bitcoin transaction recorded on the blockchain has been authorized by the legitimate owner of the Bitcoin being transmitted. In standard Bitcoin P2PKH transactions, transaction messages are signed using the elliptic curve digital signature algorithm (ECDSA). However, the ECDSA signature is typically applied to the entire transaction.
[0081] There are some use cases for the Bitcoin blockchain where participants outside the network want to provide signatures for arbitrary data types that network participants can use. Using Rabin digital signatures allows all data to be signed, even if the data generated outside the Bitcoin blockchain is placed in one or multiple transactions.
[0082] Now, we will show how to directly sign and verify data in Bitcoin scripts by utilizing the algebraic structure of the Rabin cryptographic system.
[0083] Rabin digital signature
[0084] Rabin digital signature algorithm
[0085] Background Mathematics
[0086] Definition - Integer mod p
[0087] The integer modulo p is defined by the following set.
[0088]
[0089] Fermat's Little Theorem
[0090] p is called a prime number. For any integer a, the following applies.
[0091]
[0092] Euler's Criterion
[0093] p is called a prime number. r is a quadratic residue mod p only in the following cases and only.
[0094]
[0095] Modular square root (p = 3 mod 4)
[0096] p It is said to be a prime number. Then, for any integer r satisfying Euler's criterion, if a is an integer such that a is the following integer,
[0097]
[0098] For a, there exists a solution of the following form.
[0099]
[0100] The Chinese Remainder Theorem
[0101] Coprime positive integers n1, n2, … , n k and any integers a1, a2, … , a k Given simultaneous congruences system
[0102]
[0103] is a unique solution modulo It has. As a special case of the Chinese Remainder Theorem
[0104]
[0105] In the case of and only in that case
[0106]
[0107] It can be seen that.
[0108] Rabin digital signature algorithm
[0109] The Rabin digital signature algorithm can be described as follows:
[0110] For any message m, H is said to be a collision-free hash algorithm having k output bits.
[0111] To generate a key, select prime numbers p and q, each with a bit length of approximately k / 2, such that p ≡ 3 mod 4 and q ≡ 3 mod 4, and calculate the product n = p·q. The private key is (p, q) and the public key is n = p·q.
[0112] To sign message m, the signer selects padding U such that H(m || U) satisfies the following.
[0113]
[0114] The signature S is calculated using the following formula.
[0115]
[0116] The signature of message m is the pair (S, U). Verification can be simply performed by checking the following for a given m, U, and S.
[0117] (Equation 1)
[0118] This is true if and only if there exists an integer λ in the range 0, … , n-1.
[0119] (Equation 2)
[0120] The argument λ can be safely included in the signature to provide a combination of (S, λ, U).
[0121] The advantages of the Rabin signature system are as follows.
[0122] a) Signature generation is computationally expensive, whereas signature verification is computationally easy.
[0123] b) The security of the signature relies solely on the difficulty of integer decomposition. Consequently, Rabin signatures are substantially unforgeable (unlike RSA).
[0124] c) The hash function value H (m || U) must be similar in size to the public key n.
[0125] Verification of the script is simple, as it only requires squaring the given signature, performing modular reduction, and then checking if the result is equal to H(m || U).
[0126] Rabin signature proof
[0127] Let p and q be coprime and n = p·q. By the Chinese remainder theorem
[0128]
[0129] In cases and only in that case
[0130]
[0131] It can be represented as.
[0132]
[0133] Using
[0134]
[0135] It can be represented as.
[0136] thus
[0137]
[0138] It was assumed that H(m || U) satisfies the Euler criterion. Through similar calculations, the following can also be seen.
[0139]
[0140] Rabin signatures within Bitcoin
[0141] Signature verification within the script
[0142] To verify the Rabin signature, some arithmetic and stack manipulation instruction code is required. Consider a redeem script of the following format.
[0143] OP_DUP OP_HASH160 < > OP_EQUALVERIFY OP_MUL OP_SWAP OP_2 OP_ROLL OP_CAT FUNC_HASH3072 OP_ADD OP_SWAP OP_DUP OP_MUL OP_EQUAL
[0144] Here, n is the signer's public key. This will evaluate to TRUE if and only if provided with the following input.
[0145]
[0146] Here, m is an arbitrary message, and (S, λ, U) is a valid Rabin signature. Alternatively, verifying the Rabin signature using Equation 1 above yields the repayment script as follows.
[0147] OP_DUP OP_HASH160 < > OP_DUP OP_TOALTSTACK OP_SWAP<roll index> OP_ROLL OP_CAT FUNC_HASH3072 OP_SWAP OP_MOD OP_SWAP OP_DUP OP_MUL OP_FROMALTSTACK OP_MOD OP_EQUAL
[0148] In this case, the script will evaluate to TRUE only if provided with the following input.
[0149]
[0150] In both redemption scripts, the 3072-bit hash projection function 'FUNC_HASH3072' is used. For a given message / padding concatenation, a FUNC_HASH3072 hash projection is generated using the script.
[0151] OP_SHA256 {OP_2 OP_SPLIT OP_SWAP OP_SHA256 OP_SWAP} (x11)
[0152] OP_SHA256 OP_SWAP OP_SHA256 {OP_CAT}(x11)
[0153] Data compression
[0154] Internet data consists of common file types such as JavaScript, text files (SML, HTML, etc.), video files (MPEG, M-JPEG, etc.), image files (GIF, JPEG, etc.), and audio files (AU, WAV), which are described in more detail, for example, at https: / / www.doc.ic.ac.uk / ~nd / surprise_97 / journal / vol1 / mmp / #text. Using the data insertion techniques mentioned above, these different data types can also be inserted into the blockchain.
[0155] Larger file sizes can be compressed using one of several existing coding schemes before being inserted into a blockchain. Lossless data compression algorithms, such as run-length and Huffman encoding, can be used in various applications, including ZIP files, executable programs, text documents, and source code.
[0156] Many different algorithms exist depending on the specific input data. Apple Lossless and Adaptive Transform Acoustic Coding can be used to compress audio files, PNG, and TIFF for graphic file compression, while video files can be compressed using one of many lossless video codecs. Arbitrary compression of data content can be indicated using flags within attributes. For example, the flag for the LZW lossless coding scheme within the attribute is <lzw>am.
[0157] Encryption and paid decryption
[0158] Data encryption
[0159] Content owners can choose to protect their content before inserting it into the blockchain. This ensures that the content cannot be viewed without obtaining the necessary permission.
[0160] There are many well-established techniques for encrypting data (plain text or other data types). These can be classified as asymmetric or symmetric encryption.
[0161] Elliptic Curve Cryptography (ECC) is asymmetric because it relies on public-private key pairs. It is one of the most secure encryption systems and is commonly used in cryptocurrencies such as Bitcoin. The Koblitz algorithm can be used to encrypt data for ECC encryption.
[0162] In symmetric systems, data is encrypted and decrypted using a single key. The Advanced Encryption Standard (AES) algorithm is considered one of the most secure symmetric algorithms seeded by such secrets, and is described in more detail, for example, in C. Paar and J. Pelzl, "Understanding Cryptography," Chapter 4, Springer-Verlag Berlin Heidelberg 2nd edition, 2010, pp. 87-118.
[0163] When encrypting data stored on a blockchain, there are advantages to using the same encryption system as the underlying blockchain. In Bitcoin, this is the SECP256K1 rule for ECC key pairs in asymmetric encryption and the SHA-256 hash function in symmetric encryption. The advantages are as follows:
[0164] - The security level of encryption is the same as the underlying system where the data is stored.
[0165] - The software architecture required to store encrypted data will have a smaller codebase.
[0166] Wallet key management can be used for both transactions and encryption / decryption.
[0167] - The same key can be used for both encryption and cryptocurrency payments, making it more efficient as fewer keys are required. This also reduces storage space.
[0168] - Fewer communication channels may be required to exchange / purchase data decryption functions.
[0169] - Since the keys used for encryption and transactions share the same data structure, security is enhanced, mitigating targeted attacks against specific key types.
[0170] - Keys can be purchased using native cryptocurrency.
[0171] For illustrative purposes, we will explain how the Koblitz algorithm is used to encrypt data using ECC.
[0172] Koblitz algorithm
[0173] Given an ECC key pair P1 = S1 · G, the Koblitz algorithm allows anyone to encrypt a message using the public key P1, such that only those who know the corresponding private key S1 can decrypt the message.
[0174] Assume you want to encrypt the plaintext message 'hello world' using the Koblitz method. This is performed character by character. The first character 'h' is encrypted and decrypted as follows.
[0175] 1. The character 'h' is mapped to a point on the secp256k1 curve. This is achieved by mapping plain text characters to 8-bit numbers using ASCII rules. Then, this number is multiplied by the reference point G to calculate a point on the curve. In this example, 'h' is mapped to 104 in ASCII, and the elliptic curve point is P m = is given as 104 · G.
[0176] 2. Then point P m It is encrypted using public key P1. This involves selecting a random ephmeral key k0 and a point pair C m = is achieved by calculating {k0· G, Q}, where and then it can be broadcast.
[0177] 3. The owner of private key S1 is The original point can be decoded by calculating . Then, the original ASCII number is recovered through trial and error or a lookup table so that some number x is P m You can check if it corresponds to = x · G.
[0178] Permission purchase using blockchain
[0179] Storing data on a blockchain has the clear advantage that a payment mechanism is built into the system. Payments can be used for the following purchases.
[0180] - Decode data for retrieval / use
[0181] - Permission to insert data at a specific address
[0182] In both cases, the buyer purchases a secret that grants permission to do something using cryptocurrency such as Bitcoin. This secret can be a hash preimage or a private key.
[0183] An efficient and secure method for making such purchases is to use atomic swaps. This keeps secure communication channels to a minimum and ensures that neither event occurs—the seller receiving payment nor the secrets being exposed to the buyer.
[0184] In addition to cryptocurrency payments, it can also be convenient to purchase permissions using access tokens. These are secret values (typically hash dictionary images) that the buyer possesses to use for purchases. Buyers can purchase these tokens in bulk in advance and then activate them at the time they actually intend to use the permissions.
[0185] Now, the method of executing an atomic swap will be explained with reference to Figures 4 and 5.
[0186] Atomic swap using a hash puzzle or private key puzzle
[0187] Assume Alice is the owner of the secret. This secret could be a hash dictionary image of a known hash digest or the private key of a known public key. Assume Bob wants to buy this secret from Alice using Bitcoin. A mechanism called an atomic swap is described that can trigger this transaction. It is atomic in that neither event occurs—either Alice receives the Bitcoin payment and the secret is exposed to Bob.
[0188] The method is as follows.
[0189] Alice is a public / private key pair P A = S A · G's private key S A Owning and Bob is a public / private key pair P B = S B · G's private key S B Owns.
[0190] Alice possesses a secret that is a prior image X of a known hash digest H(X) or a private key S1 of a known public key P1 = S1 · G.
[0191] They agree on a Bitcoin price so that Alice can sell the secret to Bob.
[0192] Before doing this, Bob must set up a transaction to send the temporary key k0 outside the block to Alice so that Alice can calculate r0, a component of the digital signature.
[0193] Now, referring to Fig. 4,
[0194] 1. Bob sends the locked Bitcoin to Alice using the following redemption script.
[0195] R (Written roughly):
[0196] About hash dictionary images:
[0197] = [Hash Puzzle ] [CheckSig ]
[0198] By doing this, the prior image X is exposed in the input of the redemption script.
[0199] About the private key:
[0200] = [Private Key Puzzle , ] [CheckSig ]
[0201] In this way, the private key S1 can be calculated from the input to the redemption script. In this case, Bob and Alice must agree on a temporary key k0 used to construct r0, where (r0, R y ) = k0· G.
[0202] 2. Since Alice knows her secret (X or S1), she can spend funds on the Bitcoin blockchain through the transaction shown in Fig. 5. This allows Bob to determine Alice's secret.
[0203] As an optional security feature, Alice and Bob use public key P A , P B A shared secret S known only to both parties can be established using [this method]. This can be achieved in the manner described in International Patent Publication WO 2017 / 145016. In this case, S can be added to a prior image X of the hash puzzle so that X is not publicly exposed on the blockchain. Similarly, in a private key puzzle, S can be used as a temporary key k0 to ensure that only Alice or Bob can calculate the private key.
[0204] If Alice decides not to spend the funds, a time-locked refund can be introduced into the procedure to prevent Bob's funds from being locked by Alice.
[0205] Purchase using tokens
[0206] Assume that the same situation as described above exists, but at the time of use, instead of paying for Alice's secret with cryptocurrency, Bob intends to redeem access tokens he purchased in advance to exchange for the secret.
[0207] The procedure Alice and Bob must follow is similar to the case described in the previous section, but instead uses a series of similar atomic swaps. The process consists of two stages: token issuance and token redemption.
[0208] Step 1: Token Issuance
[0209] The token issuance phase is effectively Bob purchasing a token once. For example, Alice has 10 distinct secrets X1, X2,…, X 10 T1, T2, ..., T, holding 10 tokens that allow Bob access to each secret respectively. 10 We will consider a scenario where a single purchase is desired for.
[0210] First, Bob generates a set of 10 tokens from a secret seed value Y known only to himself. These tokens are generated by sequentially hashing the seed to form a hash chain, and each token is calculated as follows.
[0211]
[0212] Alice and Bob now each have 10 secret values, which can be exposed in a hash puzzle, for example, for token redemption. However, to issue these tokens, each secret initial value I Alice and I Bob It must also be generated. This is given as follows.
[0213]
[0214]
[0215] Alice's initializer is simply a random integer with no special meaning, but Bob's initializer is his first token T1= H 9 It should be noted that it must be the hash of (Y). By extending the token chain with initial values in this way, tokens to be used later for successive redemptions in token issuance can also be defined. The total secret values held by each participant are shown in Fig. 6.
[0216] Now Alice and Bob can agree on the purchase of 10 tokens at a price of 10 units of cryptocurrency. The purchase of these tokens can occur in several ways, and here we will explain it using an atomic swap. The atomic swap is initiated by Alice and Bob broadcasting the transactions shown in Figures 7 and 8, respectively, and both outputs require a solution for two hash puzzles and a valid signature.
[0217] When both transactions appear on the blockchain, Alice and Bob have their shared initial value I Alice and I Bob You can share and complete an atomic swap for token issuance.
[0218] As a result of this atomic swap, Alice receives payment for the purchase of 10 tokens, and the secrets of both initialization values are exposed. Here, Bob's Secret I Bob = H 10 (Y) This year is the initial value H 10 (Y)'s prior image H 9 It should be noted that only the first hash puzzle [Hash Puzzle (T1)] to be solved is defined as (Y), so that is meaningful.
[0219] Step 2: Token Redemption
[0220] At some point in the future, Bob is his first token T1= H 9 You want to redeem (Y) and receive the first secret X1, but you are reminded that you have already paid for this secret by purchasing valid tokens. The process of redeeming the tokens will take the form of another atomic swap, and the solution to the lock hash puzzle is token T i Secret X corresponding to i am.
[0221] To redeem the tokens, Bob must broadcast the transaction illustrated in FIG. 9, the output of which is locked with two hash puzzles. When Alice sees this transaction, Alice broadcasts her own similar transaction, the output of which is locked with the same two hash puzzles, as illustrated in FIG. 10. The two participants can now exchange secrets T1 and X1 and unlock the outputs for these transactions. Now, both parties can redeem the nominal fee x by providing the correct unlock script that also exposes both secrets. Transactions using this unlock script are illustrated in FIGs. 11 and 12.
[0222] Upon completion of this atomic swap for token redemption, Alice's first secret X1 is exposed to Bob and Bob's first token T1 is exposed to Alice; if the amount of x is large enough to incentivize both parties to consume the locked output, the cryptocurrency funds can be exchanged for net-zero. Crucially, this also establishes that the next token available to Bob must be the solution T2 to the hash puzzle [Hash Puzzle H(T2)], where the target hash H(T2) = T1 has just been exposed to Alice. This process allows Bob to have his final token T 10 = It can be repeated recursively until Y is used.
[0223] Naming and Addressing
[0224] Node and edge structure
[0225] Above, we explained how data can be inserted into the blockchain by providing it within a transaction. Now, we present a protocol for structuring these transactions in a logical manner that allows for the addressing of nodes, permissions, and content version control. The structure of this distributed peer metanet is similar to the existing Internet.
[0226] It should be noted that this is a "tier-2" protocol that does not modify the protocol or consensus rules of the underlying blockchain.
[0227] The purpose of the structure described here is
[0228] (i) Associate related content within different transactions to enable searching, identification, and access to data and
[0229] (ii) Improve search speed, accuracy, and efficiency by allowing content identification using human-readable keyword search and
[0230] (iii) It is to build and emulate a server-like structure within the blockchain.
[0231] Our approach is to structure the data associated with the Metanet into a directed graph. The nodes and edges of this graph correspond to the following.
[0232] Node - Transactions associated with the Metanet protocol. Nodes store content. (The terms "content" and "data" may be used interchangeably in this document.)
[0233] The node is right behind it<Metanet Flag> It is generated including the incoming OP_RETURN. Each node has a public key P node It is assigned. The combination of the public key and the transaction ID is the node's index Uniquely designates .
[0234] The hash function used must match SHA-256 or RIPEMD-160 for the underlying blockchain protocol in which the invention is used, for example, Bitcoin.
[0235] Edge - Association between child nodes and parent nodes.
[0236] Signing Sig P for Metanet transaction inputs parent Since an edge is created when it appears, only the parent can grant permission to create an edge. Every node can have at most one parent, and a parent node can have any number of children. In the language of graph theory, the indegree of each node is at most 1, and the outdegree of each node is arbitrary.
[0237] It should be noted that Edge is an aspect of the Metanet protocol and is not itself a transaction associated with the underlying blockchain.
[0238] A valid Metanet node (including the parent) is provided by a transaction of the following format.
[0239]
[0240] This transaction includes all the information necessary to specify the indexes of the node and its parent.
[0241] , .
[0242] In addition, since the parent node's signature is required, only the parent can generate edges for the child. <TxID parent If a field is missing or does not point to a valid Metanet transaction, the node is an orphan. There are no reachable upper-level nodes.
[0243] Additional attributes can be added to each node. These may include flags, names, and keywords. These will be discussed later in this document.
[0244] As shown, the index of a node (transaction) can be divided as follows.
[0245] a) Public key P that resolves to the node's address node
[0246] b) Transaction ID TxID that is interpreted as the node's version node
[0247] Two advantageous features arise from this structuring.
[0248] 1. Version control If there are two nodes with the same public key, the Proof of Work resolves the node with the largest transaction ID as the latest version of that node. If the nodes are in different blocks, this can be verified by the block height. For transactions in the same block, this is determined by the Topological Transaction Ordering Rule (TTOR).
[0249] 2. permission - The children of a node are public key P node It can be created only if the owner signs the transaction input during child node creation. Therefore, P node It represents not only the node's address but also the permission to create child nodes. This is intentionally similar to a standard Bitcoin transaction—not only the address but also the public key of the permission associated with that address.
[0250] Note that since the parent node's signature appears in the UXTO unlock script, it is validated through a standard miner validation process at the time the transaction is accepted by the network. This means that permission to create child nodes is validated by the Bitcoin network itself.
[0251] It is worth noting that standard Internet Protocol (IP) addresses are unique only within the network at a specific point in time. On the other hand, Metanet node indexes are always unique, and since there is no separate network concept, data is a single object ID node It can be permanently anchored.
[0252] The node and edge structure allows the metanet to be visualized as a graph, as shown in Fig. 13.
[0253] Finding domains, naming, and content within Metanet
[0254] The hierarchical structure of the metanet graph enables the emergence of rich structures similar to domains. Orphan nodes are interpreted as top-level domains (TLDs), the children of orphan nodes as subdomains, grandchildren as sub-subdomains, and nodes without children as endpoints. See Fig. 13.
[0255] The domain name is the ID node It is interpreted as follows. Each top-level domain of Metanet can be thought of as a tree where the root is an orphan node and the leaves are nodes without children. Metanet itself is a collection of global trees that form a graph.
[0256] Although the Metanet protocol does not stipulate that every node contains content data, leaf nodes (without children) represent the ends of directed paths in the data tree and are therefore generally used to store content data. However, content can be stored in any node of the tree. Protocol-specific flags included as attributes of the node can be used to specify the node's role in the data tree (disk space, folders, files, or permission changes).
[0257] Recall that the Internet uses the Domain Name System (DNS) to associate human-readable names with Internet Protocol (IP) addresses. While DNS is effectively controlled by a small number of key players, such as governments and large corporations, it is decentralized in a sense. Depending on the DNS provider, the same name can be assigned to different addresses. This problem arises when mapping short, human-readable names to computer-generated numbers.
[0258] A human-readable top-level domain name is the root node's decentralized index ID root It is assumed that an equivalent distributed system exists that maps to it. That is, there is a one-to-one function κ that maps human-readable names to Metanet root node indices. For example,
[0259] .
[0260] The input on the left is a human-readable word, whereas the output on the right is a hash digest, which is typically a 256-bit data structure. P bobsblog and TxID bobsblog Also, note that it is generally not human-readable. In standard IP protocols, this is a map from www.bobsblog.com to the IP addresses of corresponding domains within the network.
[0261] Map κ should be interpreted as a means of ensuring backward compatibility between Metanet and the Internet when replicating the human readability of DNS-issued domain names, but the naming and addressing schemes that provide the structure of Metanet are not explicitly dependent on this map.
[0262] Possible existing forms of the mapping function κ include the DNSLink system used by the Interplanetary File System (IPFS) or the OpenNIC service (https: / / www.openic.org). This mapping can be stored in existing TXT records as part of DNS. This is similar to IPFS's DNSLink—see https: / / docs.ipfs.io / guides / concepts / dnslink / . However, generally, these sacrifice some elements of decentralization to provide a one-to-one map— https: / / hackernoon.com / ten-terrible-attempts-to-make-the-inter-planetary-file-system-human-friendly-e4e95df0c6fa reference
[0263] Vanity address
[0264] Public keys used as addresses for Metanet nodes are not human-readable objects. This can make search, reference, and input activities error-prone and slow for human users. However, human-readable public key addresses—modified addresses P—containing plaintext prefixes that users can interpret directly vanity - can be generated. Decoration addresses are known in the prior art.
[0265] The difficulty in generating these addresses depends on the character length of the desired prefix. This means that human-readable modifier addresses can be used as node addresses that depend solely on the owner's effort to generate them, rather than being a central issue. For a given prefix, since many unique modifier addresses exist due to the characters remaining in the suffix, many node addresses can share a common prefix while maintaining their uniqueness.
[0266] Examples of decorative addresses with desirable prefixes are as follows.
[0267] : bobsblogHtKNngkdXEeobR76b53LETtpyT
[0268] Prefix: bobsblog
[0269] Suffix: HtKNngkdXEeobR76b53LETtpyT
[0270] The above custom address is the node index ID from the name 'bobsblog' bobsblog It can be used to check the map of the address and support the discoverability of Metanet nodes. Note that the prefix is not unique, but the full address itself is a unique entity.
[0271] ID node The selected address P that forms together vanity The combination of and TxID is also advantageous because it implies that there is no central issuer of the domain name (TxID is generated by decentralized proof of work) and the name can be recovered by the blockchain itself. Advantageously, there are no longer any points of error within the internet DNS.
[0272] Since Metanet domains already provide a permission system (public key), there is no need to issue certificates to prove ownership. The use of a blockchain for this purpose has already been studied, for example, in namecoin (https: / / namecoin.org / ). However, according to the present invention, since everything takes place within a single blockchain, there is no need to use a separate blockchain for this function.
[0273] This significantly reduces the amount of resources (hardware, processing resources, and energy) required by the invention compared to conventional technology. It also provides a completely different architecture in terms of the device and arrangement of system components.
[0274] The advantage of this naming system is that users can identify top-level domains on Metanet using memorable words (e.g., company names) rather than hash digests. This also speeds up domain searches because searching by keyword is faster than searching by hash digest. Furthermore, it reduces input errors, providing improved search tools for data stored on the blockchain.
[0275] If a map exists from a domain name to a node index, a resource identifier similar to the Internet's Uniform Resource Locator (URL) can be constructed. We will refer to this as a Metanet URL (MURL), and it takes the following format.
[0276] .
[0277] Each component of a URL—protocol, domain name, path, and file—is mapped to the structure of MURL, making objects more intuitive for users and enabling integration with the existing internet structure.
[0278] This assumes that each node has a name associated with a unique public key (address) at a level within the domain tree. This name is always the rightmost component of the MURL for a given node. If two nodes at the same level in the tree have the same name, they have the same public key, so the later version is used.
[0279] The following table provides similarities between the Metanet protocol and the Internet protocol.
[0280]
[0281] Table: Summary of Similarities Between the Internet and Metanet Protocols
[0282] Metanet Search
[0283] An exemplary embodiment of the Metanet graph structure has been defined so that each node can have a unique index and a name associated with it. This enables content to be found using MURL. Additionally, to enable fast search functionality, additional keywords associated with the nodes are allowed.
[0284] The fixed attributes of a node are the index and the parent node's index, and the optional attributes are the name and keyword.
[0285] Node properties
[0286] {
[0287] Index: ;
[0288] Parent Index: (NULL if orphan)
[0289] Name: 'bobsblog';
[0290] kwd1: 'travel';
[0291] kwd2: 'barbados';
[0292]
[0293] }
[0294] In one example, a practical method for searching for a Metanet might be to first use a block explorer to navigate the blockchain, identify all transactions by the Metanet flag, verify if they are valid Metanet nodes, and if so, record the corresponding index and keyword in a database or other storage resource. This database can then be used to efficiently search for nodes by the desired keyword. Once the index of a node(s) containing the desired keyword is found, its contents can be retrieved and viewed in the block explorer.
[0295] For example, consider the P1 branch of FIG. 14, where public keys P0, P1, and P 1,1 The corresponding nodes represent the home page, topic page, and subtopic page, respectively. These nodes are named 'bobsblog', 'summer', and 'caribbean', and their attributes are shown below.
[0296] Home Page Node P0
[0297] MURL: mnp: / / bobsblog
[0298] {
[0299] Index: ;
[0300] Parent Index:
[0301] Name: 'bobsblog';
[0302] kwd1: 'travel';
[0303] kwd2: 'barbados';
[0304]
[0305] }
[0306] Topic Page Node P1
[0307] MURL: mnp: / / bobsblog / summer
[0308] {
[0309] Index: ;
[0310] Parent Index:
[0311] Name: 'summer';
[0312] kwd1: 'travel';
[0313] kwd2: 'barbados';
[0314]
[0315] }
[0316] Subtopic Page Node P 1,1
[0317] MURL: mnp: / / bobsblog / summer / caribbean
[0318] {
[0319] Index: ;
[0320] Parent Index:
[0321] Name: 'caribbean';
[0322] kwd1: 'travel';
[0323] kwd2: 'barbados';
[0324]
[0325] }
[0326] In this example, leaf node P 1,1,1 , P 1,1,2 and P 1,1,3 They are named 'beaches', 'nightlife', and 'food', respectively, and are used to store separate blog posts. The entire domain structure, including the MURL search paths associated with each node of the tree, is shown in the following diagram.
[0327] Note that Metanet can also integrate a content addressable network (CAN) by storing the hash of the content stored by node transactions as an additional attribute. This means that Metanet nodes can be indexed and retrieved by their content hashes.
[0328] The naming and addressing methods described above provide many technical advantages over conventional technologies, including the following.
[0329] 1. Public key address The system assigns node addresses using the same public-private key pair as the blockchain. This means that the same set of keys is used for both cryptocurrency fund management and content data authorization. This provides an efficient and secure solution.
[0330] 2. Decentralized domain - TxID that can only be generated via Proof of Work node The issuance of domain names is completely decentralized by including . The domain name is also a human-recognizable public key P that enables the fair distribution of the desired domain public key. vanity It can integrate (decorative addresses). Again, this solution provides enhanced efficiency and security.
[0331] 3. Graph Structure—The Naming and Addressing Architecture specifies a graph that can be constructed from a subset of blockchain data containing Metanet nodes. This design uses an ordered structure to map the complexity of the Internet to the blockchain, fully replicating functionality and scalability while maintaining security.
[0332] Browser wallet application
[0333] It should be noted that in the Metanet protocol, all data exists directly within the blockchain itself. This section presents an exemplary computer application, referred to herein for convenience only as a "browser wallet," capable of efficiently accessing, displaying, and interacting with Metanet data stored in the blockchain.
[0334] Before providing a more detailed explanation in the remainder of this section, we begin with an explanation of the key components and functions of how browser wallets connect to the decentralized peer internet.
[0335] outline
[0336] Components
[0337] A browser wallet is an application intended to enable end users to interact with the blockchain's Metanet infrastructure. This application must allow exploratory searching of the Metanet graph for specific content contained within the tree. Additionally, the browser wallet will handle content retrieval, decryption, recombination, and caching (optional).
[0338] Browser wallet applications will support native (or external) wallets and combine these elements with cryptocurrency payment mechanisms. A browser wallet will include the following core elements combined into a single computer application.
[0339] Blockchain search engine -ID node Support for third-party search engines querying Metanet nodes with various indexes including node name, keyword, block height, and TxID.
[0340] Display window - Software that decompresses the content returned to the browser by a full copy blockchain peer. This covers decryption, recombination, caching, and redemption of access tokens.
[0341] cryptocurrency wallet - Dedicated key management for blockchain currency. Can be native to the application or authorized to communicate and synchronize with external wallets (software or hardware). Can create standard blockchain transactions as well as new Metanet Node transactions. Can mediate the on-chain purchase of access keys and access tokens.
[0342] Hierarchical and deterministic key management is utilized for both cryptocurrency public keys and Metanet node addresses.
[0343] Access Key / Token Wallet - Management of dedicated keys for purchased access keys or tokens. Purchased keys or tokens can be received using a cryptocurrency wallet, but without permission. They can be hidden from the user so that they can expire later. This can be achieved by using a trusted execution environment. Timed access can be protected by synchronizing with the blockchain and querying the current block height.
[0344] function
[0345] The Metanet browser wallet specification guarantees the following features of the application.
[0346] 1. Hierarchical Key Management The keys used to control funds and manage the Metanet tree (graph) utilize the same hierarchical deterministic key infrastructure, reducing the burden on users to maintain key records for Metanet content.
[0347] 2. Pointing to an external cryptocurrency wallet The feature to approve and synchronize external (non-default application) wallets allows for additional security by removing browser wallets as a point of failure.
[0348] The application may require a signature from an external wallet that creates blockchain transactions and stores the key, delegating this responsibility to separate software or hardware.
[0349] 3. Metanet Content Search - Browser wallets can support and query third-party search engines that have capabilities including crawling, indexing, servicing, and ranking Metanet node transaction data from global databases. A database of OP_RETURN transactions including Metanet protocol flags can be configured. See BitDB 2.0 - https: / / bitdb.network / .
[0350] Search engines can provide a node index that enables data to be found in browser wallets.
[0351] 4. Reading and writing data on the blockchain In addition to providing content to the browser using search engines and full nodes, cryptocurrency wallet support allows content to be written directly from the browser wallet to Metanet.
[0352] 5. Data decompression and decryption - The browser wallet can process decryption keys and perform decompression of Metanet content on-site.
[0353] 6. Node ID (ID) node ) Caching - Unique node IDs can be cached locally for more efficient lookups and queries.
[0354] 7. Web server bypass Given a node index, a browser wallet can query any full-copy member of a peer-to-peer (P2P) blockchain network for the content located on the node. Since the Metanet is on-chain, every full-copy peer must possess a local copy of the node and its content.
[0355] This means that the user's browser wallet only needs to query a single peer, and this can be performed directly without an intermediate web server.
[0356] Figure 15 illustrates an overview of a browser wallet and how its core functions are divided among different components of an application.
[0357] Blockchain search engine
[0358] Search Engine - Existing Technology
[0359] Search engines (SEs) known in the prior art rely on powerful web crawlers to locate, index, and rank web content based on user queries. (The same basic principle can be extended to a third-party blockchain SE crawling Metanet).
[0360] SE identifies relevant HTML meta tags and content through keyword searches of queries. The crawl results are subsequently indexed at the location where any embedded images / videos / media files are analyzed and classified. Then, the most relevant results in the index are programmatically ranked, taking into account the user's location, language, and device.
[0361] A typical SE must have the following functions.
[0362] 1. crawling - It identifies internet data and crawls it through relevant metadata such as domain names, linked pages, and related keywords. New internet content is discovered through existing content, and arbitrary relevant information is also crawled.
[0363] 2. Indexing - Content data is analyzed and classified. This information is stored in a database.
[0364] 3. Services and Rankings - The content index is ranked in the order related to the user's query.
[0365] Block Explorer
[0366] The blockchain analogue closest to an internet search engine (SE) is Blockchain Explorer It is sometimes referred to as a 'block explorer' or 'blockchain browser'. A blockchain explorer is a web application that enables user-friendly blockchain queries at a high level and operates similarly to a web browser, but connects to the blockchain rather than the internet. See https: / / en.bitcoin.it / wiki / Block_chain_browser.
[0367] In most cases, these explorers allow searching by taking blocks (indexed by the hash of the block header), transactions (indexed by TxID), addresses, and unused transaction outputs (UTXOs) as input. Many explorers also provide their own application programming interfaces (APIs) for retrieving raw transaction and block data. https: / / blockexplorer.com / api-ref reference.
[0368] While block explorers offer a variety of functions, they are generally useful for classifying transactions and displaying their basic information—such as the value of the traded currency, the confirmation and history of the coin and address—in a form that is easy for users to understand. Many explorers, such as Bitcoin.com https: / / explorer.bitcoin.com / bch and Blockchain.com https: / / www.blockchain.com / explorer, also allow viewing individual entry and lock scripts for transactions, but the way these sites choose to present this information does not align with that of more advanced sites like Blockchair https: / / blockchair.com / .
[0369] Recently, there have been many extensions to basic blockchain explorers used to run web applications based on blockchain data. These applications, such as Memo.cash https: / / memo.cash / protocol and Matter https: / / www.mttr.app / home, function as block explorers that classify and organize blockchain transactions containing specific protocol identifiers and display encoded data within specific transactions.
[0370] However, there are two important problems with using the blockchain explorer solved by the embodiment of the present invention.
[0371] 1. catholicity There is currently no industry standard for retrieving content data stored in transactions. Content data refers to all data unrelated to the protocol used to create and secure the underlying blockchain.
[0372] 2. Keyword search - Content data stored in transactions must be retrievable using human-readable keywords. This is generally not a feature of current block explorers, as keywords are used to query protocol-based attributes of transactions, such as block height, TxID, and address, rather than as search input. (However, some, such as Blockchair, can search for words included directly in the transaction script.)
[0373] Importantly, as discussed above, the robust naming and addressing structure of the present invention facilitates and enables the configuration of a more sophisticated blockchain explorer than is known in the field.
[0374] Proposed Metanet Search Engine
[0375] Browser wallet applications use the node ID (ID node It communicates with third-party search engines for discovery. These third parties are expected to provide powerful and diverse services that replicate the functions of existing internet search engines.
[0376] The Metanet search engine third party maintains a database of all Metanet transactions mined on the blockchain that can be identified by Metanet protocol flags. This database is an ID node All Metanet nodes can be classified by a range index including node name, keyword, TxID, and block height.
[0377] Services such as Bit DB (https: / / bitdb.network / ) already exist, which continuously synchronizes with the blockchain and maintains transaction data in a standard database format. Browser wallets delegate the responsibility for crawling, indexing, servicing, and ranking Metanet transactions to these third parties and connect to these services when searching for content stored in the Metanet graph.
[0378] Using a database dedicated to Metanet data can save efficiency. Unlike Bit DB, it does not store data associated with every transaction, but only stores data containing Metanet flags. Certain databases, such as non-relational databases like MongoDB, can be more efficient for storing Metanet's graph structure. This enables faster queries, reduced storage space, and more efficient association of related content within the Metanet domain.
[0379] FIG. 16 illustrates how a browser wallet interacts with a third-party search engine when a user searches for content within the Metanet infrastructure. Importantly, it should be noted that, unlike the Internet, routing is not required, so the invention provides significant advantages in terms of efficiency, speed, processing, and required resources.
[0380] The process is as follows:
[0381] 1. The end user enters a keyword into the browser wallet search bar.
[0382] 2. The browser wallet sends the keyword query to the third-party SE.
[0383] 3. The SE checks keywords for its database and IDs any Metanet node containing related content node It returns. A third party can not only return different indices of each node to the user, but also provide suggestions for related content.
[0384] 4. The browser wallet configures the MURL using the node ID and the associated domain name.
[0385] 5. The browser wallet requests content belonging to a specified node from any network peer that has a full copy of the blockchain.
[0386] 6. Network peers provide the requested content to the browser wallet. Since the peer holds a copy of the blockchain, it also holds a copy of the content, and only one request is made and not transmitted to other network peers.
[0387] It is emphasized that third-party SEs are responsible only for indexing and maintaining records of Metanet node attributes, whereas the raw content data stored on the nodes is instead stored by network peers (e.g., full copy peers, miners, archives) as a full copy of the blockchain.
[0388] Content Display - Metanet Browser
[0389] Browser wallet applications emulate the same front-end functionality that any standard web browser should provide. This functionality includes, but is not limited to, the following.
[0390] 1. search - Provides access to search engines (SE) to find content.
[0391] 2. Retrieve - Communicate with a server to facilitate content transmission using a known protocol, e.g., Hypertext Transfer Protocol (HTTP).
[0392] 3. analysis - Parsing and executing source code (e.g., JavaScript).
[0393] 4. rendering - Efficiently display parsed content for end users to view.
[0394] 5. User Interface (UI) - Provides an intuitive interface that allows users to interact with content, including action buttons and mechanisms for user input.
[0395] 6. save - Local temporary storage performance for caching internet content, cookies, etc. to improve repetitive access to content.
[0396] In a specific embodiment, a software component of a browser wallet application acting as a web browser can perform the above functions for metanet content contained in a blockchain that is searchable (using SE) and retrieveable (from peers) by using the corresponding properties.
[0397] Blockchain search engine
[0398] Recombination, decompression, and decryption
[0399] According to a specific embodiment of the invention, the web browser software component of a browser wallet application can handle all operations that need to be performed on a given Metanet content. While there are generally many such operations that need to be performed, it is assumed that an application using the Metanet protocol and infrastructure performs at least the following operations.
[0400] reunion If Metanet content needs to be split and inserted into multiple separate node transactions, the application will request the content from all relevant nodes and reconstruct the original content. The order and structure of the split content can be encoded using additional flags in the attributes of each node.
[0401] Unzip - If content data is stored on the blockchain in a compressed form, a flag must be included to indicate the standard compression scheme used to the browser wallet. The application will decompress the content based on this flag.
[0402] decoding - If the content is encrypted, a flag indicating the encryption scheme must be used. The application will locate the key in the decryption key wallet (discussed below) and decrypt the content data to be used according to the encryption scheme used.
[0403] When performing these operations on content data, you can use a flag to indicate to the browser wallet that a given operation should be performed. This is appropriate<operation_flag> It is generalized to any other operation that can be included as part of the node properties to which the operation is applied.
[0404] Caching
[0405] Caching local files and cookies is a common and important feature of general web browsers. Browser wallet applications also ID node And local storage is used in a similar way to selectively maintain records of other node attributes related to content of interest. This allows for more efficient querying and retrieving of content from frequently visited Metanet nodes.
[0406] Metanet solves the inherent problem of internet data caching, which is that data is mutable and can be altered or censored by web browsing software depending on the provider. When caching Metanet data, users can always easily verify that the data remains in the same state as when it was originally included as an immutable record in the blockchain.
[0407] cryptocurrency wallet
[0408] Hierarchical Deterministic Key Management
[0409] A deterministic key (Dk) is a private key initialized from a single "seed" key (see Andreas M. Antonopoulos, *Mastering Bitcoin*, Chapter 5, O'Reilly 2nd Edition, 2017, pp. 93-98). The seed is a randomly generated number that serves as the master key. A deterministic key can be derived by using a hash function to combine the seed with other data, such as an index number or "chaincode" (see HD Wallet - BIP-32 / BIP-44). These keys are related to each other and can be fully recovered using the seed key. The seed also allows for easy import / export of wallets between different wallet implementations, providing additional freedom for users who wish to use external wallets alongside the Metanet browser wallet.
[0410] Hierarchical deterministic (HD) wallets are a well-known method for deterministic keys. In an HD wallet, a parent key generates a sequence of child keys, which in turn derives a sequence of grandchild keys, and so on. This tree-like structure is a powerful mechanism for managing multiple keys.
[0411] In a preferred embodiment, the HD wallet can be integrated into the Metanet architecture illustrated in FIG. 16. The benefits of using the HD wallet include the following.
[0412] 1. structure Additional organizational semantics can be expressed by using different subkey branches for different purposes. For example, users can assign different branches (and corresponding subkeys) to different types of data.
[0413] 2. security Users can generate a sequence of public keys without a corresponding private key, enabling the HD wallet to function as a receive-only device and making it suitable for use on insecure servers. Additionally, the risk of exposure is low because there are fewer secrets to store.
[0414] 3. restoration - If the key is lost or damaged, it can be recovered from the seed key.
[0415] Supports native (internal) and external wallets
[0416] Advantageously, embodiments of the invention can directly merge the functions of a traditional web browser with one or more cryptocurrency wallets. This is essentially a method for combining the payment and delivery of "Internet" content by Metanet to end users.
[0417] To achieve this, an embodiment of the browser wallet may have a dedicated built-in software component that functions as a cryptocurrency wallet. This wallet is the underlying application itself and can be used to manage cryptocurrency private keys and authorize transactions for payments to Metanet content within the browser wallet itself.
[0418] This means that the application's browser component can prompt the wallet component to authorize the payment required to purchase decryption keys, access tokens, etc., in order to view Metanet content. Since the application does not need to call an external third party to process the payment, the Metanet content of interest is consumed by the application and paid for on-site.
[0419] external wallet
[0420] If a user wishes to manage or maintain cryptocurrency private keys in an external wallet (software or hardware) instead, or even use multiple wallets, the same benefits and functions can be obtained through embodiments of the application. This can be done instead of or in conjunction with the application's default wallet.
[0421] In this embodiment, the application establishes a link or pairing with external wallet(s) and synchronizes, but does not store the private key in the browser wallet itself. Instead, when the browser component prompts for payment for content, the application requests authorization by digital signature from the selected external wallet. This authorization is granted by the user, and the browser wallet broadcasts the transaction, allowing the paid content to be viewed.
[0422] Read and write Metanet transactions
[0423] The fundamental advantage of Metanet is that it records both payment and content data using the same data structure—the blockchain. This means that in addition to generating transactions based purely on cryptocurrency exchanges using software wallets, content data can be written to the Metanet infrastructure.
[0424] The default wallet embedded in the application can write more complex transactions to the blockchain than a typical simplified payment verification (SPV) client. https: / / bitcoin.org / en / glossary / simplified-payment-verification Reference. The wallet allows the user to select content data to include on the blockchain from their computer and choose to write Metanet node transactions directly to the blockchain from the application.
[0425] Browser wallet applications have a user interface (UI), which enables wallet components to create and broadcast transactions containing pre-configured content data on the browser component or the user's computer. This capability would be much more difficult for a purpose-built wallet to achieve on its own.
[0426] Access Key / Token Wallet
[0427] Recall from the above that what is built into the Metanet protocol is the function of encrypting content using ECC key pairs or AES symmetric keys, and the function of purchasing the corresponding decryption key or token. This Access key or Access token It is referred to as.
[0428] These keys / tokens grant users permission to view or edit content (single-use or multi-instance use) and serve a role distinct from the keys controlling the user's cryptocurrency wallet (however, the same key can be used for both purposes if desired). For this reason, it is advantageous to introduce a new wallet to store and manage access keys and tokens, separate from the application's default cryptocurrency wallet.
[0429] Additionally, the concept of time-limited access to Metanet content can be introduced by allowing access keys / tokens to be burned after a certain period. This can be achieved by requiring that access keys / tokens be stored in a Trusted Execution Environment (TEE) and that users cannot access them directly.
[0430] The fact that access keys / tokens can be "burned" is also a motivating factor for not storing cryptocurrency private keys in cryptocurrency wallets to ensure there is no risk of them being burned.
[0431] In a manner similar to a cryptocurrency wallet, decryption keys and access tokens can be stored and managed deterministically to facilitate efficient processing and distribution. Decryption keys (e.g., ECC private keys) can be generated and recovered through subsequent additions to a master key, and access tokens can be reconstructed using a hash chain seeded by some initial tokens.
[0432] It is important to distinguish here that cryptocurrency wallets handle deterministic key generation for key pairs used to trade with other users and create new Metanet nodes, whereas key / token wallet(s) handle keys and tokens purchased by cryptocurrency wallets.
[0433] Block height permit
[0434] A timelock can be included in the Bitcoin script language to enable block height permission. The command code OP_CHECKLOCKTIMEVERIFY (CLTV) sets the block height at which a transaction output (UTXO) is allowed to spend.
[0435] There are two advantages to block height permits.
[0436] 1. Version control In the Metanet protocol, the latest version of a node can be identified from the node with the largest block height. Browser wallets can be configured to display only the latest version of a file by block height, enabling proof-of-work version control.
[0437] 2. Time-limited access Browser wallet applications can periodically burn decryption keys atomically purchased by users. This ensures that viewers can access content data only during the paid period. Storing decryption keys in a Trusted Execution Environment (TEE) prevents duplication. Additionally, atomic swaps involve the purchase of a Deterministic Key (Dk) (for decrypting content data). While this Deterministic Key is publicly visible, a TEE can be used to sign a combination of the Dk and a securely isolated private key.
[0438] Browser wallets can be arranged to synchronize with the current state of the blockchain to use the block height as their own time proxy, without relying on any arbitrary external clock or third-party time trust.
[0439] Web server bypass
[0440] The invention allows a new mechanism for a browser (client) and a web server to communicate and exchange information via a distributed peer internet that bypasses Domain Name System (DNS) servers and typical network routing procedures. See http: / / www.theshulers.com / whitepapers / internet_whitepaper / . The invention provides a new network architecture comprising peers that maintain a full copy of the blockchain from which a browser wallet application can receive content.
[0441] Local full-copy peer
[0442] For example, consider a local peer system for each geographical area, such as a zip code, village, or city. It is assumed that within this local network, at least one peer maintains a full copy of the blockchain, which will be referred to as the Local Full-Copy Peer (LFCP). For our purposes, the LFCP only needs to store blockchain transactions containing the Metanet flag, but is not limited to this.
[0443] By default, all users send 'get' requests to LFCP. Since peers maintain a complete and up-to-date copy of the entire blockchain, all queried node IDs are available to LFCP, allowing it to process all requests. Note that if the SE is powerful and large enough to store Metanet content and perform the main functions of a typical SE, the Metanet search engine can also act as LFCP.
[0444] In the simplest case, all LFCPs must be able to store the entire blockchain (approximately 200GB at the time of writing), so they will have the same storage and disk space overhead. The difference between each LFCP lies in the fact that performance must be scaled to respond to the demand for local requests from Metanet users. Therefore, assuming that each Metanet user in the world essentially queries the nearest LFCP, each LCFP must aim to scale operational performance to meet local demand. Densely populated areas like cities require LFCP operations composed of many cluster servers, whereas sparsely populated areas like small villages require smaller LCFP operations.
[0445] It is important to note that while disk space requirements are universal, the CPU requirements for each LFCP are tailored to local network demands. This applies to networks such as Freenet. Adaptive Network This is an example. See https: / / blockstack.org / papers / .
[0446] One advantage of this system is that the user has a given ID node The advantage is that when retrieving content associated with it, only a single (local) connection to LFCP is required. Since LFCP is guaranteed to directly provide the necessary content, there is no need to forward requests to other peers.
[0447] Metanet offers many advantages over the Internet, such as decentralization and deduplication, similar to other peer-to-peer (P2P) file sharing services like IFPS. However, Metanet improves upon these existing P2P models by guaranteeing immutability and, crucially, eliminating the need to flood the network with requests for a given content.
[0448] Metanet infrastructure is also robust against the failure of any single LFCP by employing a network of these peers. This means that if an LFCP is disabled, end users simply use the next closest LFCP by default. This can become more efficient if LFCPs communicate with each other to identify nearby peers that are underperforming or overperforming in terms of requests at any given time. This allows users to send requests to the most appropriate peer and establish dynamic equilibrium in the distribution of requests among nearby LFCPs.
[0449] Global full-copy peer
[0450] Now, consider a scenario where general-purpose disk space requirements become too large compared to small peers, which may occur as the blockchain's metanet portion expands and increases with adoption.
[0451] In this case, the smaller LFCP must use disk space capacity to store Metanet node transactions based on popular systems (there is an existing technology that ranks content based on request volume and characteristics). This means that LFCP now adjusts both CPU (for request processing capability) and storage allocation (for content delivery capability) to meet local geographic needs in both the volume and characteristics of content.
[0452] To address the fact that LFCP can no longer store all Metanet transaction content, the concept of a Global Full-Copy Peer (GFCP) can be used. A GFCP is a full-copy peer with the following characteristics.
[0453] 1. GFCP always increases disk space capacity to maintain a full copy of the blockchain.
[0454] 2. GFCP has significant CPU resources capable of handling much more requests than LFCP. Global Full Copy peers must be able to handle a sudden surge in demand in the event that many LFCPs are compromised.
[0455] GFCP has two main functions. First, it acts as a safeguard for user requests for Metanet content in the event of an LFCP overflow request. Second, GFCP acts as an archive peer that stores all historically mined Metanet content, ensuring that all Metanet node content can be accessed even if many LFCPs omit some content from their local storage offerings.
[0456] Global Data Bank
[0457] The concept of GFCP is powerful and demonstrates how Metanet's entire architecture provides solutions to existing problems and creates an all-encompassing global data bank.
[0458] Until now, it has been impossible to securely establish a universal and globally accessible data bank because it had to be maintained by a central authority. This central authority introduces both points of failure and points of trust into the system. Crucially, if an organization relies on another entity to store and maintain all internet data, it must trust that this is being done accurately and lawfully without compromising the information.
[0459] Through the Metanet infrastructure, we have effectively eliminated both the issues of trust and centrality from the concept of a global data center. Now, such a GFCP can be created because it relies solely on providing the disk space required for storage, rather than verifying and authenticating the information to be stored.
[0460] With Metanet, a universal global data bank can be trusted because the process of verifying stored content is performed by miners, making it impossible to compromise blockchain information. GFCP does not need to be trusted; it only needs to provide storage.
[0461] The fact that all GFCPs can store the same information, that is, that verification and proof of the blockchain itself are always possible, means that this can be replicated across many of these GFCPs.
[0462] This also means that the problem of having a single point of failure has been solved by enabling many global data banks to exist in parallel and verifiably store the same information.
[0463] Figure 17 illustrates a system composed of two LFCPs and one GFCP, illustrating how each peer can support other peers in a network that is robust against damage to individual peers.
[0464] Aspects of the invention that can be implemented in the embodiments of the browser wallet application described above provide numerous distinct features and advantages over the prior art, including but not limited to the following.
[0465] 1. crystalline key - Hierarchical deterministic key management for both cryptocurrency and Metanet addresses is performed within the application's same wallet component. This reduces storage requirements and allows keys to be organized into various functions that enable key recovery.
[0466] 2. Payment mechanism The application enables consumers to pay merchants directly without needing to refer to other applications or third-party payment services that typically provide authentication and trust. This allows for the purchase and delivery of digital content through the same blockchain platform. The application inherits the benefits of Bitcoin payments, including low-value exchanges or more complex transactions involving multiple parties.
[0467] 3. Web server bypass Applications generally facilitate bypassing existing web servers that handle large volumes of traffic, requests, and routing. This is because applications only need to request content from a single LFCP, ensuring delivery to users without the need to forward requests to other LFCPs. This reduces the total volume of traffic and the completion time for each request.
[0468] 4. Timed Access—The application facilitates timed access to content by synchronizing with the blockchain and using it to apply access permissions based on the current state. This eliminates the need for third-party services to monitor user privileges over time while protecting the rights of the original owner.
[0469] Use case - Decentralized app store (Swapp store)
[0470] The first use case presented here for the Metanet architecture (for illustrative purposes only) is decentralized payment and distribution for applications (apps).
[0471] Consider a scenario where app developer Alice and consumer Bob wish to trade with each other. This transaction will take the form of an atomic swap, in which money is exchanged for a secret key that grants Bob access to application data. The encrypted application data is already publicly available as part of a Metanet node transaction.
[0472] Applications that are atomically swapped are known as Swaps. While third-party platforms (Swapp stores) can be used to categorize and advertise applications existing on the Metanet, there is no need for an arbitrary third party to be involved in paying for and transferring access keys to users like Bob; this can occur directly between the seller and the consumer.
[0473] The next section details the process Alice can use to buy and sell Swap until she creates the app and Bob uses it. Throughout the process, Alice and Bob will interact with Metanet using their respective browser wallets.
[0474] Post
[0475] 1. Alice writes an application. The data constituting this application is <app>This is content labeled as . She also has the secret key S k Using<e(App)> Encrypt as.
[0476] 2. Alice uses a node transaction ID to set up the first Metanet domain (tree). AliceApp She creates 1AliceAppHtKNngkdXEeobR76b53LETtpy (P to use as the node address. AliceApp Creates ).
[0477] 3. Then, Alice creates children of the first node to create a tree corresponding to the application's Metanet library. Alice's tree domain is shown in Fig. 18.
[0478] One of the leaf nodes of this tree has an index ID App In-application <app>It is the node corresponding to. At this node, Alice [uses] encrypted application data<e(App)> Insert into the node's input script (scriptSig). The app data is the secret key s k It is encrypted using the Koblitz method.
[0479] This node transaction is as follows.
[0480]
[0481] 4. Alice is ID AliceApp , P AliceApp and publicly broadcast the domain name 'Alice App'. This may be done via social media, internet websites, or by using a third-party Metanet website.
[0482] purchase
[0483] 1. Bob wants to download a puzzle game and sees Alice's app registered on the Metanet website (Swab Store) viewed in his browser wallet.
[0484] 2. Then, Bob communicates with Alice using the information on the website and establishes an atomic swap. The swap involves Bob paying Alice the agreed-upon price in Bitcoin, and Alice using her private key s k It is designed to either expose or prevent either of the two events from occurring.
[0485] 3. The atomic swap is completed, and Bob's browser wallet receives the private key s in the access key / token wallet. k Saves.
[0486] Usage (Deployment)
[0487] Bob is now the key s that enables Alice to decrypt the application data she previously posted. k He came to have. To download and use the app, Bob performs the following.
[0488] 1. Bob uses the Metanet Search Engine (SE) to access encrypted app data<e(App)> Finds the MURL associated with it. He uses the keywords 'Alice App' and 'App' as input into the browser wallet's search bar. The third-party SE resolves the query and returns the next MURL.
[0489] mnp: / / aliceapp / games / puzzle / app
[0490] This identifier (locator) is a unique Metanet node ID containing encrypted app data in the input script. App Corresponds to.
[0491] 2. Bob's browser wallet receives this MURL and sends a request to the nearest appropriate LFCP. This peer sends the requested data to Bob.<e(App)> It provides.
[0492] 3. Browser wallet is ID App Processes data based on the attributes of. This is the secret key s k Decrypt application data using and <app>Includes processing.
[0493] 4. Bab is an application from the browser to the computer <app>Download it. Now Bob can use the application locally without repurchasing access.
[0494] Figure 19 shows the entire process summarized in the exemplary use case above. The flowchart illustrates two work branches: Alice (starting from the left) and Bob (starting from the right). The branch corresponding to Alice shows the initial publishing step, and Bob's shows the purchase setup step via atomic swap.
[0495] In Bob's branch, he sets the next transaction TxID to the atomic swap setup step. Bob Broadcasts.
[0496]
[0497] In this transaction, the output is the secret decryption key s that Alice gives to Bob to spend. k It is locked with a private key puzzle that must be exposed.
[0498] In this diagram, the branching of Alice and Bob converges at the point where Alice successfully completes the atomic swap transaction. This is Alice's transaction TxID Alice It is achieved when broadcasting.
[0499]
[0500] As soon as this transaction is broadcast, Alice and Bob's action branches diverge once again. Alice receives the payment of x Bitcoin, and Bob receives the secret decryption key s k You can receive it and retrieve and decrypt Alice's application on Metanet.
[0501] Returning now to FIG. 20, an exemplary and simplified block diagram of a computing device (2600) that may be used to implement at least one embodiment of the present disclosure is provided. In various embodiments, the computing device (2600) may be used to implement any system illustrated and described above. For example, the computing device (2600) may be configured to be used as a data server, a web server, a portable computing device, a personal computer, or any electronic computing device. As illustrated in FIG. 20, the computing device (2600) may include a memory controller that may be configured to communicate with a storage subsystem (2606) comprising a main memory (2608) and a persistent storage (2610), and one or more processors (collectively labeled 2602) having one or more cache memory levels. The main memory (2608) may include dynamic random access memory (DRAM) (2618) and read-only memory (ROM) (2620) as illustrated. The storage subsystem (2606) and cache memory (2602) may be used for storing information such as details associated with transactions and blocks as described in the present disclosure. The processor(s) (2602) may be used to provide a step or function of any embodiment as described in the present disclosure.
[0502] The processor(s) (2602) can also communicate with one or more user interface input devices (2612), one or more user interface output devices (2614), and a network interface subsystem (2616).
[0503] The bus subsystem (2604) can provide a mechanism that enables various components and subsystems of the computing device (2600) to communicate with each other as intended. Although the bus subsystem (2604) is schematically illustrated as a single bus, alternative embodiments of the bus subsystem may utilize multiple buses.
[0504] The network interface subsystem (2616) may provide an interface to other computing devices and networks. The network interface subsystem (2616) may serve as an interface for receiving data from other systems of the computing device (2600) and for transmitting data. For example, the network interface subsystem (2616) may allow a data technician to connect the device to a network so that the data technician can transmit data to the device and receive data from the device while the data technician is in a remote location, such as a data center.
[0505] The user interface input device (2612) may include one or more user input devices such as a keyboard; a pointing device such as an integrated mouse, trackball, touchpad, or graphic tablet; a scanner; a barcode scanner; a touchscreen integrated into a display; an audio input device such as a voice recognition system or a microphone; and other types of input devices. Generally, the use of the term “input device” is intended to include all possible types of devices and mechanisms for inputting information into the computing device (2600).
[0506] One or more user interface output devices (2614) may include non-visual displays such as a display subsystem, a printer, or an audio output device. The display subsystem may be a flat panel device such as a cathode ray tube (CRT), a liquid crystal display (LCD), or a light-emitting diode (LED) display, or a projection or other display device. Generally, the use of the term “output device” is intended to include all possible types of devices and mechanisms for outputting information from the computing device (2600). One or more user interface output devices (2614) may be used to display a user interface that facilitates user interaction with an application performing the described process and variations thereof, for example, where such interaction may be appropriate.
[0507] The storage subsystem (2606) may provide a computer-readable storage medium for storing basic programming and data structures capable of providing the functions of at least one embodiment of the present disclosure. When executed by one or more processors, an application (program, code module, instruction) may provide the functions of one or more embodiments of the present disclosure and may be stored in the storage subsystem (2606). Such application modules or instructions may be executed by one or more processors (2602). The storage subsystem (2606) may additionally provide a storage for storing data used according to the present disclosure. For example, main memory (2608) and cache memory (2602) may provide volatile storage for programs and data. The permanent storage (2610) may provide a permanent (non-volatile) storage for programs and data and may include flash memory, one or more solid-state drives, one or more magnetic hard disk drives, one or more floppy disk drives with associated removable media, one or more optical drives with associated removable media (e.g., CD-ROM or DVD or Blu-ray) and other similar storage media. Such programs and data may include data associated with transactions and blocks as described in the present disclosure, as well as programs for performing steps of one or more embodiments as described in the present disclosure.
[0508] The computing device (2600) may be of various types, including a portable computer device, a tablet computer, a workstation, or any other device described below. Additionally, the computing device (2600) may include other devices that can be connected to the computing device (2600) via one or more ports (e.g., USB, headphone jack, Lightning connector, etc.). A device that can be connected to the computing device (2600) may include multiple ports configured to accommodate fiber optic connectors. Thus, this device may be configured to convert optical signals into electrical signals that can be transmitted through the ports connecting the device to the computing device (2600) for processing. Due to the constantly changing nature of computers and networks, the description of the computing device (2600) illustrated in FIG. 20 is intended only as a specific example to illustrate a preferred embodiment of the device. Many other configurations are possible with more or fewer components than the system illustrated in FIG. 20.
[0509] The embodiments mentioned above are illustrative rather than limiting of the invention, and those skilled in the art should note that many alternative embodiments can be designed without departing from the scope of the invention as defined by the appended claims. In the claims, references within parentheses should not be interpreted as limiting the claims. Words such as “comprising” and “comprising” do not exclude the existence of elements or steps other than those listed in the claims or throughout the specification. In this specification, “comprising” means “comprising or composed,” and “comprising” means “comprising or composed.” A singular reference to an element does not exclude a plural reference to such element, and vice versa. The invention may be implemented by hardware comprising several distinct elements and by a suitably programmed computer. In device claims enumerating several means, some of these means may be implemented by a single hardware item. The mere fact that a specific measure is mentioned in different dependent claims does not mean that a combination of these measures cannot be used to an advantage.< / app> < / app> < / app> < / app> < / lzw> < / content> < / content> < / content> < / attributes>
Claims
Claim 1 A computer implementation system configured to enable a user to search for, access, view, write, and / or retrieve a portion of data provided within at least one blockchain transaction (Tx), wherein the system comprises a transaction index (TX) including a combination of a public key associated with said at least one blockchain transaction (Tx) and a transaction ID provided within said at least one blockchain transaction (Tx). index A system configured to identify at least one transaction (Tx) based on ). Claim 2 In claim 1, the system comprises: a search function provided within the blockchain search system; or configured to interface and / or communicate with the blockchain search system. Claim 3 A system comprising at least one additional cryptocurrency wallet in accordance with claim 1 or 2. Claim 4 In paragraph 3, the above at least one wallet is a system configured to generate, store, and / or process a hierarchical deterministic key. Claim 5 In paragraph 3, the system is configured such that at least one cryptocurrency wallet stores at least one encryption key and / or at least one token in a Trusted Execution Environment. Claim 6 A system according to claim 1 or 2, further comprising: a decompression component configured to decompress when part of the data is compressed; a recombination component; and / or a decryption component configured to decrypt when part of the data is encrypted. Claim 7 A system according to claim 1 or 2, further comprising at least one presentation component configured to display a portion of the data to a user in an auditory and / or visual form. Claim 8 In claim 1 or 2, the method further comprises means for inputting or generating a search path that identifies at least one transaction (Tx) on the blockchain, wherein the search path comprises: i) the transaction index (TX index ); and ii) a system comprising at least one attribute associated with the transaction (Tx). Claim 9 In paragraph 8, at least one of the attributes is a mnemonic associated with the transaction; and / or the at least one attribute is null. Claim 10 A system further configured to communicate with a cryptocurrency wallet or other resources to facilitate the processing, storage, and / or generation of encryption keys, blockchain transactions, and / or digital signatures in accordance with claim 1 or 2. Claim 11 In claim 1 or 2, the transaction index (TX) index A system further configured to store ), preferably configured to store each transaction index for more than one transaction. Claim 12 A system according to claim 1 or 2, further configured to transmit control of a portion of the cryptocurrency to a destination before accessing a portion of the data. Claim 13 A system further configured to transmit a request to a peer on the blockchain for a portion of the data in accordance with claim 1 or 2; and / or receive a portion of the data from a peer on the blockchain. Claim 14 A system according to claim 1 or 2 further configured to use a time lock mechanism to control access to a portion of the data. Claim 15 In claim 1, i) the at least one blockchain transaction includes a protocol flag for a blockchain search protocol; or ii) the transaction index (TX index ) is a transaction index of a blockchain search protocol; or iii) the above transaction index (TX index ) is a system including the connection of the above transaction ID and the above public key.
