US 12,597,066 B2Grant
Federated data room server and method for use in blockchain environments
Issue Date:2026-04-07
•21 Claims
•13 Drawing Sheets
Abstract
A federated-data-room server manages information about a collection of electronic documents residing elsewhere (under different organizational/customer control). The server can anchor documents to a blockchain, record usage history of each document, and provide access to the documents for authorized users. As a result, the federated-data-room server operates on customers' data, while leaving the data in control of the customers. At the same time, the federated-data-room server provides data access and enables traceability via blockchain recordation of document identifiers and document hash values.
Metadata
Assignee
- Inveniam Capital Partners, Inc.
Inventors
- Richard Gates Bunker, Jr.
- Patrick D. O'Meara
- Christos Alkiviadis Polyzois
- Paul Snow
Application Information
Application Number:US 17/979,097
Filing Date:2022-11-02
Priority Date:2021-03-26
Art Unit:3692
Classifications
IPC:
G06Q40/03H04L9/00
Field of Search:
H04L 9/50G06Q 10/10G06Q 10/06G06Q 2220/00G06Q 40/06G06Q 10/087G06Q 40/00G06Q 30/018G06Q 40/03G06Q 40/02G06Q 10/103G06Q 50/26G06Q 10/00G06Q 50/18G06Q 50/184G06Q 10/0635G06Q 50/16G06Q 30/0603
Patent Drawings (13 sheets)
Description
Reference to Prior Applications
[0001] This application is a continuation in part of U.S. non-Provisional application Ser. No. 17/705,289, filed on Mar. 26, 2022, which claims the benefit of U.S. Provisional Application Ser. No. 63/166,344, filed on Mar. 26, 2021; U.S. Provisional Application Ser. No. 63/170,006, filed on Apr. 2, 2021; and U.S. Provisional Application Ser. No. 63/224,431, filed on Jul. 22, 2021. This application also claims the benefit of U.S. Provisional Application Ser. No. 63/263,386, filed on Nov. 2, 2021; U.S. Provisional Application Ser. No. 63/263,516, filed on Nov. 4, 2021; and U.S. Provisional Application Ser. No. 63/416,830, filed on Oct. 17, 2022. Each of the above identified provisional and non-provisional applications is hereby incorporated herein in its entirety.
Field of the Disclosure
[0002] The present invention generally relates to decentralized computer systems using self-executing programs for enabling digitized transactions. Particularly, the present invention relates to an asset-information server and method for operating in association (combination) with blockchain environments for enabling digitized transactions. More particularly, the present invention relates to an asset-information server embodied as a federated-data-room server and method for operating in association with blockchain environments, for enabling digitized transactions.
Background
[0003] Rapid digitization of the global economy has led to a proliferation of digital currencies, e.g., Bitcoin, Ethereum, Dogecoin, stablecoins, etc., also known as cryptocurrencies. Today, cryptocurrencies are used to buy various goods and services in online transactions. The underlying technology in these processes is called blockchain, which is a decentralized, digital database storing all forms of data, such as transactions, using lists of records, called blocks, that are linked together using cryptography. Each block contains a cryptographic hash of the previous block, time stamp, and data. The time stamp proves that the data in the block existed when the block was published on a decentralized computer system with its hash. As each block includes information about the preceding block, they form a chain, with each additional block reinforcing the ones before. Because the hash value of each block uniquely corresponds to the data in the block, once recorded, the data in any given block cannot be altered retroactively without also altering all the subsequent blocks. As a result, blockchains are resilient to data modifications.
[0004] Cryptocurrencies have also been used in financial lending transactions. In the traditional financial landscape, loans are secured by some asset, which acts as a collateral. When the asset is illiquid (e.g., larger commercial office building) and is worth many millions of dollars, the loan can typically be supported only by large financial institutions with a massive amount of capital. Moreover, the due diligence involved in approving such a loan often takes months or even years.
[0005] Lending using blockchain technology on decentralized computer systems. i.e., decentralized lending, has provided a new mechanism for processing and distribution of loans. Not only does it allow expediting the lending process, but it also removes the need to have a financial institution facilitate it. Present day decentralized lending, however, requires collateral to be liquid, which essentially restricts the collateral to cryptocurrencies.
[0006] In addition, because cryptocurrencies are highly volatile, loans using them as collateral can quickly become under-collateralized and subject to automatic liquidation.
[0007] As a result, billions in illiquid assets, such as artwork, residential, commercial, and industrial real estate, private equity, etc., cannot be used as collateral for decentralized lending, which means they are relegated to serving as collateral in traditional lending only. The lack of technology that would allow illiquid assets to be used in decentralized lending greatly limits the scope of this lending mechanism.
[0008] What is needed is a computer system and method that can use illiquid or substantially illiquid assets as collateral in automated digital lending transactions on decentralized systems.
[0009] What is also needed is a computer system and method for on-demand access to verified private data.
[0010] What is also needed is a computer system and method that enable both payment and value to be commuted during a transaction that involves illiquid or substantially illiquid assets.
[0011] What is also needed is a computer system and method that enable an investment mechanism that provides up to date information about the value of a collateralized illiquid asset.
[0012] What is also needed is a computer system and method that generate a digital special purpose vehicle that uses a self-executing program to lock in (use) an illiquid asset as a collateral for a loaned amount of cryptocurrency.
[0013] What is also needed is a computer system and method that generate a digital special purpose vehicle that uses a self-executing program to lock in a portion of an illiquid asset (e.g., one building out of a multi-building portfolio) as a collateral for a loaned amount of cryptocurrency.
[0014] What is also needed is a computer system and method that enable digital decentralized-lending transactions, using self-executing programs, in which the loaned amounts are provided by multiple tiers of funders.
[0015] What is also needed is a computer system and method that enable digital decentralized-lending transactions, using self-executing programs, in which the loaned amounts are supplied by multiple tiers of funders and where the funder(s) in at least one tier can affect the rules under which the digital decentralized lending transactions are executed.
[0016] What is also needed is an asset-information server and method for use in a blockchain environment that manage transactions concerning digital documents and/or information pertaining to assets, collectively referred to as data, while allowing the producers (owners) of the data to retain control of the digital documents and information. As used in this disclosure, the term “electronic document” refers to both digital documents and to digital information.
[0017] What is also needed is an asset-information server and method for use in a blockchain environment that manage information about collections of electronic documents pertaining to assets, and acts as an intermediary between the producers (owners) of the electronic documents and parties that request access to the electronic documents.
[0018] What is also needed is an asset-information server and method for use in a blockchain environment that generate structured (activated) data from unstructured data. The unstructured data may include customer-controlled electronic document(s), user-entered electronic document(s), and electronic document(s) from external sources.
Summary
[0019] The present invention involves a novel decentralized computer network and method capable of using illiquid or substantially illiquid assets as collateral in automated decentralized digital lending transactions implemented using blockchain technology. The system facilitates automated transaction processing of complete, verified, and valued data, and real-time performance monitoring, enabling private markets to transact with greater velocity. The use of blockchain technology for decentralized loan transactions enables immutable data traceability. As a result, the invention creates a paradigm shift from traditional lending to a decentralized, digital lending platform for many types of illiquid or substantially illiquid assets. The resulting digital financial instrument may represent not only proportionate asset ownership but is also an auditable source of performance data, providing a platform having both know-your-customer and know-your-asset features.
[0020] The invented computer system and method involve receiving, by a first server, electronic documents and information comprising a digital representation of an illiquid asset, the digital representation indicating (showing) borrower's financial right in the asset. In one embodiment, the digital representation is recorded on a first blockchain and in an asset-information table, identifying the various sections of the digital representation and their respective locations on the blockchain. The digital representation and asset-information table are further updated (supplemented) based on additional data that confirms accuracy of the digital representation and/or value of the illiquid asset. (This way, the asset-information table is updated with at least one of digital representation of the illiquid asset and asset-valuation data of the illiquid asset.) A second server of the invented system generates an asset-value token and a data structure comprising a self-executing program for facilitating a decentralized loan transaction. The asset-value token is linked to the digital representation of the illiquid asset via the asset-information table in the first server. Using a predetermined set of rules, the second server determines an amount of digital currency needed for an automated digital loan transaction in which the illiquid asset serves as a collateral and, in return for an investment of digital currency by one or more funders, the second server issues one or more financial-return tokens. The data structure associates the issued financial-return tokens with the asset-value token and, through this association further associates the financial-return tokens with the digital representation of the illiquid asset via the asset-information table.
[0021] In another embodiment, the invented computer system and method involve receiving, by a first server, electronic documents and information comprising a digital representation of an illiquid asset, the digital representation indicating (showing) borrower's financial right in the asset. In one embodiment, the digital representation is hashed, and the resulting hash values are recorded on a blockchain and in an asset-information table, identifying the various sections of the digital representation and their respective hashes' locations on the blockchain. The digital representation is made accessible for valuation to relevant experts, such as data auditors, appraisers, pricing specialists, etc. The auditing, appraising, and/or pricing functions can be performed by automated digital expert systems, thus reducing or eliminating the need for human involvement. The digital representation and asset-information table are further updated (supplemented) based on additional data received from the experts that confirms accuracy of the digital representation and/or value of the illiquid asset. (This way, the asset-information table is updated with at least one of digital representation of the illiquid asset and asset-valuation data of the illiquid asset.) A second server, communicatively coupled to the first server, generates an asset-value token and a data structure comprising a self-executing program for facilitating a decentralized loan transaction. The asset-value token is linked to the digital representation of the illiquid asset via the asset-information table in the first server. Using a predetermined set of rules, the second server determines the amount of digital currency needed for an automated digital loan transaction in which the illiquid asset serves as a collateral and, in return for an investment of digital currency from one or more funders, issues one or more financial-return tokens. The data structure associates the issued financial-return tokens with the asset-value token and, through this association further associates the financial-return tokens with the digital representation of the illiquid asset via the asset-information table.
[0022] A system for performing a collateralized loan transaction includes a first server configured to: receive an electronic document including a digital representation of an illiquid asset, the digital representation identifying a financial interest in the illiquid asset by a borrower; hash the digital representation of the illiquid asset to generate a first hash value; record the first hash value on a first blockchain; store the digital representation of the illiquid asset at a first memory location; generate an asset-information table that associates a location of the first hash value on the first blockchain with the first memory location; receive asset-valuation data; store the asset-valuation data at a second memory location; hash the asset-valuation data to generate a second hash value; record the second hash value on the first blockchain; and update the asset-information table to associate a location of the second hash value with the second memory location. A second server is communicatively coupled to the first server and is configured to: generate an asset-value token comprising an association with the updated asset-information table; record the asset-value token on a second blockchain; determine an amount of digital currency for an automated digital transaction based on a programmed set of rules using the asset-value as a parameter; generate a data structure comprising a self-executing digital program for performing the automated digital transaction, the data structure including the asset-value token; and record the data structure on the second blockchain, wherein the automated digital transaction involves loaning the amount of digital currency at a rate of interest determined using the programmed set of rules, and wherein the illiquid asset, via the asset-value token, constitutes a collateral for the amount of digital currency being loaned.
[0023] The first server may periodically update the digital representation or valuation of the illiquid asset and the asset-information table before or after the amount of digital currency has been loaned. The second server is further configured to generate financial-return tokens, which can include governance tokens and return-interest tokens. The return-interest token could be a senior return-interest token or a subordinate return-interest token. The same may apply to governance tokens. The second server is further configured to provide access to the asset-information table in the first server to an entity possessing a financial-return token(s).
[0024] An automated method of the present invention for collateralizing an illiquid asset includes the steps of: receiving, by a first server, an electronic document including a digital representation of the illiquid asset and identifying a financial interest in the illiquid asset by a borrower; hashing, by the first server, the digital representation of the illiquid asset to generate a first hash value; recording, by the first server, the first hash value on a first blockchain; storing, by the first server, the digital representation of the illiquid asset at a first memory location; generating, by the first server, an asset-information table that associates a location of the first hash value on the first blockchain with the first memory location; receiving, by the first server, an asset-valuation data; storing, by the first server, the asset-valuation data at a second memory location; hashing, by the first server, the asset-valuation data, to generate a second hash value; recording, by the first server, the second hash value on the first blockchain; updating, by the first server, the asset-information table to associate a location of the second hash value with the second memory location; generating, by a second server, an asset-value token comprising an association with the updated asset-information table; recording, by the second server, the asset-value token on a second blockchain; determining, by the second server, an amount of digital currency for an automated digital transaction based on a programmed set of rules using the asset-value as a parameter; generating, by the second server, a data structure comprising a self-executing digital program for performing the automated digital transaction, the data structure including the asset-value token; and recording the data structure on the second blockchain; wherein the automated digital transaction involves loaning the amount of digital currency at a rate of interest determined using the programmed set of rules, and wherein the illiquid asset, via the asset-token, constitutes a collateral for the amount of digital currency being loaned.
[0025] In another embodiment, because hash values are unique, instead of the asset-information table storing a location of the hash values on the first blockchain, the asset-information table may store the hash values themselves.
[0026] Instead of, or in addition to, recording on a blockchain a hashed value of the digital representation, the method includes recording on the blockchain the digital representation itself and storing in an asset-information table a location of the digital representation on the blockchain.
[0027] In one embodiment of the present invention, invented asset-information server is a federated-data-room server. In such an embodiment, the server hosts a federated data room that acts as a repository of multiple asset-related electronic documents from one or more document owners, where control over at least some of the documents is retained by the document owner(s).
[0028] The federated-data-room server comprises a table having a number of rows (entries), where each row pertains to a particular electronic document (or a particular section of a document) and is indexed by a corresponding unique row identifier. Each row identifier acts as a pointer within the server for the corresponding document. (Hereafter, the terms “row identifier” and “document identifier” will be used interchangeably.) In one embodiment, a document identifier could be a network address, such as a uniform resource locator (URL).
[0029] Each row includes a number of fields, such as a document-hash-value field and a document-location-descriptor field. The document-hash-value field includes a hash value of a portion of document's digital representation, which portion may include 100% of the document's digital representation. The document location descriptor field includes information associated with a possibly external location of the corresponding document on the network. Each row may further include fields that identify an asset to which the corresponding document pertains, provide document category, provide document name, provide an anchoring blockchain transaction identifier, as well as other information. Moreover, in situations where the federated-data-room server saves a copy of the electronic document, either internally or in a local database, a table row may include a field identifying the location of the document's copy; in one embodiment, this field is the same as the field used for location descriptors pointing to external locations.
[0030] For each table row, the federated-data-room server may record on a blockchain the row identifier (i.e., document identifier) and the hash value of a portion of the corresponding document. If the server receives a request from a network user to access the electronic document, the server first determines whether the user is authorized to gain such access. The invention contemplates providing at least one of three levels of access: (i) an ability to read a document, (ii) an ability to update an existing content of the document, and (iii) an ability to write an additional content to document.
[0031] In one embodiment, an asset-information server in a blockchain environment includes a hardware processor and a non-transient memory storing instructions that, when executed by the hardware processor, cause the asset-information server to perform a set of operations. The set of operations may include: receiving an electronic document from a first network location; hashing a first portion of the electronic document to generate a first hash value, wherein the first hash value enables a confirmation of immutability of the electronic document; storing the first hash value in a row of a table comprising a number of rows (where the number of rows in the table is at least one), wherein the row (i) comprises a location descriptor that is associated with the first network location and (ii) is indexed by a unique document identifier; recording on a blockchain the first hash value and the document identifier; receiving a request from a network user to access the electronic document; determining that the network user is authorized to access the electronic document; and providing the user with an access to the electronic document.
[0032] In one embodiment, the set of operations further includes fetching the electronic document from the first network location. The set of operations may further include hashing a second portion of the fetched electronic document to generate a second hash value, wherein the second portion of the fetched electronic document corresponds to the first portion of the electronic document; and comparing the first hash value to the second hash value.
[0033] In one embodiment, the operations of (a) fetching the electronic document, (b) hashing a second portion of the fetched electronic document, and (c) comparing the first hash value and the second hash value, may be performed periodically, such as daily, weekly, monthly, quarterly, etc. Such periodic automated processing allows the system to check whether any changes have been made to the electronic document over time.
[0034] In one embodiment, the operation of providing the user with an access to the electronic document includes at least one of (i) allowing the user to read the electronic document, (ii) allowing the user to update an existing content of the electronic document, and (iii) allowing the user to write additional content to the electronic document.
[0035] In one embodiment, the document identifier of a row is a uniform resource locator (URL) address.
[0036] In one embodiment, the location descriptor is the first network location. The invention contemplates the first network location to be a URL location, a location in a database, or a location in any other storage. Regardless, the first network location is preferably not local to the federated-data-room-server. For example, where the first network location is a URL address, the domain name within the URL identifying the first network location would be different from the domain where the federated-data-room server is located.
Brief Description of the Figures
[0037] The accompanying figures, where like reference numerals refer to identical or functionally similar elements throughout the separate views, together with the detailed description below, are incorporated in and form a part of the specification and serve to further illustrate embodiments of concepts that include the claimed invention and explain various principles and advantages of those embodiments.
[0038] FIG. 1 shows a system in accordance with some embodiments of the present invention.
[0039] FIG. 2 is another view of a system in accordance with some embodiments of the present invention.
[0040] FIG. 3 shows an asset-information table in accordance with an embodiment of the present invention.
[0041] FIG. 4 shows an asset-information table in accordance with another embodiment of the present invention.
[0042] FIG. 5 shows a conceptual diagram of the asset-information server in accordance with some embodiments of the present invention.
[0043] FIGS. 6(a), 6(b), and 6(c) show a flow chart of a method in accordance with some embodiments of the invention.
[0044] FIG. 7 shows a server in accordance with some embodiments of the invention.
[0045] FIG. 8 shows a system in accordance with another embodiment of the present invention.
[0046] FIG. 9 shows an asset-information table in accordance with another embodiment of the present invention.
[0047] FIG. 10 shows an embodiment of using the invented asset-information server to generate structured data.
[0048] The apparatus and method components have been represented where appropriate by conventional symbols in the drawings, showing only those specific details that are pertinent to understanding the embodiments of the present invention so as not to obscure the disclosure with details that will be readily apparent to those of ordinary skill in the art having the benefit of the description herein.
Detailed Description
[0049] The following detailed description discloses some embodiments of the system and method of the present invention for programmatic collateralization of illiquid assets.
[0050] FIG. 1 shows a decentralized computer system for programmatic collateralization of illiquid assets in accordance with some embodiments of the present invention for decentralized loan processing and distribution. The system 1 includes an asset-information server(s) 12, a borrower's computer 16, an asset-related information source(s) 18, an expert system 20, a database 28, a funding system 44, a collateralization server(s) 14 that operates a blockchain on a blockchain-platform A. The system has other server(s) 15 that operate another blockchain on blockchain-platform B. In an alternative embodiment, server(s) 15 could operate a blockchain on the same platform as the collateralization server 14. The recited system components communicate with each other over a communication network 8, such as the Internet, via their respective communication links L1 though L8, which can be wired or wireless. Link L6 represents a communication channel used for recording and accessing information on an asset-information blockchain 34. Link L7 represents a communication channel used for recording and accessing information on a collateralization blockchain 38.
[0051] FIG. 2 shows a decentralized computer system 1 of FIG. 1 in more detail. (The communication network 8 in FIG. 1 is also present in the system illustrated in FIG. 2 but is not shown in FIG. 2 .) FIG. 2 depicts an illiquid asset 10 in which a borrower has a financial right (interest), and which % will be used as a collateral for a decentralized loan transaction. The process starts by having the borrower use his or her computer 16 to connect to the asset-information server 12 via the network 8. The borrower's computer 16 may already include a borrowing application (APP) stored on the device, or the asset-information server 12 may transmit a web page for the borrower to enter information regarding the asset and requested loan. Either way, having connected to the asset-information server 12, the borrower, via the borrower's computer 16, transmits to the asset-information server 12 a document(s) 22 describing the illiquid asset 10 and asset-related information 24. The document 22 may exist in any digital format, such as PDF, WORD, EXCEL, HTML, etc., constituting a digital representation 25 of the illiquid asset. The digital representation 25 includes information confirming the borrower's financial interest in the asset 10 (e.g., title, lease income, ownership, etc.), as well as any other asset-related information 24 that the borrower may need/wish to provide to the system for asset verification, asset valuation, and decentralized loan purposes. The digital representation may also include metadata about the electronic document(s) and asset-related information.
[0052] In addition to receiving the electronic document(s) 22, including asset-related information 24 from the borrower, the asset-information server 12 may also receive additional asset-related information 26 in any format from other source(s) 18.
[0053] The asset-information server 12 may process the received digital representation of the illiquid asset (digital data representing the illiquid asset) 25, such as by an artificial intelligence engine or other methods to extract certain data, create a summary, or metadata associated with the received information.
[0054] The asset-information server 12 may then record (publish) the digital representation of the illiquid asset on the asset-information blockchain 34 of server(s) 15. Blockchains and blockchain recordation are known in the art and will not be described here in detail. For example, blockchains and blockchain recordation are explained in U.S. Pat. No. 10,873,457, the disclosure of which is incorporated herein it its entirety. After recording the digital representation of the illiquid asset on the asset-information blockchain 34, the asset-information server 12 generates an asset-information table that associates each of the various sections of the digital representation with its respective location on the blockchain 34 at which the corresponding portion is stored. FIG. 3 illustrates one such table.
[0055] FIG. 3 shows an asset-information table that associates the various sections of the illiquid assets' digital representations to their respective locations on the asset-information blockchain 34. For example, the table in FIG. 3 shows that for an illiquid asset A (reference numeral 300) the server 12 has collected four documents and/or pieces of information that form the digital representation of asset A; the title 302, rent roll information 304, zoning information 306, and liabilities 308. The table further illustrates that digital representation of the title to asset A is located on the blockchain 34 at block 1, location 1 (reference numeral 312); digital representation of the rent roll information for asset A is located at block 1, location 2 (reference numeral 314); digital representation of zoning information is located at block 2, location 10 (reference numeral 316); and digital representation of borrower's liabilities is located at block 2, location 14 (reference numeral 318). As also shown in FIG. 3 , the illiquid asset B (reference numeral 320) has its own mapping between the different sections of the digital representation of asset B and the respective locations on the asset-information blockchain 34 that contain the actual digital representations. Thus, the asset-information table can be thought of as an identification structure in which the left column designates directories of files, the middle column designates file names, and the right column designates locations on a blockchain at which the corresponding file contents are present. In addition to recording the digital representation of the illiquid asset on a blockchain, the server may also separately save the information in a database 28, central or distributed, or in its own memory.
[0056] In another embodiment, instead of recording the digital representation of an illiquid asset on the asset-information blockchain 34, the asset-information server 12 first hashes the digital representation of the illiquid asset using a hashing algorithm and then records the calculated hash values on the blockchain 34. Hashing algorithms are known in the art, and any hashing algorithm, e.g., SHA-256 algorithm, could be used to obtain a hash value of the digital representation of the illiquid asset. After recording the hash value(s) of the digital representation of an illiquid asset on the blockchain 34, the asset-information server 12 stores the digital representation either in its memory or in a database, central or distributed. (Note however, storage of the digital representation may precede recordation of its hash value on the blockchain.) Afterward, the asset-information server 12 generates an asset-information table that associates each of the various sections (portions) of the digital representation of the illiquid asset with a location on the blockchain 34 at which the corresponding hash value is stored, and also associates each section with a memory location in the database 28 storing the corresponding digital representation that was used to generate the hash value. FIG. 4 illustrates one such table.
[0057] FIG. 4 shows an asset-information table that associates the various sections of an illiquid asset's digital representation to locations on the asset-information blockchain 34 that contain the hash values of the corresponding sections, and also associates them with the respective memory locations in the database 28 where the corresponding digital representations that were used to generate those hash values are stored. For example, the table in FIG. 4 shows that for the illiquid asset A (reference numeral 300) digital representation includes four pieces of information: title 302, rent roll information 304, zoning information 306, and liabilities 308. The table also illustrates that hash value of the digital representation of title to asset A is located on the blockchain 34 at block 1, location 1 (reference numeral 412); hash value of the digital representation of the rent roll information for asset A is located at block 1, location 2 (reference numeral 414); hash value of the digital representation of zoning information is located at block 2, location 10 (reference numeral 416); and hash value of the digital representation of borrower's liabilities is located at block 2, location 14 (reference numeral 418). As further shown in FIG. 4 , the table also associates each section of the digital representation of asset A with a corresponding location in the database where the respective portion of the digital representation itself is stored. For example, digital representation of title is shown as being stored in the database 28 at location 100 (reference numeral 422); digital representation of rent roll information is shown as being stored in the database 28 at location 101 (reference numeral 424); digital representation of zoning information is shown as being stored in the database 28 at location 102 (reference numeral 426); and digital representation of borrower's liabilities is shown as being stored in the database 28 at location 103 (reference numeral 428). As also shown in FIG. 4 , the illiquid asset B (reference numeral 320) has its own mapping between the various sections of the digital representation of asset B, locations of their respective hash values on the asset-information blockchain 34, and memory locations in the database 28 containing the actual digital representations. Instead of storing the digital representations of illiquid asset on the database 28, the server may save the information in its own memory. Memory locations in the rightmost column in FIG. 4 may also be Uniform Resource Locator (URL) addresses, or any other kind of addresses pointing to local or remote storage locations. In another embodiment, in addition to recording on the blockchain 34 hash values of the various pieces (portions) of the digital representation of an illiquid asset, the system may also record on the blockchain 34 the memory locations at which those corresponding pieces are stored.
[0058] Recording a hash value of a digital representation on the asset-information blockchain 34, as opposed to recording the digital representation itself, has several advantages. One advantage relates to the size of the resulting blockchain. Specifically, because hash values typically occupy less memory space than the corresponding digital representations of the illiquid assets, a blockchain that records the hash value of the digital representation of illiquid asset occupies less memory space than a blockchain that records the digital representation itself. And, because in decentralized computer networks a copy of the blockchain is stored on multiple network nodes, having a blockchain of smaller size saves memory space on each such node. Furthermore, reducing the size of the blockchain allows for faster transmission of the blockchain across the network.
[0059] Another advantage of recording a hash value is that it allows the system to confirm that the digital representation has not been changed from the time its hash value was generated, while precluding unwanted disclosure of the corresponding content of the digital representation. Specifically, because disclosure of a hash value does not lead to disclosure of the data that was used to generate it, there is no danger in publishing hash values of digital representations. Yet, when a party requests access to a specific portion of the digital representation of the illiquid asset, e.g., title (FIG. 4 , Ref. 302) of the illiquid asset A (FIG. 4 , Ref. 300), the asset-information server 12 can retrieve the digital representation of title from location 100 in the database 28 (FIG. 4 , Ref. 422) and can also retrieve the corresponding hash value from location 1 in block 1 of blockchain 34 (FIG. 4 , Ref. 412). At that point, the asset-information server 12 can hash the retrieved digital representation (digital data) of title and compare the resulting hash value to the hash value previously recorded on the asset-information blockchain 34. If the hash values match, it signifies that the retrieved digital representation of the title is authentic, i.e., it has not been changed from the time its hash value was recorded on the blockchain, at which point the retrieved digital representation of the title can be provided to the requesting party. Authenticity of the digital representation can thus be confirmed without having to disclose its content. If, however, the hash values do not match, it signifies that the original digital representation of the title was tampered with, in which case the retrieved digital representation may be flagged for further system analysis.
[0060] In another embodiment, the invention may use a modified version of the asset-information table of FIG. 4 . Specifically, because various sections of the asset's digital representation have different binary (“0s” and “1s”) content, each section will have a different, unique, hash value. As a result, instead of listing in the table the hash values' blockchain locations, the table may list the hash values themselves. In such a scenario, the system could then scan the blockchain 34 to confirm authenticity of a specific hash value in the table. Once the hash value has been authenticated, i.e., the hash value in the table is also present on the blockchain 34, the system may then retrieve the corresponding digital representation from a memory location identified in the table, hash the retrieved digital representation, and compare the resulting hash value to the hash value in the table. If the hash values match, then the retrieved digital representation is authentic. Otherwise, the retrieved digital representation has been tampered with, in which case the data would be flagged for further analysis.
[0061] Once the digital representation of the illiquid asset or its hash value has been recorded on the blockchain 34, access to the digital representation can be protected by the asset-information server via an access-rights mechanism, such as those using public-private encryption method. Access rights may be free, or may be provided for a fee, either in fiat currency or in cryptocurrency, or based on some other consideration.
[0062] For example, when a party requests access to a document or information concerning a particular illiquid asset, the server 12 may require the party to go through an authentication process, such as requiring the party to enter its login and password information, as is typically done with many software applications today. If the login and password match the login and password information in the system, the party is granted access to the data sought. Instead of a single factor authentication, a multi-factor authentication, known in the art, may be used.
[0063] In another embodiment, instead of using a login and password, access to information may be controlled using authentication approaches known in the art, such as the Web3 authentication. A party's (public) wallet address can be whitelisted and the party can prove its identity by signing a transaction using its private key, which would prove possession of the private key, thus confirming the party's identity.
[0064] The system may implement multi-tiered access rights. For example, parties with low-tier access, may only view (read) the digital representation, but may not download or supplement it. Parties (users) with a middle-tier access may read and download the digital representation but not supplement it. And parties with high-tier access may download, read, and supplement the digital representation. In addition, the ability to modify a digital representation may depend not only on the access-tier level but also on the type of data in question. For example, while rent-roll information may be supplemented by a party (user) with the high-tier of access rights, title information may not be supplemented regardless of the party's access-tier level.
[0065] In one embodiment, access rights may be implemented on a blockchain via cryptographic tokens. For example, when recording on the blockchain either digital representations of illiquid assets or their respective hash values, the server 12 may also record a cryptographic token that would control access rights to the digital representation. Such a token may also be associated with a self-executing program that would control access rights based on various specified conditions. FIG. 2 illustrates access rights to the digital representation of an illiquid asset being implemented via an asset-information token 30.
[0066] Once the asset-information server 12 receives digital representation of an illiquid asset and generates an asset-information table, the system proceeds to verify the information and to determine accurate market value of the corresponding illiquid asset. This may be accomplished by having an automated expert system(s) 20 (human experts may also be used) access the asset's digital representation, via an access-rights mechanism discussed above, and then analyze the data. For example, an audit expert system 20, or Deloitte or KPMG accountants, may audit the digital representation of the illiquid asset to confirm veracity of the information. The audit data 32a and the results of the audit are then received by the server 12.
[0067] In an embodiment where the server records asset's digital representation on the asset-information blockchain 34 and uses the asset-information table in FIG. 3 , the received audit data and audit results for the particular asset are also recorded on the asset-information blockchain, acting as a certification of accuracy of the information contained in the digital representation. The asset-information table would then get updated to reflect the additional information. For example, once audit information regarding the digital representation of the illiquid asset A (FIG. 3 , Ref. 300) has been recorded on the information blockchain 34, asset-information table of FIG. 3 in the server 12 is updated. Specifically, a row would be added in the middle and right columns of the table for asset A. In the middle column, the added cell could refer to documents and information labeled “audit information,” and the added cell in the right column could include a location on the blockchain 34 where the digital representation of the audit information is stored.
[0068] In an embodiment where the server records hash values of the asset's digital representation on the asset-information blockchain 34 and uses the asset-information table shown in FIG. 4 , the received digital representation of the audit data and audit results for the particular asset would be hashed and the hash values recorded on the blockchain 34, with the digital representation of the audit data 32a and results being saved in the database 28 (or server's memory). The asset-information table would then get updated to reflect the additional information. For example, once the hash of digital representation of audit information for the illiquid asset A (FIG. 4 , Ref. 300) has been recorded on the information blockchain 34, asset-information table in the server 12 is updated accordingly. Specifically, a row would be added in each of the three rightmost columns of the table for asset A. In the “Asset Related Documents & Information” column, the added cell could refer to documents and information labeled “audit information.” In the “Location of Hash Value on Blockchain 34” column, the added cell would include a location of the hash value of the digital representation of audit information. In the rightmost column of the table in FIG. 4 , the added cell would list the location in the database 28 where the digital representation of the audit information is stored.
[0069] The expert system 20 may also analyze the digital representation of the illiquid asset to determine its market value. For example, for a commercial real estate asset, a real estate appraisal expert system, or human appraiser from such a firm as Cushman & Wakefield, may be used to perform an appraisal. The appraisal data is then also recorded on the asset-information blockchain 34, acting as a certification of the asset's appraised value.
[0070] In an embodiment where the server records on the asset-information blockchain 34 asset's digital representation and uses the asset-information table in FIG. 3 , the received digital representation of the appraisal data and appraisal results for the particular asset are also recorded on the asset-information blockchain 34, acting as a certification of the asset's value. The asset-information table would then get updated to reflect the additional information. For example, once an appraisal information regarding the digital representation of the illiquid asset A (FIG. 3 , Ref. 300) has been recorded on the asset-information blockchain 34, asset-information table of FIG. 3 in the server 12 is updated. Specifically, a row would be added in the middle and right columns of the table for asset A. In the middle column, the added cell could refer to documents and information labeled “appraisal information,” and the added cell in the right column could include a location on the blockchain 34 where the digital representation of this appraisal information is stored.
[0071] In an embodiment where the server records hash values of the asset's digital representation on the asset-information blockchain 34 and uses the asset-information table shown in FIG. 4 , the received appraisal data and appraisal results for the particular asset would be hashed first, the hash values recorded on the asset-information blockchain 34, with the appraisal information being saved as digital representation in the database 28 (or server's memory). The asset-information table would then get updated to reflect the appraisal information. For example, once a hash value of the digital representation of appraisal information for the illiquid asset A (FIG. 4 , Ref 300) has been recorded on the asset-information blockchain 34, asset-information table in the server 12 is updated. Specifically, a row would be added in each of the three rightmost columns of the table for asset A. In the “Asset Related Documents & Information” column, the added cell could refer to documents and information labeled “appraisal information.” In the “Location of Hash Value on Blockchain 34” column, the added cell would include a location of the hash value of the digital representation of appraisal information. In the rightmost column of the table in FIG. 4 , the added cell would list the location in the database 28 where the digital representation of the appraisal information is stored.
[0072] In addition, or as an alternative to an appraisal expert, the invention may use a pricing expert system. The pricing expert system or a human pricing agent may be used to further estimate the asset's market value. This valuation data is then recorded on the asset-information blockchain 34, acting as a certification of the asset's value.
[0073] In an embodiment where the server records on the asset-information blockchain 34 asset's digital representation and uses the asset-information table of FIG. 3 , the digital representation of the pricing data and pricing results for the particular asset are also recorded on the asset-information blockchain, acting as a certification of asset's market value. (Appraisal and pricing data can each be referred to as “valuation” data 32b.) The asset-information table would then get updated to reflect the additional information. For example, once digital representation of pricing information concerning the illiquid asset A (FIG. 3 , Ref. 300) has been recorded on the asset-information blockchain 34, asset-information table of FIG. 3 in the server 12 is updated. Specifically, as shown by arrow 307 in FIG. 3 , a row would be added in the middle and right columns of the table for asset A. In the middle column, the added cell 310 could refer to documents and information labeled “Valuation” and the added cell 320 in the right column would list a location, e.g., Block 3, location 26, on the blockchain 34 where the digital representation of the valuation data is stored.
[0074] In an embodiment where the server records on the asset-information blockchain 34 hash values of the asset's digital representation and uses the asset-information table shown in FIG. 4 , the received pricing data and pricing results for the particular asset would be hashed first, the hash values recorded on the asset-information blockchain 34, with the digital representation of the pricing data and results being saved in the database 28 (or server's memory). The asset-information table would then get updated to reflect pricing information. For example, once a hash value of the digital representation of pricing information for the illiquid asset A (FIG. 4 , Ref 300) has been recorded on the asset-information blockchain 34, asset-information table in the server 12 is updated. Specifically, as shown by arrow 407 in FIG. 4 , a row would be added in each of the three rightmost columns of the table for asset A. In the “Asset Related Documents & Information” column, the added cell 310 could refer to documents and information labeled “Valuation.” In the “Location of Hash Value on Blockchain 34” column, the added cell 420 would list a location, e.g.. Block 3, location 26, of the hash value of the digital representation of valuation information on the blockchain 34. In the rightmost column of the table of FIG. 4 , the added cell 430 would list the location, e.g., Location 104, in the database 28 where the digital representation of valuation information is stored.
[0075] The modified version of asset-information table in FIG. 4 , where instead of recording locations of hash values, the hash values themselves are recorded, would be updated similarly. Except, instead of supplementing the table with the blockchain locations storing hash values of digital representations of audit, appraisal, and/or pricing, the system would supplement the table with the actual hash values of those digital representations. Although each of FIGS. 3 and 4 shows a single asset-information table generated for multiple assets, the invention also includes an embodiment in which a separate asset-information table is generated for each asset.
[0076] Once asset-information table has been updated with the audit and appraisal, and/or pricing data, the asset-information server 12 provides the collateralization server 14 with access rights to the asset-information table and its associated information.
[0077] Access rights could be credentialed via a username and password login method. Alternatively, access rights could be credentialed by providing the collateralization server 14 with an asset-information token 30 for the asset-information blockchain 34. Asset-information token may not only include access-rights information but may also link to an asset-information table in the asset-information server 12. In another embodiment, instead of using a login and password, access to information may be controlled using authentication approaches known in the art, such as the Web3 authentication. A party's (public) wallet address can be whitelisted and the party can prove its identity by signing a transaction using its private key, which would prove possession of the private key, thus confirming the party's identity.
[0078] Once the collateralization server 14 receives access to an asset-information table, via the asset-information token 30 or otherwise, it generates an asset-value token 36 and records it on an asset-collateralization blockchain 38, which is running on a collateralization server 14 and its associated decentralized server system.
[0079] The asset-value token 36 incorporates a mechanism for accessing the asset-information table in the asset-information server 12 and the table-associated data.
[0080] For example, the asset-value token 36 may include a link to the asset-information token 30, i.e., the blockchain address (digital identifier) of the asset-information token 30 on the asset-information blockchain 34, or it may incorporate information from the received asset-information token 30.
[0081] The asset-value token 36 may be a digital rights management (DRM) token that provides access rights and points to the asset-information table, or part thereof, in the asset-information server 12.
[0082] In another embodiment, the asset-token 36 may include the audit and valuation data in addition to including DRM-type access to the corresponding asset-information table.
[0083] In yet another embodiment, the asset-token 36 may include the audit and valuation data and the blockchain address (digital identifier) of the corresponding asset-information token 30 on the asset-information blockchain 34.
[0084] The asset-value token 36 may be associated with a self-executing digital program for automated execution based on various specified conditions, such as periodically checking for any updates in the asset-information table or requesting that the asset-information table be updated with current data. Thus, while an asset-information table in the asset-information server 12 may be updated from time to time by the asset-information server 12 or a self-executing program associated with the asset-information token 30, table updates may also be initiated by the collateralization server 14 or the asset-value token 36.
[0085] In FIG. 2 , the asset-information blockchain 34 and the asset-collateralization blockchain 38 are shown as two separate blockchains, running on different blockchain platforms. For example, while the asset-collateralization blockchain 38 may run on Ethereum platform, the asset-information blockchain 34 may run on another blockchain platform. In other embodiments, however, the two blockchains may not only run on the same blockchain platform, e.g., Ethereum, but they may also be the same blockchain. In another embodiment, functions of the asset-information server 12 and of asset-collateralization server 14 may be performed by a single server. Moreover, in another embodiment, the asset-information token 30 and the asset-value token 36 may be the same token, i.e., one and the same.
[0086] Having generated the asset-value token 36, the collateralization server 14 uses a digitally programmed set of rules incorporating the determined asset value as a parameter to calculate an amount of digital currency for which the illiquid asset could serve as a collateral in a decentralized loan transaction. The rules may also take into account other parameters, such as the loan duration, interest rate, risk level, etc. The rules may also set escrow parameters for the decentralized loan transaction.
[0087] Once the possible loan amount has been determined, using digitally programmed set of rules, the collateralization server 14 generates a software object, referred to herein as a decentralized special purpose vehicle (“DSPV”) 40, that ties or associates the determined loan amount to the asset-value token 36, which in turn is associated either directly or indirectly with the digital representation of the illiquid asset, including its audit and valuation data. The software object may be a smart contract (self-executing program) programmed on a blockchain platform, e.g., Ethereum platform.
[0088] The asset-collateralization server 14 collects liquid funds for the loan and programmatically ties or associates them in the DSPV 40 to the illiquid asset, via the asset's asset-value token 36, which results in the illiquid asset being programmatically secured as collateral for the upcoming loan.
[0089] As shown in FIGS. 1 and 2 , the invention includes a funding system 44. The funding system 44 represents devices through which funders (depositors, creditors, sponsors) provide liquid funds 42, whether in cryptocurrencies or in fiat currencies, for the collateralization server to use in the decentralized loan transaction. If the funders provide funds in fiat currencies, the funds are first converted to a cryptocurrency, e.g., stablecoins (which are tied to assets like fiat currencies). The asset-collateralization server 14 uses a digitally programmed set of rules to generate various types of financial-return tokens that will provide financial returns to the various funders. Thus, as shown in FIG. 2 , the funding system 44 provides liquid funds 42 to the DSPV 40, and the collateralization server 14, through DSPV, issues financial-return tokens, such as return-interest token(s) 46 and/or governance token(s) 47 (explained below), to funders 44. Each return-interest token 46 may be associated either with 100% of the loan amount or with a fraction of the loan amount. As a result, various return-interest tokens may entitle their holders to unequal rates of interest income in return. All of this may be determined by the set of programmed rules in the collateralization server 14 and effectuated via a self-executing program in the DSPV 40. As explained below, return-interest tokens may have various seniority levels (tranches) with each tranche presumably having different interest rates. Thus, the DSVP 40 not only includes the asset-value token 36, which links and collateralizes the digital representation of the illiquid asset, but also associates the asset-value token 36 to financial-return tokens.
[0090] In one embodiment, liquid funds may be available in the asset-collateralization server 14, as part of a credit pool, even prior to generating the asset-value token 36. In another embodiment, the funds start being collected from depositors once the asset-value token gets generated in the asset-collateralization server 14 and the DSPV data structure is created. This way, potential depositors can evaluate the digital representation of the illiquid asset being collateralized and decide whether to invest their funds in a particular loan transaction. The DSPV can be used to crowdfund a particular loan project by raising funds from a large number of people over the Internet. The information in the DSPV, including the asset-value token 36 and the issued financial-returns tokens, is being recorded on the asset-collateralization blockchain 38 on an ongoing basis, as the depositors and other funders contribute funds for the decentralized loan transaction.
[0091] Once a sufficient amount of liquid funds for the loan has been collected and the DSPV is recorded on the blockchain 38, the loan is ready for distribution to the borrower's computer or his digital wallet. In another embodiment, the loaned amount of digital currency is converted to fiat currency, which is then provided to the borrower. FIG. 2 diagrammatically illustrates loaned digital funds 48 being distributed to the borrower, via borrower's computer 16 (his digital wallet), and repayments 50 being transmitted back to the DSPV 40 in the collateralization server 14, for further distribution to the funders as return interest payments through their respective interest tokens and governance tokens. All of this takes place on the asset-collateralization blockchain 38. The distribution of the loaned funds to the borrower and any repayments by the borrower are also automatically recorded on the blockchain 38 as they occur.
[0092] The present invention also contemplates updating and supplementing of the digital representation, auditing, and valuation of the illiquid asset. Such updates could be periodic or non-periodic. For example, supplemental asset-related information can be received and added to the information about the illiquid asset that is already present on the asset-information blockchain 34. Such supplemental information could come from the borrower himself/herself or it can come from other sources. In addition, the asset-information server 12 may be programmed to scan the web, including social media platforms and Internet-of-Things sensor data using web bots (also referred to as web crawlers) for any asset-related information, and record the newly found data to the asset-information blockchain 34. The data may also be crowdsourced. This way, the digital representation of an illiquid asset stays current over time, and the asset may be periodically re-valued by the expert system 20, to make sure that the loan does not become under-collateralized. The supplementation and re-valuation not only result in additional recording on the asset-information blockchain 34, but also result in the corresponding asset-information table in the server 12 being updated. Having the ability to update information about an illiquid asset in a way that guarantees data's immutability helps to monitor the collateralized value of the illiquid asset during the life of the loan and to propagate changes to the asset-value token and potential actions by the DSPV. For example, if the asset value increases, the DSPV may allow for additional funds to be borrowed. On the other hand, if the asset value decreases, funds from a sponsor may be used to cover (provide a backstop for) the loan.
[0093] Updates to the digital representation of the illiquid asset can also be initiated either by the self-executing digital program in the DSPV 40 or by the self-executing program in the asset-value token 36 itself, which forms a part of the DSPV 40. In FIG. 2 , this feature is shown via an update input 39 received by the asset-information server 12. Regardless of how the updates are initiated, the updated digital representation of the illiquid asset is available to the DSPV 40, and thus funders, for further processing and analysis.
[0094] FIG. 5 shows a conceptual diagram of the asset-information server 12 in accordance with some embodiments of the present invention. The asset-information server 12 includes a number of structural elements that perform various functions. An intake circuit 500 is communicatively coupled to the network 8 (see FIG. 1 ). The intake circuit is responsible for receiving digital electronic documents, asset-related information, output(s) of the expert system 20, outputs from collateralization server 14, etc. The digital representation may be received in various formats, such as PDF, WORD, EXCEL, HTML, bitmap, graphical, audio, etc. The invention also contemplates a natural language processing engine (NLP), which enables processing of incoming data that is unstructured. During the receiving step, the intake circuit 500 identifies the format of an incoming digital representation, so that the format information could be passed to an extraction circuit 502. Once the digital representation passes to the extraction circuit 502, the extraction circuit 502 processes it to extract relevant data, such as metadata. This may involve using an artificial intelligence engine, which may be integrated into the extraction circuit 502. After the data has been extracted, it is provided to a summary circuit 504, which integrates the extracted data into a digital representation of the illiquid asset. The digital representation can be supplemented by data from a valuation circuitry 506, which integrates the audit, appraisal, and pricing data and results from the expert system 20 into the asset's digital representation.
[0095] An output-and-recordation circuit 508 is responsible for storing the digital representation of the illiquid asset in a database 28 (or in the internal memory of the asset-information server 12), recording data on blockchains, generating asset-information token 30, as well as periodically generating signals for searching the network 8 for additional asset-related information, e.g., by generating web crawlers, etc. Although structural elements 500, 502, 504, 506, and 508 have been described as circuits, they may be implemented in hardware, software, firmware, or their combinations.
[0096] As mentioned above, the DSPV may have different funders. Some funders may be depositors whose contributions are limited to providing liquid assets for a particular DSPV loan based on a set of rules. Other funders may act as creditors, e.g., retail and institutional investors that combine their respective contributions into a pool of liquid assets that is then available for the collateralization server 14 to allocate to one or more DSPVs under a predetermined set of rules. These rules may be the same or different from the rules applied concerning depositors' investments. A creditor-funder may be entitled to a larger interest than a depositor-funder.
[0097] The invention also contemplates having a standby credit facility, where liquid funds might be obtained through banks, insurance companies, flexible deposits, and matched deposits.
[0098] Yet other funders may be referred to as sponsors. These funders may not only provide liquid funds at the start of the decentralized loan transaction but may also provide funds to cover the loan in case it might become undercollateralized in the future. Because a sponsor-funder acts as a backstop for the loan, taking on greater risk, the sponsor-funder may be entitled to a higher interest rate than a depositor-funder or a creditor-funder.
[0099] As a result, a DSPV 40 may have several tiers of return-interest tokens 46, with each tier being associated with its own percentage of return interest. For example, a first tier may be assigned to depositors, a second tier may be assigned to creditors, and a third tier may be assigned to sponsors.
[0100] Moreover, even within the same tier, there may be distinct token levels (tranches). For example, return-interest tokens 46 for depositor-funders may include senior return-interest tokens (senior level return-interest tokens) and subordinate return-interest tokens (junior level return-interest tokens), representing different positions in the DSPV 40. For example, a depositor-funder with a senior level return-interest token would be entitled to collect interest before a depositor-funder with a junior level return-interest token.
[0101] In addition to having separate tiers of interest tokens, the rules under which the asset-collateralization server 14 operates and generates DSPV 40 may be controlled by governance tokens (FIG. 2 , Ref. 47). For example, creditor-funders and/or sponsor-funders may not only have rights to collect interest income but may also have a voice in setting the rules for a decentralized loan and the types of collateral that would qualify for the loan. As a result, instead of being issued return-interest tokens 46, some funders, such as creditor-funders and/or sponsor-funders, may be issued governance tokens 47. Importantly, governance tokens 47 may represent only governance or they may represent both governance and financial-return interest.
[0102] FIGS. 6(a), 6(b) and 6(c) show a flow chart of a method in accordance with some embodiments of the invention. The process starts at Step 604 in FIG. 6(a) , with the asset-information server 12, referred to in the figure as a first server, receiving an electronic document and/or asset-related information comprising a digital representation of an illiquid asset that confirms borrowing party's financial interest in the asset. Next, at Step 606, the asset-information server 12 uses a hashing algorithm to generate a hash value of the digital representation. (If the received document and/or asset related information has multiple sections, the invention contemplates hashing the digital representations of each section, thus generating several corresponding hash values.) At Step 608, the hash value(s) is stored on an asset-information blockchain 34, referred to in the FIG. 6(a) as a first blockchain. At Step 610, the asset-information server 12 stores the digital representation of the illiquid asset at a first location (or a set of locations) in memory storage. As discussed above, the memory can be a central or distributed database, or it can be memory storage in the server 12 itself. Next, at Step 612, the system generates an asset-information table, such as the ones discussed above with reference to FIGS. 3 and 4 . At Step 614, the asset-information server 12 receives asset-valuation (audit, appraisal and/or pricing) data, in the form of a digital representation, from the expert system 20.
[0103] Proceeding to FIG. 6(b) , at Step 616, the received asset-valuation data is also stored in memory, at a second location. At Step 618, the hashing algorithm is used to hash the digital representation of the asset-valuation data, and at Step 620, the hash value(s) is stored on the asset-information blockchain 34. Then, at Step 622, the asset-information table in the asset-information server 12 is updated with the digital representation of the asset-valuation data for the asset in question. Next, at Step 624, the asset-information server 12 provides the asset-collateralization server 14 (referred to in the figure as a second server) with access to the asset-information table, which in turn provides access to the underlying digital representation for the asset in question. Having received access to the asset-information table, at Step 626 the asset-collateralization server 14 generates an asset-value token 36. At Step 628, the asset-collateralization server 14 records the asset-value token 36 on an asset-collateralization (loan) blockchain 38, referred to in the figure as a second blockchain. At step 630, the asset-collateralization server 14 generates a data structure 40, referred to in the preceding paragraphs as a DSPV, which includes a self-executing digital program and the asset-value token 36.
[0104] Proceeding to FIG. 6(c) , at Step 632, based on a set of programmed rules, the asset-collateralization server 14, directly or via the DSPV 40, determines an amount of digital currency for an automated digital loan transaction. Then, at Step 634, the amount of digital currency needed for the loan transaction is collected from funders, and the financial-return tokens are generated. Next, at Step 636, the DSPV 40 data structure, including the asset-value token and the financial-return tokens, is recorded on the asset-collateralization blockchain 38. Finally, at Step 638, the system completes the automated digital loan transaction. This includes providing the loaned amount of digital currency to the borrower's computer, activating the rights represented by the financial-return tokens and in return automatically receiving (from the borrower) interest payments on a predetermined schedule, distributing the received interest payments to funders based on their tokens, and periodically reevaluating the loan.
[0105] While the method steps disclosed in FIGS. 6(a) through 6(c) are shown in a certain sequence, as understood by a person of ordinary skill in the art (POSITA), the order of many of the steps can be changed. For example, the order of Steps 608 and 610 can be reversed. In fact, the actions of Step 610 could be taken prior to the actions in Step 606. The same can be done with the actions in Steps 616, 618, and 620.
[0106] Also, depending on the granularity of the process, token generation and token recordation could be considered a single step in general. Moreover, Steps 626 through 638 could be viewed as a part of a single method step of generating and recording a DSPV 40 data structure, comprising a self-executing program that ties an asset-value token to financial-return tokens (return-interest tokens and governance tokens).
[0107] FIG. 7 shows a server 700, whether asset-information server or asset-collateralization server, in accordance with an embodiment of the present invention. The server 700 includes a system controller 702 that is coupled to a memory subsystem 704, a processor 706, a graphics subsystem 708 and a peripheral bus controller 710. The peripheral bus controller 710 may be coupled to some elements directly and to other elements via a communication bus 722. For example, the peripheral bus controller may be coupled directly to a memory 726 via an enhanced integrated drive electronics (EIDE) interface, to a USB interface port 728, and to an audio subsystem 712. At the same time, the bus 722 may couple the peripheral bus controller 710 to a super input/output (SIO) circuit 713, flash memory 724, Ethernet port 730, a small computer system interface (SCSI) 732, an external device 734, and a wireless interface 736, such as WiFi, Bluetooth, cellular, etc. The SIO circuit 713, in turn, may be coupled to a keyboard port 714, a mouse port 716, a serial interface port 718, and a parallel interface port 720.
[0108] Thus, the asset-information server manages information about a collection of electronic documents, pertaining to assets. These documents may be provided by the asset owner or by other parties, e.g., an appraisal firm that performed the valuation of the real-estate asset. An asset may form the underlying basis for the issuance of a security, e.g., a debt security or an equity security. Information about the documents related to such a security may also be managed by the asset-information server. For example, the asset-information server may manage information about a Limited Partnership Agreement document that governs investors' participation in a real-estate deal. Thus, the present invention contemplates the asset-information server managing information about documents pertaining to any type of asset, real-estate, company stock, etc.
[0109] In one embodiment, the asset-information server is a federated-data-room server. Using the federated-data-room embodiment of the asset-information server provides at least the following advantages: i) it allows the server to operate on customers' data, while leaving the data in control of the customers and their policies, which may include data retention, destruction, anti-virus checking, permissions, etc.; and ii) it provides data traceability, i.e., proof that the customers' original data has not been tampered with, such that the original document is still being reflected through the entire process.
[0110] In managing information about electronic documents, the federated-data-room server may perform at least one of the following functions: 1) record document anchors to a blockchain, e.g., Ethereum® blockchain, 2) record to the blockchain the usage history of each document, and 3) provide access to the documents.
[0111] Anchoring Documents to a Blockchain: The federated-data-room server calculates a hash value of a portion of the contents of each document and records the hash value on a blockchain network, thus creating an immutable proof of the state of the document at the time of the recordation. As used herein, the phrase “a portion” may include the whole document. Below is an example of a hash value (in hexadecimals), generated using a SHA-256 hashing algorithm, for recording on the Ethereum® blockchain; 62d5e295c6fc99a8e9ffcc45fd6720fb9b3cOb0acf36d8cdb72be4fd87f36da3. (There are many hashing algorithms that could be used to generate the hash value, and the present invention is not limited to using any particular algorithm.) As a result, subsequent modifications to the hashed portion of the document can be detected by computing the hash value of a corresponding portion of the subsequent version of the document and comparing this hash value to the hash value of the original version recorded on the blockchain. If the two hash values match, the new version is identical to the old version.
[0112] The federated-data-room server communicates with the blockchain network via a telecommunications network, e.g., the Internet (see ref. 8 in FIG. 1 , which shows a generic asset-information server). The federated-data-room server is equipped with an appropriate network interface that enables such communication. A document anchor includes at least the following two elements: (i) a hash value of a portion of a digital representation of the electronic document; and (ii) a document identifier that identifies a row in the asset-information table, inside the federated-data-room server, which row pertains to the electronic document. In other words, the document identifier acts as an index (pointer) to a row in the asset-information table.
[0113] Recording the Usage History of Each Document: The federated-data-room server can record when each document was created/modified/accessed, by whom, what versions have been created, etc. This usage information can also be anchored to a blockchain network (i.e., the usage information can be hashed, and the resulting hash recorded on the blockchain) to provide immutable proof of the process that the document underwent.
[0114] Providing Access to the Documents: The federated-data-room server allows users to access documents after the users' proper authentication to the federated-data-room server. For example, users may enter a login name and a password. There are many other types of authentication methods (e.g., electronic security keys, biometric, multi-factor). The access permissions/access authorization of individual users and/or user groups can be determined by the owners of the documents. For example, the issuer of a security, a securities exchange, or an alternative trading system may determine which documents can be viewed by prospects, which documents can be viewed by subscribers/investors, etc. The determination can be made based on qualifications of users; for example, certain securities may be accessible only to certain types of investors (e.g., accredited investors), certain securities may be accessible only to investors from a particular jurisdiction, users may have to pass know your customer/anti-money laundering/counter-terrorist financing (KYC/AML/CTF) screenings, etc. Those of ordinary skill in the art will readily appreciate that the users accessing the documents may be humans (e.g., a human via a graphical user interface on a browser or some other application) or other computers (e.g., another server via an application programming interface or API).
[0115] FIG. 8 shows an embodiment of a decentralized computer system of the present invention using a federated-data-room server. The system 800 includes a federated-data-room server 802 that communicates over a network 804, via communication links L10, L11, L12, and L13, with a number of computer servers belonging to different organization(s) (clients A, B through X), such as server 806 (belonging to client A), server 808 (belonging to client B), and server 810 (belonging to client X). Each of the client servers is shown as being a customer's data repository (customer's data room) belonging to the corresponding client. (A customer's data repository is sometimes referred to as “customer's data room” but here we refer to it either as “customer's data repository” or “customer's repository” to avoid confusion with the term “federated data room,” which is implemented in the invented federated-data-room server.) For example, server 806 is shown as having a repository of data, i.e., electronic document(s), belonging to client A, server 808 is shown as having a repository of data belonging to client B, and server 810 is shown as having a repository of data belonging to client X. The servers 806, 808, and 810 are shown as having different domain names, conceptually depicted as “Domain 1,” for server 806, “Domain 2” for server 808, and “Domain N” for server 810. Importantly, the owner of the federated-data-room server 802 does not own and/or control client-owned data. Assuming that different domain names belong to different parties, the domain of the federated-data-room server 802 is different from the domains of the client servers 806, 808, and 810.
[0116] The federated-data-room server maintains an asset-information table that includes an entry (row) for each electronic document or for each section of the electronic document. The table entries may optionally be grouped by the asset to which the documents pertain; the asset may be included explicitly in the table row for a document, or it may be stored separately. The asset-information table is indexed, so that the row pertaining to an individual document can be referenced. The index can identify a row (location) in the table by an explicit row identifier, by an offset from the beginning of the table, or by any other method. In one embodiment, the rows in the asset-information table can be referenced through a URL.
[0117] Each row in the asset-information table may contain some or all of the following information for a document; a) an asset to which the document pertains; b) document category; c) document name; d) hash value (checksum) of the contents of the document; e) location descriptor designating a location of the document; f) transaction hash (or other information, for example, blockchain location where the transaction was recorded) that identifies, and enables the retrieval of, the anchoring transaction on the blockchain; etc. Regarding the location descriptor, it can be a pointer to a location in (i) a file system that is local to the federated-data-room server; (ii) a separate storage server that is under the same administrative control as the federated-data-room server; (iii) a storage server that is under the administrative control of a different organizational entity than the organizational entity to which the federated-data-room server belongs. e.g., customer organization; or (iv) anywhere else. The pointer can use any format known in the art, e.g., a URL that points to the location where the document is stored.
[0118] The row entries of the asset-information table may include additional fields. Furthermore, some of the fields mentioned above may be redundant relative to each other. For example, since document hashes are unique, one could search the blockchain for the hash value of a document and locate the corresponding anchoring transaction, thus obviating the need to store explicit information about the anchoring transaction in the asset-information table. Conversely, the document hash can be retrieved from the anchoring transaction, thus obviating the need to store the document hash explicitly in the asset-information table. Furthermore, the uniqueness of document hashes allows them to also serve as a row identifier (index) for the asset-information table. Some redundancy in the storage of information may be desirable for performance reasons (e.g., to avoid look-ups).
[0119] FIG. 9 depicts an asset-information table in accordance with an embodiment of the present invention that could be implemented in the federated-data-room server. The table 900 includes a number of rows, with each row pertaining to a different electronic document (or a section of the document). Each row in the table 900 has number of fields and is indexed by a unique row identifier (document identifier) that acts as a pointer into the corresponding row.
[0120] In FIG. 9 , each row is shown as having six fields, creating a six-column asset-information table. Going from left to right, the leftmost column, called “Asset” (ref. 902), provides information about an asset to which a document in a particular row pertains. The next column, called “Document Category” (ref 904), provides information about a document-category into which the document falls. The next column, called “Document Name” (ref 906), designates the name of the corresponding document. The next column, called “Document Hash Value” (ref. 908), designates a hash value of the digital representation of the corresponding document. The next column, called “Document Location Descriptor” (ref. 910), also referred to as “location descriptor,” designates a location of the corresponding document, possibly in a client's data repository. (Note, a location descriptor listed in the table may change over time, such as when the path to the document in the customer's repository changes.) The rightmost column, called “Anchoring B-chain Tx-ID (or Location)” (ref. 912), designates a blockchain transaction identifier or a location on the blockchain where at least the corresponding document's hash value and document/row identifier (i.e., index to the relevant row in the asset information table) are recorded.
[0121] For example, “Row1 Identifier” (ref. 920) points to the first document-related row of the table, which means that it represents an address of that row in the federated-data-room server. Looking at the various fields of the row in question, we can see that the row pertains to a document that. (i) concerns asset “A” (ref. 922), (ii) belongs to a document category called “Title” (ref. 924), (iii) is named “TTL” (ref 926), (iv) has a hash value ha1 (ref 928) represented as a hexadecimal value, (v) is located at “location 1 of administrative domain 1” (ref. 930), and (vi) at least the hash value ha1 (ref. 928) and the index “Row1 Identifier” (ref. 920) for this document were recorded on a blockchain in a transaction with identifier “Tx-IDa1.”
[0122] As new information about an asset is collected (e.g., additional information provided by the asset owner, appraisal generated by an appraisal firm, etc.), new rows can be added to the asset-information table shown in FIG. 9 , in a manner analogous to the addition of rows to the asset-information tables described in FIGS. 3 and 4 above.
[0123] The above-described server and its method of use allow the producers of data to hold on to their data, keep it under their control, apply their rules/regulations/policies, but still achieve the benefits of having the data networked.
[0124] For the federated-data-room server to have access to a customer's data residing in a customer-controlled repository, a trusted channel is required. Such a channel can be created by credentialing the federated-data-room server via a secret-sharing scheme, passwords, an API session key, etc.
[0125] Moreover, a customer could limit the federated-data-room server's access to just a folder or certain subfolders in the customer's repository, such as by providing links and/or access permission to the respective folder or subfolders.
[0126] The present invention facilitates workflows, e.g., valuations, listing of securities, waterfall calculations in business applications, etc. For example, as illustrated in FIG. 2 , the asset-information server (ref. 12) may obtain information from various sources, such as a borrower (customer) (ref. 16), external information sources (ref. 18), experts (users) (ref. 20), etc. Some or all of the input data may be unstructured/disorganized. The asset-information server of the present invention can receive this mass of unstructured/disorganized data and organize/structure it (e.g., by extracting and arranging) in a way that speeds up the workflow at issue, while generating proof that the organizing/structuring steps did not alter the original data in the process.
[0127] In addition, the invented server may enrich the data in various ways, such as by detecting anomalies, improving the quality of the data, improving data accuracy, etc. This, in turn, allows users, e.g., appraisers, experts, et al., to do their work more accurately, more efficiently, and less expensively.
[0128] As explained with respect to FIG. 5 above, in one embodiment, the invented server 12 may include an intake circuit 500 that intakes digital data from various sources and passes it on to an extraction circuit 502. The extraction circuit 502, which may include an artificial intelligence (AI) engine, processes the received data and passes it on to a summary circuit 504 for integration. The resulting digital representation, which may be supplemented by data from a valuation circuit 506, is then sent to the output-and-recordation circuit 508.
[0129] FIG. 10 illustrates a federated-data-room server embodiment of the invented asset-information server to generate structured data, also referred to as “activated data,” in more detail. FIG. 10 depicts a customer enterprise 1002 having its data stored in a customer-controlled repository 1006, such as Box cloud storage. OneDrive cloud storage, secure file transfer protocol (SFTP) storage, etc. FIG. 10 illustrates two other data feeds, an external data feed 1004, which provides external data, such as economic data from the Federal Reserve Economic Data (FRED) database, and a user data feed 1008, which provides user-entered or uploaded data. The federated-data-room server has an unprocessed data storage 1010 that includes a data feed cache and a federated data room, the latter having an asset-information table, such as the one described above in connection with FIG. 9 . The invented server further includes a data configurator 1012 that is coupled to the server's data dictionary 1014. The data dictionary 1014 keeps track of which fields/elements are relevant for which applications and customers and what the characteristics (logical and technical) of such fields/elements are. For example, the characteristics may include (i) element definitions for humans to use, grouping them in semantically related ways (e.g., last name, first name, and middle initials go together), etc. (ii) technical characteristics of information; as well as other characteristics. As a result, the data dictionary 1014 captures semantic knowledge about the application in question. The data configurator 1012 helps specify these fields/elements (which are captured in the data dictionary).
[0130] The unprocessed data from block 1010 of the federated-data-room server is combined with the templates from the data dictionary 1014 in the server's processing block 1016 to generate structured data. For example, block 1016 may include an Artificial Intelligence (AI) component 1017a, which identifies data elements in the data dictionary 1014 that are relevant to the application in question and that need to be extracted from the unstructured data. For example, if the application is rent-roll processing, then the AI component 1017a of block 1016 would identify in the data dictionary 1014 the data elements related to rent roll, thereby creating a rent-roll template whose fields would need to be filled by analyzing the unprocessed data coming from block 1010. In one embodiment, the template retrieved or created from the data dictionary is represented in a Java Script Object Notation (JSON). In analyzing the unprocessed data, the AI component 1017a may use natural language processing, machine learning, etc., (possibly with human intervention) to extract the relevant information from the received unprocessed data to populate the fields of the template.
[0131] Because the data dictionary captures semantic knowledge about the application, the system conforms the unstructured data to that semantic knowledge, to impart semantic knowledge to the unstructured data in a way that is consistent across different customers. This may be accomplished by generating an overlay that annotates the original information or system-produced summary. For example, if the unstructured data is received as a portable data format (PDF) file, the server may take advantage of the format's “layering” property to generate structured data. Specifically, the unstructured data is treated as an original information layer. Then, the system defines an overlay layer that annotates the original information layer. The overlay layer may include human traceable features (e.g., colored polygon around an area) and associated metadata, such as a link for tracing the data's origin. The resulting annotated PDF file is a new, structured-data version of the original PDF file. The JSONs and/or links may be sent along with the data for further processing to internal and external parties, e.g., an appraiser, possibly using an application programming interface (API) ingestion element 1017b. The resulting output is a structured (activated) data, which is shown as element 1018. The activated data, e.g., presented as JSONs, may itself be made federated by having it reside in the customer's data repository 1006 under customer's control, etc. To allow traceability back to the original document, the system may record each step of the process on a blockchain. This makes the data immutable and creates proof of the process steps that were performed along the way.
[0132] One example of using the federated-data-room server is where a customer registers its electronic documents (data files) with the customer data repository and credentials the federated-data-room server to have access to the data, such as via a link. A user, who may be a member of the customer's organization, logs onto the federated-data-room server, creates a deal, sets up an associated federated data room for the deal, and identifies a set of relevant registered data files and/or locations where the relevant data resides, which locations may be remote in the customer's data repository. The server can access the registered data file, store the file name in its own memory, and can even rename the file internally, without moving or changing it on the customer repository's side. As disclosed above, the server includes an asset-information table comprising a set of indexed rows, with each row comprising various fields for a corresponding document. For example, an asset-information table entry (row) includes a document's location descriptor, possibly comprising an address of the document on the network (direct addressing), which could be a URL address of the document in the customer repository/data room. Document descriptor could also be a link to a location that contains the address of the document in customer's repository, i.e., indirect addressing. As explained above, each table row is indexed with a row identifier (document identifier), such that the document identifier, which could be a URL, serves as a pointer to the asset-information table for referencing the corresponding document. The federated-data-room server hashes a portion of the content of the document and records on a blockchain the resulting hash value and the document identifier, together with a timestamp of the recordation. The recordation of the timestamp may be automatic by the blockchain. The next time the document is accessed via the server's federated data room, the document is retrieved from its resting place and the document's immutability can be confirmed by comparing the hash value stored on the blockchain to the hash value computed from the retrieved file. Other fields of the table row could also be recorded on the blockchain. Note, however, that when only the hash value and the row identifier (document identifier) for the document are recorded on the blockchain, without recording of the location descriptor, there is no information leakage (nobody knows to which customer, let alone to which file of that customer, the recorded hash applies). Regardless, the federated-data-room server acts as a gatekeeper of the documents.
[0133] To ensure that a file is still at the location listed in the asset-information table and has not changed, the federated-data-room server may periodically (e.g., nightly, weekly, monthly, quarterly, etc.) access the file, e.g., via a link, from the address in the customer's data repository. For example, the file may no longer be accessible due to a password change, a file deletion, a move to a different location, etc.
[0134] The federated-data-room server may periodically check every document referenced in its asset-information table by retrieving from the customer's repository all (or several of) the customer's documents as a group; for example, the federated-data-room server may retrieve all documents in a particular folder in the customer's repository with a single request to increase efficiency. Alternatively, the periodic check could be limited to document retrieval one document at a time. In another embodiment, the periodic check could be limited to a “quick sanity check” of the last touch date and file size, e.g., in bytes. In yet another embodiment, where periodic hashing of the file is performed by a customer's data repository, the federated-data-room server may merely periodically retrieve the customer-calculated hash value from the customer's data repository and compare it to the hash value recorded on the blockchain.
[0135] Regardless of an embodiment of the asset-information server of the present invention, the asset-information server may manage and perform the above-described functions for other, non-asset related, types of information, e.g., for documents that are related to medical or engineering fields, etc.
[0136] Exemplary embodiments may be applied to any processor-controlled device operating in the wired or radio-frequency domain. Exemplary embodiments may be applied to any processor-controlled device utilizing a distributed computing network, such as the Internet (sometimes alternatively known as the “World Wide Web”), an intranet, a local-area network (LAN), and/or a wide-area network (WAN). Exemplary embodiments may be applied to any processor-controlled device utilizing power line technologies, in which signals are communicated via electrical wiring. Indeed, exemplary embodiments may be applied regardless of physical componentry, physical configuration, or communications standard(s).
[0137] Exemplary embodiments may utilize any processing component, configuration, or system. Any processor could be multiple processors, which could include distributed processors or parallel processors in a single machine or multiple machines. The processor can be used in supporting a virtual processing environment. The processor could include an application specific integrated circuit (ASIC), programmable gate array (PGA) including a Field PGA, or state machine. When any of the processors execute instructions to perform “operations,” this could include the processor performing the operations directly and/or facilitating, directing, or cooperating with another device or component to perform the operations.
[0138] Exemplary embodiments may packetize. The servers may have network interfaces to the various communications networks, thus allowing transmittal and retrieval of information. The information may be received as packets of data according to a packet protocol (such as the Internet Protocol). The packets of data contain bits or bytes of data describing the contents, or payload, of a message. A header of each packet of data may contain routing information identifying an origination address and/or a destination address.
[0139] The present invention can operate with escrow bots that function as self-executing digital programs that release/loan digital funds when required conditions, such as third party and crowdsourced data from a variety of sources, are met. These sources can be mobile phone, social media, and Internet-of-Things sensors.
[0140] While the foregoing descriptions disclose specific values, any other values may be used to achieve similar results. Furthermore, the various features of the foregoing embodiments may be selected and combined to produce numerous variations of improved systems.
[0141] In the foregoing specification, specific embodiments have been described. However, one of ordinary skill in the art appreciates that various modifications and changes can be made without departing from the scope of the invention as set forth in the claims below. Accordingly, the specification and figures are to be regarded as illustrative rather than restrictive, and all such modifications are intended to be included within the scope of present teachings.
[0142] Moreover, in this document, relational terms such as first and second, top and bottom, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any such specific relationship or order between such entities or actions. The terms “comprises,” “comprising,” “has”, “having,” “includes”, “including,” “contains”. “containing” or any other variation thereof, are intended to cover a non-exclusive implementation, such that a process, method, article, or apparatus that comprises, has, includes, contains a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element preceded by “comprises . . . a”, “has . . . a”, “includes . . . a”, “contains . . . a” does not, without more constraints, preclude the existence of additional identical elements in the process, method, article, or apparatus that comprises, has, includes, contains the element. The terms “a” and “an” are defined as one or more unless explicitly stated otherwise herein. The terms “substantially”. “essentially”, “approximately”, “about” or any other version thereof, are defined as being close to as understood by one of ordinary skill in the art. The term “coupled” as used herein is defined as connected, although not necessarily directly and not necessarily mechanically. A device or structure that is “configured” in a certain way is configured in at least that way but may also be configured in ways that are not listed.
[0143] The Abstract of the Disclosure is provided to allow the reader to quickly ascertain the nature of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, it can be seen that various features are grouped together in various embodiments for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus, the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separately claimed subject matter.
Claims
What is claimed is:
1. A method of using a federated-data-room server in a blockchain environment, the method comprising:
receiving, by the federated-data-room server, an electronic file from a first network location, the first network location being non-local to the federated-data-room server;
hashing, by the federated-data-room server, a first portion of the electronic file, thereby generating a first hash value, the first portion being less than 100% of the electronic file,
wherein the first hash value (i) is smaller in size than the electronic file, and (ii) enables a confirmation of immutability of the electronic file;
without storing the electronic file, in an asset-information table located inside the federated-data-room server and comprising a number of indexed rows: (i) storing by the federated-data-room server the first hash value in a hash-value field, and (ii) storing by the federated-data-room server a location descriptor, that is associated with the first network location, in a location-descriptor field;
recording, by the federated-data-room server, on a blockchain the first hash value and a row index, without recording the electronic file;
receiving, by the federated-data-room server, a request, from a requestor at a second network location, for access to the electronic file, the second network location being different from the network location of the federated-data-room server;
determining, by the federated-data-room server, whether the requestor is authorized to access the electronic file; and
based on the result of the determining step, providing, by the federated-data-room server, access to the electronic file.
2. The method of claim 1, further comprising fetching the electronic file from the first network location.
3. The method of claim 2, further comprising:
hashing, by the federated-data-room server, a second portion of the fetched electronic file, thereby generating a second hash value, wherein the second portion of the fetched electronic file corresponds to the first portion of the received electronic file; and
comparing the first hash value with the second hash value.
4. The method of claim 3, wherein the steps of (a) fetching the electronic file, (b) hashing a second portion of the fetched electronic file, and (c) comparing the first hash value and the second hash value, are performed periodically.
5. The method of claim 1, wherein providing access to the electronic file comprises at least one of (i) allowing reading of the electronic file, (ii) allowing updating of an existing content of the electronic file, and (iii) allowing writing of an additional content to the electronic file.
6. The method of claim 1, wherein the row index is a uniform resource locator (URL) address.
7. The method of claim 1, wherein the location descriptor is the first network location.
8. A federated-data-room server in a blockchain environment, the federated-data-room server comprising:
a hardware processor; and
a memory storing instructions that, when executed by the hardware processor, cause the hardware processor to perform a set of operations comprising:
receiving an electronic file from a first network location, the first network location being non-local to the federated-data-room server;
hashing a first portion of the electronic file, thereby generating a first hash value, the first portion being less than 100% of the electronic file,
wherein the first hash value (i) is smaller in size than the electronic file, and (ii) enables a confirmation of immutability of the electronic file;
without storing the electronic file, in an asset-information table located inside the federated-data-room server and comprising a number of indexed rows: (i) storing the first hash value in a hash-value field, and (ii) storing a location descriptor, that is associated with the first network location, in a location-descriptor field;
recording on a blockchain the first hash value and a row index, without recording the electronic file;
receiving a request, from a requestor at a second network location, for access to the electronic file;
determining whether the requestor is authorized to access the electronic file; and
based on the result of the determining step, providing, access to the electronic file.
9. The federated-data-room server of claim 8, wherein the set of operations further comprises fetching the electronic file from the first network location.
10. The federated-data-room server of claim 9, wherein the set of operations further comprises:
hashing a second portion of the fetched electronic file, thereby generating a second hash value, wherein the second portion of the fetched electronic file corresponds to the first portion of the received electronic file; and
comparing the first hash value with the second hash value.
11. The federated-data-room server of claim 10, wherein the operations of (a) fetching the electronic file, (b) hashing a second portion of the fetched electronic file, and (c) comparing the first hash value and the second hash value, are performed periodically.
12. The federated-data-room server of claim 8, wherein the operation of providing access to the electronic file comprises at least one of (i) allowing reading of the electronic file, (ii) allowing updating of an existing content of the electronic file, and (iii) allowing writing of an additional content to the electronic file.
13. The federated-data-room server of claim 8, wherein the row index is a uniform resource locator (URL) address.
14. The federated-data-room server of claim 8, wherein the location descriptor is the first network location.
15. A non-transitory memory storing instructions that, when executed by a federated data-room-server, cause the federated data-room-server to perform a set of operations comprising:
receiving an electronic file from a first network location, the first network location being non-local to the federated-data-room server;
hashing a first portion of the electronic file, thereby generating to-generate-a first hash value, the first portion being less than 100% of the electronic file,
wherein the first hash value (i) is smaller in size than the electronic file, and (ii) enables a confirmation of immutability of the electronic file;
without storing the electronic file, in an asset information table located inside the federated-data-room server and comprising a number of indexed rows: (i) storing the first hash value in a hash-value field, and (ii) storing a location descriptor, that is associated with the first network location, in a location-descriptor field;
recording on a blockchain the first hash value and a row index, without recording the electronic file;
receiving a request from a requestor at a second network location for access to the electronic file;
determining whether the requestor is authorized to access the electronic file; and
based on the result of the determining step, providing access to the electronic file.
16. The non-transitory memory of claim 15, wherein the set of operations further comprises fetching the electronic file from the first network location.
17. The non-transitory memory of claim 16, wherein the set of operations further comprises:
hashing a second portion of the fetched electronic file, thereby generating a second hash value, wherein the second portion of the fetched electronic file corresponds to the first portion of the received electronic file; and
comparing the first hash value with the second hash value.
18. The non-transitory memory of claim 17, wherein the operations of (a) fetching the electronic file, (b) hashing a second portion of the fetched electronic file, and (c) comparing the first hash value and the second hash value, are performed periodically.
19. The non-transitory memory of claim 15, wherein the operation of providing access to the electronic file comprises at least one of (i) allowing reading of the electronic file, (ii) allowing updating of an existing content of the electronic file, and (iii) allowing writing of an additional content to the electronic file.
20. The non-transitory memory of claim 15, wherein the row index is a uniform resource locator (URL) address.
21. The non-transitory memory of claim 15, wherein the location descriptor is the first network location.
Patent Citations (491)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4309569(A) | 1982-01-01 | Merkle | Applicant |
| US5499294(A) | 1996-03-01 | Friedman | Applicant |
| US5606609(A) | 1997-02-01 | Houser | Applicant |
| US5862218(A) | 1999-01-01 | Steinberg | Applicant |
| US5920629(A) | 1999-07-01 | Rosen | Applicant |
| US5966446(A) | 1999-10-01 | Davis | Applicant |
| US6363481(B1) | 2002-03-01 | Hardjono | Applicant |
| US7028263(B2) | 2006-04-01 | Maguire | Applicant |
| US7212808(B2) | 2007-05-01 | Eric | Applicant |
| US7272179(B2) | 2007-09-01 | Siemens | Applicant |
| US7572179(B2) | 2009-08-01 | Choi | Applicant |
| US7729950(B2) | 2010-06-01 | Mendizabal | Applicant |
| US7730113(B1) | 2010-06-01 | Payette | Applicant |
| US8245038(B2) | 2012-08-01 | Golle | Applicant |
| US8266439(B2) | 2012-09-01 | Haber | Applicant |
| US8359361(B2) | 2013-01-01 | Thornton | Applicant |
| US8442903(B2) | 2013-05-01 | Zadoorian | Applicant |
| US8560722(B2) | 2013-10-01 | Gates | Applicant |
| US8612477(B2) | 2013-12-01 | Becker | Applicant |
| US8706616(B1) | 2014-04-01 | Flynn | Applicant |
| US8712887(B2) | 2014-04-01 | Degroeve | Applicant |
| US8867741(B2) | 2014-10-01 | Mccorkindale | Applicant |
| US8943332(B2) | 2015-01-01 | Horne | Applicant |
| US8990322(B2) | 2015-03-01 | Cai | Applicant |
| US9124423(B2) | 2015-09-01 | Jennas, II | Applicant |
| US9378343(B1) | 2016-06-01 | David | Applicant |
| US9396006(B2) | 2016-07-01 | Kundu | Applicant |
| US9398018(B2) | 2016-07-01 | Macgregor | Applicant |
| US9407431(B2) | 2016-08-01 | Bellare | Applicant |
| US9411524(B2) | 2016-08-01 | Mark | Applicant |
| US9411976(B2) | 2016-08-01 | Irvine | Applicant |
| US9411982(B1) | 2016-08-01 | Dippenaar | Applicant |
| US9424576(B2) | 2016-08-01 | Vandervort | Applicant |
| US9436923(B1) | 2016-09-01 | Sriram | Applicant |
| US9436935(B2) | 2016-09-01 | Hudon | Applicant |
| US9472069(B2) | 2016-10-01 | Roskowski | Applicant |
| US9489827(B2) | 2016-11-01 | Quinn | Applicant |
| US9584493(B1) | 2017-02-01 | Leavy | Applicant |
| US9588790(B1) | 2017-03-01 | Wagner | Applicant |
| US9647977(B2) | 2017-05-01 | Levasseur | Applicant |
| US9722790(B2) | 2017-08-01 | Ebrahimi | Applicant |
| US9818109(B2) | 2017-11-01 | Loh | Applicant |
| US9830580(B2) | 2017-11-01 | Macgregor | Applicant |
| US9875510(B1) | 2018-01-01 | Kasper | Applicant |
| US9876646(B2) | 2018-01-01 | Ebrahimi | Applicant |
| US9882918(B1) | 2018-01-01 | Ford | Applicant |
| US10025941(B1) | 2018-07-01 | Griffin | Applicant |
| US10046228(B2) | 2018-08-01 | Tran | Applicant |
| US10102265(B1) | 2018-10-01 | Madisetti | Applicant |
| US10102526(B1) | 2018-10-01 | Madisetti | Applicant |
| US10108954(B2) | 2018-10-01 | Dunlevy | Applicant |
| US10135607(B1) | 2018-11-01 | Roets | Applicant |
| US10135609(B2) | 2018-11-01 | Bibera | Examiner |
| US10163080(B2) | 2018-12-01 | Chow | Applicant |
| US10270599(B2) | 2019-04-01 | Nadeau | Applicant |
| US10346815(B2) | 2019-07-01 | Glover | Applicant |
| US10355869(B2) | 2019-07-01 | Bisti | Applicant |
| US10366204(B2) | 2019-07-01 | Tanner, Jr. | Applicant |
| US10373129(B1) | 2019-08-01 | James | Applicant |
| US10411897(B2) | 2019-09-01 | Paolini-Subramanya | Applicant |
| US10419225(B2) | 2019-09-01 | Deery | Applicant |
| US10438285(B1) | 2019-10-01 | Konstantinides | Applicant |
| US10476847(B1) | 2019-11-01 | Smith | Applicant |
| US10532268(B2) | 2020-01-01 | Tran | Applicant |
| US10586270(B2) | 2020-03-01 | Reddy | Applicant |
| US10628268(B1) | 2020-04-01 | Baruch | Applicant |
| US10657151(B2) | 2020-05-01 | Qiu | Applicant |
| US10685399(B2) | 2020-06-01 | Snow | Applicant |
| US10693652(B2) | 2020-06-01 | Nadeau | Applicant |
| US10726346(B2) | 2020-07-01 | Saxena | Applicant |
| US10749848(B2) | 2020-08-01 | Voell | Applicant |
| US10764752(B1) | 2020-09-01 | Avetisov | Applicant |
| US10783164(B2) | 2020-09-01 | Snow | Applicant |
| US10817873(B2) | 2020-10-01 | Paolini-Subramanya | Applicant |
| US10826685(B1) | 2020-11-01 | Campagna | Applicant |
| US10841372(B1) | 2020-11-01 | Ram | Applicant |
| US10855446(B2) | 2020-12-01 | Ow | Applicant |
| US10873457(B1) | 2020-12-01 | Beaudoin | Applicant |
| US10915895(B1) | 2021-02-01 | Fogg | Applicant |
| US10929842(B1) | 2021-02-01 | Arvanaghi | Applicant |
| US10949926(B1) | 2021-03-01 | Call | Applicant |
| US10956973(B1) | 2021-03-01 | Chang | Applicant |
| US10958418(B2) | 2021-03-01 | Ajoy | Applicant |
| US10997159(B2) | 2021-05-01 | Futoshi | Applicant |
| US11042871(B2) | 2021-06-01 | Snow | Applicant |
| US11044095(B2) | 2021-06-01 | Lynde | Applicant |
| US11044097(B2) | 2021-06-01 | Snow | Applicant |
| US11044100(B2) | 2021-06-01 | Deery | Applicant |
| US11063770(B1) | 2021-07-01 | Peng | Examiner |
| US11075744(B2) | 2021-07-01 | Tormasov | Applicant |
| US11093933(B1) | 2021-08-01 | Peng | Applicant |
| US11134120(B2) | 2021-09-01 | Snow | Applicant |
| US11164250(B2) | 2021-11-01 | Snow | Applicant |
| US11164254(B1) | 2021-11-01 | Gordon, III | Applicant |
| US11170366(B2) | 2021-11-01 | Snow | Applicant |
| US11171782(B2) | 2021-11-01 | Tang | Examiner |
| US11205172(B2) | 2021-12-01 | Snow | Applicant |
| US11276056(B2) | 2022-03-01 | Snow | Applicant |
| US11295296(B2) | 2022-04-01 | Snow | Applicant |
| US11296889(B2) | 2022-04-01 | Snow | Applicant |
| US11328290(B2) | 2022-05-01 | Snow | Applicant |
| US11334874(B2) | 2022-05-01 | Snow | Applicant |
| US11347769(B2) | 2022-05-01 | Snow | Applicant |
| US11348097(B2) | 2022-05-01 | Snow | Applicant |
| US11348098(B2) | 2022-05-01 | Snow | Applicant |
| US11423398(B1) | 2022-08-01 | Mullins | Applicant |
| US2001/0029482(A1) | 2001-10-01 | Tealdi | Applicant |
| US2003/0018563(A1) | 2003-01-01 | Kilgour | Applicant |
| US2004/0085445(A1) | 2004-05-01 | Park | Applicant |
| US2004/0168052(A1) | 2004-08-01 | Clisham | Applicant |
| US2005/0206741(A1) | 2005-09-01 | Raber | Applicant |
| US2006/0075228(A1) | 2006-04-01 | Black | Applicant |
| US2006/0184443(A1) | 2006-08-01 | Erez | Applicant |
| US2007/0027787(A1) | 2007-02-01 | Tripp | Applicant |
| US2007/0094272(A1) | 2007-04-01 | Yeh | Applicant |
| US2007/0174630(A1) | 2007-07-01 | Shannon | Applicant |
| US2007/0294235(A1) | 2007-12-01 | Millett | Examiner |
| US2007/0296817(A1) | 2007-12-01 | Ebrahimi | Applicant |
| US2008/0010466(A1) | 2008-01-01 | Hopper | Applicant |
| US2008/0028439(A1) | 2008-01-01 | Shevade | Applicant |
| US2008/0059726(A1) | 2008-03-01 | Rozas | Applicant |
| US2009/0025063(A1) | 2009-01-01 | Thomas | Applicant |
| US2009/0287597(A1) | 2009-11-01 | Bahar | Applicant |
| US2010/0049966(A1) | 2010-02-01 | Kato | Applicant |
| US2010/0058476(A1) | 2010-03-01 | Isoda | Applicant |
| US2010/0161459(A1) | 2010-06-01 | Kass | Applicant |
| US2010/0228798(A1) | 2010-09-01 | Kodama | Applicant |
| US2010/0241537(A1) | 2010-09-01 | Kass | Applicant |
| US2011/0061092(A1) | 2011-03-01 | Bailloeul | Applicant |
| US2011/0161674(A1) | 2011-06-01 | Ming | Applicant |
| US2011/0199469(A1) | 2011-08-01 | Gallagher | Applicant |
| US2012/0059824(A1) | 2012-03-01 | Simon | Applicant |
| US2012/0203670(A1) | 2012-08-01 | Piersol | Applicant |
| US2012/0264520(A1) | 2012-10-01 | Marsland | Applicant |
| US2013/0142323(A1) | 2013-06-01 | Chiarella | Applicant |
| US2013/0222587(A1) | 2013-08-01 | Roskowski | Applicant |
| US2013/0275765(A1) | 2013-10-01 | Lay | Applicant |
| US2013/0276058(A1) | 2013-10-01 | Buldas | Applicant |
| US2014/0022973(A1) | 2014-01-01 | Kopikare | Applicant |
| US2014/0201541(A1) | 2014-07-01 | Paul | Applicant |
| US2014/0229738(A1) | 2014-08-01 | Sato | Applicant |
| US2014/0279762(A1) | 2014-09-01 | Xaypanya | Applicant |
| US2014/0282852(A1) | 2014-09-01 | Vestevich | Applicant |
| US2014/0289802(A1) | 2014-09-01 | Lee | Applicant |
| US2014/0297447(A1) | 2014-10-01 | O'Brien | Applicant |
| US2014/0344015(A1) | 2014-11-01 | Puértolas-Montañés | Applicant |
| US2015/0052615(A1) | 2015-02-01 | Gault | Examiner |
| US2015/0193633(A1) | 2015-07-01 | Chida | Applicant |
| US2015/0206106(A1) | 2015-07-01 | Yago | Applicant |
| US2015/0242835(A1) | 2015-08-01 | Vaughan | Applicant |
| US2015/0244729(A1) | 2015-08-01 | Mao | Applicant |
| US2015/0309831(A1) | 2015-10-01 | Powers | Applicant |
| US2015/0332256(A1) | 2015-11-01 | Minor | Applicant |
| US2015/0363769(A1) | 2015-12-01 | Ronca | Applicant |
| US2015/0378627(A1) | 2015-12-01 | Kitazawa | Applicant |
| US2015/0379484(A1) | 2015-12-01 | Mccarthy | Applicant |
| US2016/0002923(A1) | 2016-01-01 | Alobily | Applicant |
| US2016/0012240(A1) | 2016-01-01 | Smith | Applicant |
| US2016/0021743(A1) | 2016-01-01 | Pai | Applicant |
| US2016/0071096(A1) | 2016-03-01 | Rosca | Applicant |
| US2016/0085955(A1) | 2016-03-01 | Lerner | Applicant |
| US2016/0098578(A1) | 2016-04-01 | Hincker | Applicant |
| US2016/0119134(A1) | 2016-04-01 | Hakoda | Applicant |
| US2016/0148198(A1) | 2016-05-01 | Kelley | Applicant |
| US2016/0162897(A1) | 2016-06-01 | Feeney | Applicant |
| US2016/0217436(A1) | 2016-07-01 | Brama | Applicant |
| US2016/0239653(A1) | 2016-08-01 | Loughlin-Mchugh | Applicant |
| US2016/0253663(A1) | 2016-09-01 | Clark | Applicant |
| US2016/0260091(A1) | 2016-09-01 | Tobias | Applicant |
| US2016/0267472(A1) | 2016-09-01 | Lingham | Applicant |
| US2016/0267558(A1) | 2016-09-01 | Bonnell | Applicant |
| US2016/0275294(A1) | 2016-09-01 | Irvine | Applicant |
| US2016/0283920(A1) | 2016-09-01 | Fisher | Applicant |
| US2016/0292396(A1) | 2016-10-01 | Akerwall | Applicant |
| US2016/0292672(A1) | 2016-10-01 | Fay | Applicant |
| US2016/0292680(A1) | 2016-10-01 | Wilson, Jr. | Applicant |
| US2016/0294783(A1) | 2016-10-01 | Piqueras Jover | Applicant |
| US2016/0300200(A1) | 2016-10-01 | Brown | Applicant |
| US2016/0300234(A1) | 2016-10-01 | Moss-Pultz | Applicant |
| US2016/0321675(A1) | 2016-11-01 | Mccoy | Applicant |
| US2016/0321751(A1) | 2016-11-01 | Creighton, IV | Applicant |
| US2016/0321769(A1) | 2016-11-01 | Mccoy | Applicant |
| US2016/0328791(A1) | 2016-11-01 | Parsells | Applicant |
| US2016/0330031(A1) | 2016-11-01 | Drego | Applicant |
| US2016/0330244(A1) | 2016-11-01 | Denton | Applicant |
| US2016/0337119(A1) | 2016-11-01 | Hosaka | Applicant |
| US2016/0342977(A1) | 2016-11-01 | Lam | Applicant |
| US2016/0342989(A1) | 2016-11-01 | Davis | Applicant |
| US2016/0344737(A1) | 2016-11-01 | Anton | Applicant |
| US2016/0371771(A1) | 2016-12-01 | Serrano | Applicant |
| US2017/0000613(A1) | 2017-01-01 | Reto | Applicant |
| US2017/0005797(A1) | 2017-01-01 | Lanc | Applicant |
| US2017/0005804(A1) | 2017-01-01 | Zinder | Applicant |
| US2017/0033933(A1) | 2017-02-01 | Haber | Applicant |
| US2017/0053249(A1) | 2017-02-01 | Tunnell | Applicant |
| US2017/0061396(A1) | 2017-03-01 | Melika | Applicant |
| US2017/0075938(A1) | 2017-03-01 | Black | Applicant |
| US2017/0103167(A1) | 2017-04-01 | Shah | Applicant |
| US2017/0124534(A1) | 2017-05-01 | Savolainen | Applicant |
| US2017/0124535(A1) | 2017-05-01 | Juels | Applicant |
| US2017/0134162(A1) | 2017-05-01 | Code | Applicant |
| US2017/0148016(A1) | 2017-05-01 | Davis | Applicant |
| US2017/0161439(A1) | 2017-06-01 | Raduchel | Applicant |
| US2017/0177898(A1) | 2017-06-01 | Dillenberger | Applicant |
| US2017/0178237(A1) | 2017-06-01 | Wong | Applicant |
| US2017/0212781(A1) | 2017-07-01 | Dillenberger | Applicant |
| US2017/0213287(A1) | 2017-07-01 | Bruno | Applicant |
| US2017/0221052(A1) | 2017-08-01 | Sheng | Applicant |
| US2017/0228731(A1) | 2017-08-01 | Sheng | Applicant |
| US2017/0236123(A1) | 2017-08-01 | Ali | Applicant |
| US2017/0243208(A1) | 2017-08-01 | Kurian | Applicant |
| US2017/0243289(A1) | 2017-08-01 | Rufo | Applicant |
| US2017/0244757(A1) | 2017-08-01 | Castinado | Applicant |
| US2017/0269186(A1) | 2017-09-01 | Sharma | Applicant |
| US2017/0330279(A1) | 2017-11-01 | Ponzone | Applicant |
| US2017/0344983(A1) | 2017-11-01 | Muftic | Applicant |
| US2017/0346693(A1) | 2017-11-01 | Dix | Applicant |
| US2017/0352031(A1) | 2017-12-01 | Collin | Applicant |
| US2017/0353309(A1) | 2017-12-01 | Gray | Applicant |
| US2017/0359374(A1) | 2017-12-01 | Smith | Applicant |
| US2017/0364642(A1) | 2017-12-01 | Bogdanowicz | Applicant |
| US2017/0373859(A1) | 2017-12-01 | Shors | Applicant |
| US2018/0005186(A1) | 2018-01-01 | Hunn | Applicant |
| US2018/0048599(A1) | 2018-02-01 | Arghandiwal | Applicant |
| US2018/0075239(A1) | 2018-03-01 | Boutnaru | Applicant |
| US2018/0075527(A1) | 2018-03-01 | Nagla | Applicant |
| US2018/0082043(A1) | 2018-03-01 | Witchey | Applicant |
| US2018/0088928(A1) | 2018-03-01 | Smith | Applicant |
| US2018/0091524(A1) | 2018-03-01 | Setty | Applicant |
| US2018/0097779(A1) | 2018-04-01 | Karame | Applicant |
| US2018/0101701(A1) | 2018-04-01 | Barinov | Applicant |
| US2018/0101842(A1) | 2018-04-01 | Ventura | Applicant |
| US2018/0108024(A1) | 2018-04-01 | Greco | Applicant |
| US2018/0117446(A1) | 2018-05-01 | Tran | Applicant |
| US2018/0123779(A1) | 2018-05-01 | Zhang | Applicant |
| US2018/0139042(A1) | 2018-05-01 | Binning | Applicant |
| US2018/0144292(A1) | 2018-05-01 | Mattingly | Applicant |
| US2018/0157700(A1) | 2018-06-01 | Roberts | Applicant |
| US2018/0158034(A1) | 2018-06-01 | Hunt | Applicant |
| US2018/0167201(A1) | 2018-06-01 | Naqvi | Applicant |
| US2018/0173906(A1) | 2018-06-01 | Rodriguez | Applicant |
| US2018/0176017(A1) | 2018-06-01 | Rodriguez | Applicant |
| US2018/0181768(A1) | 2018-06-01 | Leporini | Applicant |
| US2018/0182042(A1) | 2018-06-01 | Vishwa | Applicant |
| US2018/0183602(A1) | 2018-06-01 | Campagna | Applicant |
| US2018/0189333(A1) | 2018-07-01 | Childress | Applicant |
| US2018/0189781(A1) | 2018-07-01 | Mccann | Applicant |
| US2018/0204213(A1) | 2018-07-01 | Zappier | Applicant |
| US2018/0212779(A1) | 2018-07-01 | Bergmann | Applicant |
| US2018/0219683(A1) | 2018-08-01 | Deery | Applicant |
| US2018/0219685(A1) | 2018-08-01 | Deery | Applicant |
| US2018/0225640(A1) | 2018-08-01 | Chapman | Applicant |
| US2018/0225649(A1) | 2018-08-01 | Babar | Applicant |
| US2018/0241565(A1) | 2018-08-01 | Paolini-Subramanya | Applicant |
| US2018/0253702(A1) | 2018-09-01 | Dowding | Applicant |
| US2018/0260888(A1) | 2018-09-01 | Paolini-Subramanya | Applicant |
| US2018/0260889(A1) | 2018-09-01 | Paolini-Subramanya | Applicant |
| US2018/0268162(A1) | 2018-09-01 | Dillenberger | Applicant |
| US2018/0268382(A1) | 2018-09-01 | Wasserman | Applicant |
| US2018/0268504(A1) | 2018-09-01 | Paolini-Subramanya | Applicant |
| US2018/0276270(A1) | 2018-09-01 | Bisbee | Applicant |
| US2018/0276668(A1) | 2018-09-01 | Li | Applicant |
| US2018/0276745(A1) | 2018-09-01 | Paolini-Subramanya | Applicant |
| US2018/0285879(A1) | 2018-10-01 | Gadnis | Applicant |
| US2018/0285970(A1) | 2018-10-01 | Snow | Applicant |
| US2018/0285971(A1) | 2018-10-01 | Rosenoer | Applicant |
| US2018/0288022(A1) | 2018-10-01 | Madisetti | Applicant |
| US2018/0315051(A1) | 2018-11-01 | Hurley | Applicant |
| US2018/0316502(A1) | 2018-11-01 | Nadeau | Applicant |
| US2018/0323963(A1) | 2018-11-01 | Stollman | Applicant |
| US2018/0356236(A1) | 2018-12-01 | Lawrenson | Applicant |
| US2018/0365201(A1) | 2018-12-01 | Hunn | Applicant |
| US2018/0365686(A1) | 2018-12-01 | Kondo | Applicant |
| US2018/0365764(A1) | 2018-12-01 | Nelson | Applicant |
| US2018/0367298(A1) | 2018-12-01 | Wright | Applicant |
| US2019/0012637(A1) | 2019-01-01 | Gillen | Applicant |
| US2019/0013948(A1) | 2019-01-01 | Mercuri | Applicant |
| US2019/0018947(A1) | 2019-01-01 | Li | Applicant |
| US2019/0034459(A1) | 2019-01-01 | Qiu | Applicant |
| US2019/0036887(A1) | 2019-01-01 | Miller | Applicant |
| US2019/0036957(A1) | 2019-01-01 | Smith | Applicant |
| US2019/0043048(A1) | 2019-02-01 | Wright | Applicant |
| US2019/0044727(A1) | 2019-02-01 | Scott | Applicant |
| US2019/0050855(A1) | 2019-02-01 | Martino | Applicant |
| US2019/0057382(A1) | 2019-02-01 | Wright | Applicant |
| US2019/0058709(A1) | 2019-02-01 | Kempf | Applicant |
| US2019/0065709(A1) | 2019-02-01 | Salomon | Applicant |
| US2019/0073666(A1) | 2019-03-01 | Ortiz | Applicant |
| US2019/0080284(A1) | 2019-03-01 | Kim | Applicant |
| US2019/0081793(A1) | 2019-03-01 | Martino | Applicant |
| US2019/0081796(A1) | 2019-03-01 | Chow | Applicant |
| US2019/0087446(A1) | 2019-03-01 | Sharma | Applicant |
| US2019/0123889(A1) | 2019-04-01 | Schmidt-Karaca | Applicant |
| US2019/0132350(A1) | 2019-05-01 | Smith | Applicant |
| US2019/0188699(A1) | 2019-06-01 | Thibodeau | Applicant |
| US2019/0197532(A1) | 2019-06-01 | Jayachandran | Applicant |
| US2019/0205563(A1) | 2019-07-01 | Gonzales, Jr. | Applicant |
| US2019/0207748(A1) | 2019-07-01 | Courtney | Applicant |
| US2019/0236286(A1) | 2019-08-01 | Scriber | Applicant |
| US2019/0251557(A1) | 2019-08-01 | Jin | Applicant |
| US2019/0253240(A1) | 2019-08-01 | Treat | Applicant |
| US2019/0253258(A1) | 2019-08-01 | Thekadath | Applicant |
| US2019/0268141(A1) | 2019-08-01 | Pandurangan | Applicant |
| US2019/0268163(A1) | 2019-08-01 | Nadeau | Applicant |
| US2019/0281259(A1) | 2019-09-01 | Palazzolo | Applicant |
| US2019/0287107(A1) | 2019-09-01 | Gaur | Applicant |
| US2019/0287199(A1) | 2019-09-01 | Messerges | Applicant |
| US2019/0287200(A1) | 2019-09-01 | Schuler | Applicant |
| US2019/0288832(A1) | 2019-09-01 | Dang | Applicant |
| US2019/0296915(A1) | 2019-09-01 | Lancashire | Applicant |
| US2019/0303623(A1) | 2019-10-01 | Reddy | Applicant |
| US2019/0303887(A1) | 2019-10-01 | Wright | Applicant |
| US2019/0306150(A1) | 2019-10-01 | Letz | Applicant |
| US2019/0311357(A1) | 2019-10-01 | Madisetti | Applicant |
| US2019/0318117(A1) | 2019-10-01 | Beecham | Applicant |
| US2019/0319782(A1) | 2019-10-01 | Ghosh | Applicant |
| US2019/0324867(A1) | 2019-10-01 | Tang | Applicant |
| US2019/0332691(A1) | 2019-10-01 | Beadles | Applicant |
| US2019/0333054(A1) | 2019-10-01 | Cona | Applicant |
| US2019/0334715(A1) | 2019-10-01 | Gray | Applicant |
| US2019/0334912(A1) | 2019-10-01 | Sloane | Applicant |
| US2019/0340267(A1) | 2019-11-01 | Vo | Applicant |
| US2019/0340586(A1) | 2019-11-01 | Sheng | Applicant |
| US2019/0340607(A1) | 2019-11-01 | Lynn | Applicant |
| US2019/0342422(A1) | 2019-11-01 | Li | Applicant |
| US2019/0347444(A1) | 2019-11-01 | Lowagie | Applicant |
| US2019/0347628(A1) | 2019-11-01 | Al-Naji | Applicant |
| US2019/0349190(A1) | 2019-11-01 | Smith | Applicant |
| US2019/0349426(A1) | 2019-11-01 | Smith | Applicant |
| US2019/0354606(A1) | 2019-11-01 | Snow | Applicant |
| US2019/0354607(A1) | 2019-11-01 | Snow | Applicant |
| US2019/0354611(A1) | 2019-11-01 | Snow | Applicant |
| US2019/0354724(A1) | 2019-11-01 | Lowagie | Applicant |
| US2019/0354725(A1) | 2019-11-01 | Lowagie | Applicant |
| US2019/0354964(A1) | 2019-11-01 | Snow | Applicant |
| US2019/0356733(A1) | 2019-11-01 | Snow | Applicant |
| US2019/0361917(A1) | 2019-11-01 | Tran | Applicant |
| US2019/0372770(A1) | 2019-12-01 | Xu | Applicant |
| US2019/0378128(A1) | 2019-12-01 | Moore | Applicant |
| US2019/0385165(A1) | 2019-12-01 | Castinado | Applicant |
| US2019/0386940(A1) | 2019-12-01 | Hong | Applicant |
| US2019/0391540(A1) | 2019-12-01 | Westervelt | Applicant |
| US2019/0391858(A1) | 2019-12-01 | Studnicka | Applicant |
| US2019/0394044(A1) | 2019-12-01 | Snow | Applicant |
| US2019/0394048(A1) | 2019-12-01 | Deery | Applicant |
| US2020/0004263(A1) | 2020-01-01 | Dalla Libera | Applicant |
| US2020/0004946(A1) | 2020-01-01 | Gilpin | Applicant |
| US2020/0005290(A1) | 2020-01-01 | Madisetti | Applicant |
| US2020/0019937(A1) | 2020-01-01 | Edwards | Applicant |
| US2020/0034571(A1) | 2020-01-01 | Fett | Applicant |
| US2020/0034813(A1) | 2020-01-01 | Calinog | Applicant |
| US2020/0042635(A1) | 2020-02-01 | Douglass | Applicant |
| US2020/0042960(A1) | 2020-02-01 | Cook | Applicant |
| US2020/0042982(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0042983(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0042984(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0042985(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0042986(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0042987(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0042988(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0042990(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0042995(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0044827(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0044856(A1) | 2020-02-01 | Lynde | Applicant |
| US2020/0044857(A1) | 2020-02-01 | Snow | Applicant |
| US2020/0065761(A1) | 2020-02-01 | Tatchell | Applicant |
| US2020/0067907(A1) | 2020-02-01 | Avetisov | Applicant |
| US2020/0075056(A1) | 2020-03-01 | Yang | Applicant |
| US2020/0089690(A1) | 2020-03-01 | Qiu | Applicant |
| US2020/0099524(A1) | 2020-03-01 | Schiatti | Applicant |
| US2020/0099534(A1) | 2020-03-01 | Lowagie | Applicant |
| US2020/0104712(A1) | 2020-04-01 | Katz | Applicant |
| US2020/0118068(A1) | 2020-04-01 | Turetsky | Applicant |
| US2020/0127812(A1) | 2020-04-01 | Schuler | Applicant |
| US2020/0134760(A1) | 2020-04-01 | Messerges | Applicant |
| US2020/0145219(A1) | 2020-05-01 | Sebastian | Applicant |
| US2020/0151714(A1) | 2020-05-01 | Chan | Applicant |
| US2020/0167870(A1) | 2020-05-01 | Isaacson | Applicant |
| US2020/0175506(A1) | 2020-06-01 | Snow | Applicant |
| US2020/0195441(A1) | 2020-06-01 | Suen | Applicant |
| US2020/0201964(A1) | 2020-06-01 | Nandakumar | Applicant |
| US2020/0211011(A1) | 2020-07-01 | Anderson | Applicant |
| US2020/0231122(A1) | 2020-07-01 | Simlett | Applicant |
| US2020/0234386(A1) | 2020-07-01 | Blackman | Applicant |
| US2020/0258061(A1) | 2020-08-01 | Beadles | Applicant |
| US2020/0279324(A1) | 2020-09-01 | Snow | Applicant |
| US2020/0279325(A1) | 2020-09-01 | Snow | Applicant |
| US2020/0279326(A1) | 2020-09-01 | Snow | Applicant |
| US2020/0280447(A1) | 2020-09-01 | Snow | Applicant |
| US2020/0302433(A1) | 2020-09-01 | Green | Applicant |
| US2020/0320097(A1) | 2020-10-01 | Snow | Applicant |
| US2020/0320514(A1) | 2020-10-01 | Snow | Applicant |
| US2020/0320521(A1) | 2020-10-01 | Snow | Applicant |
| US2020/0320522(A1) | 2020-10-01 | Snow | Applicant |
| US2020/0320620(A1) | 2020-10-01 | Snow | Applicant |
| US2020/0322159(A1) | 2020-10-01 | Xu | Applicant |
| US2020/0366495(A1) | 2020-11-01 | Mahoney | Applicant |
| US2020/0382480(A1) | 2020-12-01 | Isaacson | Applicant |
| US2020/0389294(A1) | 2020-12-01 | Soundararajan | Applicant |
| US2021/0021426(A1) | 2021-01-01 | Scherrer | Examiner |
| US2021/0035092(A1) | 2021-02-01 | Pierce | Applicant |
| US2021/0042758(A1) | 2021-02-01 | Durvasula | Applicant |
| US2021/0044976(A1) | 2021-02-01 | Avetisov | Applicant |
| US2021/0073212(A1) | 2021-03-01 | Conley | Applicant |
| US2021/0073750(A1) | 2021-03-01 | Ledford | Applicant |
| US2021/0090076(A1) | 2021-03-01 | Wright | Applicant |
| US2021/0097602(A1) | 2021-04-01 | Eichel | Applicant |
| US2021/0119785(A1) | 2021-04-01 | Ben-Reuven | Applicant |
| US2021/0144149(A1) | 2021-05-01 | Simons | Applicant |
| US2021/0152332(A1) | 2021-05-01 | Chen | Applicant |
| US2021/0174353(A1) | 2021-06-01 | Snow | Applicant |
| US2021/0176038(A1) | 2021-06-01 | Bortnikov | Applicant |
| US2021/0200653(A1) | 2021-07-01 | Jetzfellner | Applicant |
| US2021/0201321(A1) | 2021-07-01 | Studnitzer | Applicant |
| US2021/0201328(A1) | 2021-07-01 | Gunther | Applicant |
| US2021/0226769(A1) | 2021-07-01 | Snow | Applicant |
| US2021/0226773(A1) | 2021-07-01 | Snow | Applicant |
| US2021/0241282(A1) | 2021-08-01 | Gu | Applicant |
| US2021/0248514(A1) | 2021-08-01 | Cella | Applicant |
| US2021/0266167(A1) | 2021-08-01 | Lohe | Applicant |
| US2021/0266174(A1) | 2021-08-01 | Snow | Applicant |
| US2021/0272103(A1) | 2021-09-01 | Snow | Applicant |
| US2021/0273810(A1) | 2021-09-01 | Lynde | Applicant |
| US2021/0273816(A1) | 2021-09-01 | Deery | Applicant |
| US2021/0326815(A1) | 2021-10-01 | Brody | Applicant |
| US2021/0328804(A1) | 2021-10-01 | Snow | Applicant |
| US2021/0342836(A1) | 2021-11-01 | Cella | Applicant |
| US2021/0357369(A1) | 2021-11-01 | Kwon | Applicant |
| US2021/0366586(A1) | 2021-11-01 | Ryan | Applicant |
| US2022/0006641(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0012731(A1) | 2022-01-01 | Derosa-Grund | Applicant |
| US2022/0019559(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0020001(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0023742(A1) | 2022-01-01 | Tran | Applicant |
| US2022/0027893(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0027897(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0027994(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0027995(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0027996(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0029805(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0030054(A1) | 2022-01-01 | Snow | Applicant |
| US2022/0034004(A1) | 2022-02-01 | Snow | Applicant |
| US2022/0040557(A1) | 2022-02-01 | Tran | Applicant |
| US2022/0043831(A1) | 2022-02-01 | Douglass | Applicant |
| US2022/0044162(A1) | 2022-02-01 | Zhang | Applicant |
| US2022/0058622(A1) | 2022-02-01 | Snow | Applicant |
| US2022/0058623(A1) | 2022-02-01 | Snow | Applicant |
| US2022/0067717(A1) | 2022-03-01 | Yun | Examiner |
| US2022/0083991(A1) | 2022-03-01 | Kemper | Applicant |
| US2022/0103341(A1) | 2022-03-01 | Snow | Applicant |
| US2022/0103343(A1) | 2022-03-01 | Snow | Applicant |
| US2022/0103344(A1) | 2022-03-01 | Snow | Applicant |
| US2022/0103364(A1) | 2022-03-01 | Snow | Applicant |
| US2022/0141231(A1) | 2022-05-01 | Simons | Applicant |
| US2022/0156737(A1) | 2022-05-01 | Wright | Applicant |
| US2022/0172207(A1) | 2022-06-01 | Cella | Applicant |
| US2022/0173893(A1) | 2022-06-01 | Basu | Applicant |
| US2022/0198554(A1) | 2022-06-01 | Filter | Applicant |
| US2022/0215389(A1) | 2022-07-01 | Balaraman | Applicant |
| US2022/0245626(A1) | 2022-08-01 | Sewell | Applicant |
| US2022/0405742(A1) | 2022-12-01 | Ravinathan | Applicant |
| US2023/0185783(A1) | 2023-06-01 | Haddad | Examiner |
| US2023/0334490(A1) | 2023-10-01 | Ryan | Applicant |
| US2024/0205030(A1) | 2024-06-01 | Wright | Examiner |
| US2025/0184117(A1) | 2025-06-01 | Snow | Applicant |
| US2025/0286731(A1) | 2025-09-01 | Brian | Applicant |
| CN107392618(A) | 2017-11-01 | Applicant | |
| CN110392052(A) | 2019-10-01 | Applicant | |
| CN110599147(A) | 2019-12-01 | Applicant | |
| CN112329041(A) | 2021-02-01 | Applicant | |
| DE10128728 | 2003-01-01 | Applicant | |
| EP3726438(A1) | 2020-10-01 | Applicant | |
| EP3862947(A1) | 2021-08-01 | Applicant | |
| JPS5383297 | 1978-07-01 | Applicant | |
| JP2021152931(A) | 2021-09-01 | Applicant | |
| KR100653512 | 2006-12-01 | Applicant | |
| KR1747221 | 2017-05-01 | Applicant | |
| KR101747221 | 2017-06-01 | Applicant | |
| WO49797 | 2000-08-01 | Applicant | |
| WO2007069176 | 2007-06-01 | Applicant | |
| WO2015077378 | 2015-05-01 | Applicant | |
| WO2017190795(A1) | 2017-11-01 | Applicant | |
| WO2018013898(A1) | 2018-01-01 | Applicant | |
| WO2018109010 | 2018-06-01 | Applicant | |
| WO2018127923(A1) | 2018-07-01 | Applicant | |
| WO2018127923072018 | 2018-07-01 | Applicant | |
| WO2018208105(A1) | 2018-11-01 | Applicant | |
| WO2019180702 | 2019-09-01 | Applicant | |
| WO2019207504 | 2019-10-01 | Applicant | |
| WO2020019341(A1) | 2020-01-01 | Applicant | |
| WO2020125839(A1) | 2020-06-01 | Applicant |
Non-Patent Literature (39)
- P. Sood, P. Palsania, S. Ahuja, S. Kumar, K. Khatter and A. Mishra, “Decentralised & Collaborative DocuPad Using Blockchain,” 2022 IEEE Delhi Section Conference (DELCON), New Delhi, India, 2022, pp. 1-8, doi: 10.1109/DELCON54057.2022.9752853. (Year: 2022).Examiner
- M. Shah, M. Shaikh, V. Mishra and G. Tuscano, “Decentralized Cloud Storage Using Blockchain, ” 2020 4th International Conference on Trends in Electronics and Informatics (ICOEI)(48184), Tirunelveli, India, 2020, pp. 384-389, doi: 10.1109/ICOEI48184.2020.9143004. (Year: 2020).Examiner
- Al-Naji, Nader et al., “Basis: A Price-Stable Cryptocurrency with an Algorithmic Central Bank” www.basis.io Jun. 20, 2017, 27 pages.Applicant
- Alsolami, Fahad, and Terrance E. Boult. “CloudStash: using secret-sharing scheme to secure data, not keys, in multi-clouds.” Information Technology: New Generations (ITNG), 2014 11th International Conference on. IEEE, 2014.Applicant
- Ana Reyna et al.; On blockchain and its integration with IoT. Challenges and opportunities. Future generation computer systems. vol. 88, Nov. 2018, pp. 173-190. https://www.sciencedirect.com/science/article/pii/80167739X17329205 (Year: 2018).Applicant
- Casey, “BitBeat: Factom Touts Blockchain Tool for Keeping Record Keepers Honest”, Wall Street Journal, Nov. 5, 2014.Applicant
- Chakravorty, Antorweep, and Chunming Rong, “Ushare: user controlled social media based on blockchain.” Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication. ACM, 2017.Applicant
- Chen, Zhixong, and Yixuan Zhu. “Personal Archive Service System using Blockchain Technology: Case Study, Promising and Challenging.” AI & Mobile Services (AIMS), 2017 IEEE International Conference on. IEEE, 2017.Applicant
- Crosby, Michael et al., “BlockChain Technology, Beyond Bitcoin”, Sutardja Center for Entrepreneurship & Technology, Berkeley Engineering, Oct. 16, 2015, 35 pages.Applicant
- Dai et al. TrialChain: A Blockchain-Based Platform to Validate Data Integrity in Large, Biomedical Research Studies arXiv: 1807.03662 Jul. 10, 2018 (Year: 2018).Applicant
- Eberhardt et al., “ZoKrates—Scalable Privacy-Preserving Off-Chain Computations,” https://ieeeexplore.ieee.org/ stamp/JSP?tp:::&armumber:::8726497. (Year:2018).Applicant
- Feng and Luo, “Evaluating Memory-Hard Proof-of-Work Algorithms on Three Processors,” PVLDB, 13(6): 898-911, 2020.Applicant
- Fernandez-Carames et al.; A Review on the Use of Blockchain for the Internet of Things. https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=8370027 (Year: 2018). 23 pages.Applicant
- Haarmann, et al., “DMN Decision Execution on the Ethereum Blockchain,” Hasso Plattner Institute, University of Potsdam, May 17, 2018, 15 pages.Applicant
- Iddo Bentov, Bitcoin and Secure Computation with Money, May 2016 (Year: 2016).Applicant
- Kim et al., “A Perspective on Blockchain Smart Contracts,” Schulich School of Business, York University, Toronto, Canada, 2017, 6 pages.Applicant
- Kroeger, T. et al., The Case for Distributed Data Archival Using Secret Splitting with Percival, 6th International Symposium on Resilient Control Systems (available at IEEE Xplore), p. 204-209 (Year: 2013).Applicant
- Krol, Michal et al., “SPOC: Secure Payments for Outsourced Computations” https://arxiv.org/pdf/1807.06462.pdf. (Year: 2018).Applicant
- Luther, “Do We Need A “Fedcoin” Cryptocurrency?,” ValueWalk, Newstex Global Business Blogs, Dec. 30, 2015 (Year: 2015).Applicant
- Luu et al., Making Smart Contracts Smarter, 2016.Applicant
- Menezes, Alfred. J., et al. “Handbook of Applied Cryptography,” 1997, CRC Press, p. 527-28.Applicant
- Merkle Mountain Ranges (MMRs)-Grin Documentation, https://quentinlesceller.github.io/grin-docs/technical/building-blocks/merkle-mountain-ranges/, 5 pages, printed Jun. 1, 2022.Applicant
- Merkle Mountain Ranges, https://github.com/opentimestamps/opentimestamps-server/blob/master/doc/merkle-mountain-range.md, 3 pages, printed Jun. 1, 2022.Applicant
- Michelson, Kyle, et al., “Accumulate: An identity-based blockchain protocol with cross-chain support, human-readable addresses, and key management capabilities”, Accumulate Whitepaper, v1.0, Jun. 12, 2022, 28 pages.Applicant
- MOF-BC: A Memory Optimized and Flexible BlockChain for Large Scale Networks. IIe:///C:/Users/eoussir/Documents/e-Red%20Folder/16905961/NPL_MOF_BC_A%20Memory%20Optimized%20and%20Flexible%20Blockchain.pdf (Year:2018) 43 pages.Applicant
- Muhamed et al. EduCTX: A Blockchain-Based Higher Education Credit Platform, https://ieeexplore.ieee.org/stamp/ stamp.jsp?arnumber=8247166. (Year: 2017). 16 pages.Applicant
- On blockchain and its integration with IoT. Challenges and opportunities. file:///C:/Users/eoussir/Downloads/1-s2.0S0167739X17329205-main%20(1).pdf (Year: 2018) 18 pages.Applicant
- Sokolowski, R. (2011). Signed, sealed, delivered: EMortgages are protected from unauthorized alteration by something called a tamper seal. Mortgage Banking, 71(6), 108(4). Retrieved from https://dialog.proquest.com/professional/docview/1068158815?accountid=131444 (Year: 2011).Applicant
- United States: New Generation cryptocurrency, USDX Protocol, Offers Crypto Advantages and Fiat Pegging, Apr. 2, 2018 (Year: 2018).Applicant
- Unknown, “Federated Learning: Collaborative Machine Learning without Centralized Training Data” Apr. 6, 2017, 11 pages.Applicant
- Unknown, “Midex”, https://promo.midex.com/Midex_EN.pdf, 2017, 25 pages.Applicant
- Unknown, Xtrade White Paper, https://xtrade1-9649.kxcdn.com/wp-content/uploads/2017/09/xtrade-whitepaper.pdf Feb. 7, 2018, 37 pages.Applicant
- Watanabe, Hiroki, et al. “Blockchain contract: Securing a blockchain applied to smart contracts.” 2016 IEEE International Conference on Consumer Electronics (ICCE). IEEE, 2016.Applicant
- White, Ron, “How Computers Work,” Oct. 2003, QUE, Seventh Edition (Year: 2003), 23 pages.Applicant
- Why offchain storage is needed for blockchain_V4_1 FINAL (Year: 2018), by IBM, 13 pages.Applicant
- Written Opinion in PCT/US2021/040207, Inventor Snow, Mail date Oct. 7, 2021, 14 pages.Applicant
- ZoKrates—Scalable Privacy-Preserving Off-Chain Computations, by Jacob Eberhardt, Stefan Tai , 8 pages, Nov. 3, 2011 (Year: 2011).Applicant
- Encoding, Encryption, and Hashing by Andrea Chiarelli (Year: 2022).Applicant
- Eleftherios Kokoris-Kogias, OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding, Jul. 2018, IEEE, https:// ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8418625 (Year: 2018) (pp. 1-16).Applicant