, <B>, . . . and <N>” or “at least one of <A>, <B>, . . . <N>, or combinations thereof” or “<A>, <B>, . . . and/or <N>” are defined by the Applicant in the broadest sense, superseding any other implied definitions hereinbefore or hereinafter unless expressly asserted by the Applicant to the contrary, to mean one or more elements selected from the group comprising A, B, . . . and N. In other words, the phrases mean any combination of one or more of the elements A, B, . . . or N including any one element alone or the one element in combination with one or more of the other elements which may also include, in combination, additional elements not listed.\n(134) While various embodiments have been described, it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible. Accordingly, the embodiments described herein are examples, not the only possible embodiments and implementations.\n(135) In various examples, the systems and methods described herein may relate to the following aspects:\n(136) 1. A system, comprising:\n(137) an interoperability node in communication with a furnisher participant node of a furnisher distributed ledger technology (DLT) network and a receiver participant node of a receiver DLT network, wherein a furnisher smart contract is stored on a furnisher blockchain for the furnisher DLT network and a receiver smart contract stored on a receiver blockchain for the receiver DLT network, the interoperability node comprising a processor configured to: obtain a shielded exchange instruction, the shielded exchange instruction comprising a zero-knowledge proof, a selected token nullifier, a new token nullifier, and a new token digest, wherein the selected token nullifier comprises a hash of a selected token identifier, the new token nullifier comprises a hash of a new token identifier, and the new token digest comprises a hash of at least a recipient public key of the receiver participant node and a new token identifier, wherein the zero-knowledge proof is indicative of the furnisher participant node having access to the selected token identifier; determine that the new token nullifier is not present on the receiver blockchain; and after determination that new token nullifier is not present in on the receiver blockchain, submit the shielded exchange instruction to the furnisher smart contract and the receiver smart contract, wherein the furnisher smart contract is configured to retire the selected token nullifier on the furnisher blockchain and the receiver smart contract is configured to insert the new token nullifier and the new token digest to the receiver blockchain.\n2. The system of aspect 1, wherein to submit the shielded exchange instruction to the furnisher smart contract and the receiver smart contract, the processor of the interoperability node is further configured to: execute logic of the furnisher smart contract, where in the furnisher smart contract logic causes the processor of the interoperability node to retire the selected token nullifier on the furnisher blockchain; and execute logic of the receiver smart contract, wherein the receiver smart contract logic causes processor of the interoperability node to append the new token nullifier and the new token digest to the receiver blockchain.\n3. The system of any of aspects 1 to 2, wherein to determine that the new token nullifier is not present on the receiver blockchain, the processor of the interoperability node is further configured to: access a nullifier set stored on the receiver blockchain, the nullifier set comprising a plurality of token nullifiers stored on the receiver blockchain, each of the token nullifiers; search the nullifier set for new token nullifier; determine that the new token nullifier is not present in the nullifier set; and communicate, to the furnisher participant node, a result message indicative of the new token nullifier not being present in the nullifier set.\n4. The system of any of aspects 1 to 3, wherein the processor is further configured to: access a nullifier set stored on the receiver blockchain, the nullifier set comprising a plurality of token nullifiers stored on the receiver blockchain, each of the token nullifiers; search the nullifier set for new token nullifier; determine whether the new token nullifier is present in the nullifier set; permit, in response to determination that the new token nullifier is not present in the nullifier set, submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract; and restrict, in response to determination that the new token nullifier is present in the nullifier set, submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract.\n5. The system of any of aspects 1 to 4, wherein the processor of the interoperability node is further configured to: in response to submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract, communicate a submission result to the furnisher participant node, wherein the furnisher participant node is configured to communicate the new token identifier corresponding to the new token nullifier to the receiver participant node in response to receipt of the submission result.\n6. The system of any of aspects 1 to 5, wherein the zero-knowledge proof comprises a non-interactive zero-knowledge proof.\n7. The system of any of aspects 1 to 6, wherein the zero-knowledge proof comprises a Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK).\n8. A system comprising: a furnisher participant node of a furnisher distributed ledger technology (DLT) network, the furnisher participant node in communication with an interoperability node for facilitating private token exchange between the furnisher participant node and a receiver participant node of a receiver DLT network, wherein a furnisher smart contract is stored on a furnisher blockchain for the furnisher DLT network and a receiver smart contract is stored on a receiver blockchain for the receiver DLT network, the furnisher participant node comprising a processor configured to: generate a shielded exchange instruction, the shielded exchange instruction comprising a zero-knowledge proof, a selected token nullifier, a new token nullifier, and a new token digest, the selected token nullifier comprising a hash of a selected token identifier, the new token nullifier comprising a hash of a new token identifier, and the new token digest comprising a hash of at least a recipient public key and the new token identifier, wherein the zero-knowledge proof is indicative of the furnisher participant node having access to the selected token identifier; communicate a validation request comprising the new token nullifier to the interoperability node; determine, based on a validation response communicated by the interoperability node, that the new token nullifier is not present on the receiver blockchain; in response to determination that the new token nullifier is not present on the on the receiver blockchain, communicate the shielded exchange instruction to the interoperability node, the interoperability node configured to submit the shielded exchange instruction to a furnisher smart contract configured on a furnisher DLT platform and a receiver smart contract configured on a receiver DLT platform; receive, from the interoperability node, a submission result responsive to submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract; and communicate, in response to receipt of the submission result, the new token identifier to the receiver participant node.\n9. The system of aspect 8, wherein the processor of the furnisher participant node is further configured to: generate the new token identifier, the new token identifier comprising a random number; and generating, based on a cryptographic hash function and the new token identifier, the new token nullifier.\n10. The system of any of aspects 8 to 9, wherein the zero-knowledge proof comprises a non-interactive zero-knowledge proof.\n11. The system of any of aspects 8 to 10, wherein the zero-knowledge proof comprises a Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK).\n12. The system of any of aspects 8 to 11, wherein the processor of the furnisher participant node is configured to: receive a submission request from the interoperability node, the submission request comprising the shielded exchange instruction; in response to receipt of the submission request, execute the furnisher smart contract, the furnisher smart contract configured to cause the processor to: access a nullifier set comprising a plurality of token nullifiers; identify, in the nullifier set, the selected token nullifier; and flag the selected token nullifier as retired.\n13. The system of any of aspects 8 to 12, wherein the processor is further configured to: deny a second submission request comprising a second shielded exchange instruction in response to second shielded exchange instruction including the selected token nullifier and the selected token nullifier being flag as retired.\n14. The system of any of aspects 8 to 13, wherein to flag the selected token nullifier as retired, the processor of the furnisher participant node is further configured to: append, to the furnisher blockchain, a datablock comprising an association between the selected token nullifier and a retirement flag.\n15. A method, comprising: obtaining a shielded exchange instruction communicated by a furnisher participant node of a furnisher distributed ledger technology (DLT) network, the shielded exchange instruction comprising a zero-knowledge proof, a selected token nullifier, a new token nullifier, and a new token digest, wherein the selected token nullifier comprises a hash of a selected token identifier, the new token nullifier comprises a hash of a new token identifier, and the new token digest comprises a hash of a new token identifier and a recipient public key, wherein the zero-knowledge proof is indicative of the furnisher participant node having access to the selected token identifier; determining that the new token nullifier is not present on a receiver blockchain for a receiver DLT network; and in response to determination that new token nullifier is not present in on the receiver blockchain: submitting the shielded exchange instruction to a furnisher smart contract stored on a furnisher blockchain the furnisher smart contract is configured to retire the selected token nullifier on the furnisher blockchain, and submitting the shielded exchange instruction to a receiver smart contract stored on a receiver blockchain, the receiver smart contract to configured to append the new token nullifier and the new token digest to the receiver blockchain.\n16. The method of aspect 15, wherein determining that the new token nullifier is not present on a receiver blockchain for a receiver DLT network, the method further comprising: accessing a nullifier set stored on the receiver blockchain, the nullifier set comprising a plurality of token nullifiers stored on the receiver blockchain, each of the token nullifiers; searching the nullifier set for new token nullifier; determining that the new token nullifier is not present in the nullifier set; and transmitting, to the furnisher participant node, a result message indicative of the new token nullifier not being present in the nullifier set.\n17. The method of any of aspects 15 to 16, further comprising: accessing a nullifier set stored on the receiver blockchain, the nullifier set comprising a plurality of token nullifiers stored on the receiver blockchain, each of the token nullifiers; searching the nullifier set for new token nullifier; determining whether the new token nullifier is present in the nullifier set; permitting, in response to determination that the new token nullifier is not present in the nullifier set, submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract; and restricting, in response to determination that the new token nullifier is present in the nullifier set, submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract.\n18. The method of any of aspects 15 to 17, further comprising: in response to submission of the shielded exchange instruction to the furnisher smart contract and submission of the shielded exchange instruction to the receiver smart contract, communicating a submission result to the furnisher participant node, wherein the furnisher participant node is configured to communicate the new token identifier corresponding to the new token nullifier to a receiver participant node of a receiver DLT network in response to receipt of the submission result.\n19. The method of any of aspects 15 to 18, wherein the zero-knowledge proof comprises a non-interactive zero-knowledge proof.\n20. The method of any of aspects 15 to 19, wherein the zero-knowledge proof comprises a Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK).\n\n### Claims\n\n1. A system, comprising: an interoperability node in communication with a furnisher participant node of a furnisher distributed ledger technology (DLT) network and a receiver participant node of a receiver DLT network, the furnisher DLT network being separate from the receiver DLT network, the furnisher participant node comprising a furnisher blockchain for the furnisher DLT network and the receiver participant node comprising a receiver blockchain for the receiver DLT network, wherein a furnisher smart contract is stored on the furnisher blockchain for the furnisher DLT network and a receiver smart contract is stored on the receiver blockchain for the receiver DLT network, the interoperability node comprising a processor configured to: obtain a shielded exchange instruction, the shielded exchange instruction comprising a zero-knowledge proof, a selected token nullifier stored on the furnisher blockchain, a new token nullifier to be inserted on the receiver blockchain, and a new token digest to be inserted on the receiver blockchain, wherein the selected token nullifier comprises a hash of a selected token identifier, the new token nullifier comprises a hash of a new token identifier, and the new token digest comprises a hash of at least a recipient public key of the receiver participant node and the new token identifier, wherein the zero-knowledge proof is indicative of the furnisher participant node having access to the selected token identifier; determine that the new token nullifier is not present on the receiver blockchain; and after determination that the new token nullifier is not present in on the receiver blockchain, submit the shielded exchange instruction to the furnisher smart contract and the receiver smart contract, wherein the furnisher smart contract is configured to retire the selected token nullifier on the furnisher blockchain in response to receipt of the shielded exchange instruction by the furnisher node, and the receiver smart contract is configured to insert the new token nullifier and the new token digest to the receiver blockchain in response to receipt of the shielded exchange instruction by the receiver participant node.\n 2. The system of claim 1, wherein to submit the shielded exchange instruction to the furnisher smart contract and the receiver smart contract, the processor of the interoperability node is further configured to: execute logic of the furnisher smart contract, where in the furnisher smart contract logic causes the processor of the interoperability node to retire the selected token nullifier on the furnisher blockchain; and execute logic of the receiver smart contract, wherein the receiver smart contract logic causes processor of the interoperability node to append the new token nullifier and the new token digest to the receiver blockchain.\n 3. The system of claim 1, wherein to determine that the new token nullifier is not present on the receiver blockchain, the processor of the interoperability node is further configured to: access a nullifier set stored on the receiver blockchain, the nullifier set comprising a plurality of token nullifiers stored on the receiver blockchain, each of the token nullifiers; search the nullifier set for new token nullifier; determine that the new token nullifier is not present in the nullifier set; and communicate, to the furnisher participant node, a result message indicative of the new token nullifier not being present in the nullifier set.\n 4. The system of claim 1, wherein the processor is further configured to: access a nullifier set stored on the receiver blockchain, the nullifier set comprising a plurality of token nullifiers stored on the receiver blockchain, each of the token nullifiers; search the nullifier set for new token nullifier; determine whether the new token nullifier is present in the nullifier set; permit, in response to determination that the new token nullifier is not present in the nullifier set, submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract; and restrict, in response to determination that the new token nullifier is present in the nullifier set, submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract.\n 5. The system of claim 1, wherein the processor of the interoperability node is further configured to: in response to submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract, communicate a submission result to the furnisher participant node, wherein the furnisher participant node is configured to communicate the new token identifier corresponding to the new token nullifier to the receiver participant node in response to receipt of the submission result.\n 6. The system of claim 1, wherein the zero-knowledge proof comprises a non-interactive zero-knowledge proof.\n 7. The system of claim 4, wherein the zero-knowledge proof comprises a Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK).\n 8. A system comprising: a furnisher participant node of a furnisher distributed ledger technology (DLT) network, the furnisher participant node in communication with an interoperability node for facilitating private token exchange between the furnisher participant node and a receiver participant node of a receiver DLT network, the furnisher DLT network being separate from the receiver DLT network, wherein a furnisher smart contract is stored on a furnisher blockchain for the furnisher DLT network and a receiver smart contract is stored on a receiver blockchain for the receiver DLT network, the furnisher participant node comprising a processor configured to: generate a shielded exchange instruction, the shielded exchange instruction comprising a zero-knowledge proof, a selected token nullifier stored on the furnisher blockchain, a new token nullifier to be inserted on the receiver blockchain, and a new token digest to be inserted on the receiver blockchain, the selected token nullifier comprising a hash of a selected token identifier, the new token nullifier comprising a hash of a new token identifier, and the new token digest comprising a hash of at least a recipient public key and the new token identifier, wherein the zero-knowledge proof is indicative of the furnisher participant node having access to the selected token identifier; communicate a validation request comprising the new token nullifier to the interoperability node; determine, based on a validation response communicated by the interoperability node, that the new token nullifier is not present on the receiver blockchain; in response to determination that the new token nullifier is not present on the on the receiver blockchain, communicate the shielded exchange instruction to the interoperability node, the interoperability node configured to submit the shielded exchange instruction to the furnisher smart contract and the receiver smart contract, the furnisher smart contract responsive to the shielded exchange instruction to retire the selected token nullifier on the furnisher blockchain, and the receiver smart contract responsive to shielded exchange instruction to insert the new token nullifier and the new token digest to the receiver blockchain; receive, from the interoperability node, a submission result responsive to submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract; and communicate, in response to receipt of the submission result, the new token identifier to the receiver participant node.\n 9. The system of claim 8, wherein the processor of the furnisher participant node is further configured to: generate the new token identifier, the new token identifier comprising a random number; and generating, based on a cryptographic hash function and the new token identifier, the new token nullifier.\n 10. The system of claim 8, wherein the zero-knowledge proof comprises a non-interactive zero-knowledge proof.\n 11. The system of claim 10, wherein the zero-knowledge proof comprises a Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK).\n 12. The system of claim 8, wherein the processor of the furnisher participant node is configured to: receive a submission request from the interoperability node, the submission request comprising the shielded exchange instruction; in response to receipt of the submission request, execute the furnisher smart contract, the furnisher smart contract configured to cause the processor to: access a nullifier set comprising a plurality of token nullifiers; identify, in the nullifier set, the selected token nullifier; and flag the selected token nullifier as retired.\n 13. The system of claim 12, wherein the processor is further configured to: deny a second submission request comprising a second shielded exchange instruction in response to second shielded exchange instruction including the selected token nullifier and the selected token nullifier being flag as retired.\n 14. The system of claim 12, wherein to flag the selected token nullifier as retired, the processor of the furnisher participant node is further configured to: append, to the furnisher blockchain, a datablock comprising an association between the selected token nullifier and a retirement flag.\n 15. A method, comprising: obtaining a shielded exchange instruction communicated by a furnisher participant node of a furnisher distributed ledger technology (DLT) network, the furnisher DLT network being separate from a receiver DLT network, the shielded exchange instruction comprising a zero-knowledge proof, a selected token nullifier, a new token nullifier, and a new token digest, wherein the selected token nullifier comprises a hash of a selected token identifier, the new token nullifier comprises a hash of a new token identifier, and the new token digest comprises a hash of a new token identifier and a recipient public key, wherein the zero-knowledge proof is indicative of the furnisher participant node having access to the selected token identifier; determining that the new token nullifier is not present on a receiver blockchain, the receiver blockchain being validated based on a consensus protocol, for the receiver DLT network; and in response to determination that new token nullifier is not present in on the receiver blockchain: submitting the shielded exchange instruction to a furnisher smart contract stored on a furnisher blockchain, the furnisher blockchain being validated based on a consensus protocol for the furnisher DLT network, the furnisher smart contract is configured to retire the selected token nullifier on the furnisher blockchain, and submitting the shielded exchange instruction to a receiver smart contract stored on a receiver blockchain, the receiver smart contract to configured to append the new token nullifier and the new token digest to the receiver blockchain.\n 16. The method of claim 15, wherein determining that the new token nullifier is not present on a receiver blockchain for a receiver DLT network, the method further comprising: accessing a nullifier set stored on the receiver blockchain, the nullifier set comprising a plurality of token nullifiers stored on the receiver blockchain, each of the token nullifiers; searching the nullifier set for new token nullifier; determining that the new token nullifier is not present in the nullifier set; and transmitting, to the furnisher participant node, a result message indicative of the new token nullifier not being present in the nullifier set.\n 17. The method of claim 15, further comprising: accessing a nullifier set stored on the receiver blockchain, the nullifier set comprising a plurality of token nullifiers stored on the receiver blockchain, each of the token nullifiers; searching the nullifier set for new token nullifier; determining whether the new token nullifier is present in the nullifier set; permitting, in response to determination that the new token nullifier is not present in the nullifier set, submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract; and restricting, in response to determination that the new token nullifier is present in the nullifier set, submission of the shielded exchange instruction to the furnisher smart contract and the receiver smart contract.\n 18. The method of claim 15, further comprising: in response to submission of the shielded exchange instruction to the furnisher smart contract and submission of the shielded exchange instruction to the receiver smart contract, communicating a submission result to the furnisher participant node, wherein the furnisher participant node is configured to communicate the new token identifier corresponding to the new token nullifier to a receiver participant node of a receiver DLT network in response to receipt of the submission result.\n 19. The method of claim 15, wherein the zero-knowledge proof comprises a non-interactive zero-knowledge proof.\n 20. The method of claim 15, wherein the zero-knowledge proof comprises a Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK)."},"Patent Number":{"kind":"string","value":"10298395"},"Document ID":{"kind":"string","value":"US 10298395 B1"},"Date Published":{"kind":"string","value":"2019-05-21"},"Family ID":{"kind":"string","value":"66541240"},"Title":{"kind":"string","value":"Interoperability of zero-knowledge proof enabled blockchains"},"CPCI":{"kind":"string","value":"H04L9/3218;H04L9/3239;H04L9/3221"},"CPCA":{"kind":"string","value":"H04L9/50"},"Inventor":{"kind":"string","value":"Schiatti; Luca et al."},"Assignee":{"kind":"string","value":"ACCENTURE GLOBAL SOLUTIONS LIMITED"},"Application Number":{"kind":"string","value":"16/142657"},"Filing Date":{"kind":"string","value":"2018-09-26"},"Primary Examiner":{"kind":"string","value":"Li; Meng"},"Assistant Examiner":{"kind":"string","value":""},"OR":{"kind":"string","value":"1/1"},"XREF":{"kind":"string","value":""},"Applicant Name":{"kind":"string","value":"Accenture Global Solutions Limited"},"Notes":{"kind":"string","value":""},"Notes/Tagged":{"kind":"string","value":""},"Relevancy":{"kind":"string","value":"51.95723"},"Database":{"kind":"string","value":"USPAT"},"total_tokens":{"kind":"string","value":"22702.0"}}},{"rowIdx":95,"cells":{"text":{"kind":"string","value":"United States Patent\n10298585\nKind Code\nB1\nDate of Patent\nMay 21, 2019\nInventor(s)\nTreat; David et al.\n\n## Blockchain interoperability\n\n### Abstract\n\nA system supports asset transfers among blockchains of differing distributed ledger technologies using interop circuitry. The interop circuitry may receive asset permissions from origin and target participant circuitry. The asset permissions may support transfer of an asset from an origin blockchain to a target blockchain. The interop circuitry, acting on behalf of the origin and target participant circuitry, locks an asset on the origin blockchain. Then the interop circuitry creates the asset on the target blockchain. The locking of the asset on the origin blockchain may prevent a double-expend opportunity, where the asset can be redeemed on the origin blockchain and on the target blockchain.\n\nInventors:\n\n**Treat; David** (Ridgefield, CT), **Giordano; Giuseppe** (Juan-les-Pins, FR), **Schiatti; Luca** (Juan-les-Pins, FR), **Palatnick; Aspyn Cole** (Long Beach, NY), **Zhang; Zixuan** (Philadelphia, PA)\n\nApplicant:\n\n**Accenture Global Solutions Limited** (Dublin, IE)\n\nFamily ID:\n\n65241132\n\nAssignee:\n\n**Accenture Global Solutions Limited** (Dublin, IE)\n\nAppl. No.:\n\n16/255167\n\nFiled:\n\nJanuary 23, 2019\n\n### Related U.S. Application Data\n\nus-provisional-application US 62622371 20180126\n\n### Publication Classification\n\nInt. Cl.:\n\n**G06F7/04** (20060101); **H04L29/06** (20060101); **H04L9/06** (20060101)\n\nU.S. Cl.:\n\nCPC\n\n**H04L63/10** (20130101); **H04L9/0643** (20130101); **H04L63/08** (20130101); H04L2209/38 (20130101)\n\n### Field of Classification Search\n\nCPC:\n\nH04L (63/08); H04L (63/10); H04L (9/0043); H04L (2209/38)\n\nUSPC:\n\n726/4\n\n### References Cited\n\n#### U.S. PATENT DOCUMENTS\n\nPatent No.\nIssued Date\nPatentee Name\nU.S. Cl.\nCPC\n2017/0048209\n12/2016\nLohe\nN/A\nH04L 63/0442\n2017/0083907\n12/2016\nMcDonough\nN/A\nG06Q 20/14\n2017/0221052\n12/2016\nSheng\nN/A\nG06Q 20/3678\n2018/0294967\n12/2017\nRoberts\nN/A\nH04L 9/3236\n2019/0034923\n12/2018\nGreco\nN/A\nG06Q 20/383\n2019/0043043\n12/2018\nSaraniecki\nN/A\nG06Q 20/3678\n2019/0080392\n12/2018\nYoub\nN/A\nG06F 21/64\n\n#### OTHER PUBLICATIONS\n\nNakamoto, Satoshi, “Bitcoin: A Peer-to-Peer Electronic Cash System” www.bitcoin.com 2008, 9 pages. cited by applicant\n\nAste, Tomaso et al., “Blockchain Technologies: The Foreseeable Impact on Society and Industry” Computer, Jan. 2017, 11 pages. cited by applicant\n\nTasca, Paolo “Digital Currencies: Principles, Trends, Opportunities, and Risks” Deutsche Bundesbank and ECUREX Research, 110 pages (2017). cited by applicant\n\nBack, Adam et al., “Enabling Blockchain Innovations with Pegged Sidechains”, Oct. 22, 2014 (commit 5620e43) 25 pages (2014). cited by applicant\n\nNarayanan, Arvind et al., “Bitcoin and Cryptocurrency Technologies”, Draft—Feb. 6, 2016, 308 pages (2016). cited by applicant\n\nNelson, Jude et al., “Extending Existing Blockchains with Virtualchain”, Princeton University, Blockstack Labs, 5 pages (2016). cited by applicant\n\nKwon, Jae et al. “Cosmos a Network of Distributed Ledgers”, 53 pages (2016). cited by applicant\n\nNelson, Jude et al, “Blockstack Technical Whitepaper”, Blockstack, 2017, 24 pages. cited by applicant\n\nSpoke, Matthew, et al., “Aion: The Third-Generation of Blockchain Network”, Nuco Engineering Team, Jul. 31, 2017, 23 pages. cited by applicant\n\nStevens, Marc et al., “The first collision for full SHA-1”, CWI Amsterdam, Google Research, 2017, 23 pages. cited by applicant\n\nTrillo, Manny, “The Digital Asset Platform”, Non-technical white paper, Digital Asset, Dec. 2016, 29 pages. cited by applicant\n\nThomas, Stefan et al, “A Protocol for Interledger Payments”, 2016, 26 pages. cited by applicant\n\nWood, Gavin, “Polkadot: Vision for a heterogeneous Multi-Chain Framework Draft 1”, Ethereum & Parity, 2016, 21 pages. cited by applicant\n\nWood, Gavin, “Ethereum: A Secure Decentralised Generalised Transaction Ledger EIP-150 Revision” Ethereum & Ethcore, 2016, 32 pages. cited by applicant\n\nKwon, Jae, “Tendermint: Consensus without Mining”, Draft v.0.6, 2014, 11 pages. cited by applicant\n\nTasca, Paolo et al., “The evolution of the bitcoin economy: Extracting and analyzing the networks of payment relationships”, The Journal of Risk Finance, 2018, 34 pages. cited by applicant\n\nBitcoin Wiki, 2018 OP\\_RETURN[Online] Available at hhps://en.bitcoin.it/wiki/OP\\_RETURn, 1 page. cited by applicant\n\nEthereum Development Tutorial, Ed. Sep. 17, 2018, 9 pages. cited by applicant\n\nTransaction Formats, Ripple, 2018, [Online] Available at https://ripple.com/build/transactions/. cited by applicant\n\nWelcome to CQRS info, CQRS, [Online] Available at hpps://cqrs.wordpress.com/2010/09/08/welcome-to-cqrs-info/ (2016). cited by applicant\n\nTasca, Paolo, “Taxonomy of Blockchain Technologies. Principles of Identification and Classification” Centre for Blockchain Technologies, Forthcoming Ledger Journal, 2018, 43 pages. cited by applicant\n\nBack, Adam, “Hashcash—A Denial of Service Counter-Measure”, Aug. 1, 2002, 10 pages. cited by applicant\n\nSchwartz, David et al., “The Ripple Protocol Consensus Algorithm”, Ripple Labs, 2014, 8 pages. cited by applicant\n\nMattila, Juri, “The Blockchain Phenomenon. In: The Blockchain Phenomenon”, Berkeley Roundtable of the International Economy, 2016, 26 pages. cited by applicant\n\nTodd, Peter, “Soft Forks Are Safer Than Hard Forks”, [Online] Available at https://petertodd.org/2016/soft-forks-are-safter-than-hard-forks (2016), 5 pages. cited by applicant\n\nBitcoin Wiki “Colored Coins”, https://en.bitcoin.it/wiki/Colored\\_Coins, 2018, 7 pages. cited by applicant\n\nPrice, Rob, “Digital currency Ethereum is cratering because of a $50 million hack”, Business Insider, Jun. 16, 2016, 13 [Online] Available at http://uk.businessinsider.com/dao-hacked-ethereum-crashing-in-value-tens-of-millions-allegedly-stolen-2016-6?IR=T [accessed Dec. 1, 2017], 6 pages. cited by applicant\n\nCroman, Kyle et al., “On Scaling Decentralized Blockchains” (a Position Paper)International Conference on Financial Cryptography and Data Security, Spring, Berlin, Heidelberg, 2016, 20 pages. cited by applicant\n\nTasca, Paolo et al., “The challenges faced by blockchain—Part 1”, Journal of digital Banking 2.2 (2017), 16 pages. cited by applicant\n\nTasca, Paolo et al., “The challenges faced by blockchain—Part 2”, Journal of digital Banking 3 (2018), 17 pages. cited by applicant\n\nVerdian, Gilbert et al., “Quant Overledger Whitepaper” Jan. 31, 2018. cited by applicant\n\n*Primary Examiner:* Lemma; Samson B\n\n*Attorney, Agent or Firm:* Brinks Gilson & Lione\n\n### Background/Summary\n\nTECHNICAL FIELD\n(1) This application claims priority to U.S. Provisional Patent Application Ser. No. 62/622,371, filed 26 Jan. 2018, and titled Blockchain Interoperability. This application also claims priority to U.S. Provisional Patent Application Ser. No. 62/769,343, filed 19 Nov. 2018, and titled Blockchain Interoperability, which is incorporated by reference in its entirety\n\nTECHNICAL FIELD\n(1) This disclosure relates to interoperability among distributed ledger technologies.\nBACKGROUND\n(2) Rapid advances in electronics and communication technologies, driven by immense customer demand, have resulted in newly emerging complex network transaction chains. Improvements in the hardware and software implementations of the underlying processing for the transaction chains will increase the security, reliability, and speed of the implementations.\n\n### Description\n\nBRIEF DESCRIPTION OF THE DRAWINGS\n(1) FIG. 1 shows a blockchain interop system interacting with participant circuitry.\n(2) FIG. 2 shows example interop logic.\n(3) FIG. 3 shows an example specific execution environment for the interop system of FIG. 1.\n(4) FIG. 4 shows a specific illustrative example blockchain interoperability system.\n(5) FIG. 5 shows a flow diagram of an example agreement process by which an asset may be transferred.\n(6) FIG. 6 shows a block diagram showing an example Trusted Entity Agreement exchange.\n(7) FIG. 7 shows a block diagram showing an example DLT agreement exchange.\n(8) FIG. 8 shows a block diagram showing an example asset transfer proposal.\n(9) FIG. 9 shows a block diagram showing an example reply confirming a proposal.\n(10) FIG. 10 shows a block diagram showing an example notification to the Portals regarding an asset transfer initiation.\n(11) FIG. 11 shows a block diagram showing an example interaction where asset locking and creation is successful.\n(12) FIG. 12 shows a block diagram showing an example notification to the Portals indicating that the transfer is complete.\nDETAILED DESCRIPTION\n(13) In a blockchain, participants, e.g., clients, terminals, or other participating nodes, may append data blocks to a blockchain. Executable code that controls the operation of the blockchain, may implement multiple mechanisms that control append operations to the blockchain to be compliant with one or more distributed ledger technologies (DLTs). A DLT may include a collection of one or more blockchain features that are adopted in the blockchains that are compliant with the DLT. One mechanism may include a hash structure that, for example, may include a self-referential scheme that may help prevent evidence-less tampering with the blockchain content. Additionally or alternatively, executable code may implement a consensus mechanism that may facilitate determination of which blocks and what content may be rightly appended to the blockchain. Additionally or alternatively, the executable code may define the format of blocks (e.g., the size, number, and name of fields; the format of tracked assets; or other formatting parameters) that may be appended to the blockchain. Differing DLTs may differ in one or more operational mechanisms, such as those discussed above or other mechanisms. Accordingly, a block on a first blockchain compliant with a first DLT may not necessarily be appended to a second blockchain compliant with a second DLT. Accordingly, different DLTs may be incompatible because records on a first DLT cannot necessarily be also appended to the second incompatible DLT in the absence of translation.\n(14) An asset (e.g., a spendable asset such as coin, a tracked asset such as a shipment, an executable asset such as smart contract, or other asset) may be tracked on the blockchain. When the asset is expended (e.g., delivered, spent, or otherwise expended), the asset may be marked as spent on the blockchain. If a single asset is tracked on multiple blockchains, in some cases, the asset may be double-spent or otherwise expended multiple times (e.g., once on each of the blockchains). When an asset is tracked or partially tracked on multiple blockchains, the blockchains may be coordinated to avoid multiple expend scenarios.\n(15) The techniques and architectures discussed herein discuss a blockchain interoperability system in which interop circuitry performs asset transfer and translation between blockchains, including those compliant differing and incompatible DLTs. Further, the interop circuitry coordinates asset tracking among the blockchains. For example, this coordination may ensure that multiple expends of an asset remain disallowed even after the transfer.\n(16) Asset transfers, tracking, and transactions on a blockchains occur through the manipulation of cryptologic and/or cryptographic primitives. Interoperation between differing DLTs involves manipulation of specialized cryptologic and/or cryptographic primitives to support the interoperation, which involves the creation of cryptographic primitives for locking, unlocking, and instantiation of the assets on various ones of the interoperating blockchains. Accordingly, the techniques and architectures discussed herein, including but not limited to receiving and using asset and/or write permissions, locking assets, instantiating assets, and/or implementing a multiple tier permission detail a technical solution (implementing interoperability) to a technical problem (non-interoperating blockchains). This technical solution improves the operation of the underlying hardware—previously non-interacting hardware systems provide an efficient platform by which to interact. Furthermore, the aforementioned features provide improvements over existing market solutions by providing a technical solution allowing greater interoperation between blockchain-based hardware systems as compared to existing interoperation techniques.\n(17) Referring now to FIGS. 1 and 2, FIG. 1 shows a blockchain interop system **100** interacting with participant circuitry **110**, **160** associated with blockchains **130**, **180**. FIG. 2 shows accompanying interop logic **200** that may control operation of interop circuitry **102** within the interop system **100**. Interop circuitry may refer to circuitry, including hardware, that may execute the blockchain interoperability operations discussed herein. In some cases, interop circuitry **102** may act as a participant node within a distributed network **140**, **190** operating a blockchain. The interop circuitry **102** may participate as a node in multiple networks **140**, **190** concurrently, allowing the interop circuitry to act as an interoperability node for the blockchains corresponding to the networks in which the interop circuitry **102** is a participant. Participant circuitry may refer to participant nodes **112**, **162** that interact with the interop circuitry **102** to execute cross-blockchain asset transfers. In some cases, particular blockchains or organizations running one or more blockchains may centralize interop circuitry interaction through designated participant circuitry (e.g., for a single point of contact). In some cases, multiple different nodes/clients from a single blockchain may interact with the interop circuitry. In either of these cases, participant circuitry may interact with the interop circuitry on behalf of other nodes/client within their respective blockchains. The blockchains **130**, **180** may be stored on memory **132**, **182** which may be distributed and/or redundant. In other words, the blockchain may be at least partially stored on particular memory hardware and the same portions stored on the particular memory hardware may be redundantly stored on other memory hardware. The participant circuitry **110**, **160** may be participant nodes for the respective blockchains.\n(18) Via the interop system **100**, the participant circuitry may exchange read/write permissions and asset permissions as discussed below. In some implementations, the exchange between the participant circuitry may include granting the interop circuitry permissions to act on behalf of the other participant circuitry, e.g., to perform a blockchain write operation and/or transfer an asset between the blockchains. In various scenarios, a participant circuitry may be designated origin participant circuitry **110** and a blockchain designated an origin blockchain **130**. Similarly, a participant circuitry may be designated target participant circuitry **160** and a blockchain designated a target blockchain **180**. These designations may be transfer specific and may change with different transfers depending on the origin of a particular asset and the target where the asset is headed. In some scenarios, target and origin designates may alternate back and forth as multiple assets are transferred in two-way interoperations between blockchains.\n(19) Referring now to FIG. 2, while continuing the reference the example structures in FIG. 1, To perform an asset transfer, the interop circuitry **102** may receive a write permission **201** for the origin blockchain **130** from origin participant circuitry **110** (act **202**). For example origin participant circuitry may grant the interop circuitry write permissions for the origin blockchain **130**. In some implementations, this may include making an alteration to chaincode, blockchain parameters, blockchain authorized user lists, adding credentials for the interop circuitry to an authorization system, grant access to a private network on which the origin blockchain operates, or other permission grant. In some cases, the origin blockchain may not necessarily implement permission control. Accordingly, in some cases, a write permission grant for the origin blockchain **130** may not necessarily be required for implementation of the interop circuitry. Additionally or alternatively, permission control may be implemented via blockchain components which may be integrated with or separate from the DLT technology. For example, a blockchain may implement permission control via smart contract. In some implementations, permissions may be implemented via a consensus mechanism. In some implementations permissions may be implanted by both smart contract and consensus. For example, permitted node identities may be added or removed by smart contract and procedures and protocols for implementing permission assignments may be integrated into the consensus mechanism.\n(20) The interop circuitry **102** may receive a write permission **203** for the target blockchain **180** from target participant circuitry **160** (act **204**). For example, target participant circuitry **160** may grant the interop circuitry write permissions for the target blockchain **180**. In some implementations, this may include altering chaincode, blockchain parameters, blockchain authorized user lists, adding credentials for the interop circuitry to an authorization system, grant access to a private network on which the origin blockchain operates, or other permission grant. In some cases, the target blockchain may not necessarily implement permission control. Accordingly, in some cases, a write permission grant for the target blockchain **180** may not necessarily be required for implementation of the interop circuitry.\n(21) In some implementations, the write permissions may be exchanged (e.g., passed to the interop circuitry, but not necessarily passed all the way through to the opposing origin/target participant circuitry) in an establishment tier of a multiple-tiered permission exchange. This establishment tier may include negotiated permission exchanges to support later, as of yet unplanned asset transfers between the blockchains. In other words, the establishment tier may setup general permissions not specific to any particular asset. For example, the write permission exchange may include operational permissions, such as for example, establishing commands/strings/chaincode for inactivating/locking assets, reactivating/unlocking assets, creating assets to support transfer from other blockchains, and identifiers to support consistent asset tracking across the target/origin blockchains. Thus, a later asset exchange may be implemented using a second transfer tier in which an asset is identified and permissions (e.g., asset permissions) specific to that asset are exchanged.\n(22) In some implementations, the establishment tier may further be divided into trust and access subtiers. In the trust subtiers, the participant circuitry may exchange write permissions allowing interaction between the DLTs. In other words, the trust subtier deals with establishing the relationship between the target and origin networks. In the access subtier, the participant circuitry may provide write permissions allowing the interop circuitry to read/write blockchains or otherwise execute transactions on behalf the participant circuitry for the purpose of the exchange. In other words, the access subtier deals with the permissions used by the interop circuitry to perform its role.\n(23) In some cases, locking may depend on parallel operation of executable code overlaid on to the blockchain native code. For example, the parallel executable code may act as a wrapper around the blockchain mediating the blockchains external interactions. Thus, locking may be implemented without necessarily altering the native code of the blockchain. Additionally or alternatively, locking status of an asset may be maintained in a central registry (e.g., on the interop circuitry or on an external datastore). For example, the interop circuitry **102** may establish locking status of an asset by making a reference to a status field held by the registry. Thus, the registry may be contacted to obtain the current status of the asset (e.g., locked or unlocked). Further, such operational permissions may be exchanged as write permissions even where the multiple tier exchange is not necessarily implemented. Additionally or alternatively, the operational permissions may be exchanged even where access type write permissions (as described above) are not necessarily exchanged.\n(24) Once a specific asset for transfer is selected, the interop circuitry may receive an origin asset permission **205** for the origin blockchain (act **208**). As an illustrative example, the asset (a digital cryptologically primitive on the blockchain) may represent fruit shipment (e.g., pineapple) in the real world. The origin asset permission may include permissions to support locking and/or inactivation of the asset on the origin blockchain. This inactivation/locking may prevent a multiple-spend instance for the asset where the asset is spent on the origin blockchain after transfer. The permissions to support this inactivation/locking operation may include permissions to write to particular block fields, for example auxiliary fields, comment fields, protocol reserved fields, or other fields which may not necessarily have designated functions for blockchain operations.\n(25) The origin asset permission may also indicate which nodes within the origin network (e.g., that maintains the origin blockchain) should be notified when the transfer is completed. For example, the origin participant circuitry node (e.g., that initiated the transfer from the origin network) may be included on the notification list. In some cases, all nodes on an origin network may be notified. In some cases, identified interested nodes (e.g., a subset of the network's nodes) may be notified. The origin asset permissions may designate these notifications.\n(26) In connection with the asset, the interop circuitry may receive a target asset permission **207** for the target blockchain (act **210**). The target asset permission may include permissions to allow instantiation of the asset on the target blockchain. For example, the permission may include permission to append a block to the target blockchain or request entries on a block to be appended to the blockchain; prospectively write an asset to the blockchain for later unlocking (e.g., once locking is confirmed on the origin blockchain); permissions to unlock a prospectively written asset; permission to write to particular block fields, for example auxiliary fields, comment fields, protocol reserved fields, or other fields which may not necessarily have designated functions for blockchain operations to coordinate asset tracking and locking control, or other permissions. The target asset permissions may include permissions that are specific to the asset (associated transaction transferring the asset).\n(27) Using the origin asset permission **205**, the interop circuitry **102** may lock the asset on the origin blockchain (act **212**). Locking the asset may involve actions to prevent the asset from being used in later transactions in the blockchain. For example, the interop circuitry may mark the asset with a string or cryptographic primitive that may indicate a locked status—in later blocks these marks may be hashed along with the other content of the block. The interop circuitry may expend the asset to a designated account for transferred assets or an asset specific account to facilitate later tracking of the asset. The interop circuitry **102** may act to ensure that once the asset is transferred from the origin blockchain the asset may not be expended on the origin blockchain. Further, the interop circuitry **102** mark the asset so that it may be tracked to the target blockchain.\n(28) Using the target asset permission **207**, the interop circuitry **102** may instantiate the asset on the target blockchain (act **214**). Instantiation may include actions to create an asset and/or to advance an asset to a state where the asset may be expended on the target blockchain. In some cases, the interop circuitry **102** may wait until the asset is locked on the origin blockchain before creating the asset on the target blockchain. In some cases, the interop circuitry may prospectively create the asset on the target blockchain before the asset may necessarily be locked on the origin blockchain. This may aid in preventing loss of an asset where the asset is locked on one chain, but never fully created on another. After confirming locking on the origin blockchain, the interop circuitry may unlock the prospectively created asset on the target blockchain. The instantiation of an asset may involve writing a string/cryptographic primitive to a blockchain field as discussed above. In some cases, the target asset permission may detail the content of the string/cryptographic primitive as discussed above. In some cases, the included string may identify the origin blockchain to help facilitate tracking across the blockchains.\n(29) In some cases, the target asset permission may detail notifications for nodes on the target network **190** (e.g., that maintains the target blockchain). For example, the target participant circuitry node may be notified of transfer completion. Additionally or alternatively, other nodes may be notified similarly to those discussed above with respect to origin network. In some cases, no particular notifications may be sent, but the general distribution of blockchain updates allows any participating node to read block contents and determine that the asset was transfer in/out.\n(30) In some implementations, to handle tracking and assignment of the permissions discussed above, the origin **140** and target networks **190** respectively administering the origin and target blockchain may maintain identity or credential nodes **149**, **199** that may ensure that participant nodes in the networks operate within their proper roles. Accordingly, the interop circuitry may maintain credentials to substantiate the identity of the interop circuitry with the identity/credential nodes **149**, **199**. This may help ensure that the interop circuitry has the correct permissions to execute a transfer and may prevent other nodes from attempting to improperly perform such transfers (or other non-permissioned transactions).\n(31) FIG. 3 shows an example specific execution environment **300** for interop system **100** described above. The execution environment **300** may include system logic **314** to support execution of the interop logic **200** described above. The system logic **314** may include processors **316**, memory **320**, and/or other circuitry. In various implementations, the specific execution environment **300** may act as the interop circuitry **102** when specifically configured to implement that interop logic **200**.\n(32) The memory **320** may include blockchain blocks **352**, hash parameters **354**, and network data **356** to support blockchain manipulation and writing. The memory **320** may further include applications and structures **366**, for example, cryptographic primitives, security credentials, machine instructions, templates, or other structures to support permission exchange, asset transfer, transfer notification, blockchain reads/writes or other tasks described above. The applications and structures may implement the interop logic **200**.\n(33) The execution environment **300** may also include communication interfaces **312**, which may support wireless, e.g. Bluetooth, Wi-Fi, WLAN, cellular (4G, LTE/A), and/or wired, Ethernet, Gigabit Ethernet, optical networking protocols. The communication interfaces **312** may also include serial interfaces, such as universal serial bus (USB), serial ATA, IEEE 1394, lighting port, I.sup.2C, slimBus, or other serial interfaces. The communication interfaces **312** may be used to support and/or implement permission exchanges, remote operation, blockchain network participation or other tasks. The execution environment **300** may include power functions **334** and various input interfaces **328**. The execution environment may also include a user interface **318** that may include human-to-machine interface devices and/or graphical user interfaces (GUI). The user interface **318** may be used to support and/or implement local or localized operation (noting that the blockchain network and/or the execution environment itself may be distributed) of the execution environment **300**. In various implementations, the execution environment **300** implemented at the interop circuitry **102** may be distributed over one or more physical servers, be implemented as one or more virtual machines, be implemented in container environments such as Cloud Foundry or Docker, and/or be implemented in Serverless (functions as-a-Service) environments.\n(34) In some cases, the execution environment **300** may be a specially defined computational system deployed in a cloud platform. In some cases, the parameters defining the execution environment may be specified in a manifest for cloud deployment. The manifest may be used by an operator to requisition cloud based hardware resources, and then deploy the software components, for example, the applications and structures **366**, of the execution environment onto the hardware resources. In some cases, a manifest may be stored as a preference file such as a YAML (yet another mark-up language), JSON, or other preference file type.\n(35) The methods, devices, processing, circuitry, and logic described above and in the specific illustrative examples below may be implemented in many different ways and in many different combinations of hardware and software. For example, all or parts of the implementations may be circuitry that includes an instruction processor, such as a Central Processing Unit (CPU), microcontroller, or a microprocessor; or as an Application Specific Integrated Circuit (ASIC), Programmable Logic Device (PLD), or Field Programmable Gate Array (FPGA); or as circuitry that includes discrete logic or other circuit components, including analog circuit components, digital circuit components or both; or any combination thereof. The circuitry may include discrete interconnected hardware components or may be combined on a single integrated circuit die, distributed among multiple integrated circuit dies, or implemented in a Multiple Chip Module (MCM) of multiple integrated circuit dies in a common package, as examples.\n(36) Accordingly, the circuitry may store or access instructions for execution, in hardware, or may implement its functionality in hardware alone. The instructions may be stored in a tangible storage medium that is other than a transitory signal, such as a flash memory, a Random Access Memory (RAM), a Read Only Memory (ROM), an Erasable Programmable Read Only Memory (EPROM); or on a magnetic or optical disc, such as a Compact Disc Read Only Memory (CDROM), Hard Disk Drive (HDD), or other magnetic or optical disk; or in or on another machine-readable medium. A product, such as a computer program product, may include a storage medium and instructions stored in or on the medium, and the instructions when executed by the circuitry in a device may cause the device to implement any of the processing described above or illustrated in the drawings.\n(37) The implementations may be distributed. For instance, the circuitry may include multiple distinct system components, such as multiple processors and memories, and may span multiple distributed processing systems. Parameters, databases, and other data structures may be separately stored and managed, may be incorporated into a single memory or database, may be logically and physically organized in many different ways, and may be implemented in many different ways. Example implementations include linked lists, program variables, hash tables, arrays, records (e.g., database records), objects, and implicit storage mechanisms. Instructions may form parts (e.g., subroutines or other code sections) of a single program, may form multiple separate programs, may be distributed across multiple memories and processors, and may be implemented in many different ways. Example implementations include stand-alone programs, and as part of a library, such as a shared library like a Dynamic Link Library (DLL). The library, for example, may contain shared data and one or more shared programs that include instructions that perform any of the processing described above or illustrated in the drawings, when executed by the circuitry.\n(38) In various example implementations, the interop circuitry may be implemented as a Node P and origin/target participant circuitry as Portals in the Portal™ blockchain interoperability solution by Accenture. Various implementations of the Portal™ solution are discussed below. The example Portal™ solution discussed below is included as specific illustrative collection of examples of the architectures and techniques discussed above.\nExample Implementations\n(39) The example implementations of the interop system **100** described allow for asset transfer between any two blockchains (e.g., Quorum, Hyperledger, or other DLT types). The disclosed architectures and techniques preserve security and consistency features of the involved DLT (e.g., the blockchains subject to the asset transfer).\n(40) In some cases, distributed ledger technology (DLT) may be implemented in supply chain tracking because DLT involves keeping track of the sequence of events that occur to an asset as it transitions through the different states. Because these events may occur at different places and may be recorded by different parties, an auditable, transparent, and at least partially immutable database may be used to record these state changes.\n(41) As discussed above, different parties involved on the same supply chain may use different DLTs to track assets. To preserve the blockchain consensus, an asset may be locked on its origin DLT before the asset may be initiated on a target DLT. This helps ensure that a single (e.g., not more than one) transferable asset exists at any point in time. In some cases, the example system may allow ownership to change for a non-transferable asset. For example, in some cases, the asset can be transferred, but may remain in a locked state. The locked state conveys that the asset has been transferred to a new DLT and thus any changes made to that locked asset are being performed on an invalid asset.\n(42) Thus, an asset that can be safely transferred using Portal™ may be locked. Note that this does not necessarily mean that the smart contract/chaincode has been modified to add the locking feature. As discussed above, a separate wrapper, e.g., chaincode or smart contract, controlling this asset can be used to lock the asset. Alternatively or additionally, this locked status could be controlled from some central registry on the DLT.\n(43) As described above, there are a variety of ways of implementing locking for an on-chain asset. As such, a client interface is specified and contains the functions for Portal™ to learn the state of the asset. Table 1 show example function parameters.\n(44) TABLE-US-00001 TABLE 1 Example Function Parameters Parameters Returns Function Key Value Key Value createAsset Info: JSON Promise: Resolves to JSON origin\\_asset\\_id asset\\_id success True if on last creation is DLT successful, origin\\_dlt\\_id DLT false identifier otherwise negotiated data Optional through extra data Portal(TM) asset\\_id ID of new of last asset DLT transferAsset Info: JSON object Promise: Resolves to JSON asset\\_id ID of asset success True if asset to lock is successfully locked, false otherwise data Optional extra data isLocked Info: JSON object Promise: Resolves to JSON asset\\_id ID of asset success True if asset to check is locked, lock on false otherwise data Optional extra data query Info: JSON object Promise: Resolves to JSON asset\\_id ID of asset success True if asset to return exists, false state from otherwise origin\\_asset\\_id asset\\_id on last DLT origin\\_dlt\\_id DLT identifier negotiated through Portal(TM) of last DLT\n(45) As an illustrative example, in Fabric, the system may implement a key-value mapping data structure. Hence, for each new asset created on Fabric, four hashes are generated as keys to store different information about the asset in the mapping. The first key is called the state key and its corresponding value is an array of different states associated with this new asset. The first state of every asset may be “created”. If there is an attempt to create an asset that already exists on Fabric (which is determined by looking at the asset ID), the system may generate or throw out an error, may leave the existing asset as is, and may not create a second duplicate asset. Secondly, there is a key that is a SHA256 hash of the asset ID appended with the string “originID”. The origin asset ID may be associated with this key. Third, there is another key that is a SHA256 hash of the asset ID appended with the string “lockState”. This contains information about if the asset is locked. This may be initialized to be “unlocked” and the other possible value is “locked”. Fourth, there is a key that is a SHA256 hash of asset id appended with “dltID”. The value associated with this key stores the origin DLT ID where this asset is transferred from.\n(46) Upon locking an asset, the chaincode may first check if the asset record already exists and if the asset is already locked. If either of these holds true, the system may generate an error. Otherwise, the chaincode may first change the value associated with the locked state key to “locked” and then append “locked” to the state array associated with this asset ID.\n(47) In the example Portal™ system, assets defined in the Portal™ system that exist on a Quorum chain may exist on a single contract. This contract maintains a mapping for each asset to track the current state of each asset.\n(48) The mapping maps asset IDs to asset state (a string), and isLocked (a boolean). The mapping also maintains mappings to the original DLT identifier (empty if the asset was originally created on this chain and existed on no prior chain), and the original asset ID (again, empty if the asset was created on this chain and existed on no prior chain). This information allows the previous states of the asset to be traced through to the previous DLTs. When an asset is transferred, the isLocked state is set to true, and the asset should not be accepted by anyone on this DLT anymore.\n(49) The asset transfer process relies on a trusted intermediary to facilitate the transfer process. Three parties participate in the process: two Portal™s and one Node P. Each of these parties follows the standard Interoperability Server architecture with some additional features. Through Communication with Node P, the parties (1) Establish baseline agreements about the servers that may be notified of state changes in the asset transfer process (2) Establish baseline agreements on the DLTs that may be used and register the credentials needed for reading/writing to each DLT (3) Initiate and receive updates about the asset transfer process\n(50) The Interoperability Server that serves as an intermediary in the asset transfer process is labelled Node P. All Portals that wish to perform asset transfers must communicate their intentions and a set of credentials for interacting with their respective DLT(s) to Node P. Thus, the security of the transfer process relies on Node P, and so it is designed to be operated by an entity that is trusted by the organizations which hold Portals for a given exchange. FIG. 4 shows an example blockchain Portal™-based interoperability system **400**. The organizations **402**, **404** may interact with the Node P **410** via respective portal nodes, e.g., example Portals A and B. For example, organization A **402** may direct its interactions with organization B **404** by routing communications from Portal A to Portal B via Node P (B). Node P (B) has permissions from both organizations A and B **402**, **404**. Organization A **402** may rout communications to a third organization (not pictured) through Node P (A). Similarly, organization B may route communication to a fourth organization (not pictured) through Node P (C). From the Portals A and B, communications may be routed to individual nodes controlled via the organizations A and B **402**, **404**.\n(51) Node P is the party responsible for holding the agreements and for holding states in the asset transfer process. The Portals are a gateway for interacting with Node P. More specifically, the Portals allow the organizations to send Node P messages asking to establish agreements and to perform asset transfers. Additionally, the Portals receive updates as these agreements are finalized and as each step in the transfer process occurs.\n(52) The Interoperability Server that serves as an endpoint of asset transfer communication is labelled Portal. Any organization or collection of organizations acting as a single unit wishing to transfer assets off or onto a DLT may have a single Portal that they use to communicate with Node P. The Portal itself provides a mechanism for organizations to execute their own unique business logic whenever state transitions in the asset transfer process occur as the Portal is notified at each successful step or failure in the asset transfer process.\n(53) FIG. 5 shows a flow diagram **500** of an example agreement process that sets up the three agreement types. In some cases, the asset transfer solutions use on three agreements in order for asset transfer to occur. First, two Portals may agree to communicate with one another by establishing common DLT identifiers and to perform asset transfers facilitated by Node P (act **502**). Second, two Portals may agree on the respective DLTs for which they would like to involve in asset transfer (act **504**). Third, two Portals may agree on the asset to be transferred, which DLT the asset may be transferred from, and which DLT the asset may be transferred to (act **506**). The third agreement, once confirmed by both parties, may carry out the asset transfer process on Node P and may periodically notify the involved Portals of state transitions in the asset transfer process and of errors, if errors do occur.\n(54) This agreement process may allow for additional communication or trust validation (such as verifying certificates and proofs) to occur between parties before certain agreements are established.\n(55) Two Portals that would like to have the ability to be involved in asset transfers must communicate with Node P that they would like to establish a Trusted Entity Agreement, which is stored on Node P and indicates an agreement for mutual communication between the two Portals involved. The reason this agreement is used is because Node P is responsible for sending messages to parties that are willing to interoperate. FIG. 6 shows a block diagram showing an example Trusted Entity Agreement exchange **600** between to nodes from two different DLTs.\n(56) The process for establishing a Trusted Entity Agreement is: the Portals send messages to Node P, and then Node P issues a message to the Portals once the agreement is established. In an example scenario, the two organizations represented by Portal A and Portal B, respectively, and Node P. Since the Portals are used to communicate with Node P, the organizations may employ a way to communicate with their respective Portal. Each organization may have a client that is allowed to send messages to the organization's Portal. For example, Portal A has a client, client A, that is allowed to send requests to Portal A, and Portal B has some client, client B, that is allowed to send requests to Portal B. Now, if Portal A would like to establish a Trusted Entity Agreement with Portal B, the following steps take place:\n(57) Client A sends a message to Portal A asking Portal A to establish a Trusted Entity Agreement with Portal B.\n(58) Portal A receives the message from client A and sends a message to Node P stating that Portal A would like to establish an interoperability agreement with Portal B. In an example implementation, IP Addresses+Ports are used to uniquely identify Portals for the purpose of this agreement.\n(59) Node P receives the message from Portal A and stores the Trusted Entity Agreement between Portal A and Portal B as “unconfirmed”.\n(60) The above may be repeated with client B and Portal B sending the messages.\n(61) Once Node P receives the message from Portal B asking to establish a Trusted Entity Agreement with Portal A, given that the Trusted Entity Agreement between Portal A and Portal B is stored on Node P as “unconfirmed”, the state of the Trusted Entity Agreement between Portal A and Portal B that is stored on Node P is updated to be “confirmed”. At this point, Portal A and Portal B have successfully established an interoperability agreement.\n(62) Node P sends a message to both Portals stating the Trusted Entity Agreement has been established.\n(63) Next, two Portals that would like to have the option to be involved in asset transfers with one another must communicate with Node P that they would like to establish a DLT Agreement, which is stored on Node P and indicates an agreement between the two Portals regarding common identifiers for the DLTs that may be involved in the interoperability process. This agreement is used because an individual Portal may be responsible for asset transfer on/off more than one DLT, and so both parties involved in the asset transfer may establish which DLTs are allowed to be used in asset and in which way those DLTs can be used. This is handled by the DLT agreement manager on Node P. FIG. 7 shows a block diagram showing an example DLT agreement exchange **700** between two clients.\n(64) Additionally, since Node P is responsible for locking the asset on one DLT and creating the asset on the other DLT, the DLT agreement also contains the credentials needed to allow Node P to interact with the individual DLTs. In the DLT agreement, two Portals (e.g., the Portal that may be the asset sender and the Portal that may be the asset receiver) are specified and information about the sender DLT and information about the receiver DLT is specified. The information that must be specified about the DLTs involved is, for each DLT, (1) the common identifier for the DLT (e.g. the identifier both parties may use when referring to this DLT in the asset transfer context) (2) the type of the DLT (e.g., Fabric, Quorum, etc.) (3) the credentials to allow Node P to interact with the DLT. Node P contains interactor files that allow for Node P to create and lock assets on Quorum, Fabric, and any other DLT for which Node P has an interactor implementation.\n(65) The process for establishing a DLT Agreement is based on the Portals sending messages to Node P and Node P issuing a message to the Portals once the agreement is established. Again, Portal A and Portal B represent two different organizations, each Portal has a client that is allowed to send requests to that Portal (the clients are named client A and client B, respectively), and Node P facilitates the interoperability process. Portal A is responsible for DLT A and Portal B is responsible for DLT B. Now, if Portal A would like to establish a DLT Agreement with Portal B about allowing the transfer of assets from DLT A to DLT B, the following steps must take place:\n(66) Client A sends a message to Portal A asking Portal A to establish a DLT Agreement with Portal B with regards to allowing DLT A to transfer assets to DLT B. Included in this message are common identifiers for DLT A and DLT B, the type of DLT for DLT A and DLT B, and the credentials to allow Node P to interact with DLT A.\n(67) Portal A receives the message from client A and sends a message to Node P stating that Portal A would like to establish a DLT agreement with Portal B with regards to allowing DLT A to transfer assets to DLT B. IP Addresses+Ports are used to uniquely identify Portals for the purpose of this agreement.\n(68) Node P receives the message from Portal A and checks to see if a Trusted Entity Agreement has already been established between Portal A and Portal B. If said agreement has not been established, an error is returned in the response. Otherwise, Node P stores the DLT Agreement between Portal A and Portal B about DLT A and DLT B as “unconfirmed”. Additionally, Node P stores the common identifiers of the DLTs, the types of the DLTs, and the credentials to interact with DLT A.\n(69) The above process is repeated but with client B and Portal B sending the messages.\n(70) Once Node P receives the message from Portal B asking to establish a DLT Agreement with Portal A, given that the DLT Agreement between Portal A and Portal B is stored on Node P as “unconfirmed”, a validation check is performed, and if this check passes, the state of the DLT Agreement between Portal A and Portal B that is stored on Node P is updated to be “confirmed”. The validation check passes if the common identifiers and types of the DLTs stored in the unconfirmed agreement on Node P match the common identifiers and types of the DLTs in the message from Portal B to Node P.\n(71) If the state of the DLT Agreement is updated to confirmed, then Node P sends a message to both Portals stating the DLT Agreement has been established.\n(72) Two Portals are permitted to engage in asset transfer after the two Portals establish a Trusted Entity Agreement and a DLT Agreement between sender DLT A and receiver DLT B. The asset transfer process may include multiple stages that will be described below.\n(73) Client A sends message to Portal A asking to initiate asset transfer of asset W with Portal B from DLT A to DLT B and Portal A sends a message to Node P asking to initiate asset transfer of asset W with Portal B from DLT A to DLT B. FIG. 8 shows a block diagram showing an example asset transfer proposal **800** between two clients.\n(74) Client B sends message to Portal B asking to initiate asset transfer of asset W with Portal A from DLT A to DLT B and Portal B sends a message to Node P asking to initiate asset transfer of asset W with Portal A from DLT A to DLT B. The messages from Portal A and Portal B can be received in either order. FIG. 9 shows a block diagram showing an example reply **900** confirming a proposal. Once Node P receives both messages, the asset transfer process is confirmed and is initiated.\n(75) Portal A and Portal B are notified that the asset transfer process has begun. FIG. 10 shows a block diagram showing an example notification **1000** to the Portals regarding an asset transfer initiation.\n(76) The manager on Node P responsible for locking the asset on the sender DLT and creating the asset on the receiver DLT needs a mechanism to interact with the individual DLTs. As described in more detail in the “Standard Asset Locking Mechanism” section, a common DLT interaction interface is implemented for each DLT type that can be handled by Node P. This interface contains functions for locking the asset and creating the asset on the smart contract (or smart contract equivalent) on the sender and receiver DLT, respectively. To retrieve the correct implementation, there is a module known as a DLT Interactor Fetcher that has a DLT type as input and returns the DLT interactor implementation, as a javascript object, as output. The DLT interactor implementation is loaded at runtime, immediately before the asset is either locked on the sender or the corresponding asset is created on the receiver.\n(77) In order to ensure that the asset is considered “transferred off” DLT A, the DLT interactor is used to move asset W into the “locked” state, (as defined by the standards set forth in the “Standard Asset Locking Mechanism”). Portal A and Portal B are notified that asset W has been locked. If an error in locking occurs, which implies locking the asset is unsuccessful, then the asset transfer process may terminate and may send an error message to both Portals.\n(78) In order to ensure that the asset is considered “transferred onto” DLT B, the DLT interactor is used to create an asset on DLT B that stores the identifier for asset W on the origin DLT and the sender DLT identifier, as established in the DLT Agreement, on-chain with the newly-created asset. This may be achieved using the “Asset Locking Mechanism”. Portal A and Portal B are notified that an asset corresponding to asset W has been created on the receiver DLT. When the phrase “Asset corresponding to asset W” is used, this refers to the asset that has been created on the receiver DLT. FIG. 11 shows a block diagram showing an example interaction **1100** where asset locking and creation is successful. The created asset has an on-chain reference to the origin asset ID of W and the sender DLT ID. If an error in asset creation occurs, which implies asset creation is unsuccessful, then the asset transfer process may terminate and may send an error message to both Portals.\n(79) Node P uses the ability to write to the sender DLT and to write to the receiver DLT. If an error in locking or creating the asset occurs, then the DLT interaction stage may abort and may send an error message to both Portals.\n(80) At the point that asset W is confirmed locked on the sender DLT and the corresponding asset is confirmed created on the receiver DLT, both Portals may be sent a message that indicates the asset transfer process is complete. FIG. 12 shows a block diagram showing an example notification **1200** to the Portals indicating that the transfer is complete.\n(81) Messages in the asset transfer process may be sent as POST requests and either receive an error or an “ok” as a response. The response to a request may indicate that the request was processed. The response may not necessarily indicate that a state change in the asset transfer process has successfully occurred. When state changes in the transfer process occur, Node P may send requests to the Portals involved with messages describing the state change and those Portals may acknowledge those requests by sending an “ok” in their response.\n(82) In the specific example interoperability solutions based on Portal™, various components may be implemented. The paragraphs below discuss implementation of example components. As a first example component, an example Interoperability Server is a module that runs an Express server and contains multiple layers of abstraction to isolate the various interactions that occur with the server, with data storage, with the asset transfer process, and with direct DLT interactions. Additionally example components are added to the server in the form of routes listed in the server base class, a Routes file for handling said routes, and a Manager class for executing the correct business logic for each of those Routes.\n(83) In order to ensure that Portals that agree to communicate and agree to some identifiers for their respective DLTs are involved in asset transfer, middleware validates the existence of these agreements.\n(84) In the specific example interoperability solutions based on Portal™, various components may be implemented. The paragraphs below discuss implementation of example components. As a first example component, Routes for establishing trusted entities may not, in some cases, require agreement validation as these Routes are how the baseline agreement is established in the first place.\n(85) All Routes for establishing common DLT identifiers require a Trusted Entity Agreement to be in place. Since the DLTs involved by the two parties are relevant for asset transfer, the parties use a common way to be able to refer to their own and to each other's DLTs. If no Trusted Entity Agreement is in place when a DLT agreement is proposed, an error may be returned by Node P to the Portal that sent the message about the DLT agreement to Node P.\n(86) All Routes for the asset transfer process require both a Trusted Entity Agreement and a DLT identifier agreement to be in place. If no Trusted Entity Agreement is in place when an asset transfer agreement is proposed, an error may be returned by Node P to the Portal that sent the message about the asset transfer agreement.\n(87) Routes files may include functions, with a function for each endpoint, that are called immediately after the respective endpoint is hit on the server. These functions all take in a request and response as arguments. Each Routes file is associated with a Manager. The associated Manager contains a function to handle at least each endpoint, and so when an endpoint is hit, the server may call the corresponding Routes function and the Routes function may call the corresponding Manager function. The Routes itself is responsible for responding to the request, and may either return an error if some problem occurred or may return an “ok” response if the request succeeded.\n(88) Referring now to another example component, the example system may implement a Storage interface that has been established to provide flexibility with regard to how data is stored on Node P. An implementation of the Storage interface uses functions on a JSON object to store, update, and retrieve data. This JSON object may be backed up using a file on disk that is updated when updates to the JSON object occurs.\n(89) The “state-holding” wrapper for a Storage object is called a Vault. A Vault allows for some key-value pair to be associated with a certain state. The Vault is designed to allow for a predefined set of possible state transitions, and attempts to transition from a state to an invalid state may result in an error being thrown (generally through a promise rejection). The entire state of the system can be observed by just looking at the current states in the available Vaults, yet another example component. A Storage object is used to keep track of states (mapping key to state) and a Storage object is used to keep track of key-value pairs (mapping key to value). All interactions with a Vault take place through the VaultManager, which represents yet another component that adds a layer of abstraction between the Vault itself and the business logic that may be interacting with the Vault. This is useful as other information and functions surrounding the Vault can be added to the VaultManager. For example, the VaultManager is responsible for the calling of Watchers, which are optional custom functions that are run on Vault updates. As with the Storage interface, the Vault interface allows for alternative implementations to be used.\n(90) Referring now to another example component, a Watcher is an function that the organization(s) running an Interoperability Server module, such as the specific example discussed above, can provide to have logic (e.g., operation or logistical rules) executed whenever state transitions on an Interoperability Server occurs. The Vault allows for an associated Watcher. Therefore, when updates are made to the vault, the Watcher may be notified and the Vault may pass all relevant information about the update to the Watcher function.\n(91) Watcher functions are passed into the Interoperability server by the party responsible for starting the server.\n(92) Most of the tests which validate the entire asset transfer process use Watchers to receive updates as to when asset transfer is considered complete, and then may query the asset on the receive chain to confirm both its existence and that the asset on the receiver chain contains the correct data (which is a reference to the origin asset ID and to the origin DLT ID).\n(93) A Manager handles the logic for a certain subset of the routes present on the example Interoperability Server. Furthermore, each Manager is associated with one or more Vaults so that the Manager can be responsible for states of certain information, such as asset transfer agreements. Manager functions that support direct interactions with routes may be designed to operate asynchronously. Within the asset transfer solution, there are Managers present for establishing Trusted Entity Agreements, establishing DLT agreements, and for performing the asset transfer process. The system may allow for interoperability between the two DLTs without introducing significant overhead. The system may ensure failures in the asset transfer process do not violate the blockchain invariants and support recovery.\n(94) Runtime tests were performed to observe the time required to transfer an asset from Quorum to Fabric and to transfer an asset from Fabric to Quorum. Additionally, the solution has been thoroughly tested for various failure modes. The failure modes, the consequences of those failure modes, and the recovery from those failures is described in detail.\n(95) In the event of some failure during the asset transfer process, a notification may be sent to the Portals involved. There are a few core categories of failures that are handled by the system: (1) DLT interaction errors (2) internal errors (3) Node P failures. In the case of a DLT interaction error or an internal error, both Portals involved in the asset transfer may receive a notification that a failure occurred. For DLT interaction errors, Node P may send a message to either the /noLockFound or /failedToCreateAssetOnReceiver endpoint on each Portal when locking the asset on the sender DLT fails or creating the asset on the receiver DLT fails, respectively. For internal errors, such as unexpected promise rejections, Node P may send a message to the /otherError endpoint on each Portal with a description of the error that occurred. When a failure of Node P occurs, as in the server itself goes offline for some reason, no messages are sent by Node P to the Portals involved. Node P, by the definition of being offline, cannot send any message indicating its status as offline.\n(96) Failure modes may have a linking element: they result in an unsuccessful asset transfer. For that reason, Node P is built to run the asset transfer process using permanent records from the DLTs as the governing record of the asset's current state in the transfer process. This becomes more apparent when looking at the individual DLT interactions that occur. When locking the asset on the sender DLT, a manager first attempts to lock the asset and then, if locking fails (which occurs when there is a DLT interaction error or when the asset has already been locked), may query the DLT to check if the asset is currently locked. Similarly, when creating the asset on the receiver DLT, a manager first attempts to create the asset and then, if creating fails (which occurs when there is a DLT interaction error when that asset has already been created), may query the DLT to check if that asset has already been created. In both cases, this “attempt then query” approach prevents the double-use issue (e.g. locking the same asset twice or creating the same asset twice) while allowing for continuation of the asset transfer process from any state. This also handles the case where two Portals ask to perform the same asset transfer multiple times. For a given asset, locking can occur once on the sender DLT. Asset creation can occur once on the receiver DLT, so two Portals can ask to perform asset transfer as many times as they wish and the blockchain invariants may be maintained (e.g. when the asset may be locked on the sender DLT at most once, and created on the receiver DLT at most once).\n(97) If a failure occurs in the asset transfer process for transferring some asset from DLT A to DLT B, the Portals must both send messages to Node P asking to initiate the asset transfer process of that asset from DLT A to DLT B again. When Node P receives those messages, the asset transfer process may restart while taking the measures described above to maintain the blockchain invariants.\n(98) In some implementations, Portal™ relies on a trusted Node P to facilitate the asset transfer. As such, Node P being compromised could lead to a variety of bad outcomes, including multiple copies of a single asset being created, as invalid writes could occur to either blockchain (e.g. Node P could lie about an asset's origin ID).\n(99) In some cases, Portal™ uses a Node P that has both read and write access to the DLTs that it is transferring assets between. As such, Node P may be allowed both read/write access to each DLT involved. Further, for each DLT, may use an implementation of the DLT interactor interface that can read/write to the DLT. An additional or alternative approach to this is allowing Node P read access to each DLT and having the parties responsible for each DLT performing the required writes (e.g., the transaction for locking the asset and the transaction for creating the asset). Thus, the individual parties would lock/create assets on their respective DLTs, and Node P would verify the lock/create did successfully occur. This bounds the damage that could be done if an adversary were to take control of Node P since the integrity of the DLT could be compromised if Node P has write access. States may be stored as javascript object notation (JSON) objects. The Node P may be scaled horizontally. Also, the system may implement a Storage implementation that is backed by a NoSQL database locally or in the cloud, which would effectively provide as much secure storage as needed to handle any and all data that is stored on Node P. In order for Node P to scale to handle more DLT types, Node P (1) may have DLT interactors for each DLT type and (2) needs to be given credentials for each DLT that is involved in some DLT agreement stored on Node P.\n(100) If Node P is running on local nodes of the sender and receiver DLT, then nodes other than Node P may be untrusted. If Node P communicates with remote nodes of the sender and receiver DLT, then Node P and those nodes may be trusted.\n(101) Assets may be defined within the smart contract/chaincode system. These assets may store states for asset locking and asset creation in the contract/chaincode that Portal™ expects to be interacting with. The system may be implemented such that assets do not need to be defined within the Portal™ system. Effectively, this allows Portal™ to be used with assets that are currently on a Quorum or Fabric DLT.\n(102) A registry contract to the DLT may be used in place of chaincode state definitions. Within this contract, any asset may be marked as locked before transfer. As such, the DLT interactors need to be changed some small amount to query the correct contracts for the correct data. This effectively allows Portal to be used on assets already created on some existing contract/chaincode. In some cases, the Node P uses a DLT interactor interface to call the implementations of these functions on the DLT interactors.\n(103) The system may implement message/transaction encryption and access control, e.g., permissions systems for the creation and participation as a Portal and/or Node.\n(104) A change in DLT system **1** that is relevant to DLT **2** system, passes control to Interoperability node to facilitate the appropriate data element creation or update on DLT system **2** and locks the data element in DLT system.\n(105) The Node P has access to the transactions related to the asset to transfer (as an example, in Fabric, node P may be part of the channel that contains the asset, in Quorum it may be a party of the private transaction).\n(106) The performance metrics discussed in U.S. Provisional Patent Application Ser. No. 62/769,343, filed 19 Nov. 2018, previously incorporated by reference herein, indicate that the interoperability techniques and architectures allow interactions by systems at rates similar to serial transactions on the disparate systems. Accordingly, the asset locking and transfer techniques and architectures improve the operation of the underlying hardware by allowing interoperation of the disparate systems and by allowing such interoperation to occur on time scale similar to those by which the transfer could be completed on each system without interoperation. Therefore, the techniques and architectures provide improvement over existing market solutions by providing increased speed and interoperability to the underlying hardware.\n(107) In some cases, the systems, e.g., the portals, clients, or node P may be implemented on a localized or distributed execution platform. The platform may include system circuitry, which may include one or more processors and memory. The memory may include template, execution instructions, applications, data structures, or other content to support execution of the various systems above.\n(108) Alternatively or additionally, the node P may be supplanted by an intermediate federated Node P system. The federated Node P system may act as a distributed trusted intermediary. The federated Node P may log transactions using individual nodes each with low trust levels. However, through consensus double-expend and sequencing guarantees may be upheld. Further, a blockchain may be used to secure historical transaction records preventing later tamper. The federated Node P may incentivize action by nodes as intermediaries by providing access to a reward token, such as a right of issuance of a coin, interest in a percentage or other portion of the assets subject to the transfer, or other remuneration. In some cases, the federated Node P system may instruct nodes to leave transaction markers on the fabrics receiving and sending the asset subject to transfer. The markers may be used as tracking elements for the federated Node P system.\n(109) Various implementations may use the techniques and architectures described above.\n(110) A1 In an example, a system includes: an origin memory storing an origin blockchain compliant with an origin distributed ledger technology; a target memory storing a target blockchain compliant with a target distributed ledger technology; and interop circuitry configured to: receive from origin participant circuitry associated with the origin blockchain an origin asset permission to transfer an asset tracked on the origin blockchain to the target blockchain; send a request to target participant circuitry associated with the target blockchain to instantiate the asset on the target blockchain; responsive to the request, receive a target asset permission to instantiate the asset on the target blockchain; using the origin asset permission, lock the asset on the origin blockchain; and using the target asset permission, instantiate the asset on the target blockchain.\n(111) A2 The system of example A1, where the interop circuitry is further configured to: receive an origin write permission for the origin blockchain; and receive a target write permission for the target blockchain.\n(112) A3 The system of example A2, where the interop circuitry is configured to operate as an interoperability node between the origin and target blockchains using the origin and target write permissions.\n(113) A4 The system of example A3, where the interop circuitry is further configured to obtain origin security credentials to establish an identity of the interop circuitry on the origin blockchain when using the origin write permission, the origin asset permission, or both.\n(114) A5 The system of either of examples A3 or A4, where the interop circuitry is further configured to obtain target security credentials to establish an identity of the interop circuitry on the target blockchain when using the target write permission, the target asset permission, or both.\n(115) A6 The system of any of examples A3-A5, where the interop circuitry is configured to implement a two-tiered exchange including: an establishment tier in which the origin and target write permissions are exchanged; and an transfer tier configured to execute after the establishment tier and in which the origin and target asset permissions are exchanged.\n(116) A7 The system of any of examples A1-A6, where the interop circuitry is configured to receive the origin and target asset permissions to facilitate an asset permission exchange ahead of transfer of the asset from the origin blockchain to the target blockchain.\n(117) A8 The system of example A7, where the origin and target asset permissions are configured to identify a participating node designated to receive a notice regarding transfer of the asset.\n(118) A9 The system of any of examples A1-A8, where the target asset permission identifies the asset and the origin distributed ledger technology.\n(119) A10 The system of any of examples A1-A9, where the interop circuitry is configured to lock the asset on the origin blockchain by: generating by appending a string to the asset; and hashing the combination of the asset and the string.\n(120) A11 The system of example A10, where the string is configured to indicate a lock state of the asset on the origin blockchain.\n(121) A12 The system of any of examples A1-A11, where the interop circuitry is configured to instantiate the asset on the target blockchain by: generating by appending a string to the asset; and hashing the combination of the asset and the string.\n(122) A13 The system of example A12, where the string is configured to indicate that the asset was transferred from the origin blockchain.\n(123) A14 The system of either of examples A12 or A13, where content of the string is detailed within the target asset permission.\n(124) B1 In an example, a method includes: at interop circuitry: receiving from origin participant circuitry associated with a origin blockchain an origin asset permission to transfer an asset tracked on the origin blockchain to a target blockchain, the origin blockchain stored on an origin memory and compliant with an origin distributed ledger technology; sending a request to target participant circuitry associated with the target blockchain to instantiate the asset on the target blockchain, the target blockchain stored on a target memory and compliant with a target distributed ledger technology; responsive to the request, receiving a target asset permission to instantiate the asset on the target blockchain; using the origin asset permission, locking the asset on the origin blockchain; and using the target asset permission, instantiating the asset on the target blockchain.\n(125) B2 The method of example B1, further comprising: receiving an origin write permission for the origin blockchain; and receiving a target write permission for the target blockchain; and where the interop circuitry operates as an interoperability node between the origin and target blockchains using the origin and target write permissions.\n(126) B3 The method of example B2, further comprising implementing a two-tiered exchange including: an establishment tier in which the origin and target write permissions are exchanged; and an transfer tier configured to execute after the establishment tier and in which the origin and target asset permissions are exchanged.\n(127) C1 In an example, a product includes: machine-readable media other than a transitory signal; and instructions stored on the machine-readable media, the instructions configured to, when executed, cause a machine to: at interop circuitry: receive from origin participant circuitry associated with a origin blockchain an origin asset permission to transfer an asset tracked on the origin blockchain to a target blockchain, the origin blockchain stored on an origin memory and compliant with an origin distributed ledger technology; send a request to target participant circuitry associated with the target blockchain to instantiate the asset on the target blockchain, the target blockchain stored on a target memory and compliant with a target distributed ledger technology; responsive to the request, receive a target asset permission to instantiate the asset on the target blockchain; using the origin asset permission, lock the asset on the origin blockchain; and using the target asset permission, instantiate the asset on the target blockchain.\n(128) C2 The product of example C1, where the instructions are configured to cause the machine to lock the asset on the origin blockchain by: generating by appending a string to the asset; and hashing the combination of the asset and the string.\n(129) C3 The product of example C2, where the string is configured to indicate a lock state of the asset on the origin blockchain.\n(130) D1 A method implemented by operation of a system of any of examples A1-A14.\n(131) E1 A product comprising instructions stored on a machine readable medium, the instructions configured to cause a machine to implement the method of example D1.\n(132) Various implementations have been specifically described. However, many other implementations are also possible.\n\n### Claims\n\n1. A system including: an origin memory storing an origin blockchain, the origin blockchain compliant with an origin distributed ledger technology; a target memory storing a target blockchain, the target blockchain compliant with a target distributed ledger technology; and interop circuitry configured to: implement a multiple-tier exchange by: within an establishment tier of the multiple-tier exchange: receiving an origin write permission for the origin blockchain; and receiving a target write permission for the target blockchain within a transfer tier of the multiple-tier exchange, the transfer tier configured to execute after the establishment tier: receiving from origin participant circuitry associated with the origin blockchain an origin asset permission, the origin asset permission to allow transfer of an asset tracked on the origin blockchain to the target blockchain; sending a request to target participant circuitry associated with the target blockchain to instantiate the asset on the target blockchain; and responsive to the request, receiving a target asset permission to instantiate the asset on the target blockchain, the target asset permission configured to allow instantiation of the asset on the target blockchain; and operate as an interoperability node between the origin and target blockchains by: using the origin asset permission, locking the asset on the origin blockchain; and using the target asset permission, instantiating the asset on the target blockchain.\n 2. The system of claim 1, where the interop circuitry is further configured to obtain an origin security credential, the origin security credential configured to establish an identity of the interop circuitry on the origin blockchain when using the origin write permission, the origin asset permission, or both.\n 3. The system of claim 1, where the interop circuitry is further configured to obtain target security credentials to establish an identity of the interop circuitry on the target blockchain when using the target write permission, the target asset permission, or both.\n 4. The system of claim 1, where the interop circuitry is configured to receive the origin and target asset permissions to facilitate an asset permission exchange ahead of transfer of the asset from the origin blockchain to the target blockchain.\n 5. The system of claim 4, where the origin and target asset permissions are configured to identify a participating node designated to receive a notice regarding transfer of the asset.\n 6. The system of claim 1, where the target asset permission identifies the asset and the origin distributed ledger technology.\n 7. The system of claim 1, where the interop circuitry is configured to lock the asset on the origin blockchain by: generating by appending a string to the asset; and hashing the combination of the asset and the string.\n 8. The system of claim 7, where the string is configured to indicate a lock state of the asset on the origin blockchain.\n 9. The system of claim 1, where the interop circuitry is configured to instantiate the asset on the target blockchain by: generating by appending a string to the asset; and hashing the combination of the asset and the string.\n 10. The system of claim 9, where the string is configured to indicate that the asset was transferred from the origin blockchain.\n 11. The system of claim 9, where content of the string is detailed within the target asset permission.\n 12. A method including: at interop circuitry: implementing a multiple-tier exchange by: within an establishment tier of the multiple-tier exchange: receiving an origin write permission for an origin blockchain; and receiving a target write permission for a target blockchain within a transfer tier of the multiple-tier exchange, the transfer tier executing after the establishment tier: receiving from origin participant circuitry associated with the origin blockchain an origin asset permission to transfer an asset tracked on the origin blockchain to the target blockchain, the origin blockchain stored on an origin memory and compliant with an origin distributed ledger technology; sending a request to target participant circuitry associated with the target blockchain to instantiate the asset on the target blockchain, the target blockchain stored on a target memory and compliant with a target distributed ledger technology; and responsive to the request, receiving a target asset permission to instantiate the asset on the target blockchain; and operating as an interoperability node between the origin and target blockchains by: using the origin asset permission, locking the asset on the origin blockchain; and using the target asset permission, instantiating the asset on the target blockchain.\n 13. The method of claim 12, where receiving the origin and target asset permissions comprises facilitating an asset permission exchange ahead of transfer of the asset from the origin blockchain to the target blockchain.\n 14. The method of claim 13, where the origin and target asset permissions identify a participating node designated to receive a notice regarding transfer of the asset.\n 15. The method of claim 12, where the target asset permission identifies the asset and the origin distributed ledger technology.\n 16. The method of claim 12, where locking the asset on the origin blockchain comprises: generating by appending a string to the asset; and hashing the combination of the asset and the string.\n 17. A product including: machine-readable media other than a transitory signal; and instructions stored on the machine-readable media, the instructions configured to, when executed, cause a machine to: at interop circuitry: implement a multiple-tier exchange by: within an establishment tier of the multiple-tier exchange: receiving an origin write permission for an origin blockchain; and receiving a target write permission for a target blockchain within a transfer tier of the multiple-tier exchange, the transfer tier configured to execute after the establishment tier: receiving from origin participant circuitry associated with the origin blockchain an origin asset permission to transfer an asset tracked on the origin blockchain to the target blockchain, the origin blockchain stored on an origin memory and compliant with an origin distributed ledger technology; sending a request to target participant circuitry associated with the target blockchain to instantiate the asset on the target blockchain, the target blockchain stored on a target memory and compliant with a target distributed ledger technology; and responsive to the request, receiving a target asset permission to instantiate the asset on the target blockchain; and operate as an interoperability node between the origin and target blockchains by: using the origin asset permission, locking the asset on the origin blockchain; and using the target asset permission, instantiating the asset on the target blockchain.\n 18. The product of claim 17, where the instructions are configured to cause the machine to lock the asset on the origin blockchain by: generating by appending a string to the asset; and hashing the combination of the asset and the string.\n 19. The product of claim 18, where the string is configured to indicate a lock state of the asset on the origin blockchain.\n 20. The product of claim 18, where content of the string is detailed within the target asset permission."},"Patent Number":{"kind":"string","value":"10298585"},"Document ID":{"kind":"string","value":"US 10298585 B1"},"Date Published":{"kind":"string","value":"2019-05-21"},"Family ID":{"kind":"string","value":"65241132"},"Title":{"kind":"string","value":"Blockchain interoperability"},"CPCI":{"kind":"string","value":"H04L9/0643;G06Q40/04;G06Q20/02;H04L63/10;H04L63/08;G06Q20/223;G06Q20/06"},"CPCA":{"kind":"string","value":"H04L9/50;G06Q2220/00"},"Inventor":{"kind":"string","value":"Treat; David et al."},"Assignee":{"kind":"string","value":"Accenture Global Solutions Limited"},"Application Number":{"kind":"string","value":"16/255167"},"Filing Date":{"kind":"string","value":"2019-01-23"},"Primary Examiner":{"kind":"string","value":"Lemma; Samson B"},"Assistant Examiner":{"kind":"string","value":""},"OR":{"kind":"string","value":"1/1"},"XREF":{"kind":"string","value":""},"Applicant Name":{"kind":"string","value":"Accenture Global Solutions Limited"},"Notes":{"kind":"string","value":""},"Notes/Tagged":{"kind":"string","value":""},"Relevancy":{"kind":"string","value":"31.10807"},"Database":{"kind":"string","value":"USPAT"},"total_tokens":{"kind":"string","value":"17610.0"}}},{"rowIdx":96,"cells":{"text":{"kind":"string","value":"United States Patent\n10299128\nKind Code\nB1\nDate of Patent\nMay 21, 2019\nInventor(s)\nSuthar; Om Prakash et al.\n\n## Securing communications for roaming user equipment (UE) using a native blockchain platform\n\n### Abstract\n\nA network function (NF) entity in a communication network receives authentication data associated with a User Equipment (UE), determines the UE supports a blockchain registration procedure based on the authentication data, exchanges authentication messages with a Blockchain Roaming Broker (BRB) entity over a blockchain network interface, receives a blockchain authentication confirmation from the BRB entity, and registers the UE with the core network based on the blockchain authentication confirmation.\n\nInventors:\n\n**Suthar; Om Prakash** (Bolingbrook, IL), **Rayes; Ammar** (San Ramon, CA), **Geller; Michael David** (Weston, FL), **Campbell; Ian McDowell** (Littleton, CO), **Dodd-Noble; Aeneas Sean** (Andover, MA)\n\nApplicant:\n\n**Cisco Technology, Inc.** (San Jose, CA)\n\nFamily ID:\n\n66541023\n\nAssignee:\n\n**CISCO TECHNOLOGY, INC.** (San Jose, CA)\n\nAppl. No.:\n\n16/171190\n\nFiled:\n\nOctober 25, 2018\n\n### Related U.S. Application Data\n\nus-provisional-application US 62682778 20180608\n\n### Publication Classification\n\nInt. Cl.:\n\n**H04L29/06** (20060101); **H04W12/06** (20090101); **H04W12/08** (20090101); **G06Q20/40** (20120101); **G06Q20/32** (20120101); **H04W60/00** (20090101); H04W88/02 (20090101)\n\nU.S. Cl.:\n\nCPC\n\n**H04W12/06** (20130101); **G06Q20/325** (20130101); **G06Q20/40** (20130101); **H04L63/08** (20130101); **H04L63/10** (20130101); **H04W12/08** (20130101); **H04W60/00** (20130101); H04W88/02 (20130101)\n\n### Field of Classification Search\n\nUSPC:\n\n726/4\n\n### References Cited\n\n#### U.S. PATENT DOCUMENTS\n\nPatent No.\nIssued Date\nPatentee Name\nU.S. Cl.\nCPC\n4236068\n12/1979\nWalton\nN/A\nN/A\n5642303\n12/1996\nSmall et al.\nN/A\nN/A\n5751223\n12/1997\nTurner\nN/A\nN/A\n6812824\n12/2003\nGoldinger et al.\nN/A\nN/A\nD552603\n12/2006\nTierney\nN/A\nN/A\n7573862\n12/2008\nChambers et al.\nN/A\nN/A\nD637569\n12/2010\nDesai et al.\nN/A\nN/A\n7975262\n12/2010\nCozmei\nN/A\nN/A\n8010079\n12/2010\nMia et al.\nN/A\nN/A\n8102814\n12/2011\nRahman et al.\nN/A\nN/A\n8260320\n12/2011\nHerz\nN/A\nN/A\n8284748\n12/2011\nBorghei\nN/A\nN/A\n8300594\n12/2011\nBernier et al.\nN/A\nN/A\n8325626\n12/2011\nTóth et al.\nN/A\nN/A\n8396485\n12/2012\nGrainger et al.\nN/A\nN/A\n8446899\n12/2012\nLei et al.\nN/A\nN/A\n8457145\n12/2012\nZimmerman et al.\nN/A\nN/A\n8458184\n12/2012\nDorogusker et al.\nN/A\nN/A\nD691636\n12/2012\nBunton\nN/A\nN/A\n8549638\n12/2012\nAziz\nN/A\nN/A\n8553634\n12/2012\nChun et al.\nN/A\nN/A\n8644301\n12/2013\nTamhankar et al.\nN/A\nN/A\n8650279\n12/2013\nMehta et al.\nN/A\nN/A\n8669902\n12/2013\nPandey et al.\nN/A\nN/A\n8676182\n12/2013\nBell et al.\nN/A\nN/A\n8682279\n12/2013\nRudolf et al.\nN/A\nN/A\n8693367\n12/2013\nChowdhury et al.\nN/A\nN/A\n8718644\n12/2013\nThomas et al.\nN/A\nN/A\n8761174\n12/2013\nJing et al.\nN/A\nN/A\n8768389\n12/2013\nNenner et al.\nN/A\nN/A\n8849283\n12/2013\nRudolf et al.\nN/A\nN/A\n8909698\n12/2013\nParmar et al.\nN/A\nN/A\n8958318\n12/2014\nHastwell et al.\nN/A\nN/A\n9060352\n12/2014\nChan et al.\nN/A\nN/A\n9130859\n12/2014\nKnappe\nN/A\nN/A\n9173084\n12/2014\nFoskett\nN/A\nN/A\n9173158\n12/2014\nVarma\nN/A\nN/A\nD744464\n12/2014\nSnyder et al.\nN/A\nN/A\n9270709\n12/2015\nShatzkamer et al.\nN/A\nN/A\n9271216\n12/2015\nFriman et al.\nN/A\nN/A\n9281955\n12/2015\nMoreno et al.\nN/A\nN/A\nD757424\n12/2015\nPhillips et al.\nN/A\nN/A\nD759639\n12/2015\nMoon et al.\nN/A\nN/A\n9369387\n12/2015\nFilsfils et al.\nN/A\nN/A\n9389992\n12/2015\nGataullin et al.\nN/A\nN/A\n9426305\n12/2015\nDe Foy et al.\nN/A\nN/A\nD767548\n12/2015\nSnyder et al.\nN/A\nN/A\n9467918\n12/2015\nKwan\nN/A\nN/A\nD776634\n12/2016\nLee et al.\nN/A\nN/A\n9544337\n12/2016\nEswara et al.\nN/A\nN/A\n9569771\n12/2016\nLesavich et al.\nN/A\nN/A\n9609504\n12/2016\nKarlqvist et al.\nN/A\nN/A\n9615268\n12/2016\nNavarro et al.\nN/A\nN/A\n9634952\n12/2016\nGopinathan et al.\nN/A\nN/A\n9642167\n12/2016\nSnyder et al.\nN/A\nN/A\n9654344\n12/2016\nChan et al.\nN/A\nN/A\n9712444\n12/2016\nBolshinsky et al.\nN/A\nN/A\n9713114\n12/2016\nYu\nN/A\nN/A\n9736056\n12/2016\nVasseur et al.\nN/A\nN/A\n9762683\n12/2016\nKarampurwala et al.\nN/A\nN/A\n9772927\n12/2016\nGounares et al.\nN/A\nN/A\n9820105\n12/2016\nSnyder et al.\nN/A\nN/A\nD804450\n12/2016\nSpiel et al.\nN/A\nN/A\n9858559\n12/2017\nRaleigh et al.\nN/A\nN/A\n9860151\n12/2017\nGanichev et al.\nN/A\nN/A\n9933224\n12/2017\nDumitriu et al.\nN/A\nN/A\n9923780\n12/2017\nRao et al.\nN/A\nN/A\n9961560\n12/2017\nFarkas et al.\nN/A\nN/A\n9967906\n12/2017\nVerkaik et al.\nN/A\nN/A\n9980220\n12/2017\nSnyder et al.\nN/A\nN/A\n9985837\n12/2017\nRao et al.\nN/A\nN/A\n9998368\n12/2017\nChen et al.\nN/A\nN/A\n10108954\n12/2017\nDunlevy\nN/A\nG06Q 20/36\n10164779\n12/2017\nUhr\nN/A\nH04L 9/3265\n10171248\n12/2018\nKing\nN/A\nH04L 9/3247\n2003/0087645\n12/2002\nKim et al.\nN/A\nN/A\n2003/0116634\n12/2002\nTanaka\nN/A\nN/A\n2004/0029576\n12/2003\nFlykt\n455/422.1\nH04L 63/0869\n2004/0203572\n12/2003\nAerrabotu et al.\nN/A\nN/A\n2005/0090225\n12/2004\nMuehleisen et al.\nN/A\nN/A\n2005/0169193\n12/2004\nBlack et al.\nN/A\nN/A\n2005/0186904\n12/2004\nKowalski et al.\nN/A\nN/A\n2006/0022815\n12/2005\nFischer et al.\nN/A\nN/A\n2006/0030290\n12/2005\nRudolf et al.\nN/A\nN/A\n2006/0092964\n12/2005\nPark et al.\nN/A\nN/A\n2006/0126882\n12/2005\nDeng et al.\nN/A\nN/A\n2006/0146803\n12/2005\nBae\n370/352\nH04L 63/0869\n2006/0187866\n12/2005\nWerb et al.\nN/A\nN/A\n2006/0245406\n12/2005\nShim\n370/338\nH04L 63/0272\n2007/0037605\n12/2006\nLogan\nN/A\nN/A\n2007/0130471\n12/2006\nWalker Pina\n713/182\nH04L 63/0815\n2007/0239854\n12/2006\nJanakiraman et al.\nN/A\nN/A\n2008/0037715\n12/2007\nProzeniuk et al.\nN/A\nN/A\n2008/0084888\n12/2007\nYadav et al.\nN/A\nN/A\n2008/0101381\n12/2007\nSun et al.\nN/A\nN/A\n2008/0163207\n12/2007\nReumann et al.\nN/A\nN/A\n2008/0233969\n12/2007\nMergen\nN/A\nN/A\n2009/0129389\n12/2008\nHalna DeFretay et al.\nN/A\nN/A\n2009/0203370\n12/2008\nGiles et al.\nN/A\nN/A\n2009/0282048\n12/2008\nRansom et al.\nN/A\nN/A\n2009/0298511\n12/2008\nPaulson\nN/A\nN/A\n2009/0307485\n12/2008\nWeniger et al.\nN/A\nN/A\n2010/0039280\n12/2009\nHolm et al.\nN/A\nN/A\n2010/0097969\n12/2009\nDe Kimpe et al.\nN/A\nN/A\n2011/0087799\n12/2010\nPadhye et al.\nN/A\nN/A\n2011/0142053\n12/2010\nVan Der Merwe et al.\nN/A\nN/A\n2011/0182295\n12/2010\nSingh et al.\nN/A\nN/A\n2011/0194553\n12/2010\nSahin et al.\nN/A\nN/A\n2011/0228779\n12/2010\nGoergen\nN/A\nN/A\n2012/0023552\n12/2011\nBrown et al.\nN/A\nN/A\n2012/0054367\n12/2011\nRamakrishnan et al.\nN/A\nN/A\n2012/0088476\n12/2011\nGreenfield\nN/A\nN/A\n2012/0115512\n12/2011\nGrainger et al.\nN/A\nN/A\n2012/0157126\n12/2011\nRekimoto\nN/A\nN/A\n2012/0167207\n12/2011\nBeckley et al.\nN/A\nN/A\n2012/0182147\n12/2011\nForster\nN/A\nN/A\n2012/0311127\n12/2011\nKandula et al.\nN/A\nN/A\n2012/0324035\n12/2011\nCantu et al.\nN/A\nN/A\n2013/0029685\n12/2012\nMoshfeghi\nN/A\nN/A\n2013/0039391\n12/2012\nSkarp\nN/A\nN/A\n2013/0057435\n12/2012\nKim\nN/A\nN/A\n2013/0077612\n12/2012\nKhorami\nN/A\nN/A\n2013/0088983\n12/2012\nPragada et al.\nN/A\nN/A\n2013/0107853\n12/2012\nPettus et al.\nN/A\nN/A\n2013/0108263\n12/2012\nSrinivas et al.\nN/A\nN/A\n2013/0115916\n12/2012\nHerz\nN/A\nN/A\n2013/0145008\n12/2012\nKannan et al.\nN/A\nN/A\n2013/0155906\n12/2012\nNachum et al.\nN/A\nN/A\n2013/0191567\n12/2012\nRofougaran et al.\nN/A\nN/A\n2013/0203445\n12/2012\nGrainger et al.\nN/A\nN/A\n2013/0217332\n12/2012\nAltman et al.\nN/A\nN/A\n2013/0232433\n12/2012\nKrajec et al.\nN/A\nN/A\n2013/0273938\n12/2012\nNg et al.\nN/A\nN/A\n2013/0317944\n12/2012\nHuang et al.\nN/A\nN/A\n2013/0322438\n12/2012\nGospodarek et al.\nN/A\nN/A\n2013/0343198\n12/2012\nChhabra et al.\nN/A\nN/A\n2013/0347103\n12/2012\nVeteikis et al.\nN/A\nN/A\n2014/0007089\n12/2013\nBosch et al.\nN/A\nN/A\n2014/0016926\n12/2013\nSoto et al.\nN/A\nN/A\n2014/0025770\n12/2013\nWarfield et al.\nN/A\nN/A\n2014/0031031\n12/2013\nGauvreau et al.\nN/A\nN/A\n2014/0052508\n12/2013\nPandey et al.\nN/A\nN/A\n2014/0059655\n12/2013\nBeckley et al.\nN/A\nN/A\n2014/0087693\n12/2013\nWalby et al.\nN/A\nN/A\n2014/0105213\n12/2013\nA K et al.\nN/A\nN/A\n2014/0118113\n12/2013\nKaushik et al.\nN/A\nN/A\n2014/0148196\n12/2013\nBassan-Eskenazi et al.\nN/A\nN/A\n2014/0179352\n12/2013\nV.M. et al.\nN/A\nN/A\n2014/0191868\n12/2013\nOrtiz et al.\nN/A\nN/A\n2014/0198808\n12/2013\nZhou\nN/A\nN/A\n2014/0222997\n12/2013\nMermoud et al.\nN/A\nN/A\n2014/0233460\n12/2013\nPettus et al.\nN/A\nN/A\n2014/0269321\n12/2013\nKamble et al.\nN/A\nN/A\n2014/0302869\n12/2013\nRosenbaum et al.\nN/A\nN/A\n2014/0337824\n12/2013\nSt. John et al.\nN/A\nN/A\n2014/0341568\n12/2013\nZhang et al.\nN/A\nN/A\n2015/0016286\n12/2014\nGanichev et al.\nN/A\nN/A\n2015/0016469\n12/2014\nGanichev et al.\nN/A\nN/A\n2015/0023176\n12/2014\nKorja et al.\nN/A\nN/A\n2015/0030024\n12/2014\nVenkataswami et al.\nN/A\nN/A\n2015/0043581\n12/2014\nDevireddy et al.\nN/A\nN/A\n2015/0063166\n12/2014\nSif et al.\nN/A\nN/A\n2015/0065161\n12/2014\nGanesh et al.\nN/A\nN/A\n2015/0087330\n12/2014\nPrechner et al.\nN/A\nN/A\n2015/0103818\n12/2014\nKuhn et al.\nN/A\nN/A\n2015/0163192\n12/2014\nJain et al.\nN/A\nN/A\n2015/0172391\n12/2014\nKasslin et al.\nN/A\nN/A\n2015/0223337\n12/2014\nSteinmacher-Burow\nN/A\nN/A\n2015/0256972\n12/2014\nMarkhovsky et al.\nN/A\nN/A\n2015/0264519\n12/2014\nMirzaei et al.\nN/A\nN/A\n2015/0280827\n12/2014\nAdiletta et al.\nN/A\nN/A\n2015/0288410\n12/2014\nAdiletta et al.\nN/A\nN/A\n2015/0326704\n12/2014\nKo et al.\nN/A\nN/A\n2015/0358777\n12/2014\nGupta\nN/A\nN/A\n2015/0362581\n12/2014\nFriedman et al.\nN/A\nN/A\n2016/0007315\n12/2015\nLundgreen et al.\nN/A\nN/A\n2016/0044627\n12/2015\nAggarwal et al.\nN/A\nN/A\n2016/0099847\n12/2015\nMelander et al.\nN/A\nN/A\n2016/0100395\n12/2015\nXu et al.\nN/A\nN/A\n2016/0105408\n12/2015\nCooper et al.\nN/A\nN/A\n2016/0127875\n12/2015\nZampini, II\nN/A\nN/A\n2016/0146495\n12/2015\nMalve et al.\nN/A\nN/A\n2016/0330045\n12/2015\nTang et al.\nN/A\nN/A\n2016/0344641\n12/2015\nJavidi et al.\nN/A\nN/A\n2017/0026974\n12/2016\nDey et al.\nN/A\nN/A\n2017/0180134\n12/2016\nKing\nN/A\nH04L 9/3247\n2017/0180999\n12/2016\nAlderfer et al.\nN/A\nN/A\n2017/0181136\n12/2016\nBharadwaj et al.\nN/A\nN/A\n2017/0195205\n12/2016\nLi et al.\nN/A\nN/A\n2017/0202000\n12/2016\nFu et al.\nN/A\nN/A\n2017/0214551\n12/2016\nChan et al.\nN/A\nN/A\n2017/0214675\n12/2016\nJohnsrud\nN/A\nH04L 63/08\n2017/0243208\n12/2016\nKurian\nN/A\nG06Q 20/40\n2017/0273083\n12/2016\nChen et al.\nN/A\nN/A\n2017/0317997\n12/2016\nSmith et al.\nN/A\nN/A\n2017/0330180\n12/2016\nSong\nN/A\nG06F 21/33\n2017/0332421\n12/2016\nSternberg et al.\nN/A\nN/A\n2017/0339706\n12/2016\nAndreoli-Fang et al.\nN/A\nN/A\n2018/0063018\n12/2017\nBosch et al.\nN/A\nN/A\n2018/0069311\n12/2017\nPallas et al.\nN/A\nN/A\n2018/0084389\n12/2017\nSnyder et al.\nN/A\nN/A\n2018/0136633\n12/2017\nSmall\nN/A\nG05B 19/4099\n2018/0139056\n12/2017\nImai\nN/A\nH04L 9/3247\n2018/0253539\n12/2017\nMinter\nN/A\nG06F 21/32\n2018/0294966\n12/2017\nHyun\nN/A\nH04L 9/3236\n2018/0343128\n12/2017\nUhr\nN/A\nG06Q 20/38\n2018/0374094\n12/2017\nKohli\nN/A\nG06Q 20/401\n\n#### FOREIGN PATENT DOCUMENTS\n\nPatent No.\nApplication Date\nCountry\nCPC\nWO 2013/020126\n12/2012\nWO\nN/A\nWO 2014/098556\n12/2013\nWO\nN/A\nWO 2015/131920\n12/2014\nWO\nN/A\nWO 2017/078657\n12/2016\nWO\nN/A\nWO 2017/187011\n12/2016\nWO\nN/A\nWO 2018/009340\n12/2017\nWO\nN/A\nWO 2018/028777\n12/2017\nWO\nN/A\nWO 2018/053271\n12/2017\nWO\nN/A\nWO 2018/066362\n12/2017\nWO\nN/A\n\n#### OTHER PUBLICATIONS\n\nYang, Hui, et al. “Blockchain-based trusted authentication in cloud radio over fiber network for 5g.” Optical Communications and Networks (ICOCN), 2017 16th International Conference on. IEEE, 2017. (Year: 2017). cited by examiner\n\nMoinet, Axel, Benoit Darties, and Jean-Luc Baril. “Blockchain based trust & authentication for decentralized sensor networks.” arXiv preprint arXiv:1706.01730 (2017). (Year: 2017). cited by examiner\n\n“Cisco ASR 5x00 Mobility Management Entity Administration Guide,” Version 15.0, Cisco Systems, Inc., Last updated Jun. 13, 2014, pp. 1-266. cited by applicant\n\n“Cisco 10000 Series Router Quality of Service Configuration Guide, Chapter 20: Configuring Quality of Service for MPLS Traffic,” Cisco Systems, Inc., Updated Nov. 17, 2013, pp. 1-34. cited by applicant\n\n“Enterprise Mobility 7.3 Design Guide, Chapter 11: CISCO Mobility Services Engine,” Cisco Systems, Inc., Updated Apr. 20, 2015, 8 pages. cited by applicant\n\n“I Love WiFi, The difference between L2 and L3 Roaming Events,” Apr. 1, 2010, 6 pages. cited by applicant\n\n“Quality of Service Regulation Manual,” ITU 2017, pp. 1-174. cited by applicant\n\n“Wi-FI Location-Based Services 4.1 Design Guide,” May 20, 2008, 206 pages. cited by applicant\n\nAfolabi, Ibrahim, et al., “Network Slicing & Softwarization: A Survey on Principles, Enabling Technologies & Solutions,” Mar. 21, 2018, pp. 1-24. cited by applicant\n\nAli, Z., et al., “Performance Measurement in Segment Routing Networks with IPv6 Data Plane (SRv6),” Spring Working Group, Feb. 26, 2018, pp. 1-17. cited by applicant\n\nAn, Xueli, et al., “Virtualization of Cellular Network EPC Gateways based on a Scalable SDN Architecture,” IEEE, Feb. 12, 2015, pp. 1-7. cited by applicant\n\nAntonioli, Roberto, et al., “Dual Connectivity for LTE-NR Cellular Networks,” Research Gate, Sep. 3-6, 2017, pp. 171-175. cited by applicant\n\nBekan, Adnan, et al., “D5.1: Machine Learning Algorithms Development and Implementation,” 2016-2018 eWINE Consortium, 23, 2016, pp. 1-72. cited by applicant\n\nBogale, Tadilo Endeshaw, et al., “Machine Intelligence Techniques for Next-Generation Context-Aware Wireless Networks,” arxiv.org, Jan. 12, 2018, pp. 1-10. cited by applicant\n\nCarter, Steve Sr., “E911 VoIP Essentials for Enterprise Deployments,” XO Communications, LLC, 2012, 9 pages. cited by applicant\n\nChalise, Batu K., et al., “MIMO Relaying for Multiaccess Communication in Cellular Networks,” Sensor Array and MultiChannel Signal Processing Workshop, 2008, SAM 2008, 5th IEEE, Jul. 21, 2008, pp. 146-150. cited by applicant\n\nCheng, W., et al., “Path Segment in MPLS Based Sement Routing Network,” Network Working Group, Oct. 2017, pp. 1-10. cited by applicant\n\nChristidis, Konstantinos, et al., “Blockchains and Smart Contracts for the Internet of Things,” IEEE Access, Special Section on the of Research in Internet of Things (IoT), vol. 4, May 10, 2016, pp. 1-12. cited by applicant\n\nCox, Jacob H. Jr., et al., “Advancing Software-Defined Networks: A Survey,” IEEE, Oct. 12, 2017, pp. 25487-25526. cited by applicant\n\nCui, Wenzhi et al., “DiFS: Distributed Flow Scheduling for Data Center Networks,” Nanjing University, China, Jul. 28, 2013, 10 pages. cited by applicant\n\nDoyle, Matthew G., “An IP Address Management Solution fora Server Solution Provider,” A Dissertation Submitted to The University of Liverpool, Sep. 28, 2005, 116 pages. cited by applicant\n\nGalvan T., Carlos E., et al., “Wifi bluetooth based combined positioning algorithm,” International Meeting of Electrical Engineering Research ENIINVIE 2012, Procedia Engineering 35 (2012 ), pp. 101-108. cited by applicant\n\nGeller, Michael, et al. , “5G Security Innovation with Cisco,” Whitepaper Cisco Public, Jun. 8, 2018, pp. 1-29. cited by applicant\n\nGesbert, David, “Advances in Multiuser MIMO Systems (Tutorial Part II) Emerging Topics in Multiuser MIMO Networks,” IEEE PIMRC Conference, Sep. 2007, 107 pages. cited by applicant\n\nHalperin, Daniel, et al., “Augmenting Data Center Networks with Multi-Gigabit Wireless Links,” Aug. 15-19, 2011, SIGCOMM'11, ACM 978-1-4503-0797-0/11/08, pp. 38-49. cited by applicant\n\nHerb, Daniel, et al., “ROAUM: How to Unblock Roaming IoT Using BLockchain,” available at https://uploads-ssl.webflow.com/55987a08baeea4300016b7d9/5a7a6d6cee5bc400010a08f2\\_Roaum\\_Roaming\\_IoT\\_Whitepaper.pdf, pp. 1-14. cited by applicant\n\nHsieh, Cynthia, “Location Awareness in VMware View 4.5 and Above,” VMware, 2011, 8 pages. cited by applicant\n\nHusain, Syed, et al., “Mobile Edge Computing with Network Resource Slicing for Internet-of-Things,” IEEE 2017, pp. 1-7. cited by applicant\n\nJero, Samuel, et al., “Identifier Binding Attacks and Defenses in Software-Defined Networks,” USENIX, The Advanced Computing Systems Association, Aug. 16-18, 2017, 19 pages. cited by applicant\n\nJi, Philip N., et al., “Demonstration of High-Speed MIMO OFDM Flexible Bandwidth Data Center Network,” Optical Society of America, 2012, 2 pages. cited by applicant\n\nKandula, Srikanth, et al., “Flyways to De-Congest Data Center Networks,” Microsoft Research, Oct. 23, 2009, 6 pages. cited by applicant\n\nKatayama, Y. et al., “MIMO Link Design Strategy for Wireless Data Center Applications,” IEEE Wireless Communications and Networking Conference: Services, Applications, and Business, 2012, 5 pages. cited by applicant\n\nLeary, Jonathan, et al., “Wireless LAN Fundamentals: Mobility,” Jan. 9, 2004, Cisco Press, 15 pages. cited by applicant\n\nLeonhardt, Ulf, “Supporting Location-Awareness in Open Distributed Systems,” May 1998, 186 pages. cited by applicant\n\nMorozov, Yury, “Blockchain Telecom: Bubbletone Blockchain,” Dec. 29, 2017, pp. 1-33. cited by applicant\n\nNetwork Heresy, “NVGRE, VXLAN and What Microsoft is Doing Right,” Oct. 3, 2011, 5 pages. cited by applicant\n\nNorwegian National Security Authority, “N-03 Security guidance for switches and routers,” Sep. 26, 2012, pp. 1-24. cited by applicant\n\nSaraiva de Sousa, Nathan F., et al., “Network Service Orchestration: A Survey,” IEEE Communications Surveys & Tutorials, Mar. 23, 2018, pp. 1-30. cited by applicant\n\nSavvides, Andreas, et al., “Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors”, Proceeding MobiCom '01 Proceedings of the 7th annual international conference on Mobile computing and networking, Jul. 2001, pp. 166-179. cited by applicant\n\nShwetha, D., et al.,“A Bandwidth Request Mechanism for QoS Enhancement in Mobile WiMAX Networks,” International Journal of Advanced Research in Electrical Electronics and Instrumentation Engineering, vol. 3, Issue 1, Jan. 2014, pp. 1-8. cited by applicant\n\nSun, et al., “The future of Wi-Fi,” IEEE Communications Magazine, vol. 52, No. 11, Nov. 21, 2014, 166 pages. cited by applicant\n\nVentre, Pier Luigi, et al., “Performance Evaluation and Tuning of Virtual Infrastructure Managers for (Micro) Virtual Network Functions,” ieee.org, Nov. 7-10, 2016, pp. 1-7. cited by applicant\n\nWright, Joshua, “Detecting Wireless LAN MAC Address Spoofing,” Jan. 21, 2003, pp. 1-20. cited by applicant\n\nZickau, Sebastian, et al., “Enabling Location-based Policies in a Healthcare Cloud Computing Environment,” 2014 IEEE 3rd International Conference on Cloud Networking (Cloudnet), Oct. 2014, pp. 353-358. cited by applicant\n\n*Primary Examiner:* Zaidi; Syed A\n\n*Attorney, Agent or Firm:* Polsinelli PC\n\n### Background/Summary\n\nCROSS REFERENCE TO RELATED APPLICATIONS\n(1) The present application is claiming priority of U.S. Provisional Patent Application Ser. No. 62/682,778, filed on Jun. 8, 2018, the contents of which are incorporated herein by reference to their entirety.\n\nTECHNICAL FIELD\n(1) The present subject matter relates generally to communication networks, and more particularly, to natively integrating blockchain technologies in telecommunication networks (e.g., 4G, 5G, etc.) to provide security for roaming User Equipment (UE).\nBACKGROUND\n(2) An ever-increasing consumer demand, improved technological advancements (e.g., hardware/software infrastructure), and industry collaboration has driven significant growth in modern telecommunication networks and continues to drive its evolution. Indeed, each iteration or “next generation” of network capabilities, e.g., represented by standards promulgated by a Third Generation Partnership Project (3GPP), interconnects more devices, improves network bandwidth, increases data-rates, and so on. For example, a transition from 3.sup.rd Generation (3G) networks to 4.sup.th Generation (4G) networks introduced new network services and connected mobile devices to third party data networks such as the Internet. More recently, a transition is underway from existing 4G networks to new 5G networks, which includes a new service-oriented architecture for provisioning network services/resources in a dynamic, scalable, and customizable fashion (e.g., micro-services, network functions virtualization (NFV), etc.). This service-oriented architecture, which employs network slices, creates new opportunities to develop scalable roaming security mechanisms in the context of roaming registration and/or roaming session management in order to natively support virtual, stateless, statistic, and dynamically mobile workloads and improve overall UE mobility in 5G networks.\n\n### Description\n\nBRIEF DESCRIPTION OF THE DRAWINGS\n(1) The embodiments herein may be better understood by referring to the following description in conjunction with the accompanying drawings in which like reference numerals indicate identical or functionally similar elements. Understanding that these drawings depict only exemplary embodiments of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:\n(2) FIG. 1 illustrates a schematic block diagram of exemplary telecommunication networks, including a 3G network, a 4G network, and a 5G network;\n(3) FIG. 2 illustrates a schematic block diagram of an exemplary network device, such as a Network Function (NF) entity/module, according to one or more embodiments of this disclosure;\n(4) FIG. 3A illustrates schematic block diagram of a roaming architecture with a local breakout scenario for a service based interface representation of a Service Based Architecture (SBA);\n(5) FIG. 3B illustrates a schematic block diagram of a reference point representation of the roaming architecture shown in FIG. 3A, according to one embodiment of this disclosure;\n(6) FIG. 3C illustrates a schematic block diagram of another reference point representation of the roaming architecture shown in FIG. 3A;\n(7) FIG. 4A illustrates a schematic signalling diagram, showing callflows for a blockchain authentication procedure where User Equipment (UE) performs attach procedures, an Access and Mobility Management Function (AMF) entity invokes an Authentication Server Function (AUSF) entity to communicate with a Blockchain Authentication Function (BAF) entity;\n(8) FIG. 4B illustrates a schematic signalling diagram, showing callflows for a blockchain authentication procedure where the AMF entity is in direct communication with the BAF entity;\n(9) FIG. 5A illustrates a schematic signalling diagram, showing callflows for an out-of-band blockchain session establishment procedure;\n(10) FIG. 5B illustrates a schematic signalling diagram, showing callflows for an in-band blockchain session establishment procedure; and\n(11) FIG. 6 illustrates an example simplified procedure for registering User Equipment (UE) in a communication network, in accordance with one or more embodiments of the blockchain registration procedure.\nDESCRIPTION OF EXAMPLE EMBODIMENTS\n(12) Overview\n(13) This disclosure describes techniques for registering User Equipment (UE) in a telecommunication network (e.g., 4G/5G networks, etc.) using a natively integrated blockchain platform. In particular, the techniques can support complimentary or substitute blockchain authentication procedures for any User Equipment (UE) attaching to a 5G network. For example, according to one or more embodiments of this disclosure, a network function (NF) entity in a communication network receives authentication data associated with a UE, determines the UE supports a blockchain authentication procedure (e.g., based on the authentication data), and further exchanges authentication messages with a Blockchain Roaming Broker entity over a blockchain network interface. The NF entity can further receive a blockchain authentication confirmation from the BRB entity, and register the UE based on the blockchain authentication confirmation. In some embodiments, the NF entity can include an Access and Mobility Management Function (AMF) entity and/or an Authentication Server Function (AUSF) entity. Further the BRB entity may act as an agent or a gateway to a Blockchain Authentication Function (BAF) entity. Notably, the AMF entity may communicate directly with the BRB entity over the blockchain network interface and/or the AMF entity can invoke the AUSF entity to perform the authentication procedure and communicate with the BRB entity over another blockchain network interface.\n(14) In other embodiments, this disclosure also describes techniques for managing data sessions (e.g., establishing, hand-over, modify, etc.) for User Equipment (UE) in a telecommunication network (e.g., 4G/5G networks, etc.) using the natively integrated blockchain platform. For example, a network function (NF) entity in a communication network receives session request data associated with a User Equipment (UE), which includes blockchain authentication data. The NF entity selects a Blockchain Authentication Function (BAF) entity based on the session request data, and exchanges at least a portion of the blockchain authentication data with the BAF entity over a blockchain network interface. The NF entity further receives authentication confirmation data from the BAF entity over the blockchain network interface, and establishes a data session associated with the UE based on the authentication confirmation data.\n(15) Description\n(16) Various embodiments of the disclosure are discussed in detail below. While specific implementations are described in detail, it should be understood that this is done for illustration purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without departing from the spirit and scope of the disclosure.\n(17) As provided herein, this disclosure relates to communication networks (e.g., telecommunication networks), which include a number of network devices/modules/entities or “Network Function(s)” (NF(s)), as is appreciated by those skilled in the art. For sake of clarity, the NFs described herein are based on NFs specified by existing Technical Specifications such as the 3GPP TS 23.501, TS 23.502, TS 24.501, TS 29.509, TS 29.518, TS 33.301, TS 33.501, each of which is incorporated herein by reference to its entirety. Moreover, while some operations and functionality may be described and/or attributed to a particular NF, it is appreciated that such operations are not intended to be limited to the particular NF, but may be performed by other NFs as appropriate, particularly in view of the ongoing development and evolving nature of telecommunication networks.\n(18) A communication network is a geographically distributed collection of nodes interconnected by communication links and segments for transporting data between end nodes, such as mobile devices, computers, personal computing devices (and so on), and other devices, such as network entities, sensors, etc. Many types of networks are available, ranging from local area networks (LANs) to wide area networks (WANs). LANs typically connect these nodes over dedicated private communications links located in the same general physical location, such as a building or campus. WANs, on the other hand, typically connect geographically dispersed nodes over long-distance communications links, such as common carrier telephone lines, optical lightpaths, synchronous optical networks (SONET), synchronous digital hierarchy (SDH) links, etc. Some communication networks can include telecommunication networks, which transport data between end nodes, such as user equipment (UE), which can include mobile devices.\n(19) FIG. 1 illustrates a schematic block diagram of exemplary telecommunication networks **100**, including a 3G network **110**, a 4G network **120**, and 5G network **130**. Telecommunication networks **100** include wireless network interfaces or communication links, such as air interfaces **140**, an access network **150**, which represents radio infrastructure or radio towers, and a core network **160**, which represents respective core network entities, network modules, or Network Functions (NF(s)). The wireless network interfaces or air interfaces **140** include Uu links for 3G network **110**, LTE-Uu links for 4G network **120**, and 5G-NR links for 5G network **130**. In addition, other network interfaces (e.g., Nx, Sx, Lu-x, Gx, etc.) generally interconnect certain nodes (e.g., UE and/or core network entities) with other nodes (e.g., other UE and/or core network entities) based on, for example, distance, signal strength, network topology, current operational status, location, etc. As is appreciated by those skilled in the art, the network interfaces are vehicles for exchanging data packets (e.g., traffic and/or messages) between the nodes using predefined network protocols such as known wired protocols as appropriate. In this context, a protocol consists of a set of rules defining how the nodes interact with each other.\n(20) Those skilled in the art will understand that any number of nodes, devices, communication links, and the like may be used, and that the view shown herein is for simplicity. In particular, the representations of telecommunication networks **100**, including respective interconnected network entities, are illustrated and described herein for purposes of discussion, not limitation, and it is appreciated that the illustrated networks can include (or exclude) any number of network entities, communication links, and the like, and can support inter-network operability and compatibility.\n(21) Access network **150** represents the infrastructure or radio towers, such as a Radio Access Network (RAN), for receiving and transmitting data packets between end user nodes (UE) as well as the various network entities (e.g., core network entities). Access network **150** includes NodeBs (NBs) for 3G network **110**, eNodeBs (eNBs) for 4G network **120**, and gNodeBs (gNBs) for 5G network **130**. The infrastructure for each network may support different functionality and it is appreciated that infrastructure illustrated within one network can include appropriate hardware/software to support functionality of other telecommunication networks.\n(22) Respective network entities that form core network **160** (within the telecommunication networks **100**) operatively connect respective RAN infrastructure (NBs, eNBs, gNBs) to third party networks such as a voice network **105** (e.g., a Public Switched Telephone Network (PSTN) network) and/or a data network **108** to create end-to-end connections. Prior to 3G (e.g., 2G, 2.5G, etc.) the third party network primarily included a voice network/PSTN **105** (e.g., a circuit switched network). From 3G onward, the third party network transitioned to include a public network (e.g., the Internet), represented by data network **108** (e.g., a packet switched network). Core network **160** and its respective network entities collectively operate to manage connections, bandwidth, and mobility for respective UE.\n(23) Notably, core network **160** evolved along three functional planes, including service management, session management, and mobility management. Service management for 2G and 3G networks includes operations to create an Integrated Services Digital Network (ISDN) over wireless links (e.g., Uu links). Session management for 3G and 4G networks generally include operations establish, maintain, and release network resources (e.g., data connections). In particular, in 3G network **110**, session management includes a standalone General Packet Radio Service (GPRS) network, while 4G network **120** introduced a fully integrated data only network optimized for mobile broadband (where basic telephone operations are supported as one profile). Mobility management generally includes operations that support movement of UE in a mobile network, such as system registration, location tracking and handover (e.g., often optimized reduce heavy signaling loads). For example, in the context of 4G network **120**, a Serving Gateway (SGW) and a Packet Data Gateway (PGW) support session management operations while mobility management operations (which maintains data sessions for mobile UE) are centralized within a Mobility Management Entity (MME).\n(24) 5G network **130**, as discussed in greater detail herein, introduces a new service base architecture (SBA) **132**, which generally redistributes functionality of 4G network entities into smaller service-based functions/network entities. In addition, packet routing and forwarding functions (which are performed by SGW and PGW in 4G network **120**) are realized as services rendered through a new network function/entity called the User Plane Function (UPF). In this fashion, 5G network **130** provides a modular set of services that support dynamic and scalable deployment of resources to satisfy diverse user demands.\n(25) FIG. 2 illustrates a schematic block diagram of an exemplary network device or Network Function (NF) entity **200** that may be used with one or more embodiments described herein, e.g., particularly as User Equipment (UE) and/or other NFs within SBA **132** (e.g., an Access and Mobility Management Function (AMF) entity, Authentication Server Function (AUSF) entity, and so on).\n(26) The illustrative device **200** comprises one or more network interfaces **210**, at least one processor **220**, and a memory **240** interconnected by a system bus **250**. Network interface(s) **210** contain the mechanical, electrical, and signaling circuitry for communicating data over links (e.g., wires or wireless links) within the telecommunication networks **100** (e.g., ref. FIG. 1). Network interfaces **210** may be configured to transmit and/or receive data using a variety of different communication protocols, as will be understood by those skilled in the art. Notably, network interfaces **210** may include new blockchain network interfaces (e.g., “BCx”, “BCy”, and/or “BCz”) as discussed in greater detail below.\n(27) Memory **240** comprises a plurality of storage locations that are addressable by processor **220** for storing software programs and data structures associated with the embodiments described herein. Processor **220** may comprise necessary elements or logic adapted to execute the software programs and manipulate data structures **245**. An operating system **242**, portions of which are typically resident in memory **240** and executed by processor **220**, functionally organizes the device by, inter alia, invoking operations in support of services and/or software processes executing on the device/module. These services and/or software processes may comprise an illustrative “blockchain registration” process/service **244** as well as a “blockchain session management” process/services **246**, as described herein. Note that while processes/services **244** and **246** are shown in centralized memory **240**, some embodiments provide for these processes/services to be operated in a distributed communication network.\n(28) Illustratively, the techniques described herein may be performed by hardware, software, and/or firmware, such as in accordance with the illustrative blockchain registration process **244** and/or the illustrative blockchain session management process **246**, which may contain computer executable instructions executed by processor **220** to perform functions relating to UE authentication and/or UE session establishment, as described herein.\n(29) It will be apparent to those skilled in the art that other processor and memory types, including various computer-readable media, may be used to store and execute program instructions pertaining to the techniques described herein. Also, while the description illustrates various processes, it is expressly contemplated that various processes may be embodied as modules configured to operate in accordance with the techniques herein (e.g., according to the functionality of a similar process). Further, while the processes have been shown separately, those skilled in the art will appreciate that processes may be routines or modules within other processes. For example, processor **220** can include one or more programmable processors, e.g., microprocessors or microcontrollers, or fixed-logic processors. In the case of a programmable processor, any associated memory, e.g., memory **240**, may be any type of tangible processor readable memory, e.g., random access, read-only, etc., that is encoded with or stores instructions that can implement program modules, e.g., a module having blockchain registration process **244** and/or blockchain session management process **246** encoded thereon. Processor **220** can also include a fixed-logic processing device, such as an application specific integrated circuit (ASIC) or a digital signal processor that is configured with firmware comprised of instructions or logic that can cause the processor to perform the functions described herein. Thus, program modules may be encoded in one or more tangible computer readable storage media for execution, such as with fixed logic or programmable logic, e.g., software/computer instructions executed by a processor, and any processor may be a programmable processor, programmable digital logic, e.g., field programmable gate array, or an ASIC that comprises fixed digital logic, or a combination thereof. In general, any process logic may be embodied in a processor or computer readable medium that is encoded with instructions for execution by the processor that, when executed by the processor, are operable to cause the processor to perform the functions described herein.\n(30) As noted above, a transition is currently underway from existing 4G networks to new 5G networks, which includes a new service-oriented architecture (e.g., SBA **132**—FIG. 1). Traditional processes employed by 3G and 4G networks to provision network resources, ensure appropriate levels of security, and support UE roaming and mobility (e.g., registration, session establishment, session maintenance, and so on) were developed and optimized based on then-existing voice network (e.g., circuit-switched) infrastructure and/or conventional data network (e.g., packet switched) infrastructure. For example, UE roaming in existing mobile network infrastructures is typically based on statically configured security parameters, e.g., authentication using Open Mobile Alliance (OMA) Device Management (DM) signaling, Non-Access-Stratum (NAS) protocols, key exchanges using public/private keys, statically configured security roles, and so on. In addition, existing service providers typically implement their own security mechanisms, which in turn, results in different security requirements across multiple providers further complicating inter-operability, roaming, and network resource sharing.\n(31) The new service based infrastructure for 5G networks provisions network services/resources in a dynamic, scalable, and customizable fashion using network slices, micro-services, network functions virtualization (NFV), and so on. In the context of a network slice, each network slice can include an isolated set of programmable resources that may implement individual network functions and/or application services through software programs within a respective network slice, without interfering with other functions and services on coexisting network slices. The new service based infrastructure, including the granular network slice approach, raises new challenges for providing comprehensive security mechanisms at multiple levels and across domains.\n(32) As provided herein, this disclosure describes a natively integrated blockchain security infrastructure that uses a federated, sponsored, and/or authorized blockchain enterprise platform to support scalable roaming security mechanisms in the context of roaming UE registration and/or roaming UE session management. In particular, this blockchain enterprise platform provides a distributed trust mechanism that establishes a resilient level of security for workload instantiation or resource boot as well as workload attestation after boot. This resilient level of security inherently relies upon the distributed nature of blockchain technologies.\n(33) Blockchain technologies generally facilitate transparent, verifiable, and secure digital asset transactions with proof of rights and ownership. For example, blockchain technologies generally employ distributed ledger technology (DLT) with built-in cryptography to enable open and trusted exchanges over the internet without requiring central servers and/or independent trusted authorities. Although blockchain technologies can be non-natively employed within existing telecommunication networks, mobile network operators and/or mobile network entities are generally unaware of blockchain transactions because such blockchain transactions generally only occur after a mobile session is established (e.g., using overlay messages), which in turn, inhibits blockchain technology integration and participation by mobile service providers.\n(34) Accordingly, as described in greater detail herein, the blockchain platform of this disclosure is natively integrated with the service based architecture (SBA) of the 5G network through new blockchain network interfaces such as BCx and Bcy. The blockchain platform includes a network of blockchain service providers as well as a blockchain roaming agent, which is operable to provide roaming UE security within networks and between different network providers. As described in greater detail herein, these new roaming security mechanisms include roaming blockchain registration as well as roaming blockchain session management for UE. For example, the blockchain roaming agent may employ the roaming security mechanisms to support device registration processes within a mobile network, device registration in the context of a roaming network (e.g., when UE is outside of its local/home network and attempts to connect to a roaming/visiting network), and device session management processes to improve overall UE mobility in 5G networks.\n(35) Referring again to the figures, FIG. 3A illustrates a schematic block diagram **301**, showing a blockchain platform natively integrated with a Service Based Architecture (SBA) **132** for an exemplary 5G network (e.g., 5G network **130**). FIGS. 3B and 3C illustrates schematic block diagram **302** and **303**, respectively, showing example embodiments of reference point architectures for the blockchain platform of FIG. 3A. Collectively, FIGS. 3A-3C show a native blockchain platform, which includes an enterprise blockchain network **304** of interconnected blockchain service providers (SPs) or Blockchain Authentication Function (BAF) entities **305***a*-**305***n* (e.g., distributed ledger technology (DLT) entities, etc.), and a Blockchain Roaming Broker (BRB) entity **306**, which acts as a software defined agent accessible to various network entities of SBA **132** (e.g., over blockchain network interfaces BCx, BCy, and BCz, etc.)\n(36) Notably, the illustrated blockchain network interfaces BCx, BCy, and BCz may be represented by network interfaces **210** for device/entity **200**, discussed above. Further, these blockchain network interfaces represent communication links that facilitate exchanging messages or data packets between BAF(s), BRB **306**, and core network entities (e.g., NFs) that form SBA **132**. For example, BCx can facilitate exchanging messages related to policy request, authorization, network usage, lawful intercept, accounting, and the like. BCy can facilitate exchanging messages related to secondary authentication, authorization, resource sharing, lawful intercept, network slicing, etc. BCz can facilitate exchanging messages related to standalone Authentication public key pre-set, authorization, Distributed Ledger Technology query/set, etc.\n(37) Blockchain network **304** helps establish trust by way of immutable distributed records, which are accessible to BAFs **305** as well as BRB **306**. In operation, NFs of SBA **132** can access the immutable distributed records of blockchain network **304** to authenticate, authorize, or otherwise provide roaming security for UE registration processes and session management processes. In this fashion, blockchain network **304** can create specific trust boundaries across multiple service providers using distributed blockchain ledgers, which can be leveraged when sharing network resources or providing access to network functions (NFs) such as Access and Mobility Management Function (AMF), Session Management Function (SMF), Network Repository Function (NRF), and so on, as discussed in greater detail herein. Blockchain network **304** may represent an open source blockchain network, a public blockchain network, and/or a private blockchain network, and may include distributed ledger technologies such as hyperledger Sawtooth, and the like.\n(38) Referring again to FIG. 3A, schematic block diagram **301** illustrates a roaming architecture with a local breakout scenario for a service based interface representation of SBA **132**. Roaming generally refers to situations where the UE from one network (e.g., a home network) operates in another network (e.g., a visiting network). Typical roaming networks can include, for example, an Internet Protocol (IP) Packet eXchange (IPX) Network for 4G and 5G technologies, which is an inter-Service Provider IP backbone that includes interconnected networks of IPX Providers. For 2G and 3G technologies General Packet Radio Service (GPRS) Roaming eXchange (GRX) is used to provide roaming capabilities. Both GRX and IPX networks operably exchange IP based traffic between customers of separate mobile and fixed operators as well as other types of service provider (such as ISP), via IP based Network-to-Network Interface. Specifications for roaming networks can be defined by GSMA guidelines such as IR.34 guidelines for IPX provider networks, the contents of which are incorporated herein by reference to its entirety. As shown in FIG. 3A (and discussed in greater detail herein), schematic block diagram **301** includes a blockchain roaming broker (BRB) that facilitates roaming across 3G, 4G and 5G mobile technologies using secured Distributed Ledger Technologies (DLT).\n(39) The roaming architecture shown in schematic block diagram **301** includes a Visited Public Land Mobile Network (VPLMN) and a Home Public Land Mobile Network (HPLMN). A Public Land Mobile Network (PLMN) is a network established and operated by a carrier for providing mobile communication services to its subscribers. Generally, domestic subscribers for a carrier use roaming if to receive services from abroad. A HPLMN refers to the subscriber's home network (e.g., domestic carrier) while VPLMN refers to the subscriber's abroad network (where the UE may be registered while roaming). While FIG. 3A illustrates the roaming architecture with the local breakout scenario, it is appreciated other roaming architectures may be employed (e.g., home routing, etc.). Further, as shown here, some network entities such as the Session Management Function (SMF) and the User Plane Function(s) (UPF(s)) involved in a PDU session are under the control of the VPLMN.\n(40) An IPX network (not shown) may provide IP-based interoperability between the VPLMN and the HPLMN. However, such IPX network often increases costs associated with roaming due, in part, to the numerous protocols and complex IPX messaging. In addition, security requirements for a home network may be different than those of a visiting network. As discussed herein, this disclosure provides a natively integrated blockchain enterprise platform that supports blockchain registration processes and blockchain session management processes. This natively integrated blockchain enterprise platform avoids often expensive and complex signaling and message exchanges between VPLMNs and HPLMNs (and over IPX networks) and can include a Blockchain Roaming Broker (BRB) entity (e.g., BRB **306**), which operably establishes trust and secures communications between UE and a mobile network (e.g., NFs that form SBA **132**) using a distributed immutable record.\n(41) BRB **306** can be implemented for both domestic and international roaming and can provide instant service authorizations and network usages for roaming UE that support the blockchain registration processes and/or the blockchain session management processes. For example, BRB **306** may be accessible to network entities that form SBA **132** and reside in VPLMN and/or HPLMN.\n(42) The network entities that form SBA **132** include, for example, AMF **320**, SMF **325**, Network Slice Selection Function (NSSF) **330**, Network Exposure Function (NEF) **335***v*|**335***h*, Network Repository Function (NRF) **340***v*|**340***h*, Policy Control Function (PCF) **345***v*|**345***h*, and Application Function (AF) **350**. These network entities can be implemented either as a network element on a dedicated hardware, as a software instance running on a dedicated hardware, or as a virtualized function instantiated on an appropriate platform, e.g., a cloud infrastructure, as is appreciated by those skilled in the art.\n(43) In general, UE **308** connects to RAN/Access Network (AN) **310** as well as AMF **320**. Here, the RAN can include a base station while the AN can include a base station supporting non-3GPP access, e.g., Wi-Fi access. AMF **320** provides UE-based authentication, authorization, mobility management, etc. SMF **325** is responsible for session management, IP address allocation to UE(s), and traffic management/selection of a User Plane Function (UPF) (e.g., UPF **315**) for proper routing/data transfer. If UE **308** has multiple sessions, different SMFs may be allocated to each session for individual management and/or different functionality per session. AF **350** generally provides information on packet flows to PCF **345***v*, which is responsible for policy control in order to support Quality of Service (QoS). Based on the information from AF **350**, PCF **345***v* determines policies about mobility and session management for proper AMF/SMF operations. AUSF **355** stores authentication data for UE **308**, and UDM **360** stores subscription data for UE **308**. Data network **108** provides Internet access or operator services. The foregoing operations (and additional functionality) for respective network entities can be found in 3GPP Technical Specification (TS) 23.501 v 15.2.0 and TS 23.502v15.2.0, which is incorporated by herein by reference to its entirety.\n(44) Notably, the disclosed blockchain security operations, such as those employed for roaming UE registration and/or roaming UE session management, are discussed in greater detail below, and with reference to subsequent signaling diagrams illustrated in FIGS. 4A, 4B, 5A, and 5B. As discussed below, such blockchain security operations involve messages exchanged over the new blockchain network interfaces BCx, BCy, and BCz, and between one or more NFs in SBA **132**, BRB **306**, and/or BAF(s) **305**.\n(45) FIG. 3B illustrates a schematic block diagram **302**, showing a reference point interface representation of SBA **132** (e.g., with a local breakout (LBO) scenario). Reference point representations help develop detailed call flows in a normative standardization, which are illustrated in FIGS. 4A, 4B, 5A, and 5B and described in greater detail herein. It should be noted, for sake of clarity, certain network entities (e.g., NEF **335**, NRF **340**, etc.) are not shown by schematic block diagram **302**. However, it is appreciated any of the illustrated network entities can interact with the non-illustrated entities as appropriate.\n(46) As illustrated, N1 carries signaling between UE **308** and AMF **320**. The reference points for connecting between (R)AN **310** and AMF **320** and between (R)AN **310** and UPF **315** are defined as N2 and N3, respectively. There is a reference point, N11, between AMF **320** and SMF **325**. In this fashion, SMF **325** may be controlled by AMF **320**. N4 is used by SMF **325** and UPF **315** so that the UPF **315** can be set using the control signal generated by the SMF **325**, and the UPF **315** can report its state to the SMF **325**. N15 and N7 are defined since PCF **345** applies policy to AMF **320** and SMF **325**, respectively. N12 is used AMF **320** to perform authentication of UE **308**. N8 and N10 provide subscription data of UE **308** from UDM **360** to AMF **320** and SMF **325**. In addition, BCy network interface interconnects AMF **320** and BRB **306** to provide alternative or supplemental authentication/registration signaling for UE **308**. Notably, in some embodiments, UE **308** may be authenticated/registered by AUSF **355** over blockchain network interface BCx. In addition, BCx network interface interconnects PCF **345** and BRB **306** for data session management, including blockchain charging events/transactions. Additional reference points are illustrated and can generally operate in accordance with 3GPP specifications, as is appreciated by those skilled in the art.\n(47) FIG. 3C illustrates a schematic block diagram **303**, showing another reference point interface representation of SBA **132**. Here, schematic block diagram **303** particularly illustrates blockchain network interfaces BCx interconnecting BRB **306** with NEF **335**, which may be invoked by SMF **325** and/or PCF **345**, as discussed in greater detail herein. In addition, in some embodiments, blockchain network interface BCx may interconnect BRB **306** with UDM **360** to provide registration information.\n(48) As mentioned above, FIGS. 3A-3C illustrate a native blockchain platform, including an enterprise blockchain network **304** of interconnected blockchain service providers (SPs) or Blockchain Authentication Function (BAF) entities **305***a*-**305***n* (e.g., distributed ledger technology (DLT) entities, etc.), and a Blockchain Roaming Broker (BRB) **306**, which acts as a software defined agent accessible to various network entities of SBA **132** (e.g., over blockchain network interfaces BCx, BCy, and BCz, etc.) In general, this native blockchain platform can provide an additional and/or alternative blockchain security mechanisms natively employed as part of UE registration processes as well as UE data session management processes (e.g., PDN/PDU sessions, etc.) Notably, the blockchain security mechanisms may be represented by blockchain registration process/services **244**, and/or blockchain session management process/services **246** (ref. FIG. 2).\n(49) The blockchain registration process generally includes operations to register and attach the UE to the core network and to encrypt and protect traffic between the UE and core network entities (e.g., SBA **132**). For example, the registration operations can include exchanging authentication messages between one or more core NFs of SBA **132** and BRB **306**, which is exposed to the core NFs over new blockchain network interfaces (e.g., BCy and/or BCz). In some embodiments, the core NFs can further invoke NEF **335** to transparently forward the authentication messages to/from BRB **306**. BRB **306** further communicates with a corresponding BAF **305** (e.g., based on authentication information such as UE account credentials with the BAF). The corresponding BAF **305**, in turn, compares the UE account credentials against UE credentials stored on a blockchain or distributed ledger. As is appreciated by those skilled in the art, the BAF returns authentication confirmation messages to BRB **306** if the UE credentials match the UE credentials stored on the blockchain or distributed ledger. BRB **306** further provides appropriate confirmation messages to the core network NFs to complete registration procedure and attach UE to the core network.\n(50) The blockchain session management process generally includes operations to establish sessions (e.g., PDU sessions/PDN sessions) with UE **308** in order to allocate session resources to relevant network slices, permit data transmission between UE **308** and data network **108**, ensure appropriate Quality of Service (QoS) connectivity, satisfy Service Level Agreements (SLA(s)), and so on. Notably, the blockchain session management processes may include authentication/authorization operations, however it is appreciated such operations relate to session management and may be separate from the blockchain registration process for attaching the UE to the network. Similar to the blockchain registration process discussed above, the blockchain session management operations include exchanging messages between one or more core NFs of SBA **132** (including NEF **335** (if invoked)) and BRB entity **306** over a new blockchain network interface (e.g., BCy and/or BCz). BRB **306** further communicates with a corresponding BAF (e.g., based on the session management authentication information and/or the registration authentication information) to authenticate or authorize UE **308** for purposes of session establishment, and pass on confirmation messages back to appropriate core network entities upon successful authentication/authorization.\n(51) In proper context, and with reference to FIGS. 3A, 3B, and/or **3**C, various network entities cooperate to perform initial registration and attachment processes for UE **308**. In particular, RAN/Access Network (AN) **310** broadcasts system information (e.g., PLMN-IDs) to various UE(s), including UE **308**. UE **308** receives the PLMN-ID from RAN/Access Network (AN) **310** and, during its initial registration, UE **308** indicates support for a complimentary (and/or substitute) blockchain procedures (e.g., the blockchain registration procedure and/or the blockchain session management procedure). For example, UE **308** can indicate support for these blockchain procedures in a radio layer message (e.g., a Radio Resource Control (RRC) message) sent to RAN/Access Network (AN) **310**.\n(52) RAN/Access Network (AN) **310** receives the RRC messages from UE **308** and selects an appropriate AMF **320** (which supports the blockchain procedures) and/or redirects the RRC messages to a new AMF as appropriate. Here, RAN/AN **310** can determine the RRC message from UE **308** include an indication for the disclosed blockchain procedures (e.g., in an access category) and selects AMF **320** and/or redirects to a new AMF based on the AMF blockchain capabilities.\n(53) In some embodiments, AMF **320** receives an indication to perform the blockchain registration procedure from Non-Access Stratum (NAS) messages sent directly from UE **308** (e.g., over network interface N1) to AMF **320**. In this fashion, the NAS messages can indicate UE **308** supports/request the blockchain authentication procedure, e.g., in payload data such as registration type in the NAS message, and/or in follow-on request data.\n(54) AMF **320** further exchanges blockchain authentication messages with BRB **306**, over blockchain network interfaces BCx and/or BCy. In some embodiments, AMF **320** may send authentication messages to invoke/request that AUSF **355** perform blockchain registration operations, which causes AUSF **355** to authenticate UE **308** with BRB **306** over blockchain network interface BCx (e.g., ref. FIG. 4A). In other embodiments, AMF **320** can directly authenticate UE **308** with BRB **306** over blockchain network interface BCy, using for example, REST Application Program Interface (API) messages (e.g., ref. FIG. 4B). BRB **306** further authenticates the blockchain credentials for UE **308** with a corresponding BAF **305**, as mentioned above. For example, the BAF **305** receives the UE credentials, compares the UE credentials against stored UE credentials (e.g., stored on a blockchain or distributed ledger) and sends appropriate confirmation messages when the UE credentials match the stored UE credentials.\n(55) Notably, AMF **320** and/or AUSF **355** can also perform conventional registration processes in addition to the above discussed blockchain authentication operations, depending on service provider or mobile network operator security/integrity policies, as is appreciated by those skilled in the art—e.g., generating/creating encryption keys (e.g., anchor keys), sending authentication requests to AUSF **355**, selecting UDM **360**, retrieving vectors, e.g., credentials and/or encryption keys, from UDM **360**, and so on. In this fashion, the blockchain authentication procedure can complement (or augment) existing authentication processes (e.g., 5G Extensible Authentication Protocol (EAP)—Authentication and Key Agreement (AKA) procedures defined by 3GPP TS 33.301, etc.) to serve as an enhanced or secondary form of security. In other embodiments, however, the blockchain authentication procedure can replace existing authentication processes (e.g., if existing authentication processes fail, etc.)\n(56) These and other blockchain enhanced registration features are described in greater detail with respect to the schematic signaling diagrams shown in FIGS. 4A and 4B, below.\n(57) Still referring to FIGS. 3A, 3B, and/or **3**C, various network entities or NFs also cooperate to manage sessions for UE **308** (e.g., establish sessions, handover sessions, modify sessions, etc.). Sessions are typically managed as part of a connectivity service (e.g., PDU Connectivity Service), which defines rules for exchanging data packets (e.g., Protocol Data Units (PDUs)) between the UE (e.g., UE **308**) and a data network (e.g., data network **108**) based on session-specific Quality of Service (QoS) parameters. This connectivity service can include multiple PDU sessions, which are logical associations created between the 5G core network entities (e.g., SBA **132**) and UE **308** to handle data packet exchanges. In the context of a 5G network, session management is flexible, scalable, and accommodates various service continuity modes (e.g., “make before break” options, relocation of core network functions, etc.) while maintaining seamless end-user services. The session management also supports concurrent local and central access to a data network and multi-access edge computing where an application at an edge data centre can influence traffic routing to improve its performance.\n(58) While session management is illustrated and described herein in the context of 5G networks (e.g., PDU sessions), it is appreciated such session management and related operations can readily apply to 4G networks (e.g., PDN sessions, etc.) For example, as is appreciated by those skilled in the art, 4G networks create sessions using default data bearers (e.g., 4G networks), while the 5G networks establish a PDU session as-needed or on demand, independent of UE attachment procedures. Further, UE(s) can establish multiple PDU sessions to the same data network (or to different data networks) over a single or multiple access networks (e.g., 3GPP networks, non-3GPP networks, etc.) where each PDU session is associated with network slice—e.g., one S-NSSAI and one Data Network Name (DNN). Notably, the PDU sessions can include various session types (e.g., IPv4, IPv6, Ethernet, unstructured, etc.)\n(59) In operation, UE **308** initiates session establishment by sending a PDU session request data to AMF **320** (e.g., as part of a PDU Session Establishment Request message). Notably, when UE **308** attaches to the core network (e.g., SBA **132**), UE **308** exchanges mobility management messages and session management messages with AMF **320** (e.g., over an NG1 NAS network interface). Session management messages can be transmitted with the mobility management message supported by the NAS routing capability within AMF **320**. Although AMF **320** is involved in sending session management messages, processing mobility messages and session management messages typically occurs in AMF **320** and SMF **325**, respectively.\n(60) AMF **320** receives the PDU session request and discovers/selects an appropriate SMF (e.g., SMF **325**) based on parameters included in the initial PDU session request from UE **308**, such as session management service identification data, Single Network Slice Selection Assistance Information (S-NSSAI) data, Data Network Name (DNN) data, UE subscriptions, local operator policies, blockchain authentication data/capabilities, etc.). Although AMF **320** may not understand the full context of the session management messages, it can still determine/select an appropriate SMF for a new PDU session based on the above-mentioned parameters.\n(61) Here, AMF **320** selects SMF **325** and establishes a PDU session, which allocates PDU resources for a relevant network slice and permits data transmission/data packet exchanges between UE **308** and data network **108**. In addition, AMF **320** also ensures that NAS signaling associated with this PDU session is handled by the same SMF (SMF **325**) by assigning a PDU session identifier to the PDU session. UE **308**, in turn, uses this PDU session identifier to route messages to the correct SMF.\n(62) As mentioned, PDU sessions are typically managed as part of a connectivity service (e.g., PDU Connectivity Service), which defines rules for exchanging data packets (e.g., Protocol Data Units (PDUs)) between the UE (e.g., UE **308**) and a data network (e.g., data network **108**) based on session-specific Quality of Service (QoS) parameters. Subscription information for each S-NSSAI can include multiple DNNs and one default DNN. When UE **308** does not specify a DNN in a NAS Message containing PDU Session Establishment Request for a given S-NSSAI, the serving AMF determines the DNN for the requested PDU Session by selecting the default DNN for this S-NSSAI if a default DNN is present in the UE's Subscription Information; otherwise the serving AMF selects a locally configured DNN for this S-NSSAI. If the DNN provided by the UE is not supported by the network and AMF cannot select an SMF by querying NRF, the AMF may reject the NAS Message containing PDU Session Establishment Request from the UE with a cause indicating that the DNN is not supported.\n(63) Each PDU Session typically supports a single PDU Session type, e.g., supports the exchange of a single type of PDU requested by UE **308** at the establishment of the PDU Session. PDU Sessions are generally established upon UE request, modified upon UE **308**/SBA **132** request, and released upon UE **308**/SBA **132** request using NAS session management signaling exchanged over the N1 network interface between UE **308** and SMF **325**. Upon request from an Application Server, SBA **132** is able to trigger a specific application in UE **308**. When receiving the trigger message, UE **308** passes it to the identified application (in UE **308**). The identified application in UE **308** may establish a PDU Session to a specific DNN, in accordance with 3GPP TS 32.501, clause 4.4.5.\n(64) SMF **325** is responsible of checking whether UE requests are compliant with the user subscription. For this purpose, SMF **325** retrieves and requests to receive update notifications on SMF level subscription data from UDM **360**. This subscription data can incidate (e.g., per DNN and per S-NSSAI) allowed PDU Session Types and the default PDU Session Type, allowed SSC modes and the default SSC mode, QoS Information, subscribed Session-AMBR, Default 5QI and Default ARP, static IP address/prefix, subscribed User Plane Security Policy, Charging Characteristics to be associated with the PDU Session, and so on.\n(65) In addition, UE **308** may request to move a PDU Session between 3GPP and Non 3GPP accesses. The decision to move PDU Sessions between 3GPP access and Non 3GPP access is made on a per PDU Session basis, e.g., UE **308** may, at a given time, have some PDU Sessions using 3GPP access while other PDU Sessions are using Non 3GPP access. UE **308** typically provides a PDU session ID in a PDU Session Establishment Request message. The PDU session ID is unique per UE and represents a unique identifier assigned to a PDU Session. The PDU session ID can be stored in UDM **360** to support handover between 3GPP and non-3GPP access—e.g., when different PLMNs are used for the two accesses.\n(66) While many of the above discussed operations may be performed as part of conventional session management processes, this disclosure further describes blockchain session management processes where one or more network entities/NFs of SBA **132** exchange messages with BRB **306** over new blockchain interfaces (e.g., BCy and/or BCz) in order to establish a data session for UE **308**. The disclosed blockchain session management processes may complement existing session management processes similar to secondary authentication processes that use an Authentication Authorization, and Accounting (AAA) server in a data network. Here, however, the blockchain enterprise platform (e.g., BRB **306**, enterprise blockchain network **304**, and BAF(s) **305***a*-*n*) is natively integrated with and directly exposed to SBA **132**. It is also appreciated that the blockchain session management processes, in other embodiments, may replace existing session management processes.\n(67) With respect to the blockchain session management processes, SMF **325** receives session request data associated with UE **308**. This session request data may be included as part of a PDU Session Establishment Request message, which may comprise the above-mentioned parameters such as the blockchain authentication data. In some embodiments, AMF **320** initially selects SMF **325** based on the session request data and further forwards the session request data to SMF **325** (once selected). SMF **325** selects BRB **306** based on the session request data, and further exchanges at least a portion of the blockchain authentication data (e.g., blockchain authentication credentials associated with UE **308**) with BAF **305** over a blockchain network interface (e.g., BCx and/or BCy, where SMF **325** may route messages through AMF **320**, etc.)\n(68) In some embodiments, SMF **325** may further select an NEF (e.g., NEF **335**—shown in a dashed box in FIG. 3C) to act as an Application Program Interface (API) gateway between SMF **325** and BRB **306**. In these embodiments, SMF **325** exchanges authentication data with NEF **335**, which in turn exchanges messages with BAF **305** over the blockchain network interface BCx. In other embodiments, SMF **325** may directly communicate with BRB **306** over the blockchain network interface BCx.\n(69) SMF **325** receives authentication confirmation data from BAF **305** over the blockchain network interface BCx and establishes a session associated with the UE based on the authentication data.\n(70) In some embodiments, SBA **132** may apply a restricted access policy to the session while one or more NFs perform a blockchain credit check/charging event process. In particular, SMF **325** can communicate with PCF **345** to obtain payment credits (e.g., blockchain tokens, etc.) in order to ensure the services to be provided to UE **308** align with its creditworthiness. In turn, PCF **345** can solicit blockchain payment credits from BRB **306** (e.g., either directly and/or indirectly through NEF **335**) over the blockchain network interface BCx. PCF **345** and/or SMF **325** can determine that the blockchain payment credits satisfy a payment criteria for one or more network services (e.g., as part of the blockchain charging event), and further remove, modify, and/or update the restricted access policy for the data session.\n(71) These and other blockchain enhanced session management features are described in greater detail with respect to the schematic signaling diagrams shown in FIGS. 5A and 5B, below.\n(72) Blockchain Registration Process\n(73) FIGS. 4A and 4B illustrate respective schematic signaling diagrams **401** and **402** for the disclosed a blockchain registration procedure, where AMF **320** invokes AUSF **355** in diagram **401**, and AMF **320** directly authenticates UE **308** with BRB **306** in diagram **402**. In general, UEs register with the network in order to receive network services, enable mobility tracking, and support mobility/reachability. Notably, the call flow for the blockchain registration procedures can vary based on initial registrations, mobility registration updates, periodic registration updates, and so on. While signaling diagrams **401** and **402** illustrate an initial registration procedure in accordance with embodiments of the disclosed blockchain registration procedure, it is appreciated the call flows may be modified based the type of UE registration.\n(74) Referring to FIG. 4A, schematic signaling diagram **401** begins at step **403**, where UE **308** sends a registration request message to RAN/AN **310**. In one embodiment, the registration request message can indicate UE **308** supports a blockchain registration procedure using, for example, data fields such as access categories/access identities for existing registration messages (e.g., in accordance with access identities/access categories and RRC establishment clauses specified by 3GPP TS 24.501, table 4.5.6.1 (below)).\n(75) TABLE-US-00001 Access RRC establishment identities Access categories cause is set to 0 0 (=MT\\_acc) MT access 1 (=delay tolerant) FFS 2 (=emergency) Emergency call 3 (=MO\\_sig) MO signaling 4 (=MO MMTel voice) MO voice call 5 (=MO MMTel video) FFS 6 (=MO SMS and FFS SMSoIP) 7 (=MO\\_data) MO data 1 Any category “High priority access” 2 Any category “High priority access” 11, 15 Any category “High priority access” 12, 13, 14, Any category “High priority access” NOTE: See subclause 4.5.2, table 4.5.2.1 for use of the access identities of 0, 1, 2, and 11-15.\n(76) RAN/AN **310** further selects an AMF—here, AMF **320**—based on the registration message. For example, RAN/AN **310** determines the registration request message indicates UE **308** supports the blockchain authentication procedure, and can select an appropriate AMF that likewise supports such procedure. Alternatively, RAN/AN **310** can reject the blockchain authentication request, which causes the UE to revert to existing 3GPP behaviour.\n(77) At step **404**, RAN/AN **310** sends a registration request message to AMF **320**. As mentioned, these registration request messages (and corresponding call flows) may generally follow existing registration procedures such as those specified in 3GPP TS 23.502 (e.g., 4.2.2.2). However, in accordance with the disclosed blockchain authentication procedure, the registration request message may further include a registration type information element (e.g., 5GS registration type information element, defined in 3GPP TS 24.501, 9.8.3.7) that indicates guest access with the additional blockchain mechanisms (e.g., the blockchain authentication procedure).\n(78) For example, the 5GS registration type information element is provided below:\n(79) TABLE-US-00002 9.8.3.7.1: 5GS registration type information element 8 7 6 5 4 3 2 1 5GS registration FOR 5GS registration octet 1 type IEI type value\n(80) TABLE-US-00003 9.8.3.7.1: 5GS registration type infonnation element 5GS registration type value (octet 1) Bits 3 2 1 0 0 1 initial registration 0 1 0 mobility registration updating 0 1 1 periodic registration updating 1 1 0 emergency registration 1 1 1 reserved All other values are unused and shall be interpreted as “initial registration”, if received by the network. Follow-On Request bit (FOR) (octet 1) Bit 4 0 No follow-on request pending 1 Follow-on request pending\n(81) In one embodiment, the 5GS registration type information element can enable a follow-on attribute and/or set the follow-on-request bit, which can indicate support or information corresponding to the blockchain authentication procedure. In another embodiment, the 5GS registration type information element can be modified to include a registration type that indicates the guest authenticating mechanism (e.g., the blockchain authentication procedure).\n(82) In some embodiments, the blockchain registration procedure, whether indicated in the registration request message with the follow-on request bit or the modified registration type, can include a non-3GPP authentication procedure piggy backed over a Non-Access Stratum (NAS) message. For example, the blockchain authentication procedure could be carried in a transparent container payload of the NAS protocol where the authentication type can be indicated in a NAS payload. Notably, in accordance with network service provider or operator policy/requirements, AMF **320** may first perform standard EAP-AKA procedures (e.g., as defined by 3GPP TS 33.301, 6.1.2 and 6.1.3), and if successful, AMF **320** may further perform the blockchain authentication procedure as a complimentary or supplemental process. However, as mentioned above, in some instances, AMF **320** may perform the blockchain authentication procedure and register/attach UE **308** to the network even if the standard EAP-AKA procedures fail (depending on policy/requirements).\n(83) Signaling diagram **401** continues to steps **406** and **408** where UE **308** and AMF **320** exchange identity request/response messages. Here, AMF **320** initiates a UE identity request at step **406** during an initial registration, e.g., when AMF **320** is new to UE **308**, and/or when AMF **320** was not provided Subscriber Concealed Identifier (SUCI) information from prior AMF(s) (e.g., in accordance with 3GPP TS 23.502 procedures). As shown, AMF **320** particularly initiates authentication with UE **308** by sending an identity request message at step **406** and, in response, UE **308** generates and transmits, a corresponding identity response (e.g., with a SUCI or privacy preserving identifier containing a concealed subscriber permanent identifier (SUPI)) in step **408**.\n(84) In some embodiments, UE **308** returns additional parameters at step **408** to indicate support for the blockchain registration procedure (e.g., in addition to or as an alternative to the above discussed indications in 5GS registration type information). After step **408**, AMF **320** initiates UE authentication processes with an AUSF and selects AUSF **355** based on, for example, SUCI/SUPI information (described in 3GPP TS 23.501) and/or the indicated support for the blockchain authorization procedure.\n(85) Steps **410**-**425** illustrate the blockchain registration procedure employed by AUSF **355** in conjunction with conventional authentication calls (e.g., as specified by 3GPP TS 33.501) between AMF **320**, AUSF **355**, and UDM **360**. As described herein, the ordering and exchange messages represented by steps **410**-**425** can reflect various bi-lateral message exchanges.\n(86) In particular, step **410** represents an message exchange of challenges/responses between AMF **320** and UE **308**, which allow UE **308** to indicate support for the blockchain registration procedure in NAS messages sent to AMF **320** (e.g., over network interface N1).\n(87) At step **412**, AMF **320** can invoke existing authentication services by sending an authentication request message to AUSF **355**. In response, AUSF **355** checks that the requesting AMF in the serving network is entitled to use the serving network and sends, at step **414**, a corresponding authentication request message to UDM **360**. UDM **360** generates and sends an authentication vector (e.g., security keys, etc.) to AUSF **355**, again at step **414**.\n(88) AUSF **355** also exchanges EAP-Requests/AKA-Challenges with AMF **320**, at step **416**, which further solicit EAP challenges/responses from UE **308**, at step **418**. As shown, the EAP challenges/responses between UE **308** and AMF **320** can include NAS messages with blockchain payload data to provide AMF **320** (and thus AUSF **355** at step **416**) relevant blockchain authentication information (e.g., UE **308** registration information with prior BRB entities, prior BAF entities, etc.) for subsequent or secondary authentication by BAF **305** (e.g., steps **424**-**425** discussed below). In accordance with existing authentication protocols, and based on the EAP challenges/responses received by AUSF **355** at step **416**, AUSF **355** can complete UE authentication with UDM **360** at step **414**.\n(89) Collectively, the messages exchanged at steps **410**-**416** can confirm/accept the UE's credentials or deny/reject the UE's credentials based on existing authentication protocols. In addition, these messages can provide appropriate security context/acknowledgements between UE **308**, AMF **320**, AUSF **355**, and UDM **360**, which protect/encrypt subsequent messages from UE **308**.\n(90) Regardless of success/failure of UE authentication in steps **410**, AMF **320** and AUSF **355** may further perform the blockchain registration procedure (e.g., as a complimentary/substitute authentication procedure). In this fashion, the blockchain authentication procedure can thought of as an extension to existing calls and/or may include additional flags/parameters in appropriate messages.\n(91) Depending on policies and/or security requirements, AMF **320** may continue on to perform the blockchain authentication process with AUSF **355**. As mentioned above, AMF **320** can receive relevant blockchain authentication information from UE **308** in the course of exchanging authentication messages based on existing procedures, or alternatively, UE **308** can send separate NAS messages to AMF **320** with the blockchain authentication information included in payload data, such as shown at step **420**. The blockchain authentication information is used by AMF **320**/AUSF **355** to authenticate UE **308** with BRB **306** and thus, BAF **305**. For example, the blockchain authentication information can include a blockchain entity ID that corresponds to BRB **306** and/or BAF **305** as well as blockchain credentials, such as blockchain registration information, blockchain subscription information, and so on. Preferably, UE **308** registers and subscribes to BRB **306** and/or BAF **305** (e.g., over blockchain network interface BCz) to obtain the appropriate blockchain authentication information. AMF **320** receives these NAS messages, and sends corresponding blockchain authentication messages to BRB **306**. BRB **306** identifies the blockchain entity ID from the authentication messages, and selects an appropriate BAF (here, BAF **305**) to authenticate UE **308**.\n(92) At step **422**, AMF **320** further invokes AUSF **355** to continue the blockchain authentication procedure and authenticate UE **308** with BRB **306** using, for example, an API message (e.g., a Nausf service call over the N12 network interface). In this fashion, AMF **320** sends service-based API messages (e.g., as defined by 3GPP TS 29.509 and TS 29.518) with appropriate blockchain authentication flags/parameters/payload/etc. to AUSF **355**.\n(93) AUSF **355** receives the API messages and exchanges, at step **424**, blockchain authentication messages with BRB **306** over blockchain network interface BCx, which further causes BRB **306** to authenticate UE **308** with BAF **305** (e.g., based on the authentication data associated with UE **308**). In this fashion, BRB **306** authenticates UE **308** with BAF **305** at step **425**, and may receive a blockchain authentication confirmation message from BAF **305**. BRB **306** sends the confirmation message to AUSF **355**, which further sends the blockchain authentication confirmation messages to AMF **320**, as shown by the bi-lateral signals at steps **424** and **422**.\n(94) It is appreciated the blockchain authentication procedure may require additional messages to handle situations where BRB **306** is slow to respond, BAF **305** is unavailable or out of service, and/or fails to confirm the UE credentials. In these situations, AMF **320** may send temporary Ack messages to UE **308** to provide additional processing time for BRB **306** and/or BAF **305** to authenticate the UE credentials.\n(95) Steps **420**-**425** represent blockchain authentication operations where AMF **320** exchanges blockchain authentication data associated with UE **308** with BRB **306**, BRB **306** receives the blockchain authentication data and selects BAF **305** (e.g., based on a blockchain account identifier, UE blockchain credentials, etc.), and BRB **306** completes the blockchain authentication transaction with BAF **305**. In some embodiments, BAF **305** may be considered an agent of UE **308** and UE **308** can previously register and/or subscribe to BAF **305** over blockchain interface BCz (e.g., which can initially generate the blockchain authentication data associated with UE **308**).\n(96) Once UE **308** is successfully authenticated with the blockchain registration procedure, signaling diagram continues to steps **430**, **432**, **436**, and **438**, which include appropriate messages to complete UE **308** registration in accordance with 3GPP TS 23.502 (e.g., UDM selection/update, PCF selection, registration acceptance, and so on).\n(97) In some embodiments of this disclosure, the blockchain authentication procedure may also include an optional credit check for UE **308**, shown as a charging event at steps **434**-**435**. Notably, this credit check represents a charging authorization procedure that can be performed after UE **308** is authenticated with BRB **306**/BAF **305** but before AMF **320** attaches UE **308** to the SBA network.\n(98) In operation, PCF **345** manages mobility credentials for UE **308** and performs the credit authorization procedure with BRB **306**, which further communicates with BAF **305** in an authorization layer. The credit authorization procedure determines if UE **308** (and its corresponding user) can complete a transaction (e.g., can the user pay for the transaction now or at a future time), the type and/or number of network services the user can afford (e.g., which can limit or restrict access to network resources), and so on. For example, in an Internet of Things (IoT) context, PCF **345** can use the credit authorization procedure to determine virtual contract information (e.g., credit worthiness) associated with UE **308**, which can be shared with other network entities/services (e.g., NFs) in SBA **132**.\n(99) As mentioned above, steps **430**, **432**, **436**, and **438** include messages to complete UE **308** registration in accordance with 3GPP TS 23.502.\n(100) FIG. 4B provides signaling diagram **402**, which shows AMF **320** directly performing the blockchain registration procedure with BRB **306**. Signaling diagram **402** includes many of the same steps or calls shown in signaling diagram **401**, which are discussed above.\n(101) In this embodiment, AMF **320** directly perform the blockchain registration procedure with BRB **306** after, for example, AMF **320** successfully obtains an appropriate security context/acknowledgements from AUSF **355**/UDM **360**, which ensures encryption/integrity protection for messages exchanged with UE **308**.\n(102) In addition to the steps shown in signaling diagram **401**, signaling diagram **402** further provides steps **426**, **428**, and **429**, which represent messages directly exchanged between AMF **320** and BRB **306** and between BRB **306** and BAF **305**.\n(103) In particular, at step **426**, UE **308** exchanges blockchain authentication data with AMF **320** using, for example, NAS messages that can include blockchain payload data. In some embodiments, AMF **320** can select BRB **306** based on the blockchain authentication data, while in other embodiments, AMF **320** may be assigned to BRB **306** by default.\n(104) AMF **320** sends the authentication data to BRB **306** at step **428**. As mentioned, the blockchain authentication data can include a blockchain entity ID that corresponds to BAF **305** as well as blockchain credentials (e.g., registration information, subscription information, account information, etc.) that corresponds to UE **308**. BRB **306** receives the blockchain authentication data and can select an appropriate BAF (here, BAF **305**) based on the blockchain entity ID. BRB **306** further authenticates UE **308** with BAF **305** at step **429**, and upon successful authentication, BAF **305** sends an authentication confirmation to BRB **306**. BRB **306** further sends the authentication confirmation to AMF **320** at step **428** (which represents a bi-lateral message exchange).\n(105) Steps **430**, **432**, **436**, and **438** represent messages for completing UE registration in accordance with 3GPP TS 23.502.\n(106) Blockchain Enhanced PDN Session Establishment with Out-of-Band Blockchain Authorization\n(107) FIGS. 5A and 5B illustrate respective schematic signaling diagrams **500** and **501** of the disclosed blockchain enhanced session management processes using a natively integrated blockchain platform. Although the schematic signaling diagrams illustrate an initial session establishment procedure for a PDU session, it is appreciated the call flows may be readily modified according to handover operations, switching sessions, requesting sessions for emergency services, and the like.\n(108) FIG. 5A particularly illustrates schematic signaling diagram **500** showing call flows for a blockchain enhanced PDU session establishment with an out-of-band authorization operations. In general, the illustrated blockchain session establishment procedure leverages a new blockchain network interface (BCy) to authenticate UE **308** for network services and incorporates NEF **335** to act as an API gateway between SMF **325** and BRB **306**. In addition, FIG. 5A also illustrates blockchain charging events (e.g., steps **522**, **524**, and **525**) between PCF **345**, BRB **306**, and BAF **305**, which operably provide funds (e.g., tokens from an eWallet or blockchain wallet) directly for one or more network services.\n(109) As shown, at step **502**, UE **308** initiates an initial PDU (or PDN) session establishment request and sends session request data (e.g., Non-Access Stratum (NAS) messages) to AMF **320** over network interface N1. The NAS messages can include information such as Single Network Slice Selection Assistance Information (S-NSSAI), Data Network Name (DNN), PDU session IDs, request types, old PDU session IDs, an N1 Service Management (SM) container, indications/requests for blockchain authorization (e.g., as a secondary authorization), and so on.\n(110) Notably, the indications/requests for the blockchain authorization can represent a preference by UE **308** for the network (SBA **132**) to use blockchain authentication data (e.g., blockchain credentials) to authorize/authenticate UE **308** for a PDU session. In one embodiment, the indication of the blockchain authorization may be specified by the S-NSSAI data, which can include a unique identifier of a network slice. For example, the S-NSSAI data can include a Slice/Service type (SST), denoting expected network behaviour, as well as a Slice Differentiator (SD), differentiating amongst multiple network slices of the same Slice/Service type. Here, UE **308** can provide S-NSSAI data having a particular unique identifier corresponding to blockchain capable network slice.\n(111) Alternatively, the indication of the blockchain authorization may be included as one of the SST values in the S-NSSAI data in accordance with 3GPP TS 23.501 (clause 5.15, table 5.15.2.2-1). For example, the SST value may be modified to include the blockchain ID as provided below.\n(112) TABLE-US-00004 Slice/Ser- SST vice type value Characteristics. eMBB 1 Slice suitable for the handling of 5G enhanced Mobile Broadband. URLLC 2 Slice suitable for the handling of ultra- reliable low latency communications. MIoT 3 Slice suitable for the handling of massive IoT. Blockchain X Slice that uses blockchain for authorization and/or service provisioning.\n(113) In other embodiments, if slicing is orthogonal to the blockchain procedures, the PDU “Request Type” could be set to “guest access with dual authentication”, as is appreciated by those skilled in the art.\n(114) AMF **320** receives the session establishment request and further discovers/selects an appropriate SMF—here, SMF **325**. In particular, AMF **320** discovers and selects SMF **325** based on parameters included in the initial PDU session request (e.g., step **502**). As mentioned, these parameters include S-NSSAI data, DNN data, UE subscriptions, local operator policies, blockchain authentication data/blockchain capabilities, and so on.\n(115) Here, AMF **320** selects SMF **325** based, at least in part, on its blockchain session capabilities. If AMF **320** does not have an association with an SMF for the PDU session ID (e.g., when Request Type indicates “initial request”), AMF **320** invokes a PDU session creation request (e.g., Nsmf\\_PDUSession\\_CreateSMContext Request), as shown at step **504**. However, if AMF **320** already has an association with an SMF for the PDU Session ID (e.g., when Request Type indicates “existing PDU Session”), the AMF invokes the Nsmf\\_PDUSession\\_UpdateSMContext Request. Notably, the PDU Session creation request can specify a request type set to “guest access with dual authentication” (e.g., if a slice is not explicitly set for blockchain authorization).\n(116) At steps **506** and **507**, SMF **325** exchanges registration/subscription information (e.g., associated with UE **308**) with UDM **360** through BRB **306**. Again, at step **504**, SMF **325** sends a corresponding PDU session SM context responses (e.g., an SM context identifier) to AMF **320**. In this fashion, SMF **325** registers itself for an initial PDU session with UDM **360**, in accordance with UE-requested PDU Session Establishment procedures provided by 3GPP TS 23.502.\n(117) Steps **508**-**514** represent operations of the disclosed blockchain session management, including out-of-band blockchain authorization/authentication operations as part of the PDN session establishment. These blockchain authorization/authentication operations may conform to secondary authentication/authorization operations such as Data Network (DN)-Authentication, Authorization, and Accounting (AAA) server, described by 3GPP TS 23.501, clause 5.6.6. As shown, the blockchain authorization/authentication operations further leverage the natively integrated blockchain platform (e.g., BRB **306** and/or BAF **305**) which is exposed to SBA **132** over a new blockchain network interfaces BCy and/or BCx.\n(118) In particular, at step **508**, UE **308** sends a NAS SM DN Request Container message to SMF **325** to request the blockchain authentication procedure as a secondary authorization for the PDN session (e.g., in accordance with secondary authorization request of 3GPP TS 23.501, clause 5.6.6). The NAS SM DN Request Container message includes blockchain information for PDU session authorization by an external Data Network (e.g., slice information (identified by S-NSSAI), PDU session ID, a PDN it would like to connect to (identified by DNN), a blockchain server ID (identifying BAF **305**), etc.). This blockchain information may be provided as part of payload data, and/or may be included as part of follow-on request data.\n(119) Although the NAS SM DN Request Container message is illustrated as a single signal between UE **308** and SMF **325**, it is appreciated this signal may be conveyed to SMF **325** by AMF **320**. For example, UE **308** can send the signal to AMF **320** over the N1 network interface, and AMF **320** can send or forward the signal (or appropriate portions of the signal) to SMF **325** over the N11 network interface. In some embodiments, the NAS SM DN Request Container can include the PDU session establishment request message (e.g., step **502**) as part of a N1 SM container, as is appreciated by those skilled in the art.\n(120) SMF **325** receives the NAS SM DN Request Container, and determines an appropriate BRB entity and/or appropriate BAF entity (e.g., a blockchain server) based on the blockchain information and local configuration information contained therein. For example, SMF **325** can determine BRB **306** is as the appropriate blockchain roaming broker and further exchange blockchain Application Programming Interface (API) messages with BRB **306** over a blockchain network interface (e.g., the BCx network interface).\n(121) At step **510**, SMF **325** exchanges the blockchain API messages with BRB **306**, using NEF **335**, which acts as a gateway between SMF **325** and BRB **306**. NEF **335** further exchanges, at steps **511**-**513**, corresponding Representational State Transfer (REST) API messages with BRB **306**. In this fashion, NEF **335** allows external users (e.g., enterprises/partner operations) to monitor, provision, and enforce application-level policy for users inside the operator network. In addition, just as NEF **335** can act as a gateway between SMF **325** and BRB **306**, BRB **306** can act as a gateway between NEF **335** (and/or other NFs) and BAF **305**.\n(122) Steps **511**-**514** continue until successful authorization or failure. At step **514**, BAF **305** sends BRB **306** authentication confirmation data (e.g., indicating successful session authorization and profile information), which is further sent to NEF **335** at step **513**, which further forwards the authentication confirmation data to SMF **325** at step **510**.\n(123) Notably, the authentication confirmation data can include a service name that BAF **305** uses to register available network services for UE **308**. In addition, BAF **305** may provide service specific attributes (e.g., application access capabilities, QoS and Data rate profiles and other applications that the user has subscribed to as part of the blockchain contract, etc.) Notably, if authorization fails, the PDU set up request is rejected with appropriate cause code.\n(124) After successful authorization, SMF **325** continues with PDU establishment operations and, based on a PDU profile, selects a PCF and performs Session Management Policy Establishment procedure, as shown at step **516**. SMF **325** can provide a blockchain flag and associated parameters (if available from UE **308**) to indicate to PCF **345** that service capabilities can be obtained from BAF **305** (e.g., and/or via NEF **335**). For example, PCF **345** can use the blockchain authentication data (received from SMF **325** at step **516**) to identify NEF **335** and/or BAF **305**.\n(125) PCF **345** requests, at step **518**, service parameters from NEF **335**, which further obtains the service parameters from BAF **305**. Notably, step **518** may be optional, because PCF **345** can use the UDR as per 4.16.4 procedure defined in 3GPP TS 23.502. However, in some instances, the UDR may not have a service profile for all use cases (e.g., where the UE is a guest on the service provider's network). As shown here, PCF **345** retrieves the service profile from NEF **335** (which NEF **335** retrieves from BAF **305**). PCF **345** further determines the network services, QoS, and charging plan to be applied to the PDU session associated with UE **308**.\n(126) SMF **325** further selects a UPF (e.g., UPF **315**) to serve the PDU session, and at steps **520**-**524**, SMF **325** performs a blockchain charging event in conjunction with PCF **345**, NEF **335**, and/or BAF **305**, based on the profile information received at step **514**.\n(127) In particular, SMF **325** requests PCF **345** and NEF **335** to perform the blockchain charging event, which can represent a credit request transaction. The blockchain charging event includes operations for BAF **305** to return blockchain payment credits (e.g., blockchain tokens) to PCF **345** and/or SMF **325** (e.g., through BRB **306**) in order to pay for one or more network services for UE **308**. For example, the BAF **305** can return blockchain tokens from a blockchain eWallet associated with UE **308**.\n(128) In some instances, SMF **325** and PCF **345** can return tokens to BAF **305**, again through BRB **306**, should all the tokens requested in this step not be consumed. In comparison to other pre-paid services that use quotas from an Online Charging Server (OCS) (not an actual monetary fund), the blockchain charging event represents a prepaid transaction that can include actual funds, which the service provider can return if the contract is not completed in an authorized time period.\n(129) The blockchain charging event may include messages exchanged over the N30 network interface, shown at step **522**, between PCF **345** and NEF **335**. In this fashion, Nnef API messages may be augmented to include appropriate blockchain eWallet messages (requests/returns/etc.)\n(130) Steps **524**-**525** represent trusted communications between NEF **335**, BRB **306**, and BAF **305** since BAF **305** is a trusted application. However, in some instances, BAF **305** may not be trusted, in which case an Application Function (AF) could provide a proxy for these procedures.\n(131) In one or more additional embodiments, enhanced blockchain session management operations also accommodate delayed authorization. For example, BAF **305** and/or BRB **306** may require a certain amount of time to conclude a consensus, which may delay its response/fund verifications (e.g., as part of the blockchain charging event). In these instances, SMF **325** can request PCF **345** to notify it when NEF **335** allows the subscription. In addition, SMF **325** concludes the PDU session establishment, but can indicate UPF **315** to place the PDU session in quarantine until further notice (e.g., until BAF **305** concludes the consensus/completes the charging event).\n(132) Remaining steps **526**-**548**, may be defined by 3GPP TS 23.502, as is appreciated by those skilled in the art.\n(133) Blockchain Enhanced PDN Session Establishment with in-Band Blockchain Authorization\n(134) FIG. 5B illustrates a schematic signaling diagram **501**, showing call flows for a blockchain enhanced PDU session establishment with in-band authorization operations. The in-band blockchain session establishment procedure of FIG. 5B particularly leverages blockchain messages between UE **308** and BAF **305** (and/or through DN **108**) using Internet Protocol (IP) datagram encapsulation, as discussed in greater detail below.\n(135) Signaling diagram **501** begins at step **502** where, as discussed above, UE **308** initiates a PDU session establishment request. The session establishment call flow follows the above-discussed operations for steps **504**, **506**, and **507**.\n(136) At step **508**, UE **308** sends a NAS SM DN Request Container message to SMF **325** to request the blockchain authentication procedure as a secondary authorization for the PDN session. As mentioned, the NAS SM DN Request Container message includes blockchain information for PDU session authorization by an external Data Network (e.g., slice information (identified by S-NSSAI), PDU session ID, a PDN it would like to connect to (identified by DNN), a blockchain server ID (identifying BAF **305**), etc.) Notably, step **508** represents an optional signal between UE **308** and SMF **325**. However, even though it is optional, step **508** helps build trust between the core network (e.g., SBA **132**) and BAF **305** (e.g., a Distributed Ledger Technology (DLT) entity). For example, as discussed in greater detail below, until the blockchain authentication procedure results in successful authorization of the UE, UE **308** may only have a temporary connection and the access control list may be restricted. BAF **305** is typically registered and authenticated with NEF **335**, and SMF **325** may invoke NEF **335** to pass on the blockchain authentication credentials. Once authorized, UE **308** is notified of successful authorization, and BAF **305** notifies NEF **335**, which (in turn) notifies SMF **325** of the successful authorization.\n(137) Steps **510**-**514** (not shown) apply for the out-of-band blockchain authentication operations (e.g., secondary authentication/authorization operations), and are illustrated in signaling diagram **500**. Here, signaling diagram **501** illustrates in-band authentication operations, which are performed later in the signal flow (e.g., steps **550**-**560**), as described below.\n(138) In proper context, UE **308** is attached to the network at step **508**, but does not have an IP address assigned. After step **508**, SMF **325** selects PCF **345** based on a PDU profile. PCF **345** performs the Session Management Policy Establishment procedure, shown by steps **516**-**518**. For example, the Session Management Policy Establishment procedure can include operations where SMF **325** establishes the PDU Session with PCF **345**, including SMF **325** receiving default PCC Rules for the PDU Session, PCF **345** subscribing to IP allocation/release events in SMF **325**, PCF **345** updating policy information in SMF **325**, and so on.\n(139) Following steps **516**-**518**, SMF **325** selects a UPF (e.g., UPF **315**) to serve the PDU session. In case of PDU Type IPv4 or IPv6, SMF **325** allocates an IP address/prefix for the PDU Session as described in 3GPP TS 23.501, clause 5.8.1. In case of a PDU Type IPv6, SMF **325** can allocate an interface identifier to UE **308** for the UE to build its link-local address. For Unstructured PDU Type the SMF may allocate an IPv6 prefix for the PDU Session and N6 point-to-point tunnelling (based on UDP/IPv6) as described in 3GPP TS 23.501, clause 5.6.10.3.\n(140) Step **520** is modified since the above-discussed out-of-band blockchain authentication operations do not occur (e.g., steps **510**-**514**) here. Instead, at step **520**, PCF **345** determines UE **308** requests the blockchain authentication/authorization procedure. For example, SMF **325** can provide a blockchain indication to PCF **345**, which blockchain indication can include a blockchain flag, blockchain authentication data, payment data, blockchain entity identifiers, and so on. Here, the blockchain indication includes a blockchain flag, which causes PCF **345** to apply a restricted or guest access policy for the PDU session, pending successful in-band blockchain authorization/authentication operations, discussed below. Put differently, PCF **345** installs a restricted access rule for the PDU session, which may be similar to the rules applied for pre-paid users (e.g., users can access a Domain Name Server (DNS) to resolve the servers and HTTPS port/destination pair to a set of servers, etc.) In some embodiments, the server IP addresses could be returned in step **522** and step **524** as part of a blockchain charging event (not shown here).\n(141) If there is a commercial agreement in place, the restricted access policy allows UE **308** access to DN **108** to obtain authentication/authorization and blockchain payment data/tokens from BAF **305**. Again, similar to the pre-paid restricted policies, which allows UE **308** to connect to DN **108** through a web portal and enter credit card information, the in-band blockchain authentication/authorization operations represented by steps **550**-**562** leverage the native blockchain platform to automatically debit blockchain payments/tokens from BAF **305**. In this fashion, the subscriber associated with UE **308** only needs to ensure their wallet has funds.\n(142) Following step **520**, SMF **325** provisions rules on UPF **315**, at steps **526**-**528**, to allow DNS requests and REST messages to BAF **305** (e.g., a DLT server address provided by PCF **345**).\n(143) Steps **530**-**548** represent signals or messages accordance with UE-requested PDU Session Establishment procedures provided by 3GPP TS 23.502.\n(144) Steps **550**-**560** represent in-band blockchain authentication/authorization signals or messages. While steps **550**-**560** are illustrated after the PDU session is established at step **548** with a restricted access policy, it is appreciated these signals or messages may begin at step **538** (Up Link (UL) traffic).\n(145) At step **550**, UE **308** sends blockchain authentication data to UPF **315** using IP datagram encapsulation. UPF **315** acts as a gateway to BAF **305** and sends, at step **552**, corresponding blockchain data to BAF **305**. In some embodiments, UPF **315** may send messages to other NFs (e.g., SMF **325**) and/or over DN **108** for forwarding to BAF **305**. However, for sake of simplicity, signaling diagram **501** shows UPF **315** sending the corresponding blockchain data directly to BAF **305**. The blockchain authentication data can include, for example, blockchain authentication credentials, blockchain entity identifiers (e.g., corresponding to BAF **305**), and other information required by BAF **305** to authenticate/authorize UE **308** as well as to solicit blockchain payment data (e.g., blockchain tokens).\n(146) In this fashion, DN **108** may treat the PDU session as a prepaid session and allow approved protocols. In some embodiments, the PDU session may be associated with a timer that can safeguard the session and terminate the session if the PDU authentication/authorization does not conclude within a predetermined timeframe. In these embodiments, UDM **360** can set the timeframe at step **506** and/or the timeframe may be locally configured as part of an APN profile.\n(147) Steps **550**-**553** represent bi-directional messages between UE **308**, UPF **315**, BRB **306**, and BAF **305**. Other NFs (e.g., NEF **335**, DN **108**, etc.) may be invoked or employed as is appreciated by those skilled in the art. The bi-directional messages include blockchain authentication data required by BAF **305** to authenticate/authorize UE **308** as well as to solicit blockchain payment data (e.g., blockchain tokens). If authorization fails at steps **550**-**553**, UE **308** can choose to disconnect from the network. The network (e.g., SBA **132**) would be notified at steps **556**-**558**, and may further block UE **308**, disconnect the PDU session, or try authentication again.\n(148) BAF **305** authenticates (e.g., verifies blockchain credentials for UE **308**) the blockchain credentials associated with UE **308** and, if successful, it notifies NEF **335** (step **554**), which in turn notifies PCF **345** (step **556**) regarding successful authentication. Notably, BRB **306** may act as a gateway to facilitate communications between NEF **335** and BAF **305**. In addition, BAF **305** can return blockchain payment data (e.g., blockchain tokens) to NEF **335** and/or PCF **345**. PCF **345** updates the policy/traffic rules for SMF **325**, at step **558**, which further updates the traffic rules with UPF **315**. The updated policy/traffic rules permit UE **308** access to contracted network services (e.g., as specified and/or as paid for by BAF **305**).\n(149) The call flows or messages shown in FIG. 5B illustrate an in-band blockchain enhanced PDU session establishment procedure where BAF **305** authenticates UE **308** and returns blockchain payment data (e.g., blockchain tokens) to appropriate NFs in SBA **132** using IP datagram encapsulation.\n(150) FIG. 6 illustrates an example simplified procedure **600** for registering User Equipment (UE) in accordance with one or more embodiments of the blockchain registration procedure. For example, procedure **600** can represent operations performed by a NF entity (e.g., AMF **320**, AUSF **355**, NEF **335**, etc.) as part of the 5G core network.\n(151) Procedure **600** begins at step **605** and continues on to step **610** where, as discussed above, a core NF entity receives authentication data associated with a User Equipment (UE). The NF entity further determines the UE is roaming relative to the core network at step **615** and also determines the UE supports a blockchain registration procedure at step **620**. At step **625**, the NF entity can select a Blockchain Roaming Broker (BRB—e.g., BRB **306**) and exchange, at step **630**, authentication messages with the BRB entity. The BRB entity typically acts as an agent of a Blockchain Authentication Function (BAF) entity. In this fashion, the BRB entity can receive the authentication messages (which can include authentication data) and authenticate the UE with the BAF entity. The BRB entity can further send corresponding blockchain authentication confirmation messages from the BAF to the NF, as illustrated in step **635**.\n(152) In addition, in some embodiments, the NF can perform a credit authorization procedure for a user associated with the UE, as shown at step **640**. For example, the NF can include a PCF entity, which can communicate with the BRB entity and/or the BAF entity to determine if the user has appropriate funds (e.g., in an eWallet or a blockchain account) to pay for requested network services.\n(153) At step **645**, the NF entity registers the UE with the core network based on the blockchain authentication confirmation (e.g., received from the BRB entity), and at step **650**, the NF entity provides access to one or more network resources based on the credit authorization procedure.\n(154) Procedure **600** subsequently ends at step **655**, but may return again to step **510** where the NF receives authentication for another UE.\n(155) It should be noted that while certain steps within procedure **600** may be optional, the steps shown in FIG. 6 are merely example steps for illustration—certain other steps may be included or excluded as desired. Further, while a particular order of the steps is shown, this ordering is merely illustrative, and any suitable arrangement of the steps may be utilized without departing from the scope of the embodiments herein.\n(156) The techniques described herein, therefore, provide a native blockchain platform for wireless networks. This native blockchain platform supports new use cases that create opportunities to share network resources across multiple provider networks, increase workload mobility security, improve billing/mediation and reconciliation and create mechanisms for roaming authentication/registration using blockchain technology. In addition, the native blockchain platform provides new opportunities for the app economy and creates a new market place for Mobile virtual network operators (MVNO) participation. As discussed above the native blockchain platform facilitates new methods for authenticating UE when attaching the UE to the network as well as new methods to facilitate payments for network services as part of blockchain charging events.\n(157) While there have been shown and described illustrative embodiments of the native blockchain platform and corresponding operations in a specific network context (e.g., a mobile core network for a 5G network), it is to be understood that various other adaptations and modifications may be made within the spirit and scope of the embodiments herein. For example, the embodiments and operations disclosed herein have been described with respect to certain devices, NFs, interfaces, and systems, however it is appreciated that such embodiments are provided for purposes of example, not limitation and that the blockchain authentication techniques disclosed herein can be incorporated as part of existing wireless networks.\n(158) The foregoing description has been directed to specific embodiments. It will be apparent, however, that other variations and modifications may be made to the described embodiments, with the attainment of some or all of their advantages. For instance, it is expressly contemplated that the components, elements, and/or operations described herein can be implemented as software being stored on a tangible (non-transitory) computer-readable medium, devices, and memories (e.g., disks/CDs/RAM/EEPROM/etc.) having program instructions executing on a computer, hardware, firmware, or a combination thereof. Further, methods describing the various functions and techniques described herein can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can comprise, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that may be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on. In addition, devices implementing methods according to these disclosures can comprise hardware, firmware and/or software, and can take any of a variety of form factors. Typical examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example. Instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures. Accordingly this description is to be taken only by way of example and not to otherwise limit the scope of the embodiments herein. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the embodiments herein.\n\n### Claims\n\n1. A method for registering User Equipment in a communication network, the method comprising: receiving authentication data associated with a User Equipment (UE) by a Network Function (NF) entity that forms a part of a core network; determining, by the NF entity, the UE supports a blockchain registration procedure based on the authentication data; exchanging authentication messages between the NF entity and a Blockchain Roaming Broker (BRB) entity over a blockchain network interface; receiving, by the NF entity, a blockchain authentication confirmation from the BRB entity; and registering the UE with the core network based on the blockchain authentication confirmation.\n 2. The method of claim 1, further comprising: determining the UE is roaming relative to the core network based at least in part on the authentication data.\n 3. The method of claim 1, further comprising: selecting, by the NF entity, the BRB entity based at least in part on the authentication data.\n 4. The method of claim 1, wherein exchanging the authentication messages further comprises exchanging the authentication messages between the NF entity and the BRB entity to cause the BRB entity to authenticate blockchain credentials associated with the UE at a Blockchain Authentication Function (BAF).\n 5. The method of claim 1, wherein the NF entity includes at least one of an Access and Mobility Management Function (AMF) entity, an Authentication Server Function (AUSF) entity, or a Network Exposure Function (NEF) entity.\n 6. The method of claim 1, wherein the NF entity is a first NF entity, wherein exchanging authentication messages further comprises: invoking, by the first NF entity, a second NF entity to exchange authentication messages between the first NF entity and the BRB entity.\n 7. The method of claim 1, further comprising: receiving, by the NF entity, blockchain credentials in a Non-Access Stratum (NAS) message from the UE, and wherein exchanging the authentication messages further comprises exchanging the blockchain credentials between the NF entity and the BRB entity.\n 8. The method of claim 7, wherein the blockchain network interface is a first blockchain network interface, wherein the UE receives the blockchain credentials from a Blockchain Authentication Function (BAF) entity over a second blockchain network interface independent of the core network.\n 9. The method of claim 1, further comprising: performing a credit authorization procedure for a user associated with the UE; and providing the UE access to one or more network resources based on the credit authorization procedure.\n 10. The method of claim 9, wherein performing the credit authorization procedure further comprises invoking, by the NF entity, a Policy Control Function (PCF) entity to perform the credit authorization procedure.\n 11. The method of claim 1, wherein determining the UE supports the blockchain registration procedure further comprises: receiving, by the NF entity, the authentication data as part of a registration request message associated with the UE over at least one of a Radio Access Network (RAN) interface or an Access Network (AN) interface; and determining the registration request message indicates the UE supports blockchain authentication in an access category.\n 12. The method of claim 1, wherein exchanging authentication messages between the NF entity and the BRB entity further comprises exchanging one or more REST Application Program Interface (API) messages between the NF entity and the BRB entity.\n 13. A network function (NF) device, comprising: one or more network interfaces to communicate within a communication network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store instructions executable by the processor, wherein the instructions, when executed, are operable to: receive authentication data associated with a User Equipment (UE); determine the UE supports a blockchain registration procedure based on the authentication data; exchange authentication messages with a Blockchain Roaming Broker (BRB) entity over a blockchain network interface; receive a blockchain authentication confirmation from the BRB entity; and register the UE with at least a portion of a core network based on the blockchain authentication confirmation.\n 14. The NF device of claim 13, wherein the instructions, when executed, are further operable to: determine the UE is roaming relative to the core network based at least in part on the authentication data.\n 15. The NF device of claim 13, wherein the instructions, when executed, are further operable to: select the BRB entity based at least in part on the authentication data.\n 16. The NF device of claim 13, wherein the instructions to exchange the authentication messages are further operable to exchange the authentication messages with the BRB entity to cause the BRB entity to authenticate blockchain credentials associated with the UE at a Blockchain Authentication Function (BAF).\n 17. The NF device of claim 13, wherein the NF device includes at least one of an Access and Mobility Management Function (AMF) entity, an Authentication Server Function (AUSF) entity, or a Network Exposure Function (NEF) entity.\n 18. A tangible, non-transitory, computer-readable media having instructions encoded thereon, the instructions, when executed by a processor, are operable to: receive authentication data associated with a User Equipment (UE); determine the UE supports a blockchain registration procedure based on the authentication data; exchange authentication messages with a Blockchain Roaming Broker (BRB) entity over a blockchain network interface; receive a blockchain authentication confirmation from the BRB entity; and register the UE with at least a portion of a core network based on the blockchain authentication confirmation.\n 19. The tangible, non-transitory, computer-readable media of claim 18, wherein the instructions, when executed by the processor are further operable to: select the BRB entity based at least in part on the authentication data.\n 20. The tangible, non-transitory, computer-readable media of claim 18, wherein the instructions, when executed by the processor, are further operable to: perform a credit authorization procedure for a user associated with the UE; and provide the UE access to one or more network resources based on the credit authorization procedure."},"Patent Number":{"kind":"string","value":"10299128"},"Document ID":{"kind":"string","value":"US 10299128 B1"},"Date Published":{"kind":"string","value":"2019-05-21"},"Family ID":{"kind":"string","value":"66541023"},"Title":{"kind":"string","value":"Securing communications for roaming user equipment (UE) using a native blockchain platform"},"CPCI":{"kind":"string","value":"H04W8/02;G06Q20/10;G06Q20/322;G06Q20/401;H04L9/3226;H04L47/70;G06Q20/40;H04W4/24;G06F9/45558;H04L41/0896;H04L9/3247;G06Q20/389;H04W60/00;H04L41/0806;H04L41/0895;G06Q20/403;H04M15/8016;G06Q20/325;H04L9/3239;H04L9/083;H04L63/08;H04W12/08;G06Q20/36;H04L67/51;H04W12/06;H04L9/0637;H04L9/30;H04M15/8038;H04M15/61;G06Q20/065;H04L9/3257;H04L63/10;H04L9/321;H04L9/3236;H04L9/3297;H04M15/66"},"CPCA":{"kind":"string","value":"H04L41/5019;H04L12/1407;H04L41/40;G06F2009/4557;H04L43/0817;H04L9/50;G06F2009/45595;H04L2209/56;H04W8/18;G06Q2220/00;H04L41/342;H04W88/02;H04L2209/80;H04L43/20;H04L41/122;H04W60/04;H04L41/5009"},"Inventor":{"kind":"string","value":"Suthar; Om Prakash et al."},"Assignee":{"kind":"string","value":"CISCO TECHNOLOGY, INC."},"Application Number":{"kind":"string","value":"16/171190"},"Filing Date":{"kind":"string","value":"2018-10-25"},"Primary Examiner":{"kind":"string","value":"Zaidi; Syed A"},"Assistant Examiner":{"kind":"string","value":""},"OR":{"kind":"string","value":"1/1"},"XREF":{"kind":"string","value":""},"Applicant Name":{"kind":"string","value":"Cisco Technology, Inc."},"Notes":{"kind":"string","value":""},"Notes/Tagged":{"kind":"string","value":""},"Relevancy":{"kind":"string","value":"15.153524"},"Database":{"kind":"string","value":"USPAT"},"total_tokens":{"kind":"string","value":"30913.0"}}},{"rowIdx":97,"cells":{"text":{"kind":"string","value":"United States Patent\n10299412\nKind Code\nB1\nDate of Patent\nMay 21, 2019\nInventor(s)\nPapen; Jeffrey et al.\n\n## System and method for cooling computing devices within a facility\n\n### Abstract\n\nA system for cooling computing devices within a facility includes an air inlet that delivers cool air to a supply air space within the facility, an exhaust air damper that is configured to exhaust heated air from an exhaust air space within the facility, and computing devices that are arranged within the facility to at least partially partition the supply air space from the exhaust air space. The system also includes an air filter that is configured to filter the cool air and a mixing damper that is positioned within the interior space of the facility and that is operable to control an amount of exhaust air that is mixed with the cool air. The cool air and/or a portion of the exhaust air are used to cool the computing devices and airflow through the system is substantially driven by fans of the computing devices.\n\nInventors:\n\n**Papen; Jeffrey** (Wilsonville, OR), **Renner; Matthew** (San Francisco, CA), **Sykora; Montgomery** (Denver, CO), **Adams; Weston** (Logandale, NV)\n\nApplicant:\n\n**Core Scientific, Inc.** (Bellevue, WA)\n\nFamily ID:\n\n66541033\n\nAssignee:\n\n**Core Scientific, Inc.** (Bellevue, WA)\n\nAppl. No.:\n\n16/053648\n\nFiled:\n\nAugust 02, 2018\n\n### Publication Classification\n\nInt. Cl.:\n\n**H05K7/20** (20060101); **H05K7/14** (20060101)\n\nU.S. Cl.:\n\nCPC\n\n**H05K7/20745** (20130101); **H05K7/1497** (20130101); **H05K7/20727** (20130101);\n\n### Field of Classification Search\n\nCPC:\n\nH05K (7/20745)\n\nUSPC:\n\n361/679.49\n\n### References Cited\n\n#### U.S. PATENT DOCUMENTS\n\nPatent No.\nIssued Date\nPatentee Name\nU.S. Cl.\nCPC\n4872504\n12/1988\nHuebner\n165/54\nB29C 65/02\n8223495\n12/2011\nCarlson et al.\nN/A\nN/A\n8659895\n12/2013\nCarlson et al.\nN/A\nN/A\n8857204\n12/2013\nReytblat\nN/A\nN/A\n9313929\n12/2015\nMalone et al.\nN/A\nN/A\n9554491\n12/2016\nWong et al.\nN/A\nN/A\n9629285\n12/2016\nLachapelle et al.\nN/A\nN/A\n9674988\n12/2016\nDernis\nN/A\nF24F 11/0001\n9677777\n12/2016\nKaramanos et al.\nN/A\nN/A\n2008/0055848\n12/2007\nHamburgen et al.\nN/A\nN/A\n2009/0310300\n12/2008\nChrysler\nN/A\nN/A\n2010/0188810\n12/2009\nAnderson et al.\nN/A\nN/A\n2012/0024502\n12/2011\nKhalifa et al.\nN/A\nN/A\n2013/0062047\n12/2012\nVaney\n165/287\nH05K 7/20836\n2014/0133092\n12/2013\nLeckelt et al.\nN/A\nN/A\n2015/0327408\n12/2014\nRuiz et al.\nN/A\nN/A\n2017/0196125\n12/2016\nCrosby, Jr. et al.\nN/A\nN/A\n2017/0269648\n12/2016\nRuiz et al.\nN/A\nN/A\n\n*Primary Examiner:* Patel; Mukundbhai G\n\n*Attorney, Agent or Firm:* Davis Wright Tremaine, LLP\n\n### Background/Summary\n\nBACKGROUND\n\n### Description\n\nBRIEF DESCRIPTION OF THE DRAWINGS\n(1) The present technology is described in conjunction with the appended figures:\n(2) FIG. 1 illustrates an embodiment of a system that is designed to cool computing devices within a facility.\n(3) FIGS. 2-3 illustrate an embodiment of a section of the facility of FIG. 1.\n(4) FIG. 4 illustrates an embodiment of airflow through the section of FIGS. 2-3 in which exhaust air is not recirculated within the section.\n(5) FIG. 5 illustrates an embodiment of airflow through the section of FIGS. 2-3 in which exhaust air is recirculated within the section.\n(6) FIG. 6 illustrates another embodiment of a section of the facility of FIG. 1.\n(7) FIG. 7 illustrates a method of cooling computing devices within a facility.\n(8) In the appended figures, similar components and/or features may have the same numerical reference label. Further, various components of the same type may be distinguished by following the reference label by a letter that distinguishes among the similar components and/or features. If only the first numerical reference label is used in the specification, the description is applicable to any one of the similar components and/or features having the same first numerical reference label irrespective of the letter suffix.\nDETAILED DESCRIPTION\n(9) The ensuing description provides exemplary embodiments only, and is not intended to limit the scope, applicability or configuration of the disclosure. Rather, the ensuing description of the exemplary embodiments will provide those skilled in the art with an enabling description for implementing one or more exemplary embodiments. It being understood that various changes may be made in the function and arrangement of elements without departing from the spirit and scope of the invention as set forth in the appended claims.\n(10) The embodiments described herein relate to a system and method for cooling computing devices within a facility. In particular, the system is designed to cool computing devices that are involved in processes related to blockchain technology, such as “mining” or participating in proof-of-work processes that are known in the blockchain art. The system and method may be particularly useful in cooling computing systems that are participating in cryptocurrency mining.\n(11) The term computing device as used herein is meant to cover any device that performs computing operations and may include personal computers, servers, host devices, central processing unit (CPU) devices, graphics processing unit (GPU) devices, field programmable gate array (FPGA) devices, application-specific integrated circuit (ASIC) devices, a dedicated mining device, any combination of said devices, and the like.\n(12) The systems and method described herein use outside ambient air to cool the computing systems. Unlike traditional systems, the cooling system is not designed to cool the outside air with conventional heating, ventilation, and air conditioning (HVAC) components, such as a compressor, an evaporator coil, a condensing coil, an expansion valve, a cooling room air conditioner (CRAC), a chiller, a cooling tower, direct expansion refrigeration, etc. Rather, 100% of the air that is used in the system is provided from the external environment. The air that is heated by the computing devices may be recirculated and combined with the cool air when the cool air is too cold or when the humidity in the cool air is too high. But the air that is used in the system is not cooled by conventional HVAC systems. As used herein, the term “cool air” refers to air that is supplied from the environment surrounding the facility. The outside air that flows into the facility may be termed “cool air” to differentiate the outside air that enters the facility from the air that remains outside the facility. The cool air is ambient air in the environment and thus, the cool air is the same temperature as the air surrounding the cooling system facility. The temperature of the cool air is lower than the temperature of the computing systems, but may vary drastically depending on the season, weather conditions, and/or other environmental conditions. For example, the temperature of the cool air may vary between 0 and 95 degrees Fahrenheit or more.\n(13) In addition, the system typically does not include a dedicated fan, dedicated fans, or a dedicated blowing mechanism that is designed to push air through the system. Rather, the airflow through the system is generated by one or more fans of the computing devices, and typically some combination of computing device fans. The cooling effect of the system is achieved through a combination of the facility design and the combined effect of the computing device fans. Stated differently, the fans of the computing devices (e.g., servers, CPUs, GPUs, etc.) push the air through the system. In such instances, the system does not include any other fans or air moving devices other than the fans of the computing devices. As such, the system is a completely passive system in that the fans of the computing device drive airflow through the system and in that the cooling is achieved via convective cooling from the cool air, which in some instances is recirculated in the system after cooling the computing devices. In other embodiments, the system may include one or more dedicated fans that aid the computing device fans in pushing the air through the system.\n(14) Since the airflow through the system is dependent entirely, or essentially entirely, on the computing device fans, the system is designed to minimize pressure losses or pressure drops as the air flows through the system. This is achieved, in part, by maximizing the inflow of air from the environment, and/or the air that is recirculated in the system, and by employing low pressure drop filters, large cross-sectional areas within the facility, and other components. In this manner, the computing device fans do not experience undue stress in pushing the air through the system. The system is also designed to minimize or prevent the formation of vortices, unless explicitly required to counteract airflow stratification, in order to increase and maintain the flow of air through the system.\n(15) As briefly mentioned above, the system is further designed so that the heated air may be recirculated within the system and combined with fresh outside air from the external environment. The heated air may be combined with the fresh outside air to treat the fresh outside air to a specific target temperature and/or environmental humidity condition by raising the temperature of the fresh outside air. The system is automated to open one or more dampers, or airflow valves, when the system determines that the temperature of the outside air is too low or that the relative humidity of the outside air is too high. The recirculated air is mixed with the outside air in a mixing chamber. Mixing of the heated air and outside cool air is maximized in a passive manner via the use of one or more turbulators or elongate members, which is a component that is designed to increase turbulent flow of air within the mixing chamber and prevent temperature based airflow stratification. The turbulators may be projections, arms, or other members, that project or extended into the mixing chamber. The surface of the turbulators may be designed to induce turbulent airflow.\n(16) Having described several features of the system and method generally, additional aspects and features will be readily apparent in view of the description of the various drawings provided herein below.\n(17) Referring now to FIG. 1, illustrated is an embodiment of a system that is designed to cool computing devices within a facility **100**. The facility **100** includes a plurality of exterior walls **102** that define the exterior surface of the structure. The facility **100** includes one or more sections **110**, and commonly a plurality of sections **110**, in which each section **110** is partitioned or divided from an adjacent section **110** and in which each section **110** is designed to cool computing devices within the respective section. FIGS. 2-6 illustrate the sections in greater detail, but as illustrated in FIG. 1, each section **110** typically includes a first air inlet **212**, a second air inlet **214**, and an air outlet or exhaust **220**. The system is essentially modular and the facility **100** may have a length L that is as short as a single section (e.g., 10-12 feet) or that is as long as desired, such as 300 feet or more. The sections **110** in the facility **100** commonly have identical configurations, however, one or more sections **110** within the facility **100** may differ from another section as desired. For example, a facility **100** may include one or more sections having the configuration illustrated in FIG. 2 and may also include one or more sections having the configuration illustrated in FIG. 6.\n(18) As illustrated in FIG. 2, each section **110** has a symmetric design so that the first air inlet **212**, second air inlet **214**, exhaust **220**, computing devices **240**, etc. are essentially mirrored about a midpoint of the facility **100**. The facility **100** has a width W that may be selected as desired or needed, and which is commonly between 30 and 60 feet, and more commonly between 40 and 50 feet. The facility **100** likewise has a height H that may be selected as desired or needed, and that is commonly between 40 and 50 feet so that the facility **100** is essentially a four story building. In such instances, two of the stories may include the computing devices, a third story may be a space for recirculated exhaust air, and a fourth story may be, or include, the exhaust air outlet **220**. It should be realized that the configuration of the facility **100** may be varied depending on need or other conditions.\n(19) The facility **100** is oriented in relation to the environment so that the exhaust air is blown away from the facility **100**. Specifically, the facility **100** is oriented so that the common prevailing winds are directed to flow along a longitudinal side, or along both longitudinal sides, of the facility **100**. This orientation ensures that most or all of the exhaust air does not mix with the ambient or fresh outside air in the environment. Since the exhaust air does not mix with the ambient fresh outside air, the exhaust air is not unintentionally recirculated into the facility **100** via the air inlet **212**, which unintentional mixing may raise the temperature of the fresh outside air to an undesirable level, such as above 90 to 100 degrees or more. Positioning of the exhaust outlet **220** at or near the top of the facility **100** aids in ensuring that the exhausted air does not unintentionally mix with the fresh outside air.\n(20) The facility **100** is similarly oriented so that the exhaust is blown away from other adjacent facilities (not shown) so as to avoid unintentional mixing of the exhaust air with the fresh outside air that is adjacent to an neighboring facility. In some instances, it may be desirable to ensure that the facility **100** is located in an area that commonly experiences a modest wind, such as between 2-10 miles per hour (mph) or between 4-6 mph. The modest wind may ensure that the exhaust air is blown away from the facility **100** without being overly disruptive to the circulation of air within the facility **100**. In selecting a location for the facility **100**, and/or an orientation of the facility **100** within a given location, historical weather data may be analyzed to determine common weather conditions (e.g., wind direction, wind speed, high and low temperatures, humidity levels, etc.) within the location to ensure that the location is proper for the passive cooling that the system employs. If the common temperature is too hot, too humid, too windy, and the like, the location may not be suitable for the passive cooling system described herein.\n(21) The system may be designed to accommodate local isolated changes in weather. For example, if the local wind is flowing in a more perpendicular direction relative to the longitudinal sides of the facility **100**, one or more vents or louvers on the first air inlet **212** and/or second air inlet **214** on the upwind side of the facility **100** may be closed to reduce air pressure on the upwind side of the facility and/or to reduce air swirling or air vortices within the facility **100**. The closing of the vents or louvers may also be used to prevent a vacuum from being created on an opposite side of the facility **100**. In some instances, baffling may be used with the vents or louvers, or in place of the vents or louvers, to counteract prevailing winds.\n(22) Referring now to FIGS. 2 and 3, illustrated is an embodiment of a section **110** of the facility **100**. The section **110** may be any width, but is more commonly between 10-12 feet wide. As briefly described, the facility **100** may include one or more of the sections **110**, of which the section **110** of FIGS. 2 and 3 is a representative example. FIG. 2 is a cross sectional view of the facility **100** and illustrates an entire section **110** while FIG. 3 is perspective view of half of the section **110**. FIGS. 2 and 3 also illustrate the interior space of the facility **100** and the various components that are positioned within the interior space. In particular, the section **110** includes a supply air space, or cool air aisle, that is defined as the space between the first air inlet **212**, the second air inlet **214**, and the computing devices **240**. The supply air space, or cool air aisle, includes a mixing chamber **216** and a computing space **256**. The computing space **256** is partitioned or divided from the mixing chamber **216** by an interior wall **228** and filter structure **222**. The supply air space, or cool air aisle, includes cool air T.sub.C that is supplied to the computing devices **240** to cool the computing devices **240** during operation of the devices. The cool air T.sub.C is typically outside air that is supplied through the first or second air inlets, **212** and **214**, which may or may not be mixed with exhaust air as described herein.\n(23) The section **110** also includes an exhaust air space, or hot air aisle, that is defined as the space between the computing devices **240**, a mixing damper **232**, and the exhaust air outlet **220**. The exhaust air space, or hot air aisle, includes a main exhaust air space **254**, a recirculated hot air space **258** (hereinafter recirculated air space **258**), and a vent air space **252**. The exhaust air space, and in particular the main exhaust air space **254** and the vent air space **252**, are configured to exhaust heated air T.sub.H from the computing devices **240** to the external environment via exhaust outlet **220**. The recirculated air space **258** is typically positioned above the computing space **256** and is partitioned or divided from the computing space **256** via a floor **236**. The floor **236** is a solid floor material that is impermeable to air in order to ensure that the cool air T.sub.C does not flow into the recirculated air space **258**.\n(24) The recirculated air space **258** is also divided from the mixing chamber **216** via a mixing damper **232** that is positioned on an exterior end of the recirculated air space **258**. In some embodiments, a wall or other partition may extend vertically upward from the mixing damper **232** to divide the recirculated air space **258** from the mixing chamber **216**. As described in greater detail herein, the mixing damper **232** may be opened to allow exhaust air T.sub.H to flow into the mixing chamber **216** for mixing with the cool air T.sub.C, or the mixing damper **232** may be closed to prevent the heated air T.sub.H from flowing into the mixing chamber **216**. In this manner, the mixing damper **232** is operable to control an amount of exhaust air T.sub.H that is supplied from the main exhaust air space **254** to the supply air space for mixing with the cool air T.sub.C supplied through the first air inlet **212**. The mixing damper **232** may have various dimensions, but is commonly between 3 and 8 feet high and 4-12 feet wide. In a specific embodiment, the mixing damper **232** is approximately 4 feet high and 8 feet wide.\n(25) The vent air space **252** may be divided from the main exhaust air space **254** via a damper or vent **250**, which may be opened to allow the heated air T.sub.H to vent to the external environment or that may be partially or fully closed to force heated air T.sub.H into the recirculated air space **258** for mixing with the cool air T.sub.C. The damper **250** and/or exhaust outlet **220** may be similarly sized to the mixing damper **232**, although the damper **250** is typically larger than the exhaust outlets **220** due to the damper **250** typically venting considerably more air than either exhaust outlet **220**. In some embodiments the damper **250** may not be included in the section **110**. Rather, the section **110** may only include the exhaust outlet **220**. In other embodiments, the section **110** may not include the exhaust outlet **220** and instead may only include the damper **250**, which may be used to control and regulate exhausting of the heated air T.sub.H and/or recirculation of the heated air T.sub.H within the section **110**. When the section **110** includes both the damper **250** and the exhaust outlet **220**, louvers or other airflow control are typically only included in the damper **250** and the exhaust outlet **220** is open. The vent air space **252** typically has a width that corresponds to the width of the main exhaust air space **254** or is slightly larger than the main exhaust air space **254**. In a specific embodiment, the vent air space **252** has a width of approximately 13 feet. The vent air space **252** may be designed to vent a considerable amount of air, such as between 40,000 and 60,000 cubic feet per minute (CFM) of exhaust air T.sub.H. Accordingly, the height and width of the vent air space **252** and the size of the damper **250** and/or exhaust outlets **220** are typically selected to vent this volume of air, although the exact dimensions may be selected to vent less air as required by the design and intended use of the section **110**. The pitch of the roof above the vent air space **252**, and/or in other portions of the section **110**, may be 5/12 pitch.\n(26) A space **230** between the recirculated air space **258** and the main exhaust air space **254** is open so that the recirculated air space **258** is in fluid communication with the main exhaust air space **254**. The open space **230** ensures that the heated air T.sub.H is able to flow from the main exhaust air space **254** to the recirculated air space **258** and to the mixing damper **232**. A vertically oriented parapet or partition **234** extends upward from the floor **236** of the recirculated air space **258** to partially divide or partition the recirculated air space **258** from the main exhaust air space **254**. The partition **234** aids in guiding the heated air T.sub.H in a vertical direction and minimizes the formation or vortices that may otherwise occur in the recirculated air space **258** and in which the heated air T.sub.H may continuously circulate. The partition **234** may extend upward from the floor **236** between 1 and 6 feet, and more commonly between 2 and 4 feet.\n(27) The computing devices **240** partition the computing space **256** from the main exhaust air space **254**. The computing devices **240** form a wall between the computing space **256** and the main exhaust air space **254**, or are positioned or housed on a wall between the computing space **256** and the main exhaust air space **254**. A distance between opposing walls of the computing devices **240** may be between 5 and 20 feet, but is more commonly between 10 and 14 feet. In a specific embodiment, the distance between opposing walls of the computing devices **240** is approximately 12 feet. The main exhaust air space **254** may similarly be between 5 and 20 feet, and more commonly between 10 and 14 feet. In a specific embodiment, the main exhaust air space may be approximately 12 feet. The main exhaust air space **254** is also typically between 15 and 50 feet tall, and more commonly between 20 and 40 feet tall.\n(28) At least some of the computing devices **240** include a fan that is capable of moving the cool air T.sub.C across one or more heat generating components of the computing devices **240** to cool the heat generating components. In some embodiments, most of the computing devices **240**, or all of the computing devices **240**, include a fan that moves the cool air T.sub.C across the heat generating component(s). Each of the fans is oriented so that the air flows from the computing space **256** to the main exhaust air space **254**. The computing devices **240** are oriented or arranged relative to one another, and/or in relation to the wall that partitions the computing space **256** from the main exhaust air space **254**, so that the air is able to flow from the computing space **256** into the main exhaust air space **254**, but is prevented from flowing from the main exhaust air space **254** into the computing space **256**. Stated differently, the computing devices **240**, and/or wall, partition the computing space **256** from the main exhaust air space in a relatively air tight manner so that a flow of air from the main exhaust air space **256** to the computing space **254** is negligible. In this manner, the cool air T.sub.C is forced across the heat generating component(s) of the computing devices **240** and is heated by the heat generating component(s). The heated air T.sub.H flows into the main exhaust air space **254** and is exhausted from the section **110** or is recirculated within the section **110** as described herein.\n(29) The dimensions of the computing space **256** may be varied as desired. For example, in some embodiments the computing space **256** may be a single floor or story of the section **110**, while in other embodiments, the computing space **256** may be multiple floors or stories of the section **110**. In FIGS. 2 and 3 the computing space **256** is two floors or stories of the facility **100** and is roughly 10-12 feet wide and 15-22 feet high. The computing devices **240** may be arranged in any manner within the computing space **256**, but are more commonly arranged in rows and columns. The computing space **256** may include essentially any number of computing devices, such as between 50 and 200 devices, although between 120 and 180 computing devices is more common. In the illustrated embodiment, each row includes roughly 12 computing devices and the computing space **256** includes approximately roughly 14 rows. This arrangement results in roughly between 150 and 170 computing devices, although this arrangement is for illustrative purposes only and is not meant to be limiting in any manner. As a person of skill will readily recognize, more or fewer computing devices may be employed as desired and the arrangement and number is dependent in part on the size of the computing devices.\n(30) As briefly mentioned above, airflow through the section **110** is substantially driven by the combined airflow of a plurality of the computing device fans. More commonly, the airflow is driven entirely by the fans of the computing device so that the section **110** is free of any other air moving device, such as a dedicated fan or blowing mechanism. Stated differently, the computing device fans may be the only devices or mechanisms within the section **110** that move or blow the air through the section **110**. While the fans of each computing device **240** are typically utilized to drive airflow through the section **110**, the system does not require that the fan of each computing device **240** be operated to drive a sufficient airflow through the section **110**. Rather, it should be appreciated that some of the fans may not be operated and/or that some of the computing devices **240** may not include fans or other air moving devices or components at all. All of the computing device fans, or substantially all of the computing device fans, are typically operated to move air through the section **110** since the operation of less than 100% of the fans may create areas where backflow occurs, such as the exhaust air flowing backward into the computing device space. The computing devices **240** may be robust machines that are tolerant to variations in the temperature and thus, changes in airflow due to the amount of fans being used to drive the airflow may not substantially negatively impact the operation of the computing devices **240**.\n(31) The combined effect of the computing device's fans may result in a considerable volume of air being moved through the section **110**. For example, the combined computing device fans may move more than 10,000 CFM of air through the section **110**. The section **110** design that is illustrated in FIGS. 2 and 3 may move between 40,000 and 60,000 CFM of air through the section. In a specific embodiment, the section **110** of FIGS. 2 and 3 may move approximately 54,000 CFM of air with each half of the section **110** moving approximately 27,000 CFM of air. The exhaust outlet **220**, damper **250**, mixing damper **232**, and/or first and second air inlets, **212** and **214**, are sized to accommodate this large volume of air movement. Each of these components may be configured to allow airflow through the respective component at an airspeed of between 300 and 600 feet per minute, and more commonly between 400 and 500 feet per minute.\n(32) As briefly mentioned above, cool air T.sub.C is able to flow into the section **110** via the first air inlet **212** and the second air inlet **214**. The first and second air inlets, **212** and **214**, may have various dimensions, but are commonly between 3-5 feet high and 8-12 feet wide. In a specific embodiment, the first and second air inlets, **212** and **214**, are approximately 4 feet high and 8 feet wide. The second air inlet **214** is positioned vertically below the first air inlet **212**.\n(33) The first air inlet **212** typically does not include a damper or other closable vent and as such, outside air is essentially always able to flow through the first air inlet **212** into the interior of the section **110**. However, the first air inlet **212** typically does include a static louver, mesh screen, or other component that prevent animals or debris from accessing the interior of the section **110**. Unlike the first air inlet **212**, the second air inlet **214** includes a damper or closable vent. The damper is used to open the second air inlet **214** when airflow through the second air inlet **214** is desired and is also used to close the second air inlet **214** when airflow through the intake is not desired. The damper may be partially or fully closed to control the flow of air through the second air inlet **214**. The damper is commonly closed when the mixing damper **232** is opened to combine the heated air T.sub.H with the cool air T.sub.C. The degree of closure of the second air inlet's damper may be correlated with the degree of openness of the mixing damper **232** to achieve a desired mixing ratio of heated air T.sub.H and cool air T.sub.C. In this manner, a finite and constant amount of air may flow into and through the mixing chamber **216**. The opening and closing of the second air inlet's damper is further described in relation to FIGS. 4-5.\n(34) An air filter **222** is positioned between the mixing chamber **216** and the computing space **256**. The air filter **222** is configured to filter the cool air T.sub.C that is supplied through the first and/or second air inlets, **212** and **214**. The air filter **222** is illustrated as being a vertical wall that is coupled with a bottom end of the interior wall **228** and a floor of the facility **100**, but the air filter **222** may be placed essentially anywhere between the mixing chamber **216** and the computing space **256** and/or have any orientation desired. The air filter **222** is commonly 8-12 feet wide and approximately 6-12 feet tall. The width and height of the air filter **222** may be varied depending on a required or desired pressure drop with larger cross sectional areas of the filter **222** resulting in a lower pressure drop. The air filter **222** may be aligned with the second air inlet **214** so that when opened, air is able to flow directly from the second air inlet **214** and through the air filter **222**. Alignment of the air filter **222** and the second air inlet **214** is not required in the section **110**.\n(35) The air filter **222** is commonly an accordion or pleated filter, which maximizes the available surface area for filtering the cool air T.sub.C and minimizes the pressure drop or loss across the air filter **222**. Since the airflow through the systems is dependent mostly or entirely on the combined airflow of the computing device's fans, minimizing the pressure drop across the air filter **222** is more important than in conventional systems that have dedicated high output fans or blower mechanisms. An air filter **222** that is designed to remove debris or particles too small may overly burden the computing device's fans, which may cause the computing devices **240** to prematurely fail. An air filter with a minimum efficiency reporting value (MERV) rating of between 7-8 has been found to provide a sufficient degree of air filtering and an acceptable pressure drop. Accordingly, the air filter **222** commonly has a MERV rating of between 7 and 8. As illustrated in FIGS. 2 and 3, in some embodiments, only a single air filter **222** is employed to filter the cool air T.sub.C. In other embodiments, additional air filters may be employed and positioned within the section **110** to filter the cool air T.sub.C. The use of multiple filters may reduce the MERV rating that is required for a single air filter.\n(36) The mixing shaft or chamber **216** is positioned downstream of the first air inlet **212** and the mixing damper **232**. The mixing chamber **232** is configured to create turbulent airflow as the air flows vertically downward through the mixing chamber **232**. The turbulent airflow promotes and substantially increases mixing of the exhaust air T.sub.H and cool air T.sub.C. Without turbulence in the mixing chamber **216**, the airflow may stratify, resulting in a layer of exhaust air T.sub.H and cool air T.sub.C with little intermixing between the layers due to temperature based airflow stratification. Stratified airflow may result in drastic temperature differences in the air that is supplied to the computing devices **240** to cool the devices, which may lead to overheating or overcooling some devices. To create turbulent airflow within the mixing chamber **212**, the mixing chamber **212** includes a plurality of turbulators or elongate members **218** that project into the mixing chamber **216**. The elongate members **218** may be relatively long and thin components that project or extend into the mixing chamber **216**. In some embodiments, the elongate members **218** may be between 2 and 12 feet long, and more commonly between 4 and 10 feet long. The elongate members **218** may also be between 3 and 12 inches wide and more commonly between 4 and 8 inches. Various other dimensions for the elongate members **218** may also be employed. Each of the elongate members **218** may have a uniform or similar configuration or may have different configurations—either in size and/or orientation within the mixing chamber **216**. Differently sized and/or oriented elongate members **218** within the mixing chamber **216** may increase the turbulence that is created within the mixing chamber **216**.\n(37) In some embodiments, opposing ends of the elongate members **218** may be attached to opposing, or different walls, within the mixing chamber **216**. In such embodiments, a middle portion of the elongate members **218** may project into the interior of the mixing chamber **216**. In other embodiments, a single end of the elongate member **218** may be attached to a wall of the mixing chamber **216**. In such embodiments, the other end of the elongate member **218** may terminate within the mixing chamber **216**. The mixing chamber **216** may include a combination of elongate members **218** that are attached at opposing ends with the walls of the mixing chamber **216** and elongate members **218** that are attached at only one end with a wall of the mixing chamber **216**. Similarly, the elongate members **218** may be diagonally oriented within mixing chamber **216** or may have other orientation, such as substantially horizontal. The orientation of the elongate members **218** within the mixing chamber **216** is typically random to increase the turbulent flow of air through the mixing chamber **216**. As such, some of the elongate members **218** are commonly more horizontally oriented in comparison with other elongate members **218** within the mixing chamber **216**.\n(38) The elongate members **218** are passive devices, which means that they are not electrically or mechanically moved within the mixing chamber **216**. Rather, they are static objects that are strategically positions to force the air to pass and flow around the objects. The flow of air around the objects causes turbulent airflow as opposed to laminar airflow, which substantially increases the mixing of the air—i.e., cool air T.sub.C and exhaust air T.sub.H—within the mixing chamber **216** as the air flows downward and through the mixing chamber **216**. In some embodiments, the exterior surface of the elongate members **218** may be configured to increase the turbulent airflow. For example, the exterior surface may be textured, rough, or otherwise configured to increase skin friction or drag, which may greatly increase the turbulent flow in the mixing chamber **216**. In some embodiments the mixing chamber **216** may be roughly 8 feet wide per unit length, although the size of the mixing chamber **216** may be varied as desired or required. In some embodiments, the right side of chamber **216** may be compartmentalized. The elongate member **218** are further configured so that when the mixing damper **232** is closed and the first and second air inlets, **212** and **214**, are open, the elongate members **218** do not impede the flow of air through the section.\n(39) Referring now to FIG. 6, illustrated is another embodiment of a section **110** that may be employed within a facility **100**. The section **110** is substantially similar to the section **110** illustrated in FIGS. 2 and 3 except that the damper **250** is removed and the section **110** includes two floors of computing devices. Specifically, the section **110** includes a first computing floor **256***a* having a first wall of computing devices **241** and a second computing floor **256***b* having a second wall of computing devices **242**. The first computing floor **256***a* is separated from the second computing floor **256***b* by a floor, which may be made of an air permeable material, such as a mesh type material. As such, the cool air T.sub.C is able to flow between the first computing floor **256***a* and the second computing floor **256***b* relatively unobstructed. Additional air filters, **224** and **226**, may optionally be positioned to filter the cool air T.sub.C that flows into the first computing floor **256***a* and the second computing floor **256***b*. The additional air filters, **224** and **226**, may extend between the floor **236** and the floor of the facility and may be coupled with the floor that separates the first computing floor **256***a* and the second computing floor **256***b*. The additional air filter, **224** and **226**, may also sized and/or configured similar to the air filter **222**—e.g., may have a similar MERV rating.\n(40) In some embodiments, the wall that is formed or defined by the second computing devices **242** (hereinafter second wall) is laterally offset from the wall that is formed or defined by the first computing devices **241** (hereinafter first wall). For example, the second wall may be laterally offset from the first wall by between 6 and 24 inches and more commonly about 18 inches. When a width between the opposing first walls is 12 feet as described above, an offset of 18 inches between the second wall and the first wall would result in a width between the opposing second walls of approximately 15 feet. The offset between the first wall and the second wall may be selected as desired and may be used to accommodate an extra volume of heated air that flows upward toward the exhaust outlet **220** from the second walls. While FIG. 6 only illustrates ½ of the section **110**, it should be appreciated that the other non-illustrated half typically has a mirrored configuration to the illustrated section.\n(41) Referring now to FIG. 4, illustrated is the airflow through the section **110** of FIGS. 2 and 3 in which exhaust air **262** is not recirculated within the section **110**. The airflow that is illustrated in FIG. 4 may correspond to a typically airflow through the section **110** in warmer months in which the outside air is cool enough to cool the computing devices **240**, but not too cold to require mixing of the heated exhaust air **262** and not to humid to require mixing of the heated exhaust air **262**. In the illustration of FIG. 4, the exhaust outlet **220** and/or damper **250** are maintained fully open so that substantially all of the exhaust air **262** is exhausted or vented to the external environment. The exhaust air **262** is illustrated as flowing upward from the computing devices **240** and out of the damper **250** and exhaust outlet **220**. The mixing damper **232** is maintained closed so that substantially none of the exhaust air **262** flows into the mixing chamber **216** as illustrated in FIG. 4.\n(42) The second air inlet **214** is maintained fully open so that the cool outside air **260** (hereinafter cool air **260**) is able flow through both the first air inlet **212** and the second air inlet **214**. Each of the air inlets, **212** and **214**, are sized so that approximately ½ of the air volume flows through each air inlet. The cool air **260** flows through the air inlets and through the filter **222** to the computing devices **240** where the cool air **260** is warmed by the heat generating components. The heated cool air **260** then flows into the main exhaust air space **254** as exhaust air **262**. The airflow through the system is typically driven entirely by the fans of the computing devices **240** as previously described, although in some embodiments one or more dedicated fans or blowing mechanism may aid in moving the air through the system.\n(43) It should be appreciated that FIG. 4 is provided for illustrative purposes and that the second air inlet **214**, the exhaust outlet **220**, and/or the damper **250** may be incrementally or partially closed so that only some fraction of a maximum airflow of cool air **260** is delivered through the second air inlet **214** and so that some fraction of a maximum airflow of exhaust air **262** is vented from the facility. The mixing damper **232** may likewise be incrementally or partially opened so that some fraction of a maximum airflow of exhaust air **262** is delivered through the mixing damper **232** to the mixing chamber **216** for mixing with the cool air **260** that flows through the first air inlet **212**.\n(44) The dimensions of the section **110** are typically dependent on the desired or required airflow through the system. For example, the size of the main exhaust air space **254**, the size of the air filter **222**, and the size of the air inlets, dampers, and outlets are all dependent on the airflow that is expected within the section **110**. For example, as described above, the section **110** may be configured to accommodate an airflow of approximately 54,000 CFM, or 27,000 CFM for ½ of the section **110**. Given this airflow, the exhaust outlet **220** should be capable of venting or exhausting all of the airflow (e.g., 27,000 CFM at around 500 feet per minute) since in some embodiments all of the exhausted air will be vented from the facility **100**. The exhaust outlet **220** may be roughly 8 feet wide and 7 feet tall to exhaust this volume of air at the desired air speed.\n(45) The first air inlet **212** is typically sized smaller than the exhaust outlet **220** since the volume of air that flows through the first air inlet **212** is typically less than the volume of air that flows through the exhaust outlet **220** due to the use of the second air inlet **214** and/or the mixing damper **232**. The first air inlet **212** is commonly an open penetration with a mesh guard and no movable louvers. The first air inlet **212** typically remains open regardless of the external weather conditions, although preparations may exist to close the first air inlet **212** when necessary. The second air inlet **214** is also typically sized smaller than the exhaust outlet **220** since the volume of air that flows through the second air inlet **214** is less than the volume of air that flows through the exhaust outlet **220** due to the use of the first air inlet **212**. A cross-sectional area of the exhaust outlet **220** will typically be equal to or larger than a combined cross-sectional area of the first and second air inlets, **212** and **214**, or a combined cross-sectional area of the first air inlet **212** and the mixing damper **232** since the volume of air entering and exiting the section **110** must be equal. A cross-sectional area of the first air inlet **212**, the second air inlet **214**, and the mixing damper **232** is roughly equal since roughly half of the air entering the section **110** is provided by the first air inlet **212** and the other half of the air entering the section **110** is provided by the second air inlet **214**, the mixing damper **232**, or a combination of the second air inlet **214** and mixing damper **232**. A cross-sectional area of the damper **250** is twice the size of the cross-sectional area of the exhaust outlet **220** or larger since the damper **250** is used to vent exhaust air from both sides of the section and to vent exhaust air to a pair of exhaust outlets **220**—i.e., the damper **250** accommodates both sides of the section **110**. The second air inlet **214** includes louvers, closable vents, or other components that allow the second air inlet **214** to be partially or fully closed to impede or prevent airflow through the second air inlet **214**. The louvers may be electronically controlled variable frequency drive components.\n(46) The first and second air inlets, **212** and **214**, may each be sized so that approximately 50% of the maximum air flow of the exhaust outlet **220** (e.g., 27,000 CFM) is deliverable through each air inlet. Using the example above, approximately 13,500 CFM of airflow may be delivered through the first air inlet **212** and an additionally 13,500 CFM may be delivered through the second air inlet **214**. The airflow may be provided at a max air speed of around 421 feet per minute, which is roughly approximate to the max air speed through the exhaust outlet **220**. The first and second air inlets, **212** and **214**, may be roughly 8 feet wide and 4 feet tall to deliver this desired air flow.\n(47) As briefly described above, the mixing damper **232** may be opened and the second air inlet **214** may be closed to force some of the exhaust air **262** to flow through the mixing damper **232** and into the mixing chamber **216**, where it is mixed with the cool air **260**. The mixing damper **232** and the second air inlet **214** may be paired so that the degree of closure of the second air inlet's damper may be correlated with the degree of openness of the mixing damper **232**. The pairing of the mixing damper **232** and second air inlet **214** allows a desired mixing ratio of cool air **260** and exhaust air **262** to be achieved. In some embodiments, the mixing damper **232** and the second air inlet **214** are paired in a 1 to 1 ratio so that openness of one component directly corresponds to the closure of the other component. For example, when the mixing damper **232** is 25% open, the second air inlet **214** may be 25% closed and when the mixing damper **232** is 75% open, the second air inlet **214** may be 75% closed. The amount of openness of one component and the amount of closure of the other component may vary by any amount between 0% and 100%. As such, some amount or volume of air may simultaneously flow through the first air inlet **212**, the second air inlet **214**, and the mixing damper **232**.\n(48) The damper **250** or exhaust outlet **220** may also be partially closed to increase air pressure within the main exhaust air space **254** and within the recirculated air space **258** and thereby force the exhaust air **262** through the mixing damper **232**. In some embodiments, the degree of closure of the damper **250** or exhaust outlet **220** may be correlated with the degree of openness of the mixing damper **232** and the degree of closure of the second air inlet **214**. The damper **250** is typically employed to regulate the airflow through the mixing damper **232**. In a specific embodiment, the degree of closure of the damper **250** may be correlated with the degree of openness of the mixing damper **232** so that the damper **250** closes roughly ½ of the amount that the mixing damper **232** opens. This degree of closure of the damper **250** may create the necessary back pressure to develop within the recirculated air space **258** to force the exhaust air **262** to flow through the mixing damper **232** and into the mixing chamber **216**. As previously described, the second inlet **214** may also close by the same amount that the mixing damper **232** opens, which likewise aids in forcing the exhaust air **262** to flow through the mixing damper **232** and into the mixing chamber **216**. In some embodiments, the exhaust outlet **220** may be partially or fully closed without opening the mixing damper **232** in order to increase an internal temperature within the section **110** and facility **100**.\n(49) The mixing damper **232** may be opened to recirculate the exhaust air **262** within the system in order to increase the temperature of the cool air **260**, such as during the winter months, or to reduce a humidity in the cool air **260**, such as during humid conditions in the warmer months. The mixing damper **232**, second air inlet **214**, and exhaust damper **220** are typically controlled via a control system (not shown) of the facility **100**. The control system includes a processor, memory, and one or more sensors that are configured to sense conditions within the facility **100** and/or external to the facility **100**, such as the cool air temperature, the external humidity levels (relative and/or absolute humidity), the internal air temperature, the internal humidity levels (relative and/or absolute humidity), the airflow through the facility, the exhaust gas air temperature, the pressure differential within the system and/or across one or more components, and the like. The sensors communicate this information to the processor and the processor analyzes the information and responds accordingly by opening or closing the various dampers, vents, outlets, and intakes. For example, when the processor determines that the cool air **260** is too cold, the processor responds by sending appropriate instructions to open the mixing damper **232** and simultaneously close the second air inlet **214** and/or exhaust outlet **220**. A similar process may occur when the processor determines that the relative humidity in the air is too high. Conversely, when the processor determines that the internal air is too hot and/or the cool air is cool, but not too cold, the processor responds by sending appropriate instructions to close the mixing damper **232** and open the second air inlet **214** and/or exhaust outlet **220**. In this manner, the control system is able to modulate the conditions within the facility via information about the cool air and weather conditions and/or via information about the conditions within the facility **100**. The control system, including the processor and memory, may be an onsite system that is housed within or near the facility **100** or may be a remote system, such as a cloud computing based system. The control system may monitor one or more facilities and one or more sections within each facility and modulate the conditions within each section and within each facility as needed.\n(50) In regards to the mixing damper **232**, the mixing damper typically includes electronically controlled louvers that have a variable frequency drive capability. The mixing damper **232** may be sized to vent roughly 60% of the maximum air flow of the exhaust outlet **220** (e.g., 27,000 CFM). The airflow through the mixing damper **232** may be provided at a max air speed of around 500 feet per minute, which is roughly approximate to the max air speed through the exhaust outlet **220**. Using the example above of an airflow of 27,000 CFM through the exhaust outlet **220**, the mixing damper **232** may be configured to vent approximately 16,200 CFM of air. The mixing damper **232** may be roughly 8 feet wide and 4 feet tall to deliver this desired air flow.\n(51) As briefly described above, the mixing damper **232** may be opened to increase the temperature of the cool air **260** and/or to reduce a relative humidity of the cool air **260**. For example, if the outside air temperature is 40 degrees Fahrenheit, the mixing damper **232** may be opened to allow the exhaust air **262** to flow into the mixing chamber **216** and mix with the cool air **260**. Regardless of the temperature of the exhaust air **262**, the system may expose the cool air **260** to the exhaust air **262** via the mixing damper **216** to achieve a desired treated air condition, such as a temperature that is effective to cool the computing devices to between 60 and 90 degrees Fahrenheit in accordance with ASHRAE TC9.9 environmental standards. The mixing damper **232** may be incrementally closed and/or the second air inlet **214** may be incrementally opened as the outside air temperature nears an ideal cooling temperature, such as a temperature that is effective to cool the computing devices to between 60 and 90 degrees Fahrenheit in accordance with ASHRAE TC9.9. When the outside air temperature reaches the ideal cooling temperature, the mixing damper **232** may be fully closed so that the system is cooled entirely by the outside air. Similarly, as the outside air temperature drops below the ideal cooling temperature, the mixing damper **232** may be incrementally opened and/or the second air inlet **214** may be incrementally closed until the mixing damper is fully opened and/or the second air inlet is fully closed. The relatively humidity in the air may likewise be reduced via the introduction of the exhaust air **262** to the cool air **260**. In this manner the humidity of the cool air **260** may be modulated to a level that is in accordance with ASHRAE TC9.9 environmental standards.\n(52) Referring now to FIG. 5, illustrated is the airflow through the section **110** of FIGS. 2 and 3 in which the exhaust air **262** is recirculated within the section **110**. The airflow that is illustrated in FIG. 4 may correspond to a typically airflow in the cooler or cold months in which the cool air **260** is too cold to adequately cool the computing devices **240**, or in which the cool air **260** is below an ideal cooling temperature. The relative humidity of the cool air **260** is typically not a concern during this time period since the cool air **260** will be warmed by the exhaust air **262**. In the illustration of FIG. 5, the exhaust outlet **220** and/or damper **250** are fully closed so that substantially all of the exhaust air **262** flows into the recirculated air space **258** and through the mixing damper, which is illustrated as being fully opened. The exhaust air **262** is illustrated as flowing upward and into the recirculated air space **258** and through the mixing damper **232** into the mixing chamber **216**.\n(53) The second air inlet **214** is fully closed so that substantially none of the cool air **260** is able flow through the second air inlet **214** and instead is forced to flow through the first air inlet **212**. The cool air **260** is forced to flow through the first air inlet **212** so that the cool air **260** and the exhaust air **262** are subjected to the mixing chamber **216** and the elongate members **218**, which mixes the cool air **260** and the exhaust air **262** via the passive creation of turbulent flow. If the second air inlet **214** were opened, a substantial portion or volume of the cool air **260** would flow through the second air inlet and may not properly mix with the exhaust air **262**. The mixed cool air **260** and exhaust air **262** (hereinafter heated air **264**) flows through the air filter **222** to the computing devices **240** where the heated air **264** cools the heat generating components as the heated air **264** flows through the computing devices **240** and into the main exhaust air space **254**. The heated air **264** is further heated by the heat generating components and enters the main exhaust air space **254** as exhaust air **262**. The airflow through the system is typically driven entirely by the fans of the computing devices **240** as previously described, although in some embodiments one or more dedicated fans or blowing mechanisms may aid in moving the air through the system.\n(54) As previously described, it should be appreciated that FIG. 5 is provided for illustrative purposes and that the second air inlet **214**, the exhaust outlet **220**, and/or the damper **250** may be incrementally or partially opened so that some fraction of a maximum airflow of cool air **260** is delivered through the second air inlet **214** and so that some fraction of a maximum airflow of exhaust air **262** is vented from the facility. The mixing damper **232** may likewise be incrementally or partially closed so that some fraction of a maximum airflow of exhaust air **262** is delivered through the mixing damper **232** to the mixing chamber **216** for mixing with the cool air **260** that flows through the first air inlet **212**. Thus, the flow of cool air **260**, exhaust air **262**, and heated air **264** through the system may include any incremental airflow percentage or volume between the illustrations of FIG. 4 and FIG. 5 as a person of skill in the art will readily understand.\n(55) Referring now to FIG. 7, illustrated is a method **300** of cooling computing devices within a facility. As described herein, the facility has an interior space that includes a supply air space and an exhaust air space. At block **310**, outside air flows from an external environment, through an air inlet of an exterior wall of the facility, and to the supply air space within the facility. At block **320**, the outside air flows through an air filter assembly within the facility to filter the outside air and thereby remove unwanted particles and debris from the outside air. At block **330**, the filtered outside air flows through a plurality of computing devices in order to cool one or more heat generating component of the computing devices. The computing devices are arranged within the interior space of the facility so that the computing devices partition at least a portion of the supply air space from the exhaust air space. In some embodiments, most or all of the computing devices include a fan that is capable of moving the filtered outside air across the one or more heat generating components to cool the heat generating components and heat the filtered outside air. The heated air flows into the exhaust air space from the computing devices. At block **340**, the heated air flows through an exhaust air damper to exhaust the heated air from the exhaust air space to the external environment. The airflow of the outside air and the heated air is substantially driven by the combined airflow of a plurality of the fans of the computing devices as described herein.\n(56) At block **350**, at least a portion of the heated air flows through a mixing damper that is positioned within the interior space of the facility between the supply air space and the exhaust air space. The heated air flows through the mixing damper to enable mixing of the heated air and the outside air supplied through the air inlet. As described herein, block **350** is an optional step that may be used to increase the temperature of the outside air and/or reduce the relative humidity of the outside air. The interior space of the facility may include a hot air space, or recirculated air space, that is positioned vertically above the computing devices. The hot air space may be in fluid communication with the exhaust air space so that heated air is flowable from the exhaust air space into the hot air space. The mixing damper may be positioned on an exterior end of the hot air space. In such embodiments, the method **300** may also include closing the exhaust air damper and opening the mixing damper to control an amount of heated air that flows through the mixing damper and mixes with the outside air. The facility may include two air inlets that are each configured to supply outside air to the supply air space from the external environment. A second air inlet may be positioned vertically below a first air inlet. In such embodiments, the method **300** may further include closing a damper of the second air inlet to increase an amount of outside air that flows through the first air inlet and mixes with the heated air that flows through the mixing damper.\n(57) At block **360**, the outside air and the heated air flow through a mixing shaft or chamber to create turbulent airflow and thereby promote mixing of the outside air and the heated air. Block **360** is an optional step that is conditioned on the occurrence of block **350**. The mixing shaft may include a plurality of elongate members that project into the mixing shaft to create the turbulent airflow. The mixed outside air and heated air may flow through an air filter that is coupled with a bottom end of the mixing shaft and with a floor of the facility.\n(58) The computing devices may be arranged within the interior space of the facility to form a wall that partitions the supply air space and the exhaust air space. The wall may be two stories tall and/or the facility may include at least two floors of computing devices. As described herein, the facility may include two air inlets that are each configured to supply outside air to the supply air space from the external environment. A second air inlet may be positioned vertically below a first air inlet. In such embodiments, the method **300** may further include flowing outside air through the first air inlet and through the second air inlet into the supply air space. A combined airflow through the first air inlet and through the second air inlet may be approximately equal to the airflow through the exhaust air damper.\n(59) While several embodiments and arrangements of various components are described herein, it should be understood that the various components and/or combination of components described in the various embodiments may be modified, rearranged, changed, adjusted, and the like. For example, the arrangement of components in any of the described embodiments may be adjusted or rearranged and/or the various described components may be employed in any of the embodiments in which they are not currently described or employed. As such, it should be realized that the various embodiments are not limited to the specific arrangement and/or component structures described herein.\n(60) In addition, it is to be understood that any workable combination of the features and elements disclosed herein is also considered to be disclosed. Additionally, any time a feature is not discussed with regard in an embodiment in this disclosure, a person of skill in the art is hereby put on notice that some embodiments of the invention may implicitly and specifically exclude such features, thereby providing support for negative claim limitations.\n(61) Having described several embodiments, it will be recognized by those of skill in the art that various modifications, alternative constructions, and equivalents may be used without departing from the spirit of the invention. Additionally, a number of well-known processes and elements have not been described in order to avoid unnecessarily obscuring the present invention. Accordingly, the above description should not be taken as limiting the scope of the invention.\n(62) Where a range of values is provided, it is understood that each intervening value, to the tenth of the unit of the lower limit unless the context clearly dictates otherwise, between the upper and lower limits of that range is also specifically disclosed. Each smaller range between any stated value or intervening value in a stated range and any other stated or intervening value in that stated range is encompassed. The upper and lower limits of these smaller ranges may independently be included or excluded in the range, and each range where either, neither or both limits are included in the smaller ranges is also encompassed within the invention, subject to any specifically excluded limit in the stated range. Where the stated range includes one or both of the limits, ranges excluding either or both of those included limits are also included.\n(63) As used herein and in the appended claims, the singular forms “a”, “an”, and “the” include plural referents unless the context clearly dictates otherwise. Thus, for example, reference to “a process” includes a plurality of such processes and reference to “the device” includes reference to one or more devices and equivalents thereof known to those skilled in the art, and so forth.\n(64) Also, the words “comprise,” “comprising,” “include,” “including,” and “includes” when used in this specification and in the following claims are intended to specify the presence of stated features, integers, components, or steps, but they do not preclude the presence or addition of one or more other features, integers, components, steps, acts, or groups.\n\n### Claims\n\n1. A system for cooling computing devices within a facility, the facility having an interior space that includes a supply air space and an exhaust air space, the supply air space being configured to supply outside air to the computing devices to cool the computing devices during operation of said computing devices, and the exhaust air space being configured to exhaust heated air from the computing devices to the external environment, the system comprising: a first air inlet that is coupled with an exterior wall of the facility and that is configured to deliver outside air to the supply air space from the external environment; a second air inlet that is coupled with the exterior wall of the facility and that is configured to supply outside air to the supply air space from the external environment; an exhaust air damper that is configured to exhaust the heated air from the exhaust air space to the external environment; a plurality of computing devices that are arranged within the interior space so as to be positioned between the supply air space and the exhaust air space, wherein substantially each of the computing devices include a fan that is capable of moving the outside air across one or more heat generating components of the computing device to cool the heat generating components; an air filter assembly that is positioned between the supply air space and the computing devices, the air filter assembly being configured to filter the outside air that is supplied to the computing devices from the air supply space; a mixing damper that is positioned within the interior space of the facility between the supply air space and the exhaust air space, the mixing damper being operable to control an amount of exhaust air that is supplied from the exhaust air space to the supply air space for mixing with the outside air supplied through the first air inlet; and a mixing shaft that is positioned downstream of the first air inlet and mixing damper so that the outside air and the exhaust air are delivered to the mixing shaft and flow through the mixing shaft, the mixing shaft including a plurality of elongate members that project into the mixing shaft to create turbulent airflow to promote mixing of the outside air and the exhaust air as the outside air and the exhaust air flow through the mixing shaft; wherein airflow through the system is driven entirely by the combined airflow of a plurality of the fans of the computing devices; and wherein the second air inlet is positioned vertically below the first air inlet and includes a damper that is operable to control an amount of outside air that flows through the second air inlet to the supply air space.\n 2. The system of claim 1, wherein at least some of the elongate members of the plurality of elongate members differ in size or differ in orientation within the mixing shaft.\n 3. The system of claim 1, wherein the plurality of computing devices are positioned on a first computing floor and a second computing floor of the facility, and wherein a horizontal air permeable floor separates the first computing floor from the second computing floor.\n 4. The system of claim 1, wherein the air filter assembly includes an air filter that is coupled with a bottom end of the mixing shaft and with a floor of the facility.\n 5. The system of claim 1, wherein the respective fan of each computing device is employed in driving airflow through the system.\n 6. The system of claim 2, wherein the air filter assembly includes an air filter that filters outside air that flows from the supply air space to the computing devices.\n 7. The system of claim 1, wherein the system includes a hot air space positioned vertically above the plurality of computing devices, the hot air space being in fluid communication with the exhaust air space such that heated air is flowable from the exhaust air space to the hot air space, and wherein the mixing damper is positioned on an exterior end of the hot air space.\n 8. The system of claim 7, wherein an interior end of the hot air space includes a vertically oriented partition that extends upward from a floor of the hot air space toward a ceiling of the facility and toward the exhaust air damper.\n 9. The system of claim 1, wherein the plurality of computing devices are arranged within the interior space of the facility about a wall that is two or more stories tall.\n 10. A method of cooling computing devices within a facility having an interior space that includes a supply air space and an exhaust air space, the method comprising: flowing outside air from an external environment through a first air inlet of an exterior wall of the facility to supply the outside air to the supply air space; flowing outside air from the external environment through a second air inlet to supply outside air to the supply air space, the second air inlet being positioned vertically below the first air inlet; flowing the outside air through an air filter assembly to filter the outside air and thereby remove unwanted particles and debris from the outside air; flowing the filtered outside air through a plurality of computing devices that are arranged within an interior space of the facility so that the computing devices are positioned between the supply air space and the exhaust air space, wherein substantially each of the computing devices include a fan that is capable of moving the filtered outside air across one or more heat generating components of the computing device to cool the heat generating components and heat the filtered outside air, wherein the heated air flows into the exhaust air space from the computing devices; flowing a first portion of heated air through an exhaust air damper to exhaust the first portion of heated air from the exhaust air space to the external environment; flowing a second portion of heated air through a mixing damper that is positioned within the interior space of the facility between the supply air space and the exhaust air space; flowing the outside air and the second portion of heated air through a mixing shaft that is positioned downstream of the air inlet and mixing damper, the mixing shaft including a plurality of elongate members that project into the mixing shaft to create turbulent airflow to promote mixing of the outside air and the second portion of heated air as the outside air and the second portion of heated air flow through the mixing shaft; closing a damper of the second air inlet to increase an amount of outside air that flows through the first air inlet and mixes with the second portion of heated air that flows through the mixing damper; and wherein airflow of the outside air and heated air is driven entirely by the combined airflow of a plurality of the fans of the computing devices.\n 11. The method of claim 10, wherein at least some of the elongate members of the plurality of elongate members differ in size or differ in orientation within the mixing shaft.\n 12. The method of claim 10, further comprising closing the exhaust air damper and opening the mixing damper to control an amount of heated air that flows through the mixing damper and mixes with the outside air.\n 13. The method of claim 10, wherein the interior space of the facility includes a hot air space positioned vertically above the plurality of computing devices, the hot air space being in fluid communication with the exhaust air space such that heated air is flowable from the exhaust air space to the hot air space, and wherein the mixing damper is positioned on an exterior end of the hot air space.\n 14. The method of claim 10, wherein the plurality of computing devices are positioned on a first computing floor and a second computing floor of the facility, and wherein a horizontal air permeable floor separates the first computing floor from the second computing floor.\n 15. The method of claim 14, further comprising flowing the mixed outside air and second portion of heated air through the air permeable floor separating the first computing floor from the second computing floor.\n 16. The method of claim 10, further comprising flowing the mixed outside air and second portion of heated air through an air filter that is coupled with a bottom end of the mixing shaft and with a floor of the facility.\n 17. The method of claim 10, wherein the plurality of computing devices are arranged within the interior space of the facility about a wall that is two stories tall."},"Patent Number":{"kind":"string","value":"10299412"},"Document ID":{"kind":"string","value":"US 10299412 B1"},"Date Published":{"kind":"string","value":"2019-05-21"},"Family ID":{"kind":"string","value":"66541033"},"Title":{"kind":"string","value":"System and method for cooling computing devices within a facility"},"CPCI":{"kind":"string","value":"G06F1/20;H05K7/20745;F24F7/06;H05K7/1497;F24F13/10;H05K7/20727"},"CPCA":{"kind":"string","value":""},"Inventor":{"kind":"string","value":"Papen; Jeffrey et al."},"Assignee":{"kind":"string","value":"Core Scientific, Inc."},"Application Number":{"kind":"string","value":"16/053648"},"Filing Date":{"kind":"string","value":"2018-08-02"},"Primary Examiner":{"kind":"string","value":"Patel; Mukundbhai G"},"Assistant Examiner":{"kind":"string","value":""},"OR":{"kind":"string","value":"1/1"},"XREF":{"kind":"string","value":""},"Applicant Name":{"kind":"string","value":"Core Scientific, Inc."},"Notes":{"kind":"string","value":""},"Notes/Tagged":{"kind":"string","value":""},"Relevancy":{"kind":"string","value":"14.761707"},"Database":{"kind":"string","value":"USPAT"},"total_tokens":{"kind":"string","value":"16138.0"}}},{"rowIdx":98,"cells":{"text":{"kind":"string","value":"United States Patent\n10304062\nKind Code\nB1\nDate of Patent\nMay 28, 2019\nInventor(s)\nHines; Scott\n\n## Computer architecture incorporating blockchain based immutable audit ledger for compliance with data regulations\n\n### Abstract\n\nA computer system architecture and method for providing compliance with data regulations, by: (a) collecting a data input stream with a data collection terminal; (b) using a compliance device driver resident in the data collection terminal to: (1) select data corresponding to pre-identified data compliance fields, and (2) apply a compliance markup language parser to generate pseudonymized data; and (c) using an automated compliance network appliance and an automated compliance server to: (1) transmit the pseudonymized data into immutable audit ledger, wherein the immutable audit ledger is assembled and verified by blockchain, and (2) transmit the data input stream into a data lake; (d) hosting access portals for accessing data: (1) stored in the data lake, and (2) stored in the immutable audit ledger.\n\nInventors:\n\n**Hines; Scott** (Fountain Hills, AZ)\n\nApplicant:\n\n**TD PROFESSIONAL SERVICES, LLC** (Fountain Hills, AZ)\n\nFamily ID:\n\n66636233\n\nAssignee:\n\n**TD PROFESSIONAL SERVICES, LLC** (Fountain Hills, AZ)\n\nAppl. No.:\n\n15/934720\n\nFiled:\n\nMarch 23, 2018\n\n### Publication Classification\n\nInt. Cl.:\n\n**G06Q30/00** (20120101); **H04L9/06** (20060101); **G06F21/60** (20130101); **G06F21/62** (20130101)\n\nU.S. Cl.:\n\nCPC\n\n**G06Q30/018** (20130101); **G06F21/602** (20130101); **G06F21/6254** (20130101); **H04L9/0637** (20130101);\n\n### Field of Classification Search\n\nCPC:\n\nG06F (21/6254); G06F (21/602); G06F (16/22); G06F (16/252); G06F (16/80); G06F (16/30); G06Q (30/018); H04L (9/0637)\n\nUSPC:\n\n707/602; 707/694\n\n### References Cited\n\n#### U.S. PATENT DOCUMENTS\n\nPatent No.\nIssued Date\nPatentee Name\nU.S. Cl.\nCPC\n2003/0028514\n12/2002\nLord\nN/A\nG06F 11/2064\n2017/0011460\n12/2016\nMolinari\nN/A\nG06Q 40/04\n2017/0046693\n12/2016\nHaldenby\nN/A\nG06Q 20/0655\n2018/0082024\n12/2017\nCurbera\nN/A\nG06F 19/3418\n2018/0088928\n12/2017\nSmith\nN/A\nG06F 8/65\n2018/0152289\n12/2017\nHunt\nN/A\nH04L 9/0637\n2018/0158050\n12/2017\nChenard\nN/A\nG06Q 20/382\n\n#### OTHER PUBLICATIONS\n\nGeelkerken et. al. “Using Blockchain to strengthen the rights granted through the GDPR”. Nov. 23-25, 2017. International Youth Science Forum “Litteris et Artibus”. pp. 458-461. cited by examiner\n\n*Primary Examiner:* Pham; Michael\n\n*Attorney, Agent or Firm:* Gordon Rees Scully Mansukhani LLP\n\n### Background/Summary\n\nTECHNICAL FIELD\n(1) The present invention relates to computer architectures that automatically comply with data regulations by generating or employing immutable audit ledgers. The present invention also relates to computer systems that effectively comply with data processing regulations including, but not limited to, the European Union's General Data Protection Regulation (GDPR).\nBACKGROUND OF THE INVENTION\n(2) On 27 Apr. 2016, the European Union passed The General Data Protection Regulation (GDPR) (Regulation (EU) 2016/679). The GDPR is a regulation by which the European Parliament, the Council of the European Union and the European Commission intend to strengthen and unify data protection for all individuals within the European Union (EU). The regulation is extra-territorial and extends the scope of the EU data protection law to all foreign companies processing data of EU residents.\n(3) The regulations go in to effect on 25 May 2018 and require organizations that collect, process, or control (the “Data Controllers”) personal data from EU residents (the ‘Data Subjects”) to comply with the regulations. The scope of the of regulations is quite wide. For example, according to the European Commission “personal data” is any information relating to an individual, whether it relates to his or her private, professional or public life. It can be anything from a name, a home address, a photo, an email address, bank details, posts on social networking websites, medical information, or a computer's IP address.\n(4) The GDPR specifically requires Data Controllers to: (i) implement effective measures to comply with the regulations and, (ii) be able to demonstrate evidence of the compliance of processing activities. The regulations place a very significant and expensive burden on Data Controllers. Data Controllers are required to: BREACH NOTIFICATION—Notify Data Subjects within 72 hours of first having become aware of the breach. OBTAIN VALID CONSENT—Valid consent must be explicit for data collected and the purposes data is used. Data controllers must be able to prove “consent” (opt-in) and consent may be withdrawn. RIGHT TO ACCESS—Provide Data Subjects with confirmation as to whether or not personal data concerning them is being processed, where and for what purpose. Further, the controller shall provide a copy of the personal data, free of charge, in an electronic format. RIGHT TO BE FORGOTTEN—Allow the Data Subject to have the data controller erase his/her personal data, cease further dissemination of the data, and potentially have third parties halt processing of the data. DATA PORTABILITY—Provide the right for a data subject to receive the personal data concerning them, which they have previously provided in a ‘commonly use and machine-readable format’ and have the right to transmit that data to another controller.\n(5) The GDPR places significant financial burden and liability on Data Controllers. Independent research suggests that companies will spend an average of $1.4 million on systems and training to comply with the GDPR. Fundamental limitations in current data processing technology are the primary an obstacle to GDPR compliance. Many organizations simply don't have the appropriate technology to manage data effectively. The penalties for breach of GDPR are very severe. Data Controllers found in breach can be fined up to 4% of annual global turnover or €20 Million (whichever is greater). Companies, such as retailers and hotels that collect large amounts of consumer data are particularly exposed to GDPR compliance costs and liabilities.\n(6) What is now desired is a computer system architecture that ensures automatic seamless compliance with GDPR data regulations. Ideally, such a computer system architecture would permit the data subjects themselves to access the data being stored about them, yet also permit merchants, financial, medical and academic professionals (and others) to only access pseudonymized data about the data subjects (thereby maintaining the data subjects' privacy and anonymity). Ideally as well, such a computer system architecture would seamlessly and automatically generate an auditably verified record in a timely fashion that the data stored therein complies with data processing regulations such as GDPR. As will be shown below, the present computer architecture provides such a system.\nSUMMARY OF THE INVENTION\n(7) In a first aspect, the present system provides a computer system architecture for providing compliance with data regulations, comprising: (a) a data collection terminal configured to receive a data input stream; (b) a compliance device driver resident in the data collection terminal that: (1) selects data in the data input stream that corresponds to pre-identified data fields, wherein the pre-identified data fields are determined by data compliance regulations, and (2) applies a compliance markup language parser to the selected data, thereby generating pseudonymized data; and (c) an automated compliance network appliance in communication with the compliance device driver, the automated compliance network appliance: (1) receiving the pseudonymized data generated by the compliance driver, and (2) transmitting the pseudonymized data to the Internet; and (3) receiving the data input stream from the data collection terminal, and (4) transmitting the data input stream to the Internet; and (d) an automated compliance server, the automated compliance server: (1) receiving the pseudonymized data from the Internet, and (2) storing the pseudonymized data in immutable audit ledger by using a private blockchain system, (3) receiving the data input stream from the Internet, and (4) storing the data input stream in a data lake.\n(8) In another aspect, the present system includes a method of providing an auditable record showing transaction compliance with data regulations, by: (a) collecting a data input stream with a data collection terminal; (b) selecting data in the data input stream that corresponds to pre-identified data fields, wherein the pre-identified data fields are determined by data compliance regulations; (c) applying a compliance markup language parser to the selected data, thereby generating pseudonymized data; (d) transmitting the pseudonymized data into a blockchain based immutable audit ledger; (e) transmitting the data input stream into a data lake; (f) hosting a portal for accessing data stored in the data lake; and (g) hosting a portal for accessing data stored in the immutable audit ledger.\n(9) A first advantage of the present system is that it utilizes blockchain technology to reliably generate the immutable audit ledger. An advantage of a blockchain system is that the immutable audit ledger meets legal standards of data security. The immutable audit ledger is preferably generated by utilizing a private blockchain in which blocks are added to the blockchain after they have been verified by dedicated miners. A “proof of complexity” problem solving system is used. This approach advantageously allows dedicated miners to solve the mathematical problem rapidly enough to allow the miners to achieve consensus within a desired time frame, while still providing sufficient randomness in the selection of the miner awarded the right to write the block. The immutable audit ledger thereby provides an auditable data registry that certifies that the data stored in the data lake is correct and unaltered.\n(10) Preferably, the automated compliance network appliance transmits data to the Internet in batches such that it is pre-prepared for the blockchain miners. An advantage of sending data in batches to a group of pre-selected private miners is that the blocks can be solved (i.e.: consensus can be achieved between the miners) and written faster (as compared to using individual data transmissions and a public blockchain approach). This feature of the present system is very advantageous since GDPR regulations only give Data Controllers 72 hours to report data breaches.\n(11) In preferred aspects, the automated compliance application server hosts a portal for accessing the data stored in the data lake such that the Data Subjects (i.e.: the persons about whom the data has been stored) can access data about themselves, and then delete, modify or transfer the data. In addition, the automated compliance application server also hosts a portal for accessing the data in the immutable audit ledger such that an auditor, merchant, financial professional or medical professional (or other 3.sup.rd parties) can access the pseudonymized data stored in the immutable audit ledger. Thus, data privacy is maintained such these 3.sup.rd parties cannot access the full sets of all of the data stored corresponding to each data subject. Optionally, the pseudonymized data may itself be encrypted.\n(12) Another advantage of the present computer architecture is that it permits data regulation auditors to access an immutable ledger of the pseudonymized data, thereby confirming compliance with the data regulations. Specifically, auditors can view the compliance data without requiring access to any of the private information or systems, yet can still coordinate, communicate and collaborate with the owners and operators of the present computer architecture system.\n(13) In various aspects, the data collection terminal may be a point of sale terminal, a webpage, a cash register, a check-in counter, a hand-held mobile device, an API, or any other suitable device. In preferred aspects, the data collection terminal is also payment cardholder information (PCI) complaint. The data collection terminal optionally comprises a data input device and a data output device. The data output device shows the collected data to the person about whom the data has been collected. For example, the data output device may simply be a receipt printer (which prints details of the sales transaction). Alternatively, the data output device may be a web page that displays this information. The receipt or webpage can have both the gathered data thereon, and a statement that the data has been gathered.\n(14) Preferably, the automated compliance network appliance has a processor, and memory with local storage that assembles data into blocks for transmission to the Internet. Optionally, the automated compliance network appliance may be a USB drive or a router.\n(15) The pre-identified data fields are preferably pre-stored in the compliance device driver and preferably correspond to personal information data, including, but not limited to: names, addresses, photos, email addresses, bank details, financial information, posts on social networking sites or apps, medical information, computer IP addresses, purchase information, agreements, academic records, travel records, or government and public services records. The compliance markup language parser determines which data is to be sent to the data output device, and which data is administered by which regulatory agency.\n(16) Although the present system can be used for GDPR data regulations, it is to be understood that it can also be used for other data regulation schemes including, but not limited to: Health Insurance Portability And Accountability Act (HIPPA) data regulations, or Financial Industry Regulatory Authority (FINRA) data regulations, any other data regulations or even just updates to any such data regulations. It is to be understood that the present system can be used with any regulatory compliance standard that requires that evidence of compliance be maintained in an immutable data storage this is: accessible to public stakeholders, shows that the regulatory requirements were performed according to published requirements of the standard, yet still shields private information from public stakeholders.\n\n### Description\n\nBRIEF DESCRIPTION OF THE DRAWINGS\n(1) FIG. 1 is a system diagram of the present invention.\n(2) FIG. 2 is a system diagram showing further details of the compliance enabled data collection terminal of FIG. 1.\n(3) FIG. 3 is a system diagram showing further details of the compliance device driver of FIG. 1.\n(4) FIG. 4 is a system diagram showing further details of the automated compliance network appliance of FIG. 1.\n(5) FIG. 5 is a system diagram showing further details of the data transactions between the automated compliance application server and both the immutable audit ledger and the data lake of FIG. 1.\n(6) FIG. 6 is a system diagram of the automated compliance application server stakeholder interfaces.\n(7) FIG. 7 illustrates the use of compliance markup language to generate a printed sales receipt.\n(8) FIG. 8 illustrates an exemplary printed sales receipt (**12** in FIG. 2) that has been generated using the compliance markup language of FIG. 7.\n(9) FIG. 9 illustrates the present invention in a preferred system of operation.\nDETAILED DESCRIPTION OF THE DRAWINGS\n(10) Referring first to FIG. 1, an overview of computer architecture **101** for providing compliance with data regulations is provided, as follows.\n(11) A data collection terminal **1** is configured to receive a data input stream. A compliance device driver (**9** in FIG. 2) is resident in data collection terminal **1**. The compliance device driver **9** performs the following two functions.\n(12) First, it selects data in the data input stream that corresponds to pre-identified data fields. The pre-identified data fields are determined by data compliance regulations. For example, in the case of GDPR, suitable data fields may include: names, addresses, photos, email addresses, bank details, financial information, posts on social networking sites or apps, medical information, computer IP addresses, purchase information, agreements, academic records, travel records, or government and public services records. It is to be understood that this list is merely exemplary and that other data fields could also be used, all keeping within the scope of the present system. These pre-identified data fields are preferably pre-stored in the compliance device driver **9** (FIG. 2). Preferably, these pre-identified data fields correspond to privacy data regulations (including, but not limited to GDPR, HIPPA and FINRA data regulations, or even top updates of such privacy regulations). The data input stream can comprise data about can be purchases, restaurant bills, legal agreements, academic grades, financial transactions, travel locations and itineraries, etc.\n(13) Second, the compliance device driver **9** applies a compliance markup language parser (**15** in FIG. 3) to the selected data, thereby generating pseudonymized data. As understood herein, “pseudonymized data” is data in which most of the identifying fields within a data record are replaced within one or more artificial identifiers, or pseudonyms, thereby rendering the data less identifying to provide for greater Data Subject privacy. Specifically, as seen in FIG. 3, the compliance markup language parser **15** scans the data subject receipt data stream **13** and identifies compliance markup language tags that are embedded within data stream **13** as defined by a data controller **32** (FIG. 6). The compliance markup language tags instruct the compliance markup language parser **15** to identify, categorize, and forward data elements within the data stream to automated compliance network appliance **2**.\n(14) As can be seen, the automated compliance network appliance **2** is in communication with compliance device driver **9** within data collection terminal **1**. Automated compliance network appliance **2** both receives and transmits data. Specifically, it receives the pseudonymized data generated by the compliance driver **9** and then transmits the pseudonymized data to the Internet **3**. The automated compliance network appliance **2** also receives the data input stream from the data collection terminal (**7** in FIG. 2), and transmits this data input stream to the Internet **3**. Thus, both data streams (i.e.: the full data input stream and the pseudonymized data) can be transmitted over the Internet. Optionally, the automated compliance network appliance **2** can use artificial intelligence or machine learning to predict events of interest to data controller **32**, data auditor **23**, or other stakeholders. For example, such events can include events that have a high probability of fraud (e.g.: unusual purchases), or a high probability of lack of compliance to the regulatory regime in force. Moreover, events of interest can also be operational events such as the need to reorder products or supplies, a need to update financial or labor forecasts, or any other key business process.\n(15) Next, an automated compliance server **4** receives both the pseudonymized data and the data input stream from the Internet **3**. As will be fully explained below, automated compliance server **4** then stores the pseudonymized data in immutable audit ledger **5** using a blockchain based approach. As will also be explained, automated compliance server **4** also stores the data input stream in data lake **6**.\n(16) FIG. 2 shows further details of the data collection terminal with compliance device driver **1**, as follows. In various aspects, data collection terminal **1** can include any suitable data input device **7** for collecting data, including, but not limited to, a point of sale terminal, a webpage, a cash register, a check-in counter, a hand-held mobile device, or an API.\n(17) Preferably, data collection terminal **1** comprises a data input device **7** and a data output device **11**. In operation, data output device **11** provides the data from the data input stream to the person about whom the data has been collected. For example, data output device **11** can simply be a receipt printer (which prints the sales transaction receipt **12** thereon). Alternatively, data output device **11** can be a web page which simply displays the information of the person about which it is collected (e.g.: a webpage displaying a transaction confirmation). Output device driver **10** sends the data to output device **11**.\n(18) In operation, the compliance markup language parser **15** determines which data is to be sent to data output device **11**. It is to be understood that not all data that is collected in the input data stream needs to be printed onto receipt **12** (or displayed on a webpage). For example, a sales receipt need not have the purchaser's address or phone number printed thereon. Additionally, the compliance markup language parser **15** determines which data is to be sent to automated compliance network appliance **2**.\n(19) In optional preferred aspects, the data collection terminal includes a Point Of Sale (POS) Application **8** therein. In preferred aspects, POS Application **8** may be Payment Cardholder Information (PCI) complaint. As a result, no extra time is spent to achieve PCI compliance (since the data handling will already be PCI compliant before the data is entered into blocks in the present blockchain system). The present system can thus be implemented without having to redo its PCI compliance.\n(20) FIG. 3 shows further structural details of compliance device driver **9** in FIG. 2, as follows. First, the full data stream **13** relating to a data subject is received. Next, at **14**, the data stream is intercepted via a piping instruction that re-directed the data stream to the compliance markup language parser **15**. After processing by parser **15**, the data is then directed into output device **11**. Compliance markup language parser **15** performs pseudonymisation (and optionally encryption as well) at **18**, thereby sending pseudomynized data to automated compliance network appliance **2**. (In the absence of data stream intercept **14**, the data would instead simply pass directly into output device **15** without being pseudonymised).\n(21) FIG. 4 shows further structural details of automated compliance network appliance **2** in FIG. 1, as follows. Preferably, automated compliance network appliance **2** comprises a processor, memory and local storage. The Automated Compliance Network Appliance should provide at least two network interface ports to provide a secure bridge of communication between the private network connecting the data collection terminals **1** and the public Internet **3**. Optionally, the network connection between data collection terminal **1** and automated compliance network appliance **2** could be replaced by a temporary data storage device that could be connected to data collection terminal **1** and could emulate automated compliance network appliance **2**. This temporary storage device would then provide temporary storage of the compliance transactions collected from data collection terminal **1**. This temporary storage device could then be removed from the connection to the data collection terminal **1** and connected to automated compliance network appliance **2**. Upon connection to automated compliance network appliance **2**, the temporary storage device would download the stored compliance transactions to be processed by the system in accordance with the processing requirements defined by data controller **32** in the same manner as if the transactions had been collected from a data collection terminal **1** connected directly to automated compliance network appliance **2**. The use of the temporary data storage device supports the operation of a data collection terminal **1** in an off-line mode when it is not possible for the data controller **32** to operate data collection terminal **1** in an environment where it is connected directly to the automated compliance network appliance **2**.\n(22) Automated compliance network appliance **2** includes a temporary local storage **20** into which the data is received. Next, at **21**, blockchain block preparation is done. Specifically, automated compliance network appliance **2** at step **21** assembles the data that is to be used to form the immutable audit ledger **5** into batches for transmission to the Internet **3**. By sending the data in batches to the internet, the blockchain miners are able to verify blocks and add them to the blockchain faster. If the data was not sent in batches to the blockchain miners, the blockchain miners will be required to validate each data subject transaction one by one.\n(23) FIG. 5 shows further details of the data transactions between the automated compliance application server **4** and both the immutable audit ledger **5** and data lake **6**, as follows. Preferably, automated compliance application server **4** comprises an authentication service **25** that verifies the identity of the automated compliance network appliance **2** and ensures that it has been approved by the data controller **32** to connect to and exchange data with the transaction API **26**. Multiple methods of authentication may be utilized by the present system, all keeping within the scope of the present invention. Next, the transaction API **26** operates to expose a set of methods that may be called by the automated compliance network appliance **2** to support the data processing compliance policies determined by data controller **32**. These API methods can include multiple data processing functions such as separating the full data stream from the pseudonymized data (and direct the pseudonymized data into blockchain API **27**, and direct the full collected data into data lake API **29**).\n(24) The blockchain ledger API **27** exposes methods supported by the blockchain such that transaction API **26** is able to pass to the blockchain data elements and transaction registrations to be stored in immutable audit ledger **5**. Blockchain ledger API **27** also exposes methods to the data subject portal **34**, data controller portal **35** and data audit portal **36** (see FIG. 6) such that these stakeholder interfaces are able to query, select, and process data maintained in the immutable audit ledger **5**.\n(25) Preferably, the blockchain is a private blockchain that uses a proof of complexity problem/solution to write individual blocks to the chain. Such a blockchain would provide an immutable audit ledger that provides an auditable data registry that certifies that the data stored in data lake **6** is correct and unaltered. Thus, the present blockchain would advantageously meet legal evidentiary standards.\n(26) In operation, the validated transactions are recorded by the miners on a shared distributed ledger. Specifically, whichever miner solves the proof of complexity problem first will get to write the block (after independent verification of the block by the other miners).\n(27) By using a private or permissioned blockchain with a private field of miners (i.e.: a blockchain system in which anyone can read, but only pre-selected members can record transactions to the blockchain), the required proof of complexity can be reduced. This is very advantageous in reducing the time required to verify and add blocks to the chain. GDPR regulations require 72 hour notice to Data Subjects after a data breach has occurred. In accordance with the present private blockchain system, miner consensus on blocks may be achieved (for example) in as little as 12 hours, and potentially less time. It is to be understood, of course, that the average time to solve and write the blocks will depend both upon the specific numerical problem the miners are assigned and the number of miners working on the problem. In accordance with the present system, proof of work (i.e.: solving computationally intense mathematical problem), proof of complexity and proof of stake consensus modeling (which uses less resources) can be used. Another advantage of using private minors is that you don't have to pay them.\n(28) The blockchain derived, immutable audit ledger **5** certifies that the data in data lake **6** is unaltered. Specifically, each line in ledger **5** contains a timestamp, and may contain transaction type, specific IDs for customer and retailers, a transaction ID from the data lake, and a hash value associated with the contents. Ledger data is hashed together and the collection of the hashes is grouped into a block. The contents of each block is then hashed with the hash of the previous block. The blocks are then validated by other blockchain miners. The hash stored in the blockchain can be compared to the hash of the transaction in the data lake to verify that the contents of the data lake have not been changed.\n(29) FIG. 6 illustrates various portals **34**, **35** and **36** hosted by the automated compliance application server **4** for either accessing the data stored in data lake **6**, or the data in immutable audit ledger **5**, as follows.\n(30) First, portal **34** allows a data subject **31** to access data about themselves stored in the data lake. Specifically, this portal preferably allows the data subject **31** to delete, modify or transfer data about themselves stored in the data lake.\n(31) Second, portal **35** that allows access to the immutable audit ledger can be used for an auditor, merchant, financial professional, medical professional, educator (or other third party) to access the pseudomymized data that is stored in the immutable audit ledger.\n(32) Third, portal **36** allows the data controller (i.e.: “system administrator”) to access to both data stored either in the immutable audit ledger **5** or in the data lake **6**.\n(33) The present system also provides a method of providing an auditable record showing transaction compliance with data regulations, by: (a) collecting a data input stream with a data collection terminal **1**; (b) selecting data in the data input stream that corresponds to pre-identified data fields, wherein the pre-identified data fields are determined by data compliance regulations; (c) applying a compliance markup language parser **15** to the selected data, thereby generating pseudonymized data; (d) transmitting the pseudonymized data into an immutable audit ledger **5**; (e) transmitting the data input stream into a data lake **6**; (f) hosting a portal **35**/**36** for accessing data stored in data lake **6**; and (g) hosting a portal **34** for accessing data stored in the immutable audit ledger **5**.\n(34) In accordance with this method, portal **34** hosted for accessing data stored in the data lake allows a data subject to access data about themselves, and delete, modify or transfer the data. Similarly, portal **35** hosted for accessing data stored in the immutable audit ledger allows an auditor, merchant, financial professional or medical professional to access data stored in the immutable audit ledger. Thus, the portal access will depend on the “role” of the person or agency seeking access.\n(35) FIG. 7 illustrates the use of compliance markup language on data stream (**13** in FIG. 3) to generate a printed sales receipt, and FIG. 8 illustrates an exemplary printed sales receipt (**12** in FIG. 2) that has been generated using the compliance markup language of FIG. 7, as follows.\n(36) In FIG. 7, an exemplary data subject receipt data stream **13** can include a document header **37** that has content out of scope of GDPR or other data regulation. This data content passes through compliance language parser **15** without any effect on the data stream. An opening compliance tag **38** and a closing compliance tag **44** define the opening and closing boundaries for data elements that fall within the scope of GDPR or other data regulation. (For example, 40 shows content within scope). Tags **38** and **44** are user defined by data controller **32** and may designate regulatory compliance regulations. Opening tag **38** may be nested within other opening tags if the data controller determines that certain data contents falls within the scope of multiple regulatory agencies. An opening element tag **39** designates content that must be recorded in immutable audit ledger **5** and data lake **6**. Tag **39** can be used to name data elements and set their pass-through behavior in data stream insertion module **16** (FIG. 3). Tag **40** designates the end of stream content that was opened by tag **39**. Data **40** between tags **39** and **41** passes into output device **11** without compliance language parser **15** operating on it. This data can then, for example, be printed directly on the sales receipt **12** (FIGS. 8 and 2). Conversely, data **43** between opening tag **42** and closing tag **44** does not pass directly out of the system and onto a sales receipt. Instead, this data is acted upon by compliance language parser **15**, and is sent to data lake **6** and is also pseudonymized and sent into immutable audit ledger **5**. At **45**, the document body and footer show data that is out of scope of GDPR (or other data regulation). This data also passes through compliance language markup parser **15** without effect on the data stream.\n(37) Lastly, FIG. 9 shows an overall illustration of the present system in operation. Additional features in the system of FIG. 9 include communication manager **46** which provides automated communications to data subjects **31** to notify them of any changes, additions or deletions to the data elements kept in immutable ledger **5** or data lake **6**. Communication services provided by communication manager **46** can include, but are not limited to, texts, emails or even postal or courier mailings. Automated compliance server **4** can optionally include a workflow engine **47** that provides the data configuration for the data processing steps required to correctly process each of the transactions. A transaction bundling software system **48** is a system within the blockchain platform that prepares data blocks received from automated compliance network appliance **2** into blocks of data that can be hashed and written to the immutable ledger **5** by the blockchain miners **49**. Lastly, ledger service **50** can be a set of APIs that provide miners **49** with a standard set of functions that they can execute against immutable ledger **5** to add the blocks to immutable ledger **5**.\n\n### Claims\n\n1. A computer system architecture for providing compliance with data regulations, comprising: (a) a data collection terminal configured to receive a data input stream; (b) a data input device resident in the data collection terminal; (c) a data output device resident in the data collection terminal; (d) a compliance device driver resident in the data collection terminal, the compliance device driver comprising a non-transitory computer-readable medium having instructions stored therein that when executed by a computing device: (1) selects in-scope data in the data input stream received by the data input device that corresponds to pre-identified data fields by identifying compliance markup language tags embedded in the data input stream, wherein the pre-identified data fields are determined by data compliance regulations, and (2) applies a compliance markup language parser to the selected in-scope data, thereby generating pseudonymized data of the selected in-scope data, while permitting out-of-scope data to pass through the compliance language markup parser without affecting the out-of-scope data; (e) an automated compliance network appliance in communication with the compliance device driver, wherein the automated compliance network appliance is a physical network interface connection comprising a processor, memory and local storage, the automated compliance network appliance: (1) receiving the pseudonymized data generated by the compliance driver, and (2) transmitting the pseudonymized data in batches to blockchain miners; and (3) receiving the data input stream from the data collection terminal, and (4) transmitting the data input stream to the Internet; and (f) an automated compliance server, the automated compliance server: (1) receiving the data input stream from the Internet, and (2) storing the data input stream as raw, unstructured and unaltered data in a data lake, while simultaneously (3) receiving verified blockchain blocks from the blockchain miners, and (4) storing the verified blockchain blocks in a blockchain derived immutable audit ledger, wherein the blockchain derived immutable audit ledger certifies that the data stored in the data lake is correct and unaltered.\n 2. The computer system architecture of claim 1, wherein the data collection terminal is a point of sale terminal, a webpage, a cash register, a check-in counter, a hand-held mobile device, or an API.\n 3. The computer system architecture of claim 1, wherein the network interface connection is a USB drive or router.\n 4. The computer system architecture of claim 1, wherein the pre-identified data fields are pre-stored in the compliance device driver.\n 5. The computer system architecture of claim 1, wherein the pre-identified data fields comprise personal information data fields.\n 6. The computer system architecture of claim 1, wherein the pre-identified data fields correspond to privacy data regulations.\n 7. The computer system architecture of claim 1, wherein the blockchain is a private blockchain.\n 8. The computer system architecture of claim 7, wherein the private blockchain is a proof of complexity blockchain.\n 9. The computer system architecture of claim 1, wherein the automated compliance application server hosts a portal for accessing the data stored in the data lake.\n 10. The computer system architecture of claim 9, wherein the portal allows a data subject to access data about themselves stored in the data lake.\n 11. The computer system architecture of claim 10, wherein the portal allows the data subject to: delete data about themselves stored in the data lake, modify data about themselves stored in the data lake, or transfer data about themselves stored in the data lake.\n 12. The computer system architecture of claim 1, wherein the automated compliance application server hosts a portal for accessing the data in the immutable audit ledger.\n 13. The computer system architecture of claim 1, wherein the data output device provides the data in the data input stream to the person about whom the data has been collected.\n 14. The computer system architecture of claim 1, wherein the compliance markup language parser determines which data is to be sent to the data output device.\n 15. The computer system architecture of claim 1, wherein the data collection terminal is payment cardholder information (PCI) complaint.\n 16. The computer system architecture of claim 1, wherein the compliance markup language parser determines which data is administered by which regulatory agency.\n 17. A method of providing an auditable record showing transaction compliance with data regulations, comprising: (a) collecting a data input stream with a data collection terminal; (b) selecting in-scope data in the data input stream that corresponds to pre-identified data fields by identifying compliance markup language tags embedded in the data input stream, wherein the pre-identified data fields are determined by data compliance regulations, and wherein the in-scope data are selected by a compliance device driver comprising a non-transitory computer-readable medium having instructions stored therein that when executed by a computing device selects the in-scope data; (c) applying a compliance markup language parser to the in-scope selected data, and wherein the compliance markup language is applied by an automated compliance network appliance comprising a network interface connection having a processor, memory and local storage, thereby generating pseudonymized data of the in-scope data; (d) transmitting the pseudonymized data of the in-scope data in batches to blockchain miners; (e) transmitting the data input stream into a data lake as raw, unstructured and unaltered data, while simultaneously; (f) receiving verified blockchain blocks from the blockchain miners, and (g) storing the verified blockchain blocks in a blockchain derived immutable audit ledger, wherein the blockchain derived immutable audit ledger certifies that the data stored in the data lake is correct and unaltered; (h) hosting a portal for accessing data stored in the data lake; and (i) hosting a portal for accessing data stored in the immutable audit ledger.\n 18. The method of claim 17, wherein collecting the data input stream with the data collection terminal comprises collecting the data input stream with a point of sale terminal, a webpage, a cash register, a check-in counter, a hand-held mobile device, or an API.\n 19. The method of claim 17, further comprising: utilizing a private blockchain to verify the data in the immutable audit ledger.\n 20. The method of claim 17, wherein the portal hosted for accessing data stored in the data lake allows a data subject to access data about themselves, and delete, modify or transfer the data."},"Patent Number":{"kind":"string","value":"10304062"},"Document ID":{"kind":"string","value":"US 10304062 B1"},"Date Published":{"kind":"string","value":"2019-05-28"},"Family ID":{"kind":"string","value":"66636233"},"Title":{"kind":"string","value":"Computer architecture incorporating blockchain based immutable audit ledger for compliance with data regulations"},"CPCI":{"kind":"string","value":"G06Q30/018;G06F21/602;H04L9/3239;G06F21/6254;H04L9/0637;G06F21/64"},"CPCA":{"kind":"string","value":"H04L9/50;H04L2209/88;H04L2209/42"},"Inventor":{"kind":"string","value":"Hines; Scott"},"Assignee":{"kind":"string","value":"TD PROFESSIONAL SERVICES, LLC"},"Application Number":{"kind":"string","value":"15/934720"},"Filing Date":{"kind":"string","value":"2018-03-23"},"Primary Examiner":{"kind":"string","value":"Pham; Michael"},"Assistant Examiner":{"kind":"string","value":""},"OR":{"kind":"string","value":"1/1"},"XREF":{"kind":"string","value":""},"Applicant Name":{"kind":"string","value":"TD PROFESSIONAL SERVICES, LLC"},"Notes":{"kind":"string","value":""},"Notes/Tagged":{"kind":"string","value":""},"Relevancy":{"kind":"string","value":"19.994345"},"Database":{"kind":"string","value":"USPAT"},"total_tokens":{"kind":"string","value":"8703.0"}}},{"rowIdx":99,"cells":{"text":{"kind":"string","value":"United States Patent\n10305833\nKind Code\nB1\nDate of Patent\nMay 28, 2019\nInventor(s)\nDennis; Stewart MacGregor\n\n## Blockchain based email procedures\n\n### Abstract\n\nSystems and techniques are provided for managing and categorizing unsolicited emails from unknown senders using blockchain technology. In a specific implementation, an email authorization system authorizes emails from unknown senders to reach recipient email inboxes after the unknown senders validate the emails by executing blockchain transactions prompted by the email authorization system; else, the emails from unknown senders are not included in the recipient email inboxes. The blockchain transactions are recorded in a blockchain ledger in a blockchain network.\n\nInventors:\n\n**Dennis; Stewart MacGregor** (Redwood City, CA)\n\nApplicant:\n\n**Turing Technology, Inc.** (Redwood City, CA)\n\nFamily ID:\n\n66636139\n\nAssignee:\n\n**TURING TECHNOLOGY, INC.** (Redwood City, CA)\n\nAppl. No.:\n\n15/723467\n\nFiled:\n\nOctober 03, 2017\n\n### Related U.S. Application Data\n\nus-provisional-application US 62535910 20170723\n\n### Publication Classification\n\nInt. Cl.:\n\n**H04L29/06** (20060101); **H04L12/58** (20060101); **H04L9/16** (20060101); **H04L9/30** (20060101)\n\nU.S. Cl.:\n\nCPC\n\n**H04L51/12** (20130101); **H04L9/16** (20130101); **H04L9/30** (20130101); **H04L63/205** (20130101);\n\n### Field of Classification Search\n\nCPC:\n\nH04L (63/205)\n\nUSPC:\n\n726/22\n\n### References Cited\n\n#### U.S. PATENT DOCUMENTS\n\nPatent No.\nIssued Date\nPatentee Name\nU.S. Cl.\nCPC\n7783883\n12/2009\nGasparini et al.\nN/A\nN/A\n2018/0053160\n12/2017\nSchwartz\nN/A\nG06Q 20/389\n2018/0053161\n12/2017\nBordash\nN/A\nG06Q 20/102\n2018/0374094\n12/2017\nKohli\nN/A\nG06Q 20/401\n\n#### OTHER PUBLICATIONS\n\nBouguila et al., “A discrete mixture-based kernal for SVMs: Application to spam and image categorization,” Information Processing & Management, vol. 45, Issue 6, Nov. 2009, pp. 631-642. cited by applicant\n\nBoykin et al., “Leveraging Social Networks to Fight Spam,” IEEE, Apr. 2005, 8 pages. cited by applicant\n\nCrispin, M., “Internet Message Access Protocol,” version 4rev1, Mar. 2003, 108 pages. cited by applicant\n\nFdez-Riverola et al., “SpamHunting: An Instance-Based Reasoning System for Spam Labelling and Filtering,” Decision Support Systems v43, Issue 3, Apr. 2007, 34 pages. cited by applicant\n\nKlensin, “RFC 5321—Simple Mail Transfer Protocol,” Oct. 2008, 83 pages. cited by applicant\n\nLaurie et al., “‘Proof-of-Work’ Proves Not to Work,” May 3, 2004, 9 pages. cited by applicant\n\nMyers et al., “RFC 1939—Post Office Protocol,” May 1996, 21 pages. cited by applicant\n\nSalehi et al., “Enhanced genetic algorithm for spam detection in email,” 2011 IEEE 2nd Int'l Conf. on Software Engineering and Service Science, Beijing, Jul. 15-17, 2011, pp. 594-597. cited by applicant\n\nSalehi et al., “Hybrid simple artificial immune system (SAIS) and particle swarm optimization (PSO) for spam detection,” 2011 Malaysian Conference in Software Engineering, Johor Bahru, Dec. 13-14, 2011, pp. 124-129. cited by applicant\n\nApeltsin, “A CryptoCubic Protocol for Hacker-Proof Off-Chain Bitcoin Transactions,” Cornell University Library, arXiv:1408.2824, 16 pages, Aug 11, 2014. cited by applicant\n\n*Primary Examiner:* Chai; Longbit\n\n*Attorney, Agent or Firm:* Haynes Beffel & Wolfeld LLP\n\n### Background/Summary\n\nPRIORITY APPLICATION\n(1) This application claims the benefit of U.S. Provisional Patent Application No. 62/535,910, filed 23 Jul. 2017; which application is incorporated herein by reference.\n\nBACKGROUND\nField\n(1) The present invention relates to authorization of emails from unknown senders. More particularly, the present invention relates to authorizing emails from unknown senders to be delivered to the recipients using blockchain technology.\nDescription of Related Art\n(2) Electronic mail (email) is a fast and powerful tool for information exchange between individuals and organizations. Due to email's immense popularity, low cost and fast delivery characteristics, the technology is prone to be misused. In the recent years, a vast majority of the email traffic could be considered spam. Spammers create and exploit free webmail accounts, and send spam emails directly to victims' mailboxes by exploiting the computational power and network bandwidth of their hosts. Spam emails are also used to spread threats, including malicious software (e.g., internet worms, Trojan horses, computer viruses and spyware) and phishing (i.e., attacks that seek to acquire sensitive information from spam email recipients). Spam emails are not only a nuisance for the email users but, additionally, cost billions of dollars in productivity losses.\n(3) Many spam filtering methods are used by email service providers and organizations. There are three main approaches for spam filtering: content-based filtering, real-time blacklisting, and sender reputation mechanisms. Content-based filtering refers to techniques in which the body of the email, attached executables, pictures or other files are analyzed and processed to determine whether the email can be classified as spam. Significant computational resources are wasted on the filtering process, thus making it fairly costly. Real-time blacklisting is another technique for mitigating spam by maintaining a “blacklist” of locations, or Internet Protocol (IP) addresses on the Internet reputed to send spam emails. Internet Service Providers (ISP) and email server software can be configured to reject or flag messages which have been sent from a site listed on one or more such blacklists. Although real-time blacklisting is a fast filtering process, it is not very effective as spammers can bypass the blacklists by repeatedly changing their IP addresses. Another shortcoming of real-time blacklisting is that whenever an IP prefix is blacklisted, both spammers and benign senders who share the same prefix might be rejected. Sender reputation mechanisms for spam email mitigation are a collection of methods for computing the reputation of email senders. The computation is usually based on information extracted from the network, the transport level, social network information or other useful identifiers. When a sending pattern of a sender reflects that of a spammer, his reputation typically decreases. If the reputation of a sender goes below a predefined threshold, the system typically rejects the sender's emails, at least until he gains up some reputation, by changing his sending properties. Various Machine learning algorithms for computing sender reputation from data sets include Bayesian classifier (P. Boykin et al., Leveraging Social Networks to fight Spam, IEEE Computer, 38(4), pp. 61-68, 2005), support vector machine-based classifier (N. Bouguila et al., A discrete mixture-based kernel for SVMs: application to spam and image categorization, Information Processing & Management, 45, pp. 631-642, 2009), genetic algorithm (S. Salehi et al., Enhanced genetic algorithm for spam detection in email, 2nd IEEE International Conference on Software Engineering and Service Science, pp. 594-597, 2011), artificial immune system (S. Salehi and A. Selamat, Hybrid simple artificial immune system (SAIS) and particle swarm optimization (PSO) for spam detection, 5th IEEE Malaysian Conference on Software Engineering (MySEC), pp. 124-129, 2011), and case-based technique (F. Fdez-Riverola et al., SpamHunting: An instance-based reasoning system for spam labeling and filtering, Decision Support Systems, 43, pp. 722-736, 2007).\n(4) Apart from spam emails, email users may also receive another form of unsolicited emails from unknown recipients known as “cold” emails. A cold email is an email that is sent to a recipient without sufficient prior contact between the sender and the recipient. Examples of cold emails include emails from job seekers to potential employers, from entrepreneurs to investors, from salespeople to corporate executives and customers for potential business opportunities, from recruiters to potential job candidates, and so on. While cold emails can be sent with good intentions from genuine senders (e.g., a job seeker sending a well-written email to one potential employer), in some instances the sender can be considered a borderline spammer (e.g., a fresh college graduate sending a generic email inquiring about available positions to twenty potential employers). Communicating to target recipients via cold emails is somewhat risky for cold email senders as there is no guarantee that the target recipient will respond to the email reliably. The target recipients of cold emails may feel that responding to some or all cold emails received may not be the best usage of their valuable time. The target recipient will benefit from a cold email filtering system that filters cold emails to include ones from only serious and genuine senders in his inbox. Genuine senders of cold emails will benefit from some sort of confirmation that the target recipients have received their cold emails and may respond in the near future.\n(5) It is desirable to provide an email exchange solution that can more effectively filter out both spam emails and non-genuine cold emails.\nSUMMARY\n(6) A system and a method are provided that can be used for filtering out spam and non-genuine cold emails. In a method described herein, emails in a recipient email channel are selected using filters, for example, where the filters may apply algorithms to select emails that are not part of an established list associated with the recipient or other processes that can classify incoming emails. The selected emails are tagged as not authorized, and can in some cases be blocked from delivery to the recipient's email inbox, or removed from the recipient's email inbox. For a particular selected email, an individual blockchain address is created, and a message is sent to the sender of the particular selected email, prompting execution of a blockchain transaction associated with the individual blockchain address of the particular filtered email. A sender of a genuine cold email may validate the particular selected email by executing the blockchain transaction associated with the individual blockchain address of the particular filtered email. The blockchain transaction will be recorded in a blockchain ledger maintained by a blockchain network. The blockchain ledgers in the blockchain network are monitored to detect the completion of the prompted blockchain transaction. After the system detects and verifies a record for the prompted blockchain transaction in the blockchain network, the particular selected email from the sender can be classified as authorized, and in some cases can be moved from a message folder holding unauthorized emails to the recipient's email inbox.\n(7) In one embodiment, the blockchain transaction has specified characteristics, such as involving a transfer of a predetermined amount of cryptocurrency to the individual blockchain address associated with the email. Other types of blockchain transactions can be used as well, such as transfer of a specified cryptographic token, or proof of performance of an obligation set in a blockchain contract.\n(8) Embodiments of the technology described herein, or elements thereof, can be implemented in the form of a computer product including a non-transitory computer-readable storage medium with the computer usable program code for performing the method steps indicated. Furthermore, embodiments of the invention or elements thereof can be implemented in the form of an apparatus including a memory and at least one processor that is coupled to the memory and operative to perform exemplary method steps. Yet further, in another aspect, embodiments of the invention or elements thereof can be implemented in the form of means for carrying out one or more of the method steps described herein; the means can include (i) hardware module(s), (ii) software module(s) executing on one or more hardware processors, or (iii) a combination of hardware and software modules; any of (i)-(iii) implement the specific techniques set forth herein, and the software modules are stored in a computer-readable storage medium (or multiple such media).\n(9) Thus, a technology is provided that can replace or supplement spam filters known in the prior art. In use, the present technology can effectively block spam and cold email, while enabling senders of emails to gain authorization for delivery of emails when they are motivated to do so. As spammers and non-genuine cold emailers are unlikely to execute a blockchain transaction to gain authorization, in general only genuine cold emails and email from known contacts will be directed to the recipients' email inboxes.\n(10) These and other features, aspects, and advantages of the invention will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings.\n\n### Description\n\nBRIEF DESCRIPTION OF THE DRAWINGS\n(1) FIG. 1 illustrates the process flow of an email authorization system.\n(2) FIG. 2 illustrates an architectural level schematic of an environment that includes an email authorization system in accordance with an implementation.\n(3) FIG. 3 is a simplified block diagram of a network node hosting an email authorization system.\n(4) FIG. 4 illustrates an example of an email authorization system.\n(5) FIG. 5 is a symbolic drawing indicating how the user database in FIG. 4 is organized, according to an embodiment of the invention.\n(6) FIG. 6 is a symbolic drawing indicating how the registered email account database in FIG. 4 is organized, according to an embodiment of the invention.\n(7) FIG. 7 is a symbolic drawing indicating how the filter database in FIG. 4 is organized, according to an embodiment of the invention\n(8) FIG. 8 is a symbolic drawing indicating how the unauthorized email database in FIG. 4 is organized, according to an embodiment of the invention.\n(9) FIG. 9 is a symbolic drawing indicating how the blockchain addresses for the unauthorized database in FIG. 4 is organized, according to an embodiment of the invention.\n(10) FIG. 10 is a sequence diagram illustrating a representative method of processing a new user in the email authorization system by the new user processor in FIG. 4.\n(11) FIG. 11 is a sequence diagram illustrating a representative method of synching a user's filter with users' contact lists by the filter synchronizer in FIG. 4.\n(12) FIG. 12 is a sequence diagram illustrating a representative method of processing an email from a known sender by the new email processor in FIG. 4.\n(13) FIG. 13 is a sequence diagram illustrating a representative method of processing an email from an unknown sender by the new email processor in FIG. 4.\n(14) FIG. 14 illustrates an example message to an unknown sender prompting execution of a blockchain transaction in accordance with an implementation.\n(15) FIG. 15 illustrates a representative method of completing a blockchain transaction to authorize the release of an email.\n(16) FIG. 16 is a sequence diagram illustrating a representative method of processing new blockchain transactions in the email authorization system by the new transaction processor in FIG. 4.\n(17) FIG. 17 is a sequence diagram illustrating a representative method of scheduling various tasks in the email authorization system by the task scheduler in FIG. 4.\n(18) FIGS. 18A and 18B (hereafter FIG. 18) illustrate an example blockchain ledger data structure in a blockchain network that implements the technology disclosed.\nDETAILED DESCRIPTION\n(19) The following description is presented to enable any person skilled in the art to make and use the invention, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present invention. Thus, the present invention is not intended to be limited to the embodiments shown but is to be accorded the widest scope consistent with the principles and features disclosed herein.\n(20) Email, short for Electronic Mail, is a method of exchanging messages between people using electronics. Email operates across computer networks, which today is primarily the Internet. Email messages consist of two major sections, the message header, and the message body, collectively known as content. The header is structured into fields such as From (specifying the sender), To (specifying one or more recipients), Subject, Date, and other information about the email. The body contains the message as unstructured text. In addition to the message body, images, multimedia or documents can also be attached to emails.\n(21) An email server is a computer processor that serves as an electronic post office for emails. Emails exchanged across networks is passed between email servers. Email servers can run an email server software which is built around agreed-upon, standardized protocols for handling emails. An example of such a protocol is Simple Mail Transfer Protocol (SMTP). Various computer software that can be used to run an email server includes Novell Groupwise™, Lotus Notes™, Microsoft Exchange Servers™, Sendmail™, Postfix™, and Exim™. An email server can also run as a web-based email platform, such as Gmail™, Hotmail™, or Yahoo! Mail™. Most email server systems are based on a store-and-forward model where email servers accept, forward, deliver, and store messages for email users. Neither the users nor their email receiving devices are required to be online continuously to receive or send emails; they need to connect only briefly for as long as it takes to send or receive messages. In the process of transporting email messages between email servers, SMTP communicates delivery parameters and information using email message header fields.\n(22) In order to send or receive emails, an email user can use an email account on an email server. An email address identifies an email account to which email messages to the user are delivered. The general format of an email address is local-part@domain, and a specific example is jsmith@example.com. The part before the @ symbol (local-part) identifies the name of the email account. This is often the username of the recipient, e.g., j smith. The part after the @ symbol (domain) is a domain name that represents the administrative realm for the email account, e.g., an email server's domain name, example.com. A single email account may receive emails from multiple email addresses. Email channels are, for the purposes of this disclosure, a communication link on which emails in the system of email servers are transported among email servers and email clients. A recipient email channel can include a number of nodes, including an email client associated with the recipient email address, and email servers acting as email transfer agents in the network for the recipient email address. An “inbox” is used herein to refer to a mailbox folder for the recipient email address designated to act as a delivery point for newly-delivered emails in an email channel. In a typical email client, incoming emails from the email channel or channels serving the email client are placed in an inbox, and can be presented as inbox emails on a user interface on the platform in use by the email client. A client may have more than one message folder acting as inboxes, and sets of rules in place to direct emails to particular message folders.\n(23) In addition to sending and receiving emails, an email user can also maintain a “contact list” to store email addresses and other contact information of known contacts. In some embodiments, email domains and Internet Protocol (IP) addresses can also be stored in an email user's contact list. Such contact lists are typically deployed to assist composition of emails to be sent, and to provide information associated with the senders of emails that have been delivered to the email client.\n(24) In some embodiments, the email authorization system can be used in conjunction with one or more spam filtering methods.\n(25) FIG. 1 illustrates the process flow **100** of an email authorization system that processes emails in an email channel to a recipient email. In some embodiments, the actions in the process flow may be performed in different orders and/or with different, fewer or additional actions than those illustrated in FIG. 1. Multiple actions can be combined in some implementations.\n(26) The email authorization system begins at step **110** by selecting emails from an email channel to a recipient's email address using a classification procedure, such as a filter. The email channel may be monitored for new emails, such as by periodically polling a message folder in the email channel at an email client, or by configuring the email channel to forward new emails to a designated message folder used by the classification procedure. In some embodiments, the monitoring of the email channel includes periodically accessing the email recipient's primary inbox to identify new emails. In other embodiments, the monitoring of the email channel can include accessing a message folder other than the primary inbox, through which incoming emails may be buffered in the email channel before delivery to the primary inbox. The email authorization system includes a procedure that traverses email inbox folders, or other points in an email channel, of registered email addresses in some embodiments, removing particular selected emails from the email inbox folders (or other point), and saving the particular selected emails in a folder or folders for unauthorized emails for the registered email accounts. The email authorization system selects emails for processing by applying the classification procedure to emails in email channels of registered email accounts\n(27) A filter to be used for classification of incoming emails can be composed using identifying parameters associated with emails. Emails classified, using the filter or other procedure, as unauthorized can be tagged so that the email client is notified of the unauthorized status, or so that the unauthorized email can be moved into a message folder designated for unauthorized emails, and out of the inbox.\n(28) The identifying parameters used in a filter can include for example components in an email message header, e.g., sender email address, email address domain, IP address from which the email originated, etc. In some embodiments, the recipient's contact list can be used to populate the filter applied for email to that recipient. A filter based on known contacts can be referred to as a “whitelist” filter, as opposed to a “blacklist” filter in which the filter is based on known or suspected spam emails. For an example of a whitelist, if an email address of the sender, domain of the email address, or IP address from which the email originated, includes an identifying parameter set in the filter based on a contact list, the email is not selected. If the email does not include an identifying parameter set in the filter based on the known contact list, such as one of the addresses of the sender, the domain of the email address, or IP address from which the email originated, the email is selected by the email authorization system as an unauthorized email. Any email not selected by the email authorization system may be classified as authorized, and moved into, or left in, the recipient's inbox, or otherwise identified as an authorized email.\n(29) Process flow **100** continues at step **120** where the email authorization system tags the selected emails as being unauthorized. As described herein, “tagging” an email indicates the email authorization system classified the email as unauthorized, and can comprise setting a parameter associated with the selected email enabling it to be marked in a user interface as unauthorized. Also, tagging the emails can include causing it to be removed from the inbox or other message folder at the recipient client, and causing it to be stored in a message folder designated for unauthorized emails and other actions related to storage of the email. In some embodiments, a tagged email is moved to a secondary folder in the recipient's email account, such as an “unauthorized” folder. As described herein, an “unauthorized” folder is a folder in the email account that stores tagged emails that have not been authorized by the email authorization system to be included in the recipient's email inbox. In some embodiments, the selected email may initially be placed in the inbox folder and then removed from the recipient's inbox after being tagged by the email authorization system. In some embodiments, the email authorization system may apply the filter to, and tag, an email in the email channel before the email reaches the recipient's inbox and redirect the tagged email to a location other than the recipient's inbox.\n(30) Referring to FIG. 1, at step **130**, the email authorization system establishes a blockchain address for the selected emails. In some embodiments, the blockchain address is randomly generated using a public key associated with a private key that is used to encrypt transactions associated with the address. The public key/private key pair can be produced using public key cryptography. Public key cryptography uses pairs of keys: (i) public keys which may be disseminated widely, and (ii) private keys which are known only to the owner of the key. Public key cryptography accomplishes two functions: authentication, which is when the public key can be used to verify that a holder of the paired private key sent the message, and encryption, whereby only the holder of the paired private key can decrypt the message encrypted with the public key. In a public key cryptography system, any person can encrypt a message using the public key of the receiver, but such a message can be decrypted only with the receiver's private key.\n(31) In one embodiment, the private key used to produce the blockchain address of particular selected emails of an email recipient is generated and stored in a digital “wallet” of the email recipient. A digital wallet is a software program that maintains blockchain addresses and private keys held by the account holders, and supports the execution of blockchain transactions by which users send or receive cryptocurrency, pay for goods or save cryptocurrency.\n(32) Cryptocurrency is a digital asset designed to work as a medium of exchange to secure transactions between two parties using cryptography. Numerous digital wallets exist today such as Coinbase™, Bread Wallet™, Mycelium™, Exodus™ Copay™, Jaxx™, Armory™, Trezor™, Ledger Nano™, Green Address™ and Blockchain.Info™. In some embodiments, the email authorization system may host its own digital wallet.\n(33) Referring to FIG. 1, at step **140**, the email authorization system causes a message to be composed and sent to the sender of a particular selected email, prompting the sender to validate the selected email by executing a blockchain transaction associated with the blockchain address created for the selected email. The message can include links or software to facilitate or enable the execution of a blockchain transaction having specified characteristics.\n(34) In one embodiment, the blockchain transaction involves causing the blockchain network to add a record in the blockchain ledger that includes the specified characteristics required for authorization of the selected emails, such as a transfer of a predetermined type of token from the sender of the selected email to the recipient, transfer of a specified amount of cryptocurrency, or performance of a condition or obligation of a blockchain contract. On completion of the blockchain transaction, a party monitoring the blockchain network will be able to detect the completion of the blockchain transaction. As described herein, “token” is a means to enable the authorization of an email, selected and tagged by the email authorization system, for its intended recipient's inbox. In one embodiment, cryptocurrencies can be used as a form of token. Numerous cryptocurrencies exist today such as Bitcoin™, Ethereum™, Credo™ Bitcoin Cash™, Ripple™, Litecoin™, Dash™, Peercoin™, Namecoin™, Dogecoin™ Primecoin™, and Mastercoin™. For techniques described herein, any form of cryptocurrency can be used as tokens to execute a blockchain transaction.\n(35) The sender validates the particular selected email by executing the blockchain transaction associated with the blockchain address created for the selected email, and the executed transaction is recorded in a blockchain ledger in a blockchain network. The blockchain transaction is broadcasted to a blockchain network, specifying the blockchain address and the characteristics of the transaction, such as an amount of cryptocurrency that has been transferred.\n(36) A blockchain network hosts multiple open, distributed blockchain ledgers that can record cryptocurrency transactions between two parties efficiently and in a verifiable and permanent way. The safety, integrity, and balance of all blockchain networks are ensured by a group of mutually distrustful parties, referred to by terms such as miners or stakers, who actively protect the network by maintaining a consensus algorithm. In some embodiments, the consensus algorithm may be the proof-of-stake algorithm (PoS). Other consensus algorithms that can be used for techniques described herein are the practical Byzantine fault tolerance algorithm (PBFT), the proof-of-work algorithm (PoW), the delegated proof-of-stake algorithm (DPoS), the proof-of-authority algorithm (PoA) and the proof-of-importance algorithm (PoI). Each time a blockchain transaction is broadcasted on the blockchain network, a “miner” processes the blockchain transaction to ensure that all the information in the blockchain transaction is correct and then updates the blockchain network. For a blockchain transaction to be confirmed, it must be included in a “block” along with a mathematical proof performed by the miner based on the consensus algorithm employed by the blockchain network. These proofs are very difficult to generate and are designed to depend on the previous block, making it exponentially difficult to reverse previous blockchain transactions. Validation (or confirmation) of a blockchain transaction in a blockchain network may require confirmations on the blockchain network, with each successive confirmation adding greater confidence that a blockchain transaction is valid. A confirmation means that there is a consensus on the network that, for example, cryptocurrency involved in the transaction has not been sent to anyone else and is the property of the email recipient.\n(37) Referring to FIG. 1, at step **150**, the email authorization system maintains a list of unauthorized emails, and with information identifying the characteristics of the blockchain transaction prompted for each in the return emails. The email authorization server detects executed blockchain transactions in the blockchain ledgers in the blockchain network associated with the blockchain addresses of emails in the list of unauthorized emails. For detected transactions, the authorization server verifies that it matches the prompted transaction for an email tagged unauthorized. In one embodiment, detection of the blockchain transactions is accomplished by notification from a digital wallet service, which may notify the email authorization system of the completed execution of the blockchain transaction. In another embodiment, the email authorization server detects blockchain transactions by polling the blockchain for new blocks containing transactions for the blockchain addresses of the unauthorized emails. At step **160**, the email authorization system authorizes the selected emails if the selected emails have been validated by a prompted blockchain transaction which has been confirmed as executed. The authorization can be executed by removing the unauthorized tag, by moving the email out of the unauthorized list into the recipient's email channel or inbox, or otherwise.\n(38) The process of FIG. 1 can be implemented using a computer system storing computer software for execution which has access to the email channels of registered users. The network node can be implemented on a machine coupled to the internet including, in some embodiments, the same machine as is used by email recipients, and in other embodiments, a cloud-based server, and in other embodiments, any point of presence on a network connected to the internet.\n(39) The computer software implementing the process of FIG. 1 can be stored in computer-readable memory, or other non-transitory data storage medium, for the purposes of distribution to machines to execute the procedures, or for access by a processor or processors executing the procedure.\n(40) System Overview\n(41) FIG. 2 illustrates an architectural level schematic of an environment in which an email authorization system executing a procedure like that of FIG. 1, is deployed in a network node **202** on the network. Because FIG. 2 is an architectural diagram, certain details are intentionally omitted to improve the clarity of the description. The discussion of FIG. 2 will be organized as follows. First, the elements of the figure will be described, followed by their interconnections.\n(42) The system **200** includes network nodes hosting email servers **206**, **208**, **210** and **212**, the network(s) **218**, a blockchain network **216**, an external wallet service **220**, and a network node **202** hosting an email authorization system **204**. As used herein, a network node is an active electronic device or virtual device that is attached to a network, and is capable of sending, receiving, or forwarding information over a communications channel. Examples of electronic devices which can be deployed as network nodes include all varieties of computers, workstations, laptop computers, handheld computers, and smartphones. Network nodes can be implemented in a cloud-based server system. More than one virtual device configured as a network node can be implemented using a single physical device. For the sake of clarity, only four network nodes hosting email servers and one external wallet service are shown to be connected to the network node **202** hosting an email authorization system **204** through the network(s) **218**. However, any number of network nodes hosting email servers and external wallet services can be connected to the network node **202** hosting an email authorization system **204** through the network(s) **218**.\n(43) The interconnection of the elements of system **200** will now be described. Network(s) **218** couples the network nodes hosting email servers **206**, **208**, **210** and **212**, the blockchain network **216**, the external wallet service **220**, and the network node **202** hosting the email authorization system **204**, all in communication with each other (indicated by solid double-arrowed lines). Email users **214** are connected to the network node **202** hosting the email authorization system **204** through network nodes hosting email servers **206**, **208**, **210** and **212**. Each email user has an email account in their respective email server. In some embodiments, email users **214** may include one or more individuals who utilize the functionality of an email authorization system to reduce unsolicited emails in their email inboxes. Various computer software that can be used to run an email server includes Novell Groupwise™, Lotus Notes™, Microsoft Exchange Servers™, Sendmail™, Postfix™, and Exim™. A web-based email platform, such as Gmail™, Hotmail™, or Yahoo! Mail™ can also be used. In the technology described herein, email servers hosted in network nodes **206**, **208**, **210** and **212** can use any of the platforms described. Users **214** can access their emails through many devices including in some examples the following devices: a smartphone, a personal computing (PC) device such as a desktop or laptop computer, a media center device or other PC derivative, portable media consumption device (mobile terminal, personal digital assistant (PDA), gaming and/or media console, etc.), a tablet computer, other consumer electronic device, or the like.\n(44) An email channel from an email server to an email client can be executed according to an email protocol like Internet Message Access Protocol IMAP, Post Office Protocol—Version 3 POP3 (other versions) and HTTP for web-based email interfaces. See, Crispin, “Internet Message Access Protocol—Version 4rev1”, RFC 3501, March 2003; Myers, “Post Office Protocol—Version 3,” RFC 1939, May 1996. An email channel between email servers acting as message transfer agents can be executed according to a protocol such as Simple Mail Transfer Protocol (SMTP). See, Klensin, J., “Simple Mail Transfer Protocol,” RFC 5321, DOI 10.17487/RFC5321, October 2008, <http://www.rfc-editor.org/info/rfc5321>, which is incorporated herein by reference. Alternatives, such as proprietary email servers, can execute different protocols to carry emails on an email channel to an email recipient. In addition to protocols, email clients can access email servers via application programming interfaces (APIs).\n(45) The actual communication path through the internet can be point-to-point over public and/or private networks. The communications can occur over a variety of networks **218**, e.g., private networks, VPN, MPLS circuit, or Internet, and can use appropriate application programming interfaces (APIs) and data interchange formats, e.g., Representational State Transfer (REST), JavaScript™ Object Notation (JSON), Extensible Markup Language (XML), Simple Object Access Protocol (SOAP), Java™ Message Service (JMS), and/or Java Platform Module System. All of the communications can be encrypted. The communication is generally over a network such as the LAN (local area network), WAN (wide area network), telephone network (Public Switched Telephone Network (PSTN), Session Initiation Protocol (SIP), wireless network, point-to-point network, star network, token ring network, hub network, Internet, inclusive of the mobile Internet, via protocols such as EDGE, 3G, 4G LTE, Wi-Fi, and WiMAX. Additionally, a variety of authorization and authentication techniques, such as username/password, Open Authorization (OAuth), Kerberos, SecureID, digital certificates and more, can be used to secure the communications.\n(46) The blockchain network **216** is a distributed and public ledger which maintains records of all the blockchain transactions on the blockchain. In some embodiments, the blockchain network is a peer-to-peer network and does not require a central authority or trusted intermediaries to authenticate or to settle the transactions or control the underlying infrastructure. Examples of popular blockchain platforms include Ethereum™, Eris™, Multichain™, Bitcoin™, Hyperledger Fabric™, and Hyperledger Corda™.\n(47) Users **214** can maintain a cryptocurrency balance and send or receive cryptocurrency through the external wallet service **220**. Examples of popular wallets include Coinbase™, Bread Wallet™, Mycelium™, Exodus™, Copay™, Jaxx™ Armory™, Trezor™, Ledger Nano™, Green Address™, and Blockchain.Info™.\n(48) The network node **202** hosts an email authorization system **204**. FIG. 3 is a simplified block diagram of a network node that can be used to implement email authorization system **204**. Network node **202** typically includes an operating system executed by a processor subsystem **314** which communicates with a number of peripheral devices via bus subsystem **312**. These peripheral devices may include a storage subsystem **324**, comprising a memory subsystem **326** and a file storage subsystem **328**, user interface input devices **322**, user interface output devices **320**, and a network interface subsystem **316**. The input and output devices allow user interaction with network node **202**. Network interface subsystem **316** provides an interface to outside network **218** and is coupled via network **218** to other elements in system **200**. The physical hardware components of network interfaces are sometimes referred to as network interface cards (NICs), although they need not be in the form of cards; for instance they could be in the form of integrated circuits (ICs) and connectors fitted directly onto a motherboard, or in the form of macrocells fabricated on a single integrated circuit chip with other components of the computer system.\n(49) User interface input devices **322** may include a keyboard, pointing devices such as a mouse, trackball, touchpad, or graphics tablet, a scanner, a touchscreen incorporated into the display, audio input devices such as voice recognition systems, microphones, and other types of input devices. In general, use of the term “input device” is intended to include all possible types of devices and ways to input information into network node **202** or onto network **218**.\n(50) User interface output devices **320** may include a display subsystem, a printer, a fax machine, or nonvisual displays such as audio output devices. The display subsystem may include a cathode ray tube (CRT), a flat-panel device such as a liquid crystal display (LCD), a projection device, or some other mechanism for creating a visible image. The display subsystem may also provide a nonvisual display such as via audio output devices. In general, use of the term “output device” is intended to include all possible types of devices and ways to output information from network node **202** to the user or to another machine or network node. In particular, an output device of the network node **202** on which email authorization system **204** is implemented, may include a visual output informing a user of action recommendations made by the system, or may include a communication device for communicating action signals.\n(51) Storage subsystem **324** stores the basic programming and data constructs that provide the functionality of certain embodiments of the present invention. For example, the various modules implementing the functionality of certain embodiments of the invention may be stored in storage subsystem **324**. These software modules are generally executed by processor subsystem **314**.\n(52) Memory subsystem **326** typically includes a number of memories including a main random access memory (RAM) **330** for storage of instructions and data during program execution and a read-only memory (ROM) **332** in which fixed instructions are stored. File storage subsystem **328** provides persistent storage for program and data files, and may include a hard disk drive, a floppy disk drive along with associated removable media, a CD ROM drive, an optical drive, or removable media cartridges. The databases and modules implementing the functionality of certain embodiments of the invention may have been provided on a computer-readable medium such as one or more CD-ROMs, volatile memory, non-volatile memory, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs), DVDs (digital versatile discs or digital video discs), or other media capable of storing computer-readable media now known or later developed. The databases and modules implementing the functionality of certain embodiments of the invention may also be stored by file storage subsystem **328**. The host memory subsystem **326** contains, among other things, computer instructions which, when executed by the processor subsystem **314**, cause the computer system to operate or perform functions as described herein. As used herein, processes and software that are said to run in or on “the host”, “the computer” or “the network”, execute on the processor subsystem **314** in response to computer instructions and data in the host memory subsystem **326** including any other local or remote storage for such instructions and data.\n(53) Bus subsystem **312** provides a mechanism for letting the various components and subsystems of network node **202** communicate with each other as intended. Although bus subsystem **312** is shown schematically as a single bus, alternative embodiments of the bus subsystem may use multiple busses.\n(54) Network node **202** itself can be of varying types including a personal computer, a portable computer, a workstation, a computer terminal, a network computer, a television, a mainframe, a server farm, a widely-distributed set of loosely networked computers, or any other data processing system or user device. Due to the ever-changing nature of computers and networks, the description of network node **202** depicted in FIG. 3 is intended only as a specific example for purposes of illustrating the preferred embodiments of the present invention. Many other configurations of network node **202** are possible having more or less components than the system depicted in FIG. 3.\n(55) In some embodiments, the email authorization system **204** can be implemented in the network node **202** as a Software-as-a-Service (SaaS) application, a web-architected application or a cloud-delivered service. Examples of common SaaS applications today include Salesforce.Com™, Box™, Dropbox™, Google Apps™ Amazon Web Services AWS™, Microsoft Office 365™, Workday™, Oracle on Demand™, Taleo™, Yammer™, and Concur™. SaaS applications provide functionalities to users that are implemented in the cloud, and that are the target of policies, e.g., logging in, editing user information, updating whitelists, deleting contacts from the contact list, in contrast to the offerings of simple websites and e-commerce sites. Note that a SaaS application can be supported by both web browser clients and application clients that use URL-based APIs (application programming interfaces).\n(56) The technology disclosed herein can be implemented in the context of any computer-implemented system including a database system, a multi-tenant environment, or a relational database implementation like an Oracle™ compatible database implementation, an IBM DB2 Enterprise Server™ compatible relational database implementation, a MySQL™ or PostgreSQL™ compatible relational database implementation or a Microsoft SQL Server™ compatible relational database implementation or a NoSQL™ non-relational database implementation such as a Vampire™ compatible non-relational database implementation, an Apache Cassandra™ compatible non-relational database implementation, a BigTable™ compatible non-relational database implementation or an HBase™ or DynamoDB™ compatible non-relational database implementation. In addition, the technology disclosed can be implemented using different programming models like MapReduce™, bulk synchronous programming, MPI primitives, etc. or different scalable batch and stream management systems like Apache Storm™, Apache Spark™, Apache Kafka™, Apache Flink™ Truviso™, Amazon Elasticsearch Service™, Amazon Web Services™ (AWS), IBM Info-Sphere™, Borealis™, and Yahoo! S4™.\n(57) Email Authorization System\n(58) FIG. 4 illustrates an example of an email authorization system **204**. The email authorization system **204** includes software components referred to herein as a new user processor **412**, a filter synchronizer **414**, a new email processor **416**, a new blockchain transaction processor **420** and a task scheduler **422**. These components can be distributed between nodes executing email servers and remote nodes in the network in some embodiments.\n(59) The new user processor **412** oversees the sign-up process for registration of new email authorization system users to identify and enable monitoring of email channels of registered recipients in the system. The filter synchronizer **414** maintains the filter used for classifying emails as unauthorized, such as by executing a routine that periodically checks for new contacts in user's contact list to be added to user's filter. The new email processor **416** periodically traverses email channels of registered recipients, and classifies new emails using a filter, creates blockchain addresses for each selected email, and causes the sending of a message to the senders of the selected emails prompting the senders to gain authorization for the selected emails by executing blockchain transactions. The new blockchain transaction processor **420** periodically checks for new blockchain transactions in the blockchain network **216**, verifies that the blockchain transaction satisfies the requirements of the prompted transaction and identifies the selected emails as authorized, enabling for example, moving them to users' inboxes if the blocked transactions are verified. The task scheduler **422** schedules various tasks in the email authorization system **204**, such as requesting the filter synchronizer **414** to check for new contacts in users' contact lists, requesting the new email processor **416** to check for new emails, and requesting the new blockchain transaction processor **420** to check for new blockchain transactions in the blockchain network **216**. In some embodiments, the email authorization system **204** may also host an internal wallet service **424** for email authorization system users who wish to store their cryptocurrency balance using the email authorization system **204**.\n(60) The email authorization system also includes a user database **402**, a registered email account database **404**, a filter database **406**, an unauthorized email database **408** storing emails tagged as unauthorized, and a blockchain address for unauthorized email database **410**. As used herein, the term “database” does not necessarily imply any unity of structure. For example, two or more separate databases, when considered together, still constitute a “database” as that term is used herein. Databases can include tables. In some embodiments, the user and registered email account data is stored in separate tables within a single database.\n(61) FIG. 5 is a symbolic drawing indicating how the user database **402** in FIG. 4 can be organized, according to an embodiment. The user database **402** contains information regarding the email authorization system users. The user database **402** includes a unique user ID **502** for each user, user's name **504**, and a parameter (expected token) **506** specifying a characteristic of a blockchain transaction, such as a number or type of tokens or cryptocurrency value, which must be satisfied for authorization of the email for the recipient. In some embodiments, the user database **402** can have separate entries for the first name and surname of the user. As shown in FIG. 5, example of user entries include user John E. Murphy with user ID **1001** who expects 400 tokens to respond to an email from an unknown sender, user Kristine B. Odaniel with user ID **1004** who expects 100 tokens to respond to an email from an unknown sender, and user Carl N. Brewington with user ID **1005** who expects 2000 tokens to respond to an email from an unknown sender. In some embodiments, a characteristic such as an expected cryptocurrency value or token type or amount (expected token) **506** is set by the user. In some embodiments, the expected characteristic (expected token) **506** is a default set by the email authorization system. In some embodiments, the user database **402** can include the private keys of any external wallet service/internal wallet **508**, e.g., John E. Murphy with user ID **1001** and Carl N. Brewington with user ID **1005**. In some embodiments, the user database **402** may include other optional user information **510** that might be helpful for the functionality of the email authorization system **204**, e.g., the password for the user account, the timestamp of last sign in, the timestamp for user account creation, user's organization, profile picture, and so on.\n(62) FIG. 6 is a symbolic drawing indicating how the registered email account database **404** in FIG. 4 may be organized, according to an embodiment. The registered email account database **404** contains information regarding the email accounts the email authorization system has permission to access for the purpose of executing the authorization service. The registered email accounts database **404** includes a unique email account ID **602** for each email account. The owner of the email account is identified by the owner's user ID **502**. The registered email account database **404** further includes a registered email address **604** associated with the email account, and an email account type **606**. The email account type **606** specifies the email platform used by the email server hosting the email account. Example email platforms include Novell Groupwise™, Lotus Notes™, Microsoft Exchange Servers™, Sendmail™, Postfix™, Exim™, Gmail™, Hotmail™, and Yahoo! Mail™. In some embodiments, a user, may have information for one registered email account, e.g., user Kristine B. Odaniel with user ID **1004** with one email account with email account ID **105** and email address daniel@toprecruiters.com on a Gmail™ email platform, and user Carl N. Brewington with user ID **1005** with one email account with email account ID **106** and email address CarlNBrewington@yahoo.com on a Yahoo! Mail™ email platform. In some embodiments, a user may have information for two or more registered email accounts, e.g., user John E. Murphy with user ID **1001** with one email account with email account ID **101** and email address JohnEMurphy@teleworm.us on a Outlook™ email platform, and one email account with email account ID **102** with email address JohnEMurphy@gmail on a Gmail™ email platform. In some embodiments, the user's email account might be hosted in an unconventional email platform; for such email accounts, Internet Message Access Protocol (IMAP) and SMTP URLs are stored. In some embodiments, the registered email account database **404** may further include other optional information **608** that might be helpful for the functionality of the email authorization system **204**, e.g., last time contact list from the particular email account was synched with the user's filter, timestamp for account creation, last time account was updated and so on.\n(63) FIG. 7 is a symbolic drawing indicating how the filter database **406** in FIG. 4 may be organized, according to an embodiment. The filter database **406** contains information regarding a user's filter for each user in the email authorization system **204**. A user's filter is composed using identifying parameters associated with emails. The identifying parameters can include components in an email message header, e.g., sender email address, email address domain, IP address from which the email originated, etc. In some embodiments, a user's filter can be composed of email addresses, domains already included in user's contact list in the user email account. Emails from the known contacts in the filter database **406** can be automatically forwarded to the users' email inboxes. The filter database **406** includes allowed email address **702** for a user identified by user ID **502**. In some embodiments, a user may also include certain domains, e.g., user Kristine B. Odaniel with user ID **1004** allows any email from the domain yahoo.com. In some embodiments, any information in an email's message header can be included in a user's filter in the filter database **406**. In some embodiments, the filter database **406** may further include other optional information **704** that might be helpful for the functionality of the email authorization system **204**, e.g., timestamp for when the filter entry was created, timestamp for when the filter entry was last updated, whether the filtered member has been notified by email of inclusion in the user's filter and so on.\n(64) FIG. 8 is a symbolic drawing indicating how the unauthorized email database **408** in FIG. 4 is organized, according to an embodiment of the invention. The unauthorized email database **408** contains information regarding tagged, unauthorized emails from the users' registered email accounts. The unauthorized email database **408** identifies each unauthorized email with an email ID **802**. The unauthorized email database **408** further includes the email subject **804**, the email account ID **602** of the registered email account from which the email authorization system retrieved the email, the email sender's address **806**, the current folder **808** in which the unauthorized email resides in the originating email server, and whether the blockchain transaction (token) has been received **810** and verified, that is required to release the blocked, unauthorized email. In some embodiments, blocked, unauthorized emails are kept in an “unauthorized” folder (alternatively labeled “unpaid” folder when the blockchain transaction includes a transfer of cryptocurrency) at the email server end. In some embodiments, the unauthorized email database **408** may further include other optional information **812** that might be helpful for the functionality of the email authorization system **204**, e.g., timestamp for when the email entry was created, timestamp for when the email entry was last updated, whether the message prompting the sender to authenticate the email has been delivered, and so on. As shown in FIG. 8, spam emails such as the email with subject “GET PAID $500/hr” with email ID 1 and the email with subject “\\*\\*\\*FREE VACATION\\*\\*\\*” with email ID 3 are rarely authenticated by their senders, and the email authorization system **204** does not authorize their release to the recipients' email inbox. However, genuine cold emails such as the email with subject “Invitation to join ACM Artificial Intelligence Committee” with email ID 4 have been validated by the sender with email address “ProfDoLittle@cs.umn.edu,” and the email authorization system **204** has authorized its release to the recipient's email inbox.\n(65) FIG. 9 is a symbolic drawing indicating how the blockchain address for unauthorized email database **410** in FIG. 4 is organized, according to an embodiment of the invention. The blockchain address for unauthorized email database **410** includes the email ID **802** for each unauthorized email, the email blockchain address **902** being created by the email authorization system **204**, and whether a blockchain transaction with the corresponding blockchain address has been made **904**. In some embodiments, the blockchain address for unauthorized email database **410** may further include other optional information **906** that might be helpful for the functionality of the email authorization system **204**.\n(66) Signup Process for a New Email Authorization System User\n(67) FIG. 10 is an example workflow **1000** illustrating a representative method of processing a new user in the email authorization system **204** by the new user processor **412** in FIG. 4. In some embodiments, the actions in the workflow may be performed in different orders and with different, fewer or additional actions than those illustrated in FIG. 10. Multiple actions can be combined in some implementations.\n(68) FIG. 10 includes workflow **1000** that begins at step **1006**, when a new user **1002** signs up by providing an email account and the email server information associated with the email account to the new user processor **412** in the email authorization system **204**. In some embodiments, the email authorization system **204** will be able to detect the email server information automatically by the email address provided by the new user **1002**. In some embodiments, the new user **1002** may provide information about more than one email account.\n(69) Workflow **1000** continues at step **1008** where the new user **1002** provides information about an external wallet to the new user processor **412** in the email authorization system **204**, or the user might submit a request for an account in the email authorization system's internal wallet. At step **1010**, the new user processor **412** adds the new user's **1002** information to the user database **402**. At step **1012**, the new user processor **412** adds the email account(s) information of the new user **1002** to the registered email account database **404**. At step **1014**, the new user processor **412** accesses the email server hosting the new user's email account **1004** for the new user's contact list. At step **1016**, the new user processor **412** adds the contacts and domains in the new user's contact list to the user's filter in the filter database **406**. The added filter database entries can be identified by the user ID of the new user. At step **1018**, the new user processor **412** creates a folder for authorized emails in the new user's email account hosted in email server **1004**. At step **1020**, if requested by the new user **1002**, the new user processor **412** creates an internal wallet account for the new user **1002** in the internal wallet service **424**.\n(70) Filter Synchronization\n(71) FIG. 11 is an example workflow **1100** illustrating a representative method of synching a user's filter in the filter database **406** with users' contact lists located in the user email account by the filter synchronizer **414** in FIG. 4. In some embodiments, the actions in the workflow may be performed in different orders and/or with different, fewer or additional actions than those illustrated in FIG. 11. Multiple actions can be combined in some implementations.\n(72) FIG. 11 includes workflow **1100** that begins at step **1104**, the filter synchronizer **414** in the email authorization system **204** accesses the registered email account database **404** to access email account and server information for a registered user's email account in the registered email account database **404**. Workflow **1100** continues at step **1106** where the filter synchronizer **414** retrieves information about new contacts from a user's contact list in the email server **1102** hosting the user's email account. At step **1108**, the filter synchronizer **414** adds the newly retrieved contacts from the user's contact list to the user's filter in the filter database **406**. The added entries in the filter database **406** can be identified by the user ID of the owner of the email account.\n(73) Processing of New Emails\n(74) FIG. 12 is an example workflow **1200** illustrating a representative method of processing an email from a known sender by the new email processor **416** in the email authorization system **204**. In some embodiments, the actions in the workflow may be performed in different orders and/or with different, fewer or additional actions than those illustrated in FIG. 12. Multiple actions can be combined in some implementations.\n(75) FIG. 12 includes workflow **1200** that begins at step **1206** when an email sender **1202** sends an email to a recipient. As used herein, a “recipient” is an email authorization system user, who has one or more email accounts registered with the system. The sender **1202** is known to the recipient as the sender's information is already included in the recipient's contact list and filter. The email is saved in a message folder, such as an inbox, for the recipient's email account in the email server **1204**. Workflow **1200** continues at step **1208** where the new email processor **416** accesses recipient's email account information in the registered email account database **404**. At step **1210**, the new email processor **416** accesses the recipient's email account hosted by the email server **1204** with the email account information retrieved at step **1208**. The email from the known sender **1202** from step **1206** is included among the new emails. At step **1212**, the new email processor **416** applies the filter to the new emails in the email channel to check whether the known sender's email address or email address domain is listed in the recipient's filter stored in the filter database **406**. As the sender's email address or email address domain is included in the filter database **406**, the new email processor **416** in the email authorization system **204** can then redirect the email to the email inbox folder of the recipient's email account in the email server **1204** at step **1214**.\n(76) FIG. 13 is an example workflow **1300** illustrating a representative method of processing an email from an unknown sender (e.g., an email selected using the filter) by the new email processor **416** in the email authorization system **204**. In some embodiments, the actions in the workflow may be performed in different orders and/or with different, fewer or additional actions than those illustrated in FIG. 13. Multiple actions can be combined in some implementations.\n(77) FIG. 13 includes workflow **1300** that begins at step **1306** when an unknown email sender **1302** sends an email to a recipient. The email is delivered to the email channel of the recipient email account, in which in some embodiments it is saved in a message folder for the recipient's email account in the email server **1304**. Workflow **1300** continues at step **1308** when the new email processor **416** accesses recipient's email account information in the registered email account database **404**. At step **1310**, the new email processor **416** accesses the recipient email account hosted by the email server **1304** with the email account information retrieved at step **1308**. The email from the unknown sender **1302** from step **1306** is included among the new emails. At step **1312**, the new email processor **416** checks whether the sender's email address or email address domain is listed in the recipient's filter stored in the filter database **406**. As the sender's email address or email address domain is not included in the filter database **406**, the new email processor **416** in the email authorization system **204** classifies the email as unauthorized. The selected email classified as unauthorized is redirected in this example to an unauthorized email folder of the recipient's email account in the email server **1304** at step **1314**. At step **1316**, the new email processor **416** creates a new blockchain address for the email. At step **1318**, the new email processor **416** sends, or causes the email server to send, an email or message tagged with the blockchain address created at step **1316** to unknown sender **1302** and prompts execution of a certain transaction having specified characteristics, such as an amount of cryptocurrency, to enable the tagged email to be authorized for the recipient. In some embodiments, the new email processor **416** causes the email or message to be sent from email server **1304** having the recipient's email addresses as a sender address. In another embodiment, the new email processor **416** causes the email or message to be sent to the unknown sender on behalf of the email authorization system **204**. At step **1320**, the new email processor **416** saves the email in the unauthorized email database **408**. At step **1322**, the new email processor **416** saves the blockchain address created at step **1316** in the blockchain address for unauthorized email database **410**.\n(78) FIG. 14 illustrates an example message **1400** returned to the sender of tagged emails, prompting execution of a blockchain transaction in accordance with an implementation. The transaction can be prompted by text or icons in the email, with an associated link to tools, such as a web interface to a transaction composition engine, or a widget when selected causes initiation of code that composes the transaction or messages required to execute the transaction. The message **1400** prompts the unknown sender to validate the email by executing a blockchain transaction, such as transferring a certain number of tokens or amount of cryptocurrency to a blockchain address assigned to the tagged email, and logged by the email recipient. The prompts can include links to more than one type of blockchain transaction, such as transactions using available alternative types of cryptocurrencies **1402**, reflected by tags in message **1400** in this example, and included in the illustrated example icons for Bitcoin™, Credo™, and Tezos™. The message carries an active link to tools that can execute the blockchain transaction, that is selected by selecting a chosen one of the types of cryptocurrency. Thus, characteristics of the blockchain transaction in this example include an amount of cryptocurrency of one of the available types shown in the message, and a value of the cryptocurrency. The message **1400** also carries the blockchain address, or a link to the blockchain address, created by the new email processor **416**. The sender can opt to complete the blockchain transaction using the linked tools. The linked tools can enable the use of an internal or external wallet service. The blockchain transaction includes adding a record of the blockchain transaction into the blockchain ledgers in the blockchain network **216** with the tagged blockchain address.\n(79) The message also includes a link to a tool **1404** that causes sending of a request from the sender of the tagged email to the recipient, requesting that the sender's email account be added to the filter to enable delivery to the recipient without requiring execution of the blockchain transaction. In some embodiments, the request can be included in a blockchain transaction using the address of the tagged email. The authorization server can include a process for composing return emails linked to the individual blockchain addresses, and having the recipient email addresses identified as sender addresses in the return emails, as the messages are returned to senders.\n(80) Processing of New Blockchain Transactions\n(81) FIG. 15 illustrates a representative method **1500** for the unknown sender **1302** to complete a blockchain transaction to authorize the release of the tagged email. At step **1506**, the unknown sender **1302** completes the blockchain transaction through the sender wallet service **1502**. In one embodiment, the unknown sender **1302** may use the service of an external wallet. In one embodiment, the unknown sender **1302** may be an email authorization system user and may use the internal wallet service **424** of the email authorization system **204**. The sender wallet service **1502** broadcasts the blockchain transaction to the blockchain network **216** at step **1508**. The blockchain transaction is entered into the blockchain ledgers in the blockchain network **216**. After the blockchain transaction is verified in a blockchain network **216**, the transfer of the cryptocurrency is logged in the recipient's wallet **1504** at step **1510**. In one embodiment, the user may use the service of an external wallet. In one embodiment, the recipient may use the internal wallet service **424** of the email authorization system **204**. For clarity sake, network(s) **218** is not included in FIG. 15.\n(82) FIG. 16 is an example workflow **1600** illustrating a representative method of processing new blockchain transactions in the blockchain network **216** by the new blockchain transaction processor **420** in the email authorization system **204**. In some embodiments, the actions in the workflow may be performed in different orders and/or with different, fewer or additional actions than those illustrated in FIG. 16. Multiple actions can be combined in some implementations.\n(83) FIG. 16 includes workflow **1600** that begins at step **1604**, when the new blockchain transaction processor **420** retrieves information about pending blockchain transactions from the blockchain address for unauthorized email database **410**, including blockchain addresses of the pending transactions. The Workflow **1600** continues at step **1606** where the new blockchain transaction processor **420** checks the blockchain ledgers in the blockchain network **216** to determine whether any pending blockchain transaction has been completed against the retrieved blockchain addresses in unauthorized email database **410**. At step **1608**, if a pending transaction has been completed, the blockchain transaction processor **420** checks if the token is received, or other characteristics required, from the completed blockchain transaction matching the expected token of the email recipient. At step **1610**, if the token received from the completed blockchain transaction matches the expected token, the new blockchain transaction processor **420** marks the email as authorized. The email server can then transfer the authorized email to a designated message folder such as the recipient's primary email inbox in the recipient's email account in email server **1304**. At step **1612**, the new blockchain transaction processor **420** updates the information for the authorized email in the unauthorized email database **408** to specify that the blockchain transaction has been completed and the email has been released.\n(84) In some embodiments, the new blockchain transaction processor **420** may get a notification from the unknown sender's wallet service or the recipient's wallet service that a blockchain transaction has been completed. In such cases, the blockchain transaction processor **420** may check if the token received from the completed blockchain transaction matches the expected token of the email recipient. If the token received, or other characteristics required, from the completed blockchain transaction matches the expected characteristic, the new blockchain transaction processor **420** marks the email as authorized, and the authorized email can be moved from the unauthorized folder to the recipient's email inbox in the recipient's email account.\n(85) Email Authorization System Scheduler\n(86) FIG. 17 is an example workflow **1700** illustrating a representative method of scheduling various tasks by the task scheduler **422** in the email authorization system **204**. In some embodiments, the actions in the workflow may be performed in different orders and/or with different, fewer or additional actions than those illustrated in FIG. 17. Multiple actions can be combined in some implementations.\n(87) In the workflow **1700**, the task scheduler **422** schedules various tasks in the email authorization system **204**, such as requesting the filter synchronizer **414** update the filter of each email authorization system user by checking for new contacts in user's contact list maintained in user's email account (step **1702**), requesting the new email processor **416** to check for new emails in each email authorization system user's email account (step **1704**), and requesting the new blockchain transaction processor **420** to check for new blockchain transactions in the blockchain network **216** (step **1706**). In some embodiments, the task scheduler **422** will request the filter synchronizer **414** to sync user's filter every six hours. In some embodiments, the task scheduler **422** will request the new email processor **416** to check for new emails every fifteen minutes. In some embodiments, the task scheduler **422** will request the new blockchain transaction processor **420** to check for new blockchain transactions in the blockchain network **216** every fifteen minutes.\n(88) Blockchain Transaction Block\n(89) Blockchain network **216** is maintained by a network of nodes where every node executes and records the same blockchain transactions. Each node in the blockchain network **216** includes a one or more distributed blockchain ledger data structure comprising a chain of blocks or “blockchain.” This blockchain ledger data structure is replicated among the nodes in the blockchain network **216**. FIG. 18A illustrates a segment of such a blockchain ledger data structure **1800**, consisting of blocks **1810**, **1820**, **1830** and **1840**. For the sake of clarity, only four blocks are included in FIG. 18A. Any number of blocks can be present in a blockchain structure.\n(90) Blockchain transactions **1806** are time-stamped and bundled into blocks where each block is identified by its cryptographic hash called the consensus proof **1802**. The consensus proof can be determined by a consensus algorithm. Consensus algorithms that can be used for techniques described herein are the proof-of-stake algorithm (PoS), the practical Byzantine fault tolerance algorithm (PBFT), the proof-of-work algorithm (PoW), the delegated proof-of-stake algorithm (DPoS), the proof-of-authority algorithm (PoA) and the proof-of-importance algorithm (PoI). One skilled in the art would appreciate that, in other implementations, the consensus proof can be determined by any consensus algorithm.\n(91) The blocks **1810**, **1820**, **1830**, **1840** form a sequence where each block references the consensus proof of the previous or parent block **1804**, forming a chain of blocks. In some embodiments, a special data structure called a Merkle tree is used to store the blockchain transactions.\n(92) New blocks can be created and added to the blockchain in a process called mining. The nodes in the blockchain network **216** that perform the mining operations are called miners or stakers. New blockchain transactions are broadcast to all the nodes on the network. Each miner node creates its own block by collecting the new blockchain transactions and then finds a consensus proof for its block by performing complex cryptographic computations. The miners validate the blockchain transactions and reach a consensus on the block that should be added next to the blockchain. The newly mined block, called the winning block, is then broadcast to the entire network.\n(93) Blockchain is an immutable and durable data structure which maintains a record of the blockchain transactions that are tamper-resistant. Once a blockchain transaction is recorded in a block, it cannot be altered or deleted as long as a majority of the computational power of the network is not controlled by peers who collude to alter the blockchain.\n(94) While each miner on the blockchain network **216** can create its own block, only the block which has a consensus proof of a given difficulty is accepted to be added to the blockchain. The consensus mechanism ensures that all the nodes agree on the same block to contain the canonical blockchain transactions. Blockchain offers enhanced security as compared to centralized systems as every transaction is verified by multiple miners. The integrity of the transaction data recorded in the blocks is protected through strong cryptography. In addition to the transaction data, each block contains a consensus proof of itself and the consensus proof of the previous block. Any attempts to modify a transaction would result in a change in the consensus proof and would require all the subsequent blocks to be recomputed. This would be extremely difficult to achieve as long as the majority of miners do not cooperate to attack the network.\n(95) FIG. 18B illustrates an example blockchain transaction block **1850** located in block **1810** that implements the technology disclosed. The blockchain transaction block **1850** includes a the blockchain address **1852** associated with the blockchain transaction, a timestamp **1854** to record the time and date the blockchain transaction was completed, and the amount of token received **1856**. The example blockchain transaction block **1850** records the blockchain transaction to authenticate the email with email ID 4 in the unauthorized email database **408**. The blockchain transaction block **1850** can also include other components which are not shown in FIG. 18B, such as header, nonce, balance, storage root, code hash, value, signature, ommers hash, beneficiary, state root, transactions root, receipts root, logs bloom, difficulty, number, private key, public key, extra data, and mix hash. One skilled in the art would appreciate that, in other implementations, the blockchain transaction block **1850** shown in FIG. 18B can be distributed across multiple blockchain ledgers in blockchain nodes in the blockchain network **216**.\n(96) A number of workflows illustrating logic are described herein. The logic can be implemented using processors programmed using computer programs stored in memory accessible to the computer systems and executable by the processors. With all workflows herein, it will be appreciated that many of the steps can be combined, performed in parallel or performed in a different sequence without affecting the functions achieved. In some cases, as the reader will appreciate, a rearrangement of steps will achieve the same results only if certain other changes are made as well. In other cases, as the reader will appreciate, a re-arrangement of steps will achieve the same results only if certain conditions are satisfied. Furthermore, it will be appreciated that the workflows herein show only steps that are pertinent to an understanding of the invention, and it will be understood that numerous additional steps for accomplishing other functions can be performed before, after and between those shown.\n(97) The applicant hereby discloses in isolation each individual feature described herein and any combination of two or more such features, to the extent that such features or combinations are capable of being carried out based on the present specification as a whole in light of the common general knowledge of a person skilled in the art, irrespective of whether such features or combinations of features solve any problems disclosed herein, and without limitation to the scope of the claims. The applicant indicates that aspects of the present invention may consist of any such feature or combination of features. In view of the foregoing descriptions, it will be evident to a person skilled in the art that various modifications may be made within the scope of the invention.\n(98) The foregoing description of preferred embodiments of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Obviously, many modifications and variations will be apparent to practitioners skilled in this art. In addition, any and all variations described, suggested or incorporated by reference herein with respect to any one embodiment are also to be considered taught with respect to all other embodiments. The embodiments described herein were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention for various embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalents.\n\n### Claims\n\n1. A method for handling email with blockchain based procedures, comprising: filtering incoming emails being addressed to particular recipient email addresses to identify selected emails using filters for registered email accounts; establishing individual blockchain addresses for the selected emails, sending messages to senders of the selected emails and prompting execution of blockchain transactions in a blockchain network based on the individual blockchain addresses, wherein the prompted blockchain transactions include transferring tokens having specified characteristics required for authorization of the selected emails; and authorizing the selected emails with the particular recipients email addresses upon (i) detection of a transaction in the blockchain network of the prompted blockchain transactions, and (ii) verification of the specified characteristics of the prompted blockchain transactions in the blockchain network.\n 2. The method of claim 1, including tagging the selected emails in memory as unauthorized, pending the authorizing.\n 3. The method of claim 1, including moving the authorized selected emails to email inbox folders of the recipients.\n 4. The method of claim 1, wherein said filtering includes traversing email inbox folders of the registered email accounts, removing the selected emails from the email inbox folders, and saving the selected emails in a folder or folders for unauthorized emails for the registered email accounts.\n 5. The method of claim 1, wherein said filtering includes applying the filters to emails in email channels of the registered email accounts.\n 6. The method of claim 1, including maintaining a list of registered email accounts, further including maintaining in memory lists of individual blockchain addresses and associated encryption keys for the selected emails of the registered email accounts.\n 7. The method of claim 1, including composing return emails linked to the individual blockchain addresses, and having the recipient email addresses identified as sender addresses in the return emails, as the messages are returned to senders.\n 8. The method of claim 1, wherein a message returned associated with a selected email includes a link to a user interface for tools useable to cause execution of the prompted blockchain transaction required for authorization of the selected email.\n 9. The method of claim 1, wherein the prompted blockchain transaction comprises a transfer of cryptocurrency having a specified monetary value.\n 10. The method of claim 1, including monitoring the blockchain for transactions addressed to the individual blockchain addresses generated for the selected emails.\n 11. The method of claim 1, including responding to notifications indicating presence on the blockchain network of blockchain transactions to determine whether transactions addressed to the individual blockchain addresses generated for the selected emails have been executed.\n 12. The method of claim 1, including maintaining a list of registered email accounts, and composing filters for each registered email account in the list of registered email accounts that include information identifying parameters associated with emails.\n 13. A system for managing email with blockchain based procedures, comprising: one or more network nodes, where a network node of the one or more network nodes includes a communication interface, a hardware processor or hardware processors and memory accessible by the hardware processor or hardware processors; the one or more network nodes configured for execution of a procedure for handling emails, comprising: filtering incoming emails being addressed to particular recipient email addresses to identify selected emails using filters for registered email accounts; establishing individual blockchain addresses for the selected emails, sending messages to senders of the selected emails and prompting execution of blockchain transactions in a blockchain network based on the individual blockchain addresses, wherein the prompted blockchain transactions include transferring tokens having specified characteristics required for authorization of the selected emails; and authorizing the selected emails with the particular recipients email addresses upon (i) detection of a transaction in the blockchain network of the prompted blockchain transactions, and (ii) verification of the specified characteristics of the prompted blockchain transactions in the blockchain network.\n 14. The system of claim 13, the procedure for handling emails including tagging the selected emails in memory as unauthorized, pending the authorizing.\n 15. The system of claim 13, the procedure for handling emails including moving the authorized selected emails to email inbox folders of the recipients.\n 16. The system of claim 13, the procedure for handling emails wherein said filtering includes traversing email inbox folders of the registered email accounts, removing the selected emails from the email inbox folders, and saving the selected emails in a folder or folders for unauthorized emails for the registered email accounts.\n 17. The system of claim 13, wherein said filtering includes applying the filters to emails in email channels of the registered email accounts.\n 18. The system of claim 13, the procedure for handling emails including maintaining a list of registered email accounts, further including maintaining in memory lists of individual blockchain addresses and associated encryption keys for the selected emails of the registered email accounts.\n 19. The system of claim 13, the procedure for handling emails including composing return emails linked to the individual blockchain addresses, and having the recipient email addresses identified as sender addresses in the return emails, as the messages are returned to senders.\n 20. The system of claim 13, wherein a message returned associated with a selected email includes a link to tools useable to cause execution of the prompted blockchain transaction required for authorization of the selected email.\n 21. The system of claim 13, wherein the prompted blockchain transaction comprises a transfer of cryptocurrency having a specified monetary value.\n 22. The system of claim 13, the procedure for handling emails including monitoring the blockchain for transactions addressed to the individual blockchain addresses generated for the selected emails.\n 23. The system of claim 13, the procedure for handling emails including responding to notifications indicating presence on the blockchain network of blockchain transactions to determine whether transactions addressed to the individual blockchain addresses generated for the selected emails have been executed.\n 24. The system of claim 13, the procedure for handling emails including maintaining a list of registered email accounts, and composing filters for each of the registered email account in the list of registered email accounts that include information identifying parameters associated with emails.\n 25. A computer program product embodied in non-transitory machine readable memory having a computer program stored in the memory, the computer program including instructions configured for execution of a procedure for handling emails with blockchain based procedures, comprising: filtering incoming emails being addressed to particular recipient email addresses to identify selected emails using filters for registered email accounts; establishing individual blockchain addresses for the selected emails, sending messages to senders of the selected emails and prompting execution of blockchain transactions in a blockchain network based on the individual blockchain addresses, wherein the prompted blockchain transactions include transferring tokens having specified characteristics required for authorization of the selected emails; and authorizing the selected emails with the particular recipients email addresses upon (i) detection of a transaction in the blockchain network of the prompted blockchain transactions, and (ii) verification of the specified characteristics of the prompted blockchain transactions in the blockchain network.\n 26. The computer program product of claim 25, the procedure for handling emails including tagging the selected emails in memory as unauthorized, pending the authorizing.\n 27. The computer program product of claim 25, the procedure for handling emails including moving the authorized selected emails to email inbox folders of the recipients.\n 28. The computer program product of claim 25, wherein said filtering includes traversing email inbox folders of the registered email accounts, removing the selected emails from the email inbox folders, and saving the selected emails in a folder or folders for unauthorized emails for the registered email accounts.\n 29. The computer program product of claim 25, wherein said filtering includes applying the filters to emails in email channels of the registered email accounts.\n 30. The computer program product of claim 25, the procedure for handling emails including maintaining a list of registered email accounts, further including maintaining in memory lists of individual blockchain addresses and associated encryption keys for the selected emails of the registered email accounts.\n 31. The computer program product of claim 25, the procedure for handling emails including composing return emails linked to the individual blockchain addresses, and having the recipient email addresses identified as sender addresses in the return emails, as the messages are returned to senders.\n 32. The computer program product of claim 25, wherein a message returned associated with a selected email includes a link to tools useable to cause execution of the prompted blockchain transaction required for authorization of the selected email.\n 33. The computer program product of claim 25, wherein the prompted blockchain transaction comprises a transfer of cryptocurrency having a specified monetary value.\n 34. The computer program product of claim 25, the procedure for handling emails including monitoring the blockchain for transactions addressed to the individual blockchain addresses generated for the selected emails.\n 35. The computer program product of claim 25, the procedure for handling emails including responding to notifications indicating presence on the blockchain network of blockchain transactions to determine whether transactions addressed to the individual blockchain addresses generated for the selected emails have been executed.\n 36. The computer program product of claim 25, the procedure for handling emails including maintaining a list of registered email accounts, and composing filters for each of the registered email account in the list of registered email accounts that include information identifying parameters associated with emails."},"Patent Number":{"kind":"string","value":"10305833"},"Document ID":{"kind":"string","value":"US 10305833 B1"},"Date Published":{"kind":"string","value":"2019-05-28"},"Family ID":{"kind":"string","value":"66636139"},"Title":{"kind":"string","value":"Blockchain based email procedures"},"CPCI":{"kind":"string","value":"H04L9/16;H04L9/30;H04L63/0227;H04L9/0637;H04L67/10;H04L9/3247;H04L51/48;H04L63/102;H04L9/3239;H04L9/14;H04L9/088;H04L51/212;H04L63/205"},"CPCA":{"kind":"string","value":"H04L63/0428;H04L9/50"},"Inventor":{"kind":"string","value":"Dennis; Stewart MacGregor"},"Assignee":{"kind":"string","value":"TURING TECHNOLOGY, INC."},"Application Number":{"kind":"string","value":"15/723467"},"Filing Date":{"kind":"string","value":"2017-10-03"},"Primary Examiner":{"kind":"string","value":"Chai; Longbit"},"Assistant Examiner":{"kind":"string","value":""},"OR":{"kind":"string","value":"1/1"},"XREF":{"kind":"string","value":""},"Applicant Name":{"kind":"string","value":"Turing Technology, Inc."},"Notes":{"kind":"string","value":""},"Notes/Tagged":{"kind":"string","value":""},"Relevancy":{"kind":"string","value":"16.226843"},"Database":{"kind":"string","value":"USPAT"},"total_tokens":{"kind":"string","value":"18703.0"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":0,"numItemsPerPage":100,"numTotalItems":49025,"offset":0,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4NTcwMzA3OCwianRpIjoiZTg5ZTk3NGItNWRkMi00ZjhlLWJkNDYtZGRlN2UyZDFkMWRlIiwic3ViIjoiL2RhdGFzZXRzL0V4cG9uZW50aWFsU2NpZW5jZS9ETFQtUGF0ZW50cyIsImV4cCI6MTc4NTcwNjY3OCwiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.9uQT8syg6N75St9_2_8Fl7WJPCKxLL83yQOPy3xIwksVhIU91ebkEEvbD85__e272xT_GXAfYmrmYyG9LjXCCw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":49025,"numBytesParquet":2288058875}]},"discussionsStats":{"closed":1,"open":1,"total":2},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
text stringlengths 0 19.4M | Patent Number stringlengths 8 11 | Document ID stringlengths 14 17 | Date Published stringdate 2001-06-07 00:00:00 2025-07-29 00:00:00 | Family ID stringlengths 7 13 | Title stringlengths 5 459 | CPCI stringlengths 8 872 | CPCA stringlengths 0 1.53k | Inventor stringlengths 6 55 | Assignee stringlengths 0 297 | Application Number stringlengths 9 9 | Filing Date stringdate 1998-03-11 00:00:00 2025-04-29 00:00:00 | Primary Examiner stringlengths 0 29 | Assistant Examiner stringclasses 934
values | OR stringlengths 0 10 | XREF stringclasses 519
values | Applicant Name stringlengths 0 297 | Notes stringclasses 1
value | Notes/Tagged stringclasses 1
value | Relevancy stringlengths 5 10 | Database stringclasses 2
values | total_tokens stringlengths 3 9 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
United States Patent
10002277
Kind Code
B1
Date of Patent
June 19, 2018
Inventor(s)
Endress; Thomas et al.
## Reader device for reading a marking comprising a physical unclonable function
### Abstract
The present invention relates to the field of anti-counterfeit protection of products. Specifically, the invention i... | 10002277 | US 10002277 B1 | 2018-06-19 | 57794062 | Reader device for reading a marking comprising a physical unclonable function | G06K7/1417;G09C5/00;G09C1/00;H04L9/3278;H04L9/0643 | Endress; Thomas et al. | Merck Patent GmbH | 15/428641 | 2017-02-09 | Mikels; Matthew | 1/1 | Merck Patent GmbH | 16.428484 | USPAT | 29384.0 | |||||
United States Patent
10002362
Kind Code
B1
Date of Patent
June 19, 2018
Inventor(s)
Endress; Thomas et al.
## Composite security marking
### Abstract
The present invention relates to the field of anti-counterfeit protection of products. Specifically, the invention is directed to a composite security marking for a ph... | 10002362 | US 10002362 B1 | 2018-06-19 | 57890634 | Composite security marking | G06K19/06037;G06Q30/0185;G09C1/00;H04L9/3247;G06K19/0614;H04L9/3278 | G06K2019/06225 | Endress; Thomas et al. | Merck Patent GmbH | 15/428577 | 2017-02-09 | Kholdebarin; Iman K | 1/1 | Merck Patent GmbH | 16.33698 | USPAT | 25722.0 | ||||
United States Patent
10003612
Kind Code
B1
Date of Patent
June 19, 2018
Inventor(s)
Hocker; Michael D. et al.
## Protection for computing systems from revoked system updates
### Abstract
A computing system may be protected from revoked system updates. A computing system receives an object and scans it for revocation... | 10003612 | US 10003612 B1 | 2018-06-19 | 62554741 | Protection for computing systems from revoked system updates | H04L9/0891;G06F21/57;H04L9/3247;H04L67/34;G06F8/65;H04L9/0877;H04L63/0428;H04L9/3066;H04L63/1466;H04L9/0897 | Hocker; Michael D. et al. | International Business Machines Corporation | 15/718072 | 2017-09-28 | Revak; Christopher | 1/1 | International Business Machines Corporation | 10.945688 | USPAT | 13362.0 | |||||
United States Patent
10005564
Kind Code
B1
Date of Patent
June 26, 2018
Inventor(s)
Bhatia; Amit et al.
## Autonomous cargo handling system and method
### Abstract
An autonomous cargo handling system is provided. The autonomous cargo handling system may comprise one or more sensing agents in electronic communication... | 10005564 | US 10005564 B1 | 2018-06-26 | 62116273 | Autonomous cargo handling system and method | B64C1/20;B64D9/00;B64D45/00;B64C1/22 | G01S17/88;G01S13/88;G01S15/88 | Bhatia; Amit et al. | GOODRICH CORPORATION | 15/587769 | 2017-05-05 | Feild; Joseph | Point; Rufus | 1/1 | GOODRICH CORPORATION | 5.095735 | USPAT | 11272.0 | |||
United States Patent
10007826
Kind Code
B2
Date of Patent
June 26, 2018
Inventor(s)
Ebrahimi; Armin et al.
## Transferring data files using a series of visual codes
### Abstract
Software on an image-capturing device iteratively captures a visual code in a series of visual codes displayed in a repeating progression o... | 10007826 | US 10007826 B2 | 2018-06-26 | 59723575 | Transferring data files using a series of visual codes | G06K19/06112;G06K7/1095;H04L9/30;H04L9/3271;G06K7/1439;G06K19/06037;H04L9/3247;H04L9/14;H04L9/3236;G09C5/00 | Ebrahimi; Armin et al. | ShoCard, Inc. | 15/208580 | 2016-07-12 | Vo; Tuyen K | 1/1 | ShoCard, Inc. | 7.1721015 | USPAT | 24330.0 | |||||
United States Patent
10008102
Kind Code
B1
Date of Patent
June 26, 2018
Inventor(s)
McEachron; Jon Daniel
## System and method for monitoring radio-frequency (RF) signals for security applications
### Abstract
The present disclosure relates generally to systems and method for monitoring and preserving radio-frequenc... | 10008102 | US 10008102 B1 | 2018-06-26 | 62623935 | System and method for monitoring radio-frequency (RF) signals for security applications | G08B25/10;H04W4/80;H04W4/38;H04W4/027;H04W4/90;H04W4/30 | G08B25/14 | McEachron; Jon Daniel | United Services Automobile Association (USAA) | 15/085612 | 2016-03-30 | Yacob; Sisay | 1/1 | United Services Automobile Association (USAA) | 5.1298795 | USPAT | 11666.0 | ||||
United States Patent
10022614
Kind Code
B1
Date of Patent
July 17, 2018
Inventor(s)
Tran; Bao et al.
## Smart device
### Abstract
An Internet of Thing (IoT) device includes a body and sensors including a camera and an accelerometer; a processor; and a wireless transceiver coupled to the processor.
Inventors:
**Tra... | 10022614 | US 10022614 B1 | 2018-07-17 | 62837373 | Smart device | G16H50/20;G16H50/50;A61B5/11;A63B71/145;A63B69/36;G16H30/20;G06V20/68;G16H40/63;G09B19/0038;G01L5/0052;G06V20/52;G06F3/00;F25D29/00;G06V40/23;H04W84/18;G16H40/67;G16H50/30;B33Y10/00;G16H50/70 | A63B2244/102;A63B2220/74;A63B2220/75;A63B2243/007;A61B5/112;A63B69/0002;A63B2244/20;A63B2220/72;A61B5/1116;A63B69/0071;A63B2071/1233;A63B2220/53;A63B2220/56;A63B2244/203;A63B2220/836;A63B2220/20;A63B2244/19;A63B2225/50;A63B2243/0095;A63B2225/30;A63B2220/24;A63B2220/30;A63B2220/807;A63B2230/70;A63B2243/0037;G06F1/163;A6... | Tran; Bao et al. | 15/612808 | 2017-06-02 | Ahmed; Masud | 1/1 | Tran; Bao | 7.1369658 | USPAT | 59289.0 | |||||
United States Patent
10025797
Kind Code
B1
Date of Patent
July 17, 2018
Inventor(s)
Fonss; Jack
## Method and system for separating storage and process of a computerized ledger for improved function
### Abstract
A non-conventional method and system used with computerized ledgers provides advantages of computing effi... | 10025797 | US 10025797 B1 | 2018-07-17 | 62837486 | Method and system for separating storage and process of a computerized ledger for improved function | G06F16/27;G06F16/182;G06F21/64;G06F16/1865 | Fonss; Jack | True Return Systems LLC | 15/923317 | 2018-03-16 | Wong; Leslie | 1/1 | True Return Systems LLC | 41.994236 | USPAT | 14757.0 | |||||
United States Patent
10025941
Kind Code
B1
Date of Patent
July 17, 2018
Inventor(s)
Griffin; Phillip H. et al.
## Data element tokenization management
### Abstract
Systems and methods to manage a tokenization manifest that can be used for managing a redaction through tokenization of a set of field level tokenization... | 10025941 | US 10025941 B1 | 2018-07-17 | 62837181 | Data element tokenization management | G06F21/6209;G06F21/64 | Griffin; Phillip H. et al. | WELLS FARGO BANK, N.A. | 15/244915 | 2016-08-23 | Rahman; Mahfuzur | 1/1 | Wells Fargo Bank, NA | 6.8004794 | USPAT | 16456.0 | |||||
United States Patent
10031993
Kind Code
B1
Date of Patent
July 24, 2018
Inventor(s)
Poornachandran; Rajesh et al.
## Application store model for dynamic reconfiguration of a field-programmable gate array (FPGA)
### Abstract
A computing device, computer-readable medium, and method are provided to dynamically configur... | 10031993 | US 10031993 B1 | 2018-07-24 | 62874411 | Application store model for dynamic reconfiguration of a field-programmable gate array (FPGA) | H03K19/17704;H05K1/181;G06F15/7871;G06F9/44521;H05K3/222;G06F8/65;H01L25/0657;G06F9/4401;H05K1/144;G06F12/0246;G06F30/331;G06F30/34 | H05K2201/10689;H05K2201/10515;H01L25/16 | Poornachandran; Rajesh et al. | Intel Corporation | 15/619844 | 2017-06-12 | Tan; Vibol | 1/1 | Intel Corporation | 5.3595095 | USPAT | 23248.0 | ||||
United States Patent
10032039
Kind Code
B1
Date of Patent
July 24, 2018
Inventor(s)
Milman; Ivan M. et al.
## Role access to information assets based on risk model
### Abstract
The program controls access to data objects stored on a tangible device of a computer system within an enterprise. A user request to access ... | 10032039 | US 10032039 B1 | 2018-07-24 | 62874412 | Role access to information assets based on risk model | G06F21/6209;H04L51/02;H04L51/42;G06F21/6218;G06F16/335;H04L51/212 | Milman; Ivan M. et al. | International Business Machines Corporation | 15/844660 | 2017-12-18 | Chai; Longbit | 1/1 | INTERNATIONAL BUSINESS MACHINES CORPORATION | 6.6482987 | USPAT | 17367.0 | |||||
United States Patent
10033672
Kind Code
B1
Date of Patent
July 24, 2018
Inventor(s)
Morris; Robert Paul
## Methods and computer program products for browsing using a communicant identifier
### Abstract
In one embodiment, a computer-implemented method is provided, comprising: creating at least a portion of an instant... | 10033672 | US 10033672 B1 | 2018-07-24 | 62874363 | Methods and computer program products for browsing using a communicant identifier | G06Q10/107;H04L51/04;G06F3/0482;H04L51/08;G06F9/451;H04L51/18;H04L51/10;H04L51/046;H04L67/02 | G06F3/0485;G06F3/0488;H04L61/4547;H04L51/02 | Morris; Robert Paul | Sitting Man, LLC | 15/803823 | 2017-11-05 | Vu; Thanh | 1/1 | Sitting Man, LLC | 6.491028 | USPAT | 46342.0 | ||||
United States Patent
10037420
Kind Code
B1
Date of Patent
July 31, 2018
Inventor(s)
Ibrahim; Wael et al.
## Cardless transactions
### Abstract
A system for conducting transactions without a debit card or credit card may receive a request to complete a transaction including authentication data associated with a trans... | 10037420 | US 10037420 B1 | 2018-07-31 | 62948485 | Cardless transactions | G06F21/32;G06F16/245;G06Q20/40145 | G06F2221/2111 | Ibrahim; Wael et al. | AMERICAN EXPRESS TRAVEL RELATED SERVICES COPMANY, INC. | 15/597852 | 2017-05-17 | Le; Thien M | 1/1 | American Express Travel Related Services Company, Inc. | 4.6954145 | USPAT | 15307.0 | ||||
United States Patent
10037508
Kind Code
B1
Date of Patent
July 31, 2018
Inventor(s)
Rusnak; Ryan et al.
## System for calculating whether time-crucial shipment is located according to expectation
### Abstract
A client-server system and method for calculating whether time-crucial shipment is located according to expe... | 10037508 | US 10037508 B1 | 2018-07-31 | 62948476 | System for calculating whether time-crucial shipment is located according to expectation | H04W4/80;G08G5/57;H04W4/023;G08G5/32;G06Q10/063116;G08G5/56;G06Q10/1093;G06Q10/08355;G08G5/22;G06Q10/0833;G08G5/55 | H04W4/14;H04W84/042;H04W4/029;H04W88/06;H04W84/12 | Rusnak; Ryan et al. | AirTrace, LLC | 15/610166 | 2017-05-31 | Epstein; Brian M | Brown; Alexander D | 1/1 | AIRTRACE, LLC | 10.664972 | USPAT | 11201.0 | |||
United States Patent
10055715
Kind Code
B1
Date of Patent
August 21, 2018
Inventor(s)
Grassadonia; Brian et al.
## Cryptocurrency payment network
### Abstract
The present technology provides a payment service for providing financial transactions between a customer and merchant wherein the customer can pay in any cur... | 10055715 | US 10055715 B1 | 2018-08-21 | 63144032 | Cryptocurrency payment network | G06Q20/36;G06Q20/4012;G06Q20/20;G06Q20/3674;G06Q20/06;G06Q20/065;G06Q20/381 | Grassadonia; Brian et al. | Square, Inc. | 15/713322 | 2017-09-22 | Hamilton; Lalita M | 1/1 | Square, Inc. | 16.533543 | USPAT | 18997.0 | |||||
United States Patent
10057243
Kind Code
B1
Date of Patent
August 21, 2018
Inventor(s)
Kumar; Srinivas et al.
## System and method for securing data transport between a non-IP endpoint device that is connected to a gateway device and a connected service
### Abstract
A method of securing data transport between an endp... | 10057243 | US 10057243 B1 | 2018-08-21 | 63144083 | System and method for securing data transport between a non-IP endpoint device that is connected to a gateway device and a connected service | H04L9/0891;H04W8/005;G06F8/65;H04L63/12;G06F8/71;H04L9/30;G06F21/57;H04L9/0637;H04L9/0825;H04L63/0823;H04L9/3263;H04L9/3268;H04L67/104;G06F21/575;H04L9/321;H04L9/3247 | H04L63/20;G06F9/4401;H04L63/0428;H04W12/06 | Kumar; Srinivas et al. | MOCANA CORPORATION | 15/899009 | 2018-02-19 | Ho; Dao Q | 1/1 | MOCANA CORPORATION | 29.875694 | USPAT | 20755.0 | ||||
United States Patent
10068228
Kind Code
B1
Date of Patent
September 04, 2018
Inventor(s)
Winklevoss; Cameron Howard et al.
## Systems and methods for storing digital math-based assets using a secure portal
### Abstract
Systems and methods for securely storing digital assets using a secure portal are disclosed. Using... | 10068228 | US 10068228 B1 | 2018-09-04 | 63295237 | Systems and methods for storing digital math-based assets using a secure portal | G06Q20/34;H04L9/50;H04L9/085;H04L9/3252;G06Q20/065;G06Q20/36;G06Q20/3829;H04L9/3239 | G06Q2220/14;G06Q20/02;H04L2209/56;G06Q2220/00 | Winklevoss; Cameron Howard et al. | Winklevoss IP, LLC | 14/320900 | 2014-07-01 | Kim; Steven S | Choo; Johann Y | 1/1 | WINKLEVOSS IP, LLC | 11.092735 | USPAT | 75852.0 | |||
United States Patent
10073763
Kind Code
B1
Date of Patent
September 11, 2018
Inventor(s)
Raman; Mahesh Venkata et al.
## Touchless testing platform
### Abstract
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for a touchless testing platform employed to, for example... | 10073763 | US 10073763 B1 | 2018-09-11 | 63406437 | Touchless testing platform | G06N20/00;G06F11/008;G06F11/3688;G06F11/3698;G01R31/31835;G06F11/3676;G06F11/3696;G06F11/3476;G06N5/02;G06F15/76;G06F11/3684;G06F8/10;G06F11/3692;G06F16/9024;G06F11/3616;G06F11/3438 | G06F2201/865;G05B23/0229 | Raman; Mahesh Venkata et al. | Accenture Global Solutions Limited | 15/911968 | 2018-03-05 | Wang; Philip | Wang; Rongfa P | 1/1 | Accenture Global Solutions Limited | 5.160124 | USPAT | 18047.0 | |||
United States Patent
10078839
Kind Code
B1
Date of Patent
September 18, 2018
Inventor(s)
Mullins; Brian et al.
## Centralized system for data retrieval
### Abstract
This disclosure describes, in part, techniques for storing transaction data at a central service, and techniques for querying information associated wit... | 10078839 | US 10078839 B1 | 2018-09-18 | 63491134 | Centralized system for data retrieval | G06Q20/3224;G06Q20/327;G06Q20/204;G06Q20/4016;G06Q20/389;G06Q20/405;G06Q20/202;G06Q20/02;G06F16/90335 | Mullins; Brian et al. | Square, Inc. | 15/691301 | 2017-08-30 | Hayles; Ashford S | 1/1 | Square, Inc. | 6.9813633 | USPAT | 24495.0 | |||||
United States Patent
10080498
Kind Code
B1
Date of Patent
September 25, 2018
Inventor(s)
Gibson; Jeffrey S.
## Capnography device with constant remote surveillance and notification capabilities
### Abstract
A capnography device including a suitable sensor to measure carbon dioxide concentration for a target patient/... | 10080498 | US 10080498 B1 | 2018-09-25 | 63556716 | Capnography device with constant remote surveillance and notification capabilities | A61B5/082;A61B5/097;A61B5/0022;A61B5/746;A61B5/0004;G16H50/30;G16H40/67;A61B5/0082;A61B5/0816 | A61B2560/0475;A61B2562/08 | Gibson; Jeffrey S. | 15/912111 | 2018-03-05 | Natnithithadha; Navin | Messersmith; Eric | 1/1 | Gibson; Jeffrey S. | 4.7439013 | USPAT | 24279.0 | ||||
United States Patent
10084600
Kind Code
B1
Date of Patent
September 25, 2018
Inventor(s)
Irwan; Susanto Junaidi et al.
## Decentralized information protection for confidentiality and tamper-proofing on distributed database
### Abstract
In an embodiment, a computer-implemented data security method comprises: at a fir... | 10084600 | US 10084600 B1 | 2018-09-25 | 63557081 | Decentralized information protection for confidentiality and tamper-proofing on distributed database | H04L63/08;H04L9/14;H04L9/3093;H04L63/0464;H04L9/0637;H04L9/3236;H04L63/0442;H04L9/321;H04L9/085;H04L9/0861 | H04L67/12;H04L9/50 | Irwan; Susanto Junaidi et al. | XAGE SECURITY, INC. | 15/954365 | 2018-04-16 | Cribbs; Malcolm | 1/1 | Xage Security, Inc. | 8.324005 | USPAT | 17802.0 | ||||
United States Patent
10084826
Kind Code
B1
Date of Patent
September 25, 2018
Inventor(s)
Irwan; Susanto Junaidi et al.
## Protocol agnostic security by using out-of-band health check
### Abstract
A computer-implemented method provides an improvement in security breach detection and comprises using a broker computing... | 10084826 | US 10084826 B1 | 2018-09-25 | 63557126 | Protocol agnostic security by using out-of-band health check | H04L9/0637;H04W12/065;H04L9/3231;G06F21/552;H04L9/0891;H04L63/18;H04L63/10;H04L63/1441;H04L9/3236;H04L63/0876;G06F21/577;H04L63/20 | H04L67/10;G06F2221/034;H04L9/50 | Irwan; Susanto Junaidi et al. | XAGE SECURITY, INC. | 15/979402 | 2018-05-14 | Gergiso; Techane | 1/1 | Xage Security, Inc. | 8.776049 | USPAT | 14234.0 | ||||
United States Patent
10095549
Kind Code
B1
Date of Patent
October 09, 2018
Inventor(s)
Needham; Sean Michael et al.
## Ownership transfer account service in a virtual computing environment
### Abstract
Technology is described for providing an ownership transfer service in virtual computing service environment. Compu... | 10095549 | US 10095549 B1 | 2018-10-09 | 63685457 | Ownership transfer account service in a virtual computing environment | G06F21/602;G06F21/31;H04L63/102;G06F9/468;H04L63/083 | H04L67/10 | Needham; Sean Michael et al. | Amazon Technologies, Inc. | 14/869494 | 2015-09-29 | Jacobs; Lashonda | 1/1 | Amazon Technologies, Inc. | 6.544125 | USPAT | 30837.0 | ||||
United States Patent
10095888
Kind Code
B1
Date of Patent
October 09, 2018
Inventor(s)
Lee; Jonathan et al.
## Secure decentralized system utilizing smart contracts, a blockchain, and/or a distributed file system
### Abstract
A node associated with an organization may receive a storage identifier for new credit data... | 10095888 | US 10095888 B1 | 2018-10-09 | 63685138 | Secure decentralized system utilizing smart contracts, a blockchain, and/or a distributed file system | G06Q40/03;G06F16/182;H04L9/0637;H04L9/14;G06F21/64;H04L9/3239 | H04L9/50 | Lee; Jonathan et al. | Capital One Services, LLC | 15/997271 | 2018-06-04 | Dada; Beemnet W | 1/1 | Capital One Services, LLC | 19.454119 | USPAT | 20665.0 | ||||
United States Patent
10095992
Kind Code
B1
Date of Patent
October 09, 2018
Inventor(s)
Brestoff; Nelson E. et al.
## Using classified text, deep learning algorithms and blockchain to identify risk in low-frequency, high value situations, and provide early warning
### Abstract
Deep learning is used to identify specif... | 10095992 | US 10095992 B1 | 2018-10-09 | 57795176 | Using classified text, deep learning algorithms and blockchain to identify risk in low-frequency, high value situations, and provide early warning | G06F18/214;G06N3/08;G06Q50/18;G06Q10/0635;G06Q10/107;G06F40/10;G06N20/00;G06F16/35;G06N3/044;G06N3/04 | H04L9/50 | Brestoff; Nelson E. et al. | Intraspexion, Inc. | 15/864785 | 2018-01-08 | Holmes; Michael B | 1/1 | Brestoff; Nelson E.,Rajagopal; Jagannath | 11.077489 | USPAT | 14462.0 | ||||
United States Patent
10102265
Kind Code
B1
Date of Patent
October 16, 2018
Inventor(s)
Madisetti; Vijay K. et al.
## Method and system for tuning blockchain scalability for fast and low-cost payment and transaction processing
### Abstract
A method of synchronizing transactions between blockchains comprising receivin... | 10102265 | US 10102265 B1 | 2018-10-16 | 63761632 | Method and system for tuning blockchain scalability for fast and low-cost payment and transaction processing | G06F16/27;G06Q20/3829;G06Q20/38215;H04L9/3263;G06Q20/3678;H04L9/3247;G06F16/1805;G06Q20/389;H04L9/0637;G06Q20/0658;H04L9/3234;G06Q20/06;H04L9/3239 | H04L2209/56;H04L9/50;G06Q2220/00 | Madisetti; Vijay K. et al. | Madisetti; Vijay K. | 15/942604 | 2018-04-02 | Chau; Dung K | 1/1 | Madisetti; Vijay K.,Bahga; Arshdeep | 19.279238 | USPAT | 23411.0 | ||||
United States Patent
10102526
Kind Code
B1
Date of Patent
October 16, 2018
Inventor(s)
Madisetti; Vijay K. et al.
## Method and system for blockchain-based combined identity, ownership, integrity and custody management
### Abstract
A method of issuing blockchain-based digital certificates comprising receiving from a... | 10102526 | US 10102526 B1 | 2018-10-16 | 63761678 | Method and system for blockchain-based combined identity, ownership, integrity and custody management | G06Q20/389;G06Q20/0658;G06Q20/3829;G06Q20/02;H04L9/0637;H04L9/14;H04L9/3297;G06Q20/3827;G06Q20/367;H04L9/3239;G06Q20/065;H04L67/1042;G06Q20/06;G06Q40/04;H04L9/3247;G06Q20/38215;H04L9/3236;G06Q20/3823;H04L9/3242;G06Q20/3825;H04L9/3263;G06Q20/4014;H04L9/30 | G06Q2220/00;H04L2209/56;H04L9/50 | Madisetti; Vijay K. et al. | 15/863128 | 2018-01-05 | Vaughan; Michael R | 1/1 | Madisetti; Vijay K.,Bahga; Arshdeep | 14.568243 | USPAT | 21359.0 | |||||
United States Patent
10104077
Kind Code
B1
Date of Patent
October 16, 2018
Inventor(s)
Irwan; Susanto Junaidi et al.
## Enabling multitenant data access on a single industrial network
### Abstract
In an embodiment, a computer-implemented method comprises receiving a first authentication request from one or more firs... | 10104077 | US 10104077 B1 | 2018-10-16 | 63761693 | Enabling multitenant data access on a single industrial network | G06F21/45;H04L9/30;H04W4/70;H04L9/3239;H04L67/10;H04L63/0442;G06F21/445;H04L63/0869;H04L9/0637;H04L63/0884;G06F21/602 | H04L2209/56;H04L2209/76;H04L9/50;H04W4/38;H04L67/12 | Irwan; Susanto Junaidi et al. | XAGE SECURITY, INC. | 15/727476 | 2017-10-06 | Ullah; Sharif E | 1/1 | XAGE SECURITY, INC. | 6.97235 | USPAT | 16763.0 | ||||
United States Patent
10114969
Kind Code
B1
Date of Patent
October 30, 2018
Inventor(s)
Chaney; Jordan White et al.
## Ultra-secure blockchain-based electronic information transfer system
### Abstract
The system and method presents a secure blockchain enabled encryption. Incoming information and data files may be enc... | 10114969 | US 10114969 B1 | 2018-10-30 | 63895112 | Ultra-secure blockchain-based electronic information transfer system | G06F21/64;H04L9/3236;H04L9/3247;G06F21/602;G06F21/6218 | H04L9/50 | Chaney; Jordan White et al. | 15/227368 | 2016-08-03 | Pearson; David J | 1/1 | Chaney; Jordan White,Housholder; Charlie,Krut; William,Nimsch; Christian,Chaney; Bryce Nelson | 8.915529 | USPAT | 9125.0 | |||||
United States Patent
10121025
Kind Code
B1
Date of Patent
November 06, 2018
Inventor(s)
Rice; Pamela
## Content validation using blockchain
### Abstract
A device may receive content data from a content provider, the content data including: data identifying content, and data for verifying that the content has not cha... | 10121025 | US 10121025 B1 | 2018-11-06 | 63964573 | Content validation using blockchain | G06F21/10;G06F16/1805;G06F21/602;H04L9/3239;G06F21/645;H04L9/30;H04L9/0643;G06F21/64;H04L9/0637 | H04L9/50;H04L2209/608;H04L67/1042;G06F16/1834 | Rice; Pamela | Capital One Services, LLC | 15/902368 | 2018-02-22 | Chai; Longbit | 1/1 | Capital One Services, LLC | 37.56582 | USPAT | 24390.0 | ||||
United States Patent
10123202
Kind Code
B1
Date of Patent
November 06, 2018
Inventor(s)
Polehn; Donna L. et al.
## System and method for virtual SIM card
### Abstract
A method is provided for using virtual subscriber identity modules (vSIMs) for client devices. A network device creates, in a memory, a user account f... | 10123202 | US 10123202 B1 | 2018-11-06 | 63963973 | System and method for virtual SIM card | H04B1/3816;H04W12/42;H04W12/069;H04W12/35;H04W8/183;H04W12/068 | Polehn; Donna L. et al. | Verizon Patent and Licensing Inc. | 15/646201 | 2017-07-11 | Le; Thanh | 1/1 | Verizon Patent and Licensing Inc. | 11.4842005 | USPAT | 11695.0 | |||||
United States Patent
10125519
Kind Code
B1
Date of Patent
November 13, 2018
Inventor(s)
Gengler; David P. et al.
## Wireless-enabled interchangeable locking core
### Abstract
A wireless, electronic interchangeable locking core that includes an outer housing and a locking core that is rotatable via an external handle... | 10125519 | US 10125519 B1 | 2018-11-13 | 64050629 | Wireless-enabled interchangeable locking core | E05B47/0611;E05B9/04;E05B9/084;G07C9/00682;E05B47/0004;E05B47/0012;G07C9/00174;G07C9/00944 | E05B2047/0094;G07C2209/62;G07C2009/00769;G07C2009/00761 | Gengler; David P. et al. | NOKE, INC. | 15/832348 | 2017-12-05 | Bousono; Orlando | 1/1 | Noke, Inc. | 4.6636753 | USPAT | 17246.0 | ||||
United States Patent
10127247
Kind Code
B1
Date of Patent
November 13, 2018
Inventor(s)
Arora; Deepak et al.
## Linking digital images with related records
### Abstract
A user may capture an image of a document using a mobile device. The mobile device may crop and clean the image. The mobile device may perform optic... | 10127247 | US 10127247 B1 | 2018-11-13 | 64050962 | Linking digital images with related records | G06F16/583;G06Q20/047;G06Q20/3276;G06T1/0007;G06Q20/209;G06T1/20 | Arora; Deepak et al. | AMERICAN EXPRESS TRAVEL RELATED SERVICES COMPANY, INC. | 15/701027 | 2017-09-11 | Kim; Ahshik | 1/1 | AMERICAN EXPRESS TRAVEL RELATED SERVICES COMPANY, INC. | 6.409185 | USPAT | 19499.0 | |||||
United States Patent
10127591
Kind Code
B1
Date of Patent
November 13, 2018
Inventor(s)
Wollmer; Bradley James et al.
## Systems, methods, and devices for dynamic used vehicle marketing, dealer matching, and extended sale period transactions platform
### Abstract
The disclosure herein provides methods, systems, and ... | 10127591 | US 10127591 B1 | 2018-11-13 | 64050649 | Systems, methods, and devices for dynamic used vehicle marketing, dealer matching, and extended sale period transactions platform | G06Q40/03;G06Q30/08;G06F16/9535;G06Q30/0609;G06Q30/0619;G06Q30/0603 | Wollmer; Bradley James et al. | Wippy, LLC | 15/979094 | 2018-05-14 | Pond; Robert M | 1/1 | WIPPY, LLC | 5.044171 | USPAT | 29815.0 | |||||
United States Patent
10129269
Kind Code
B1
Date of Patent
November 13, 2018
Inventor(s)
Ford; Richard A.
## Managing blockchain access to user profile information
### Abstract
A method, system and computer-usable medium for generating a user behavior profile, comprising: monitoring user interactions between a user a... | 10129269 | US 10129269 B1 | 2018-11-13 | 64050855 | Managing blockchain access to user profile information | G06F21/554;H04L63/14;H04L9/3239;G06F21/57;G06N5/04;G06F21/604;H04L63/1425;H04L63/1408;H04L67/306;H04L63/10;H04L67/535;H04L63/205;H04L63/102;G06F21/6218 | H04L9/50;G06F2221/2141;G06F2221/2101 | Ford; Richard A. | Forcepoint, LLC | 15/963729 | 2018-04-26 | Schwartz; Darren B | 1/1 | Forcepoint, LLC | 25.514668 | USPAT | 27133.0 | ||||
United States Patent
10135607
Kind Code
B1
Date of Patent
November 20, 2018
Inventor(s)
Roets; Joe
## Distributed ledger interaction systems and methods
### Abstract
Distributed public ledger interaction methods and systems are presented by which one or more elements of a first smart contract are privately recorded ... | 10135607 | US 10135607 B1 | 2018-11-20 | 64176503 | Distributed ledger interaction systems and methods | H04L9/3213;G06Q20/36;G06F21/64;H04L9/0637;G06Q20/02;G06Q20/389;G06F21/10;H04L9/3239 | G06F16/27;H04L9/50;G06Q2220/00 | Roets; Joe | DRAGONCHAIN, INC. | 16/101343 | 2018-08-10 | Ho; Dao Q | 1/1 | DRAGONCHAIN, INC. | 11.419399 | USPAT | 21649.0 | ||||
United States Patent
10135834
Kind Code
B1
Date of Patent
November 20, 2018
Inventor(s)
Galebach; Timothy S. et al.
## System and method of executing operations in a social network application
### Abstract
Embodiments are directed to improving social network applications using the power of the blockchain (or other r... | 10135834 | US 10135834 B1 | 2018-11-20 | 64176637 | System and method of executing operations in a social network application | G06Q10/10;H04L9/14;H04L9/30;G06Q50/01;H04L63/102;H04L9/0637;H04L9/3236 | G06F16/9535;H04L9/50;H04L2209/56 | Galebach; Timothy S. et al. | Social Patent LLC | 15/789724 | 2017-10-20 | Goodchild; William J. | 1/1 | Social Patent LLC | 19.810097 | USPAT | 21125.0 | ||||
United States Patent
10135835
Kind Code
B1
Date of Patent
November 20, 2018
Inventor(s)
Kandel; Tal et al.
## Passwordless and decentralized identity verification
### Abstract
Techniques include receiving request for verification of an identity, where the request includes no authentication information associated wit... | 10135835 | US 10135835 B1 | 2018-11-20 | 62027791 | Passwordless and decentralized identity verification | H04L9/0637;H04L63/0861;H04L9/321;H04L67/10;H04L63/08;H04L63/0876;H04L63/102;G06F21/40;H04L9/3265 | H04L9/50;H04L63/205 | Kandel; Tal et al. | CyberArk Software Ltd. | 15/925006 | 2018-03-19 | Vaughan; Michael R | 1/1 | CyberArk Software Ltd. | 17.355278 | USPAT | 13596.0 | ||||
United States Patent
10140665
Kind Code
B1
Date of Patent
November 27, 2018
Inventor(s)
Lipstein; Shawn Allan Michael et al.
## Graphical user interface for manipulating relationships between elements
### Abstract
Techniques described herein include a platform configured to provide for association of an accounting e... | 10140665 | US 10140665 B1 | 2018-11-27 | 64315573 | Graphical user interface for manipulating relationships between elements | G06Q40/12 | Lipstein; Shawn Allan Michael et al. | Amazon Technologies, Inc. | 14/862056 | 2015-09-22 | Crawley; Talia F | 1/1 | Amazon Technologies, Inc. | 14.749751 | USPAT | 17022.0 | |||||
United States Patent
10142333
Kind Code
B1
Date of Patent
November 27, 2018
Inventor(s)
Griffin; Phillip H. et al.
## Biometric reference template record
### Abstract
Systems and methods provide for secure and efficient token generation, management, transfer, and authentication services in a biometric data environme... | 10142333 | US 10142333 B1 | 2018-11-27 | 64315510 | Biometric reference template record | H04L9/3231;H04L63/0861;H04L9/3247;G06F21/32 | H04L2209/34 | Griffin; Phillip H. et al. | WELLS FARGO BANK, N.A. | 15/188685 | 2016-06-21 | Lanier; Benjamin E | 1/1 | Wells Fargo Bank, N.A. | 6.7807994 | USPAT | 19084.0 | ||||
United States Patent
10146792
Kind Code
B1
Date of Patent
December 04, 2018
Inventor(s)
Dobrek; Lukasz et al.
## Systems and methods for implementing a programming model for smart contracts within a decentralized computer network
### Abstract
Computer-implemented methods and systems for implementing smart contract m... | 10146792 | US 10146792 B1 | 2018-12-04 | 64451975 | Systems and methods for implementing a programming model for smart contracts within a decentralized computer network | H04L9/32;G06F16/1834;G06Q20/0655;G06Q20/405;H04L9/3297;H04L9/3236;G06Q20/3829 | H04L2209/56;H04L9/50 | Dobrek; Lukasz et al. | SYMBIONT.IO, INC. | 15/994714 | 2018-05-31 | Hayes; John W | Fenstermacher; Jason B | 1/1 | SYMBIONT.IO, INC. | 19.796825 | USPAT | 15485.0 | |||
United States Patent
10154052
Kind Code
B1
Date of Patent
December 11, 2018
Inventor(s)
McClintock; Jon Arron et al.
## Tracer cookies to detect web session compromise by insiders
### Abstract
Complex web applications may be susceptible to cyber-attacks that affect the security of customer sessions. Session theft an... | 10154052 | US 10154052 B1 | 2018-12-11 | 64535961 | Tracer cookies to detect web session compromise by insiders | H04L67/141;H04L63/1425 | H04L63/0815;H04L67/02;H04L63/1483 | McClintock; Jon Arron et al. | Amazon Technologies, Inc. | 14/286247 | 2014-05-23 | Tran; Tri M | 1/1 | Amazon Technologies, Inc. | 10.141993 | USPAT | 13619.0 | ||||
United States Patent
10158480
Kind Code
B1
Date of Patent
December 18, 2018
Inventor(s)
Winklevoss; Cameron Howard et al.
## Autonomous devices
### Abstract
Autonomous devices and systems, methods, and program products for authorizing and performing autonomous devices transactions are disclosed. An autonomous device... | 10158480 | US 10158480 B1 | 2018-12-18 | 64605423 | Autonomous devices | H04L9/0825;H04L9/3239;H04L9/3247;H04L12/2803;H04L9/3297 | H04L9/50;H04L2209/56 | Winklevoss; Cameron Howard et al. | Winklevoss IP, LLC | 15/071902 | 2016-03-16 | Hirl; Joseph P | Truvan; Leynna T | 1/1 | Winklevoss IP, LLC | 6.8815327 | USPAT | 19204.0 | |||
United States Patent
10162840
Kind Code
B1
Date of Patent
December 25, 2018
Inventor(s)
Carter; Christopher Richard
## Method and system for aggregating financial measures in a distributed cache
### Abstract
According to an embodiment of the present invention, a system and method for consolidating financial data com... | 10162840 | US 10162840 B1 | 2018-12-25 | 64692194 | Method and system for aggregating financial measures in a distributed cache | G06F16/24539;G06F16/211 | Carter; Christopher Richard | JPMORGAN CHASE BANK, N.A. | 14/842966 | 2015-09-02 | Al-Hashemi; Sana A | 1/1 | JPMorgan Chase Bank, N.A. | 8.380923 | USPAT | 13441.0 | |||||
United States Patent
10164973
Kind Code
B1
Date of Patent
December 25, 2018
Inventor(s)
Prasad; Bharat et al.
## Public authentication systems and methods
### Abstract
Techniques provided herein relate to electronic authentication on public systems. A backend system receives at least one electronic data action reque... | 10164973 | US 10164973 B1 | 2018-12-25 | 64692261 | Public authentication systems and methods | H04W4/80;G06Q20/10;H04L63/0853;H04L63/0442;H04L63/08;H04L9/3236;H04L63/0861;G06F21/31;H04L63/083;H04L63/0876;H04L63/102 | H04L9/50;H04L2463/082;H04L2209/56 | Prasad; Bharat et al. | United Services Automobile Association (USAA) | 15/365520 | 2016-11-30 | Song; Hosuk | 1/1 | United Services Automobile Association (USAA) | 4.945345 | USPAT | 14064.0 | ||||
United States Patent
10169937
Kind Code
B1
Date of Patent
January 01, 2019
Inventor(s)
Zwink; Robert V. et al.
## Systems and methods for multifactor physical authentication
### Abstract
Systems and methods for multifactor physical authentication are disclosed. In one embodiment, a method for accessing an entitlemen... | 10169937 | US 10169937 B1 | 2019-01-01 | 64739697 | Systems and methods for multifactor physical authentication | G07C9/23;G07C9/257;G07C9/27;G06F21/31;G06F21/42;G07C9/21;G06F21/34;H04L63/083;H04L63/08 | H04L2463/082;G06F2221/2113;G06F2221/2103 | Zwink; Robert V. et al. | JPMorgan Chase Bank, N.A. | 15/298328 | 2016-10-20 | Garcia; Santiago | 1/1 | JPMorgan Chase Bank, N.A. | 10.72866 | USPAT | 10662.0 | ||||
United States Patent
10171992
Kind Code
B1
Date of Patent
January 01, 2019
Inventor(s)
Viswanathan; Ram et al.
## Switching mobile service provider using blockchain
### Abstract
An example operation may include one or more of receiving, by a mobile service provider, a mobile number portability request from a mobile ... | 10171992 | US 10171992 B1 | 2019-01-01 | 64739900 | Switching mobile service provider using blockchain | H04M15/49;H04W4/24;H04W8/28;H04M15/50 | Viswanathan; Ram et al. | International Business Machines Corporation | 16/016404 | 2018-06-22 | Miller; Brandon J | 1/1 | International Business Machines Corporation | 11.856369 | USPAT | 13027.0 | |||||
United States Patent
10172409
Kind Code
B1
Date of Patent
January 08, 2019
Inventor(s)
Andon; Christopher
## Intelligent electronic footwear and control logic for automated pedestrian collision avoidance
### Abstract
Presented are intelligent electronic footwear with controller automated features, methods for making... | 10172409 | US 10172409 B1 | 2019-01-08 | 64872434 | Intelligent electronic footwear and control logic for automated pedestrian collision avoidance | G08G1/164;A43B3/48;G01S5/0072;G01S19/19;G08G1/162;H04W4/023;B60Q1/2673;G08B21/02;G08G1/005;H04W4/021;B60Q9/008;B60Q5/006;A43B3/34;A43B3/36;B60Q1/525;G08G1/07;A43B3/44;A43B3/50;H04W4/80;G01S5/0027;G08G1/087;G08G1/166;H04W4/40 | G01S19/49;A43C11/165 | Andon; Christopher | NIKE, Inc. | 16/114646 | 2018-08-28 | Patton; Spencer D | 1/1 | NIKE, Inc. | 11.510683 | USPAT | 20578.0 | ||||
United States Patent
10176418
Kind Code
B1
Date of Patent
January 08, 2019
Inventor(s)
Osborn; Kevin et al.
## System and apparatus for encrypted data collection using RFID cards
### Abstract
A secure smart card is described. The smart card can include a processor, a memory and a transceiver. The smart card can comm... | 10176418 | US 10176418 B1 | 2019-01-08 | 64815688 | System and apparatus for encrypted data collection using RFID cards | G06K19/071;G06K19/0723;G06K19/073 | Osborn; Kevin et al. | CAPITAL ONE SERVICES, LLC | 16/042502 | 2018-07-23 | Trail; Allyson | 1/1 | Capital One Services, LLC | 7.856963 | USPAT | 13340.0 | |||||
United States Patent
10193695
Kind Code
B1
Date of Patent
January 29, 2019
Inventor(s)
Endress; Thomas et al.
## Methods and systems for automatic object recognition and authentication
### Abstract
A system and a method of receiving object data representing one or more discriminating characteristics of a physical ob... | 10193695 | US 10193695 B1 | 2019-01-29 | 62110875 | Methods and systems for automatic object recognition and authentication | G06F18/214;G06V20/80;H04L9/0637;G06V20/64;H04L9/3236;H04L9/3239;G06N20/00 | H04L9/3247;G06V20/95;H04L9/50 | Endress; Thomas et al. | Merck Patent GmbH | 16/023590 | 2018-06-29 | Feild; Lynn D | McCoy; Richard A | 1/1 | Merck Patent GmbH | 42.47583 | USPAT | 22937.0 | |||
United States Patent
10193884
Kind Code
B1
Date of Patent
January 29, 2019
Inventor(s)
Griffin; Phillip H. et al.
## Compliance and audit using biometric tokenization
### Abstract
Various embodiments relate to a method of auditing a biometric enrollment event journal entry, performed by a processor of an authenticat... | 10193884 | US 10193884 B1 | 2019-01-29 | 65032229 | Compliance and audit using biometric tokenization | G06F21/33;G06F21/32;H04L63/0428;H04L63/0861;H04L9/3231;H04L9/0866;H04L63/123;H04L63/0807;H04L9/3247 | Griffin; Phillip H. et al. | WELLS FARGO BANK, N.A. | 15/482008 | 2017-04-07 | Lanier; Benjamin E | 1/1 | Wells Fargo Bank, N.A. | 8.907424 | USPAT | 19077.0 | |||||
United States Patent
10200196
Kind Code
B1
Date of Patent
February 05, 2019
Inventor(s)
Rodriguez De Castro; Edward L.
## Cryptographic ASIC with autonomous onboard permanent storage
### Abstract
A cryptographic ASIC and method for autonomously storing data into a one-time programmable memory in isolation. Internal ... | 10200196 | US 10200196 B1 | 2019-02-05 | 65200131 | Cryptographic ASIC with autonomous onboard permanent storage | G06F21/73;H04L9/0643;H04L63/10;G06F12/1408;H04L9/3239;H04L9/0637;H04L9/0836;G06F21/72;H04L9/3226;G06F21/78;H04L9/0877;G06F7/588;H04L9/088;G06F3/0622;H04L9/0863;H04L9/0894 | H04L9/50;H04L2209/12 | Rodriguez De Castro; Edward L. | Blockchain ASICs LLC | 15/979072 | 2018-05-14 | Plecha; Thaddeus J | 1/1 | Blockchain ASICs LLC | 12.186609 | USPAT | 25617.0 | ||||
United States Patent
10200197
Kind Code
B1
Date of Patent
February 05, 2019
Inventor(s)
Li; Wenting et al.
## Scalable crash fault-tolerance consensus protocol with efficient message aggregation
### Abstract
Methods and systems for encrypting and aggregating data in a network are provided. The method includes perfor... | 10200197 | US 10200197 B1 | 2019-02-05 | 62947920 | Scalable crash fault-tolerance consensus protocol with efficient message aggregation | H04L9/3239;H04L9/12;H04L9/3247;H04L9/3242;H04L9/008 | H04L9/50 | Li; Wenting et al. | NEC CORPORATION | 15/844674 | 2017-12-18 | Paliwal; Yogesh | 1/1 | NEC Laboratories Europe GmbH | 33.333176 | USPAT | 6571.0 | ||||
United States Patent
10204160
Kind Code
B1
Date of Patent
February 12, 2019
Inventor(s)
Yelton; Alexis et al.
## Methods and systems for disambiguating user input based on detection of ensembles of items
### Abstract
Systems and methods are described for disambiguating user input based on a physical location of item... | 10204160 | US 10204160 B1 | 2019-02-12 | 65241792 | Methods and systems for disambiguating user input based on detection of ensembles of items | G06F16/58;H04N21/47;H04N21/4828;G06F16/7867;H04N21/44008;H04N21/4524;H04N21/4223;G06V10/751;H04N21/44227;H04N21/482;H04N21/4532;G06V20/00;G06F16/78 | Yelton; Alexis et al. | ROVI GUIDES, INC. | 15/949650 | 2018-04-10 | Corbo; Nicholas T | 1/1 | Rovi Guides, Inc. | 5.794427 | USPAT | 25073.0 | |||||
United States Patent
10204378
Kind Code
B1
Date of Patent
February 12, 2019
Inventor(s)
Wnuk; John Matthew
## Flexible payment services for travel and credit cards
### Abstract
Flexible fiat and cryptocurrency Payment Services (FfcPS) are disclosed for travel and credit cards. This invention applies to U.S. Dollar, ... | 10204378 | US 10204378 B1 | 2019-02-12 | 65241811 | Flexible payment services for travel and credit cards | G06Q20/363;G06Q20/4014;G06Q20/381;G06Q20/223;G06Q20/065;G07F7/1008;G06Q20/3678;G06Q20/3274;G07F7/0833;G06Q20/34;G06Q40/04;G06Q20/4018;G06Q20/367 | G06Q2220/00 | Wnuk; John Matthew | 15/812886 | 2017-11-14 | Huang; Tsan-Yu J | 1/1 | Wnuk; John Matthew | 17.59792 | USPAT | 5639.0 | |||||
United States Patent
10204380
Kind Code
B1
Date of Patent
February 12, 2019
Inventor(s)
Moore; Riley et al.
## Categorically inductive taxonomy system, program product and method
### Abstract
System, method and program product, the system configured to retrieve entity financial transaction data; receive for the fina... | 10204380 | US 10204380 B1 | 2019-02-12 | 65241816 | Categorically inductive taxonomy system, program product and method | G06F16/353;G06F16/25;G06F16/2291;G06Q40/12 | Moore; Riley et al. | EEZZData, Inc. | 14/740757 | 2015-06-16 | Goyea; Olusegun | 1/1 | EEZZData, Inc. | 11.203619 | USPAT | 71260.0 | |||||
United States Patent
10210522
Kind Code
B1
Date of Patent
February 19, 2019
Inventor(s)
Medina, III; Reynaldo et al.
## Systems and methods for counterfeit check detection
### Abstract
Techniques for detecting counterfeit checks include using sensors to determine correspondence between a portion of sensed check info... | 10210522 | US 10210522 B1 | 2019-02-19 | 65322669 | Systems and methods for counterfeit check detection | G06Q20/042;G06K7/1413;G07D7/0043;G07D7/202;G07D7/2075;G06V30/412;G06Q20/0425;G06Q20/4016 | G06V40/394 | Medina, III; Reynaldo et al. | UNITED SERVICES AUTOMOBILE ASSOCIATION (USAA) | 15/707122 | 2017-09-18 | Hess; Daniel A | 1/1 | UIPCO, LLC | 9.497812 | USPAT | 12182.0 | ||||
United States Patent
10210579
Kind Code
B1
Date of Patent
February 19, 2019
Inventor(s)
Neveu; Alan et al.
## Automated expense reports systems and methods
### Abstract
According to another aspect, a computer system is provided. The computer system includes a memory; at least one processor in data communication with... | 10210579 | US 10210579 B1 | 2019-02-19 | 65322786 | Automated expense reports systems and methods | G06Q40/12;G06Q10/1093 | Neveu; Alan et al. | Certify, Inc. | 14/493159 | 2014-09-22 | Mansfield; Thomas L | 1/1 | CERTIFY, INC. | 10.158518 | USPAT | 23447.0 | |||||
United States Patent
10217037
Kind Code
B1
Date of Patent
February 26, 2019
Inventor(s)
Di Iorio; Anthony et al.
## Systems, methods and devices to facilitate secure purchases of cryptocurrencies
### Abstract
There is provided a physical redemption device such as a card and a system for purchasers to buy cryptocurre... | 10217037 | US 10217037 B1 | 2019-02-26 | 65410748 | Systems, methods and devices to facilitate secure purchases of cryptocurrencies | G06Q20/065;G06K19/041;G06Q20/28;G06K19/06037;G06K19/06028;G07F17/42;G06Q20/342 | Di Iorio; Anthony et al. | DECENTRAL INC. | 15/711312 | 2017-09-21 | Hess; Daniel A | 1/1 | DECENTRAL INC. | 5.09653 | USPAT | 13047.0 | |||||
United States Patent
10225289
Kind Code
B1
Date of Patent
March 05, 2019
Inventor(s)
Tucker, IV; Arthur Oliver et al.
## Anonymization overlay network for de-identification of event proximity data
### Abstract
A system comprising: mobile computing devices; an anonymization network; a server computing device coupled ... | 10225289 | US 10225289 B1 | 2019-03-05 | 65496075 | Anonymization overlay network for de-identification of event proximity data | H04W4/30;H04L63/302;H04W4/023;H04W4/029;G06Q20/3223;G06Q20/065;H04L63/0421 | H04W12/02;H04W4/021 | Tucker, IV; Arthur Oliver et al. | 15/703973 | 2017-09-13 | Holliday; Jaime | 1/1 | Tucker, IV; Arthur Oliver,Karlen; Christopher Delton | 5.6394205 | USPAT | 36393.0 | |||||
United States Patent
10236006
Kind Code
B1
Date of Patent
March 19, 2019
Inventor(s)
Gurijala; Aparna R. et al.
## Digital watermarks adapted to compensate for time scaling, pitch shifting and mixing
### Abstract
Pre-processing modules are configured to compensate for time and pitch scaling and shifting and provide ... | 10236006 | US 10236006 B1 | 2019-03-19 | 65721966 | Digital watermarks adapted to compensate for time scaling, pitch shifting and mixing | G10L19/02;G10L19/06;G10L19/018 | G10L21/04;G10L21/043;G10L25/90;G10L21/013 | Gurijala; Aparna R. et al. | Digimarc Corporation | 15/671090 | 2017-08-07 | Elbin; Jesse A | 1/1 | Digimarc Corporation | 7.1035333 | USPAT | 64380.0 | ||||
United States Patent
10237583
Kind Code
B1
Date of Patent
March 19, 2019
Inventor(s)
Allen; Bruce
## Execution of cases based on barcodes in video feeds
### Abstract
Systems and methods for executing a case based on a barcode detected in a video feed are described herein. An example method commences with receiving t... | 10237583 | US 10237583 B1 | 2019-03-19 | 65722085 | Execution of cases based on barcodes in video feeds | H04N21/23418;G06K7/1417;H04N21/6543;H04N21/44008;H04N21/8146;G06F16/9554 | Allen; Bruce | BEGASP LLC. | 16/104734 | 2018-08-17 | Mikels; Matthew | 1/1 | BeGasp LLC | 7.091753 | USPAT | 12619.0 | |||||
United States Patent
10242538
Kind Code
B2
Date of Patent
March 26, 2019
Inventor(s)
Pierce; Matthew Dalton et al.
## Systems and methods for creating and maintaining real money tournaments for video games
### Abstract
A system and method of awarding a participant with a real or virtual prize over a network, the sys... | 10242538 | US 10242538 B2 | 2019-03-26 | 55163541 | Systems and methods for creating and maintaining real money tournaments for video games | G07F17/3276;G07F17/3295;G07F17/3237 | Pierce; Matthew Dalton et al. | Versus LLC | 14/796966 | 2015-07-10 | Deodhar; Omkar A | 1/1 | Versus LLC | 16.243792 | USPAT | 33489.0 | |||||
United States Patent
10243748
Kind Code
B1
Date of Patent
March 26, 2019
Inventor(s)
Callan; Jonathan Sean et al.
## Blockchain based digital certificate provisioning of internet of things devices
### Abstract
A system and method for provisioning an IoT device with a digital certificate without a need for a central ... | 10243748 | US 10243748 B1 | 2019-03-26 | 65811804 | Blockchain based digital certificate provisioning of internet of things devices | H04L9/3239;H04L9/3265;H04L9/3263;H04L9/3247;H04L9/0643 | H04L9/50 | Callan; Jonathan Sean et al. | 16/022278 | 2018-06-28 | Le; Chau | 1/1 | Callan; Jonathan Sean,Finlow-Bates; Keir | 29.4219 | USPAT | 12479.0 | |||||
United States Patent
10244965
Kind Code
B1
Date of Patent
April 02, 2019
Inventor(s)
Gibson; Jeffrey S.
## Capnography device with constant remote surveillance and notification capabilities coupled with automated drug delivery instruments
### Abstract
A completely wireless capnography/drug delivery system is provide... | 10244965 | US 10244965 B1 | 2019-04-02 | 65898629 | Capnography device with constant remote surveillance and notification capabilities coupled with automated drug delivery instruments | G16H80/00;A61B5/0022;A61M5/1723;A61B5/747;A61B5/097;A61M16/024;A61M16/06;G16H40/67;A61M5/142;A61B5/0836 | A61M2205/3584;A61M2230/432;A61M2205/3313;A61M2205/60;A61M2202/0482;A61M2205/18;A61B2560/0204;A61M2205/3569;A61B5/082;A61M2205/3592;A61M2205/50 | Gibson; Jeffrey S. | 16/109794 | 2018-08-23 | Messersmith; Eric J | 1/1 | Gibson; Jeffrey S. | 4.1723404 | USPAT | 29109.0 | |||||
United States Patent
10250383
Kind Code
B1
Date of Patent
April 02, 2019
Inventor(s)
Kumar; Srinivas et al.
## Dynamic domain key exchange for authenticated device to device communications
### Abstract
A method of dynamically generating a domain based public group key and private member keys using a domain key agent... | 10250383 | US 10250383 B1 | 2019-04-02 | 65898558 | Dynamic domain key exchange for authenticated device to device communications | H04W12/108;H04W12/50;H04L9/3247;H04L9/0833;H04W12/0471;H04W12/06;H04W4/06;H04L63/065;H04W12/0433;H04L9/3268;H04L9/3271;H04W12/0431;H04W4/46;H04W12/009;H04L67/12;H04L9/0825;H04W4/40;H04L9/3263;H04W12/069 | H04L2209/80;H04L2209/84 | Kumar; Srinivas et al. | MOCANA CORPORATION | 16/138030 | 2018-09-21 | Vaughan; Michael R | 1/1 | MOCANA CORPORATION | 18.812716 | USPAT | 8489.0 | ||||
United States Patent
10250390
Kind Code
B1
Date of Patent
April 02, 2019
Inventor(s)
Gray; Chad Roberts et al.
## Data health assurance using private proof of authority
### Abstract
A method of securing a network including parsing a first data packet into at least one portion using a first device, such that the at l... | 10250390 | US 10250390 B1 | 2019-04-02 | 65898568 | Data health assurance using private proof of authority | H04L9/3239;H04L63/20;H04L63/1466;G06F16/2255;H04L9/0637 | H04L9/50 | Gray; Chad Roberts et al. | BOOZ ALLEN HAMILTON INC. | 15/924057 | 2018-03-16 | King; John B | 1/1 | BOOZ ALLEN HAMILTON INC. | 10.804831 | USPAT | 9916.0 | ||||
United States Patent
10250394
Kind Code
B1
Date of Patent
April 02, 2019
Inventor(s)
Borne-Pons; Hugo et al.
## Cryptologic self-executing blockchain export commitment
### Abstract
A data furnisher may append, to a furnisher blockchain, an interoperability smart contract comprising a cryptologic committal. The crypt... | 10250394 | US 10250394 B1 | 2019-04-02 | 65898570 | Cryptologic self-executing blockchain export commitment | G06F21/64;G06F16/1805;G06F16/182;G06F16/1865;G06Q20/223;H04L9/0643;H04L9/3239;H04L9/0861;H04L9/0819;H04L9/12;H04L9/3247 | G06Q20/382;H04L9/50;G06F16/275;G06F16/2343 | Borne-Pons; Hugo et al. | ACCENTURE GLOBAL SOLUTIONS LIMITED | 16/136700 | 2018-09-20 | Jhaveri; Jayesh M | 1/1 | Accenture Global Solutions Limited | 55.785423 | USPAT | 21054.0 | ||||
United States Patent
10250395
Kind Code
B1
Date of Patent
April 02, 2019
Inventor(s)
Borne-Pons; Hugo et al.
## Cryptologic blockchain interoperation
### Abstract
Systems and methods for cryptologic blockchain interoperability are provided. A furnisher participant of a furnisher DLT network may receive a request to ... | 10250395 | US 10250395 B1 | 2019-04-02 | 65898579 | Cryptologic blockchain interoperation | H04L9/3247;H04L9/0894;H04L63/12;H04L9/0841;H04L9/14;H04L9/3255;H04L9/3239 | H04L9/50;H04L2209/56 | Borne-Pons; Hugo et al. | ACCENTURE GLOBAL SOLUTIONS LIMITED | 16/116360 | 2018-08-29 | Abyaneh; Ali S | 1/1 | Accenture Global Solutions Limited | 55.059944 | USPAT | 21518.0 | ||||
United States Patent
10250708
Kind Code
B1
Date of Patent
April 02, 2019
Inventor(s)
Carver; David C. et al.
## High performance distributed system of record
### Abstract
A high-performance distributed ledger and transaction computing network fabric over which large numbers of transactions (involving the transformat... | 10250708 | US 10250708 B1 | 2019-04-02 | 65898665 | High performance distributed system of record | H04L67/12;H04L67/108;H04L9/0637;H04L67/565;H04L67/1093;H04L9/3239;H04L67/10;H04L9/3247;H04L9/3297;H04L67/1042;H04L67/1095 | H04L9/50;H04L2209/56 | Carver; David C. et al. | Akamai Technologies, Inc. | 16/008085 | 2018-06-14 | Lim; Krisna | 1/1 | Akamai Technologies, Inc. | 11.895472 | USPAT | 20953.0 | ||||
United States Patent
10251053
Kind Code
B1
Date of Patent
April 02, 2019
Inventor(s)
Paczkowski; Lyle W. et al.
## Embedded subscriber identity module (eSIM) implementation on a wireless communication device using distributed ledger technology (DLT)
### Abstract
A method of storing device information, provisioning d... | 10251053 | US 10251053 B1 | 2019-04-02 | 65898723 | Embedded subscriber identity module (eSIM) implementation on a wireless communication device using distributed ledger technology (DLT) | H04W8/22 | H04W8/183;H04W88/02 | Paczkowski; Lyle W. et al. | Sprint Communications Company L.P. | 15/666564 | 2017-08-02 | Maung; Nay A | Fleming-Hall; Erica L | 1/1 | Sprint Communications Company L.P. | 27.294308 | USPAT | 14725.0 | |||
United States Patent
10251211
Kind Code
B1
Date of Patent
April 02, 2019
Inventor(s)
Tan; Adrian et al.
## Vehicle connection maintenance system
### Abstract
A vehicle connection maintenance system includes a receiver, a transmitter, an electronic controller. The receiver is disposed in a vehicle and is configured t... | 10251211 | US 10251211 B1 | 2019-04-02 | 65898722 | Vehicle connection maintenance system | H04W4/48;H04W4/80;H04W76/25;B60N2/002 | H04W4/44;H04W48/04;H04W84/005;B60N2210/24 | Tan; Adrian et al. | Nissan North America, Inc. | 15/947497 | 2018-04-06 | Tran; Mong-Thuy T | 1/1 | Nissan North America, Inc. | 6.1548204 | USPAT | 9063.0 | ||||
United States Patent
10255645
Kind Code
B1
Date of Patent
April 09, 2019
Inventor(s)
Christensen; Coy et al.
## Systems and methods for personalized dining checks and individualized payment by associating device with dining session
### Abstract
Systems and methods are disclosed for managing personalized dining check... | 10255645 | US 10255645 B1 | 2019-04-09 | 65998148 | Systems and methods for personalized dining checks and individualized payment by associating device with dining session | G06Q20/14;G06Q20/405;G06Q50/12;G06Q20/322 | Christensen; Coy et al. | Worldpay, LLC | 15/389034 | 2016-12-22 | Mitchell; Nathan A | 1/1 | VANTIV, LLC | 9.897995 | USPAT | 22616.0 | |||||
United States Patent
10256829
Kind Code
B1
Date of Patent
April 09, 2019
Inventor(s)
Bertsch; Christoph et al.
## Production of modified image inventories
### Abstract
There are disclosed methods and apparatus for enhancing the image exposure of image inventories. A frame conversion and packaging machine assigns met... | 10256829 | US 10256829 B1 | 2019-04-09 | 65998209 | Production of modified image inventories | G06F16/48;H04L9/3239;H04N21/8358;H04N21/26603;G06V40/10;H04N21/2541;H04L9/3226;H04N21/23418;H04L9/3297;H04N1/465;H04N21/84;H03M1/001 | H04L9/50;H04L2209/608 | Bertsch; Christoph et al. | Eight Plus Ventures, LLC | 16/027068 | 2018-07-03 | Mistry; Oneal R | 1/1 | Eight Plus Ventures, LLC | 12.614515 | USPAT | 12756.0 | ||||
United States Patent
10257052
Kind Code
B1
Date of Patent
April 09, 2019
Inventor(s)
Lønborg; Søren et al.
## Computer-implemented method performed by an electronic data processing apparatus to more efficiently utilize network resources for at least one user device and data processing apparatus for the same
### Abstr... | 10257052 | US 10257052 B1 | 2019-04-09 | 65628783 | Computer-implemented method performed by an electronic data processing apparatus to more efficiently utilize network resources for at least one user device and data processing apparatus for the same | H04L41/50;H04W12/37;H04L43/0876;G06F21/604;H04L63/10 | G06F2221/2149;G09B5/00 | Lønborg; Søren et al. | Heart Thinking Technologies GmbH | 15/908110 | 2018-02-28 | Scott; Randy A | 1/1 | Heart Thinking Technologies GmbH | 12.41507 | USPAT | 18425.0 | ||||
United States Patent
10257960
Kind Code
B1
Date of Patent
April 09, 2019
Inventor(s)
Banerjee; Abhishek et al.
## Power distribution for immersion-cooled information systems
### Abstract
A two-phase immersion cooling system includes two or more voltage converters and a plurality of circuit boards, which are held in ... | 10257960 | US 10257960 B1 | 2019-04-09 | 65998187 | Power distribution for immersion-cooled information systems | H05K7/203;H05K7/1427;H05K7/20818;H05K7/1492;H05K7/20327;H02B1/56;H01R12/722;H01B7/0045;H02B1/20;H01R25/162 | Banerjee; Abhishek et al. | 16/117870 | 2018-08-30 | Sawyer; Steven T | 1/1 | TAS Energy, Inc. | 5.2178106 | USPAT | 13856.0 | ||||||
United States Patent
10261711
Kind Code
B1
Date of Patent
April 16, 2019
Inventor(s)
Pasirstein; David Brett
## Proof of non-tampering for stored data
### Abstract
An application shim receives transactions that will update a portion of data stored in an existing data store. A reduced representation of the pre-update... | 10261711 | US 10261711 B1 | 2019-04-16 | 66098384 | Proof of non-tampering for stored data | H04L9/0637;H04L9/3236;G06F21/6218;H04L9/3297;G06F16/23;G06F16/907;G06F21/64;H04L9/3239;G06F3/0623;G06F16/27 | H04L9/50;H04L67/104 | Pasirstein; David Brett | Merck Sharp & Dohme Corp. | 15/880476 | 2018-01-25 | Phillips, III; Albert M | 1/1 | Merck Sharp & Dohme Corp. | 16.619322 | USPAT | 17495.0 | ||||
United States Patent
10261846
Kind Code
B1
Date of Patent
April 16, 2019
Inventor(s)
Patton; Damien et al.
## Storing and verifying the integrity of event related data
### Abstract
The present invention extends to methods, systems, and computer program products for storing and validating the integrity of event relat... | 10261846 | US 10261846 B1 | 2019-04-16 | 66098411 | Storing and verifying the integrity of event related data | G06F9/542;H04L9/3239;G06F21/64;H04L63/123;H04L41/145;H04L9/3297;G06F9/5005;G06F16/182;G06F21/6245 | H04L9/50 | Patton; Damien et al. | Banjo, Inc. | 16/121847 | 2018-09-05 | Anya; Charles E | 1/1 | Banjo, Inc. | 5.604308 | USPAT | 19007.0 | ||||
United States Patent
10262321
Kind Code
B1
Date of Patent
April 16, 2019
Inventor(s)
Ramanathan; Ramanathan et al.
## Digital coin, digital wallet, and model of transaction
### Abstract
Embodiments of the present disclosure are directed to, among other things, methods, systems, and computer program instructions rela... | 10262321 | US 10262321 B1 | 2019-04-16 | 66098397 | Digital coin, digital wallet, and model of transaction | G06Q20/3829;G06Q20/065;G06Q20/00;G06Q20/3678 | G06Q2220/00 | Ramanathan; Ramanathan et al. | 14/788585 | 2015-06-30 | Kwong; Cho | 1/1 | Ramanathan; Ramanathan,Ramanathan; Anirudh | 16.721943 | USPAT | 30237.0 | |||||
United States Patent
10262437
Kind Code
B1
Date of Patent
April 16, 2019
Inventor(s)
Ter Beest, III; James J.
## Decentralized position and navigation method, device, and system leveraging augmented reality, computer vision, machine learning, and distributed ledger technologies
### Abstract
A method for determining ... | 10262437 | US 10262437 B1 | 2019-04-16 | 66098735 | Decentralized position and navigation method, device, and system leveraging augmented reality, computer vision, machine learning, and distributed ledger technologies | G06T7/74;G01C21/1656;G06F16/29;G01C21/1654;G06T7/73;G06V20/20;G01C21/005 | G06T2207/30244;G06V2201/10;G06N20/00 | Ter Beest, III; James J. | BOOZ ALLEN HAMILTON INC. | 16/176673 | 2018-10-31 | Bitar; Nancy | 1/1 | BOOZ ALLEN HAMILTON INC. | 37.881763 | USPAT | 13071.0 | ||||
United States Patent
10263785
Kind Code
B1
Date of Patent
April 16, 2019
Inventor(s)
Waters; Thomas J. et al.
## Cryptography method and system for securing data via electronic transmission
### Abstract
Securing information is increasingly difficult. With technological advances and tools/information sharing between ... | 10263785 | US 10263785 B1 | 2019-04-16 | 66098636 | Cryptography method and system for securing data via electronic transmission | H04L63/062;H04L63/061;G06F21/6218;G06F21/602;H04L9/083;H04L63/0407;H04L63/0442;H04L9/3239 | H04L9/50;G06F2221/034 | Waters; Thomas J. et al. | 15/588192 | 2017-05-05 | Ho; Dao Q | 1/1 | Autography LLC | 10.658129 | USPAT | 9637.0 | |||||
United States Patent
10268817
Kind Code
B1
Date of Patent
April 23, 2019
Inventor(s)
Pham; Vincent et al.
## Methods, mediums, and systems for establishing and using security questions
### Abstract
Exemplary embodiments relate to the secure storage of security questions through an immutable log, such as a blockchain... | 10268817 | US 10268817 B1 | 2019-04-23 | 66174995 | Methods, mediums, and systems for establishing and using security questions | G06F21/45;G06F21/6227;H04L9/3239;H04L9/3226;G06F21/602 | H04L9/50 | Pham; Vincent et al. | Capital One Services, LLC | 16/153164 | 2018-10-05 | Schwartz; Darren B | 1/1 | Capital One Services, LLC | 7.283677 | USPAT | 14767.0 | ||||
United States Patent
10269009
Kind Code
B1
Date of Patent
April 23, 2019
Inventor(s)
Winklevoss; Cameron Howard et al.
## Systems, methods, and program products for a digital math-based asset exchange
### Abstract
Systems, methods, and program products for providing exchanges for converting from, to, or between digi... | 10269009 | US 10269009 B1 | 2019-04-23 | 66175027 | Systems, methods, and program products for a digital math-based asset exchange | G06Q20/105;G06Q20/36;G06Q20/065;G06Q20/3674 | G06Q2220/00 | Winklevoss; Cameron Howard et al. | WINKLEVOSS IP, LLC | 14/611136 | 2015-01-30 | Robinson; Kito R | Tibljas; Shacole C | 1/1 | WINKLEVOSS IP, LLC | 14.535649 | USPAT | 71097.0 | |||
United States Patent
10270770
Kind Code
B1
Date of Patent
April 23, 2019
Inventor(s)
Irwan; Susanto Junaidi et al.
## Generic computing device attestation and enrollment
### Abstract
Secure enrollment of devices into computer networks is improved by a method that comprises receiving a first set of security data for ... | 10270770 | US 10270770 B1 | 2019-04-23 | 66174856 | Generic computing device attestation and enrollment | H04L63/0876;H04L9/3247;H04L9/3239;H04L9/0637;G06F21/44;G06F21/64;H04L9/085;H04L63/0823;H04L9/0866;H04W4/70;H04L9/3271 | H04W4/027;H04W4/02;H04W4/80;H04W12/06;H04L9/50 | Irwan; Susanto Junaidi et al. | Xage Security, Inc. | 16/110567 | 2018-08-23 | Chai; Longbit | 1/1 | XAGE SECURITY, INC. | 8.281845 | USPAT | 16741.0 | ||||
United States Patent
10275400
Kind Code
B1
Date of Patent
April 30, 2019
Inventor(s)
Newman; Rhys Andrew
## Systems and methods for forming a fault-tolerant federated distributed database
### Abstract
The present disclosure provides a method for forming a fault-tolerant federated distributed database system, wherein... | 10275400 | US 10275400 B1 | 2019-04-30 | 66248306 | Systems and methods for forming a fault-tolerant federated distributed database | G06F16/256;G06F16/2365;G06F16/27;G06F16/2477 | Newman; Rhys Andrew | XANADU BIG DATA, LLC | 15/950909 | 2018-04-11 | Singh; Amresh | 1/1 | XANADU BIG DATA, LLC | 11.936763 | USPAT | 11139.0 | |||||
United States Patent
10277400
Kind Code
B1
Date of Patent
April 30, 2019
Inventor(s)
Griffin; Phillip H. et al.
## Biometric electronic signature tokens
### Abstract
The methods and system allow for the generation of a biometric electronic signature token using a subsequent biometric sample after an enrollment of a ... | 10277400 | US 10277400 B1 | 2019-04-30 | 66248338 | Biometric electronic signature tokens | H04L9/3231;H04L9/3297;H04L9/14;H04L9/3263;H04L9/30;H04L9/3247;H04L9/3236;H04L9/0866 | Griffin; Phillip H. et al. | WELLS FARGO BANK, N.A. | 15/299308 | 2016-10-20 | Najjar; Saleh | Almaghayreh; Khalid M | 1/1 | Wells Fargo Bank, N.A. | 6.2776823 | USPAT | 20055.0 | ||||
United States Patent
10282790
Kind Code
B1
Date of Patent
May 07, 2019
Inventor(s)
Kolbrener; Michael et al.
## Systems, media, and methods for enriching data records and enabling historical data replay
### Abstract
Described are methods, systems, and media for enriching data records while preserving data provenance... | 10282790 | US 10282790 B1 | 2019-05-07 | 66334035 | Systems, media, and methods for enriching data records and enabling historical data replay | G06Q40/03;G06F16/219;G06Q40/12 | Kolbrener; Michael et al. | PROMONTECH LLC | 15/820260 | 2017-11-21 | Wilder; A. Hunter | 1/1 | PROMONTECH LLC | 28.866802 | USPAT | 20790.0 | |||||
United States Patent
10284541
Kind Code
B1
Date of Patent
May 07, 2019
Inventor(s)
Subramanian; Ponnazhakan et al.
## System and method for generating enhanced distributed online registry
### Abstract
A system for generating an enhanced distributed online registry that utilizes an interoperable framework, and machin... | 10284541 | US 10284541 B1 | 2019-05-07 | 66333905 | System and method for generating enhanced distributed online registry | H04W64/00;H04L67/10;H04L67/52;H04L67/55;G06N20/00;H04L67/306;H04W12/06;H04L63/08;H04W76/10;G06Q50/01;H04W12/63 | H04W12/64;H04L67/1095 | Subramanian; Ponnazhakan et al. | CAPITAL ONE SERVICES, LLC | 16/030048 | 2018-07-09 | Abrishamkar; Kaveh | 1/1 | Capital One Services, LLC | 10.295042 | USPAT | 13955.0 | ||||
United States Patent
10289816
Kind Code
B1
Date of Patent
May 14, 2019
Inventor(s)
Malassenet; Francois Jacques et al.
## Methods, systems, and devices for an encrypted and obfuscated algorithm in a computing environment
### Abstract
A computer implemented method is disclosed for obfuscating an algorithm. The comput... | 10289816 | US 10289816 B1 | 2019-05-14 | 66439586 | Methods, systems, and devices for an encrypted and obfuscated algorithm in a computing environment | G06F9/45516;G06F21/75;H04L9/002;G06F21/14;G06F21/52;G06F9/30036 | H04L2209/16;G06F21/6245 | Malassenet; Francois Jacques et al. | GSFM LLC | 16/003152 | 2018-06-08 | Chiang; Jason | 1/1 | Malassenet; Francois Jacques,Sidle; Glenn Daniel | 4.3598146 | USPAT | 28713.0 | ||||
United States Patent
10289915
Kind Code
B1
Date of Patent
May 14, 2019
Inventor(s)
Bertsch; Christoph et al.
## Manufacture of image inventories
### Abstract
There are disclosed methods and apparatus for manufacture of image inventories. A frame slicing and packaging machine assigns metadata to each frame of a digit... | 10289915 | US 10289915 B1 | 2019-05-14 | 66439651 | Manufacture of image inventories | G06V40/10;H04L9/3239;G06F16/48;H04L9/0643;G06T1/0021;H04L9/50;G06V20/46;G06F16/71 | H04L2209/608;G06T2207/10004 | Bertsch; Christoph et al. | Eight Plus Ventures, LLC | 16/000410 | 2018-06-05 | Edwards; Linglan E | 1/1 | Eight Plus Ventures, LLC | 11.543678 | USPAT | 7222.0 | ||||
United States Patent
10291316
Kind Code
B1
Date of Patent
May 14, 2019
Inventor(s)
Schloemer; Gerald R.
## Data transmission systems and methods using satellite-to-satellite radio links
### Abstract
Radio communications systems use 100 to 200 satellites in random low-earth orbits distributed over a predetermined ran... | 10291316 | US 10291316 B1 | 2019-05-14 | 66439784 | Data transmission systems and methods using satellite-to-satellite radio links | H04B7/18584;H04B7/18556;H04B7/18554;H04B7/1856;H04B7/18519;H04B7/18521;G01S19/06;G01S19/14 | Schloemer; Gerald R. | STAR MESH LLC | 16/034413 | 2018-07-13 | Taylor; Nathan S | 1/1 | STAR MESH LLC | 7.844303 | USPAT | 31786.0 | |||||
United States Patent
10296258
Kind Code
B1
Date of Patent
May 21, 2019
Inventor(s)
Richardson; Michael
## Offloading data storage to a decentralized storage network
### Abstract
Offloading data storage to a decentralized storage network, including: identifying a plurality of decentralized storage networks that the s... | 10296258 | US 10296258 B1 | 2019-05-21 | 66540922 | Offloading data storage to a decentralized storage network | G06F3/0604;G06F3/0653;G06F3/067;G06F11/1076;G06F3/0647;H04L67/1095;H04L67/1097 | G06F2201/84;G06F11/2094 | Richardson; Michael | Pure Storage, Inc. | 15/916599 | 2018-03-09 | Rones; Charles | Doan; Han V | 1/1 | Pure Storage, Inc. | 9.05256 | USPAT | 42647.0 | |||
United States Patent
10296729
Kind Code
B1
Date of Patent
May 21, 2019
Inventor(s)
Bertsch; Christoph et al.
## Manufacture of inventories of image products
### Abstract
There are disclosed methods and apparatus for manufacture of image inventories. A production and packaging machine applies derivations to still ima... | 10296729 | US 10296729 B1 | 2019-05-21 | 66541125 | Manufacture of inventories of image products | H04L9/3239;H04L9/0643;H04L9/0637;G06F21/16;G06F16/7837;G06F21/64;G06V20/46 | G06F21/1063;G06V20/40;H04L9/50;H04L2209/608;G06T1/0021 | Bertsch; Christoph et al. | Eight Plus Ventures, LLC | 16/110831 | 2018-08-23 | Truong; Thanhnga B | 1/1 | Eight Plus Ventures, LLC | 12.068487 | USPAT | 9663.0 | ||||
United States Patent
10296764
Kind Code
B1
Date of Patent
May 21, 2019
Inventor(s)
Batishchev; Andriy
## Verifiable cryptographically secured ledgers for human resource systems
### Abstract
One or more human resources systems implements one or more cryptographically secured ledger(s) to persist transactions related ... | 10296764 | US 10296764 B1 | 2019-05-21 | 66541082 | Verifiable cryptographically secured ledgers for human resource systems | G06F21/602;H04L9/3239;G06Q10/105;G06F21/64 | H04L9/50 | Batishchev; Andriy | AMAZON TECHNOLOGIES, INC. | 15/356462 | 2016-11-18 | Reza; Mohammad W | 1/1 | Amazon Technologies, Inc. | 17.650415 | USPAT | 23574.0 | ||||
United States Patent
10298395
Kind Code
B1
Date of Patent
May 21, 2019
Inventor(s)
Schiatti; Luca et al.
## Interoperability of zero-knowledge proof enabled blockchains
### Abstract
For shielded cryptographic data exchange interoperation, an interoperability node is in communication with a furnisher participant node... | 10298395 | US 10298395 B1 | 2019-05-21 | 66541240 | Interoperability of zero-knowledge proof enabled blockchains | H04L9/3218;H04L9/3239;H04L9/3221 | H04L9/50 | Schiatti; Luca et al. | ACCENTURE GLOBAL SOLUTIONS LIMITED | 16/142657 | 2018-09-26 | Li; Meng | 1/1 | Accenture Global Solutions Limited | 51.95723 | USPAT | 22702.0 | ||||
United States Patent
10298585
Kind Code
B1
Date of Patent
May 21, 2019
Inventor(s)
Treat; David et al.
## Blockchain interoperability
### Abstract
A system supports asset transfers among blockchains of differing distributed ledger technologies using interop circuitry. The interop circuitry may receive asset permissi... | 10298585 | US 10298585 B1 | 2019-05-21 | 65241132 | Blockchain interoperability | H04L9/0643;G06Q40/04;G06Q20/02;H04L63/10;H04L63/08;G06Q20/223;G06Q20/06 | H04L9/50;G06Q2220/00 | Treat; David et al. | Accenture Global Solutions Limited | 16/255167 | 2019-01-23 | Lemma; Samson B | 1/1 | Accenture Global Solutions Limited | 31.10807 | USPAT | 17610.0 | ||||
United States Patent
10299128
Kind Code
B1
Date of Patent
May 21, 2019
Inventor(s)
Suthar; Om Prakash et al.
## Securing communications for roaming user equipment (UE) using a native blockchain platform
### Abstract
A network function (NF) entity in a communication network receives authentication data associated wit... | 10299128 | US 10299128 B1 | 2019-05-21 | 66541023 | Securing communications for roaming user equipment (UE) using a native blockchain platform | H04W8/02;G06Q20/10;G06Q20/322;G06Q20/401;H04L9/3226;H04L47/70;G06Q20/40;H04W4/24;G06F9/45558;H04L41/0896;H04L9/3247;G06Q20/389;H04W60/00;H04L41/0806;H04L41/0895;G06Q20/403;H04M15/8016;G06Q20/325;H04L9/3239;H04L9/083;H04L63/08;H04W12/08;G06Q20/36;H04L67/51;H04W12/06;H04L9/0637;H04L9/30;H04M15/8038;H04M15/61;G06Q20/065;H... | H04L41/5019;H04L12/1407;H04L41/40;G06F2009/4557;H04L43/0817;H04L9/50;G06F2009/45595;H04L2209/56;H04W8/18;G06Q2220/00;H04L41/342;H04W88/02;H04L2209/80;H04L43/20;H04L41/122;H04W60/04;H04L41/5009 | Suthar; Om Prakash et al. | CISCO TECHNOLOGY, INC. | 16/171190 | 2018-10-25 | Zaidi; Syed A | 1/1 | Cisco Technology, Inc. | 15.153524 | USPAT | 30913.0 | ||||
United States Patent
10299412
Kind Code
B1
Date of Patent
May 21, 2019
Inventor(s)
Papen; Jeffrey et al.
## System and method for cooling computing devices within a facility
### Abstract
A system for cooling computing devices within a facility includes an air inlet that delivers cool air to a supply air space within... | 10299412 | US 10299412 B1 | 2019-05-21 | 66541033 | System and method for cooling computing devices within a facility | G06F1/20;H05K7/20745;F24F7/06;H05K7/1497;F24F13/10;H05K7/20727 | Papen; Jeffrey et al. | Core Scientific, Inc. | 16/053648 | 2018-08-02 | Patel; Mukundbhai G | 1/1 | Core Scientific, Inc. | 14.761707 | USPAT | 16138.0 | |||||
United States Patent
10304062
Kind Code
B1
Date of Patent
May 28, 2019
Inventor(s)
Hines; Scott
## Computer architecture incorporating blockchain based immutable audit ledger for compliance with data regulations
### Abstract
A computer system architecture and method for providing compliance with data regulations, by... | 10304062 | US 10304062 B1 | 2019-05-28 | 66636233 | Computer architecture incorporating blockchain based immutable audit ledger for compliance with data regulations | G06Q30/018;G06F21/602;H04L9/3239;G06F21/6254;H04L9/0637;G06F21/64 | H04L9/50;H04L2209/88;H04L2209/42 | Hines; Scott | TD PROFESSIONAL SERVICES, LLC | 15/934720 | 2018-03-23 | Pham; Michael | 1/1 | TD PROFESSIONAL SERVICES, LLC | 19.994345 | USPAT | 8703.0 | ||||
United States Patent
10305833
Kind Code
B1
Date of Patent
May 28, 2019
Inventor(s)
Dennis; Stewart MacGregor
## Blockchain based email procedures
### Abstract
Systems and techniques are provided for managing and categorizing unsolicited emails from unknown senders using blockchain technology. In a specific implement... | 10305833 | US 10305833 B1 | 2019-05-28 | 66636139 | Blockchain based email procedures | H04L9/16;H04L9/30;H04L63/0227;H04L9/0637;H04L67/10;H04L9/3247;H04L51/48;H04L63/102;H04L9/3239;H04L9/14;H04L9/088;H04L51/212;H04L63/205 | H04L63/0428;H04L9/50 | Dennis; Stewart MacGregor | TURING TECHNOLOGY, INC. | 15/723467 | 2017-10-03 | Chai; Longbit | 1/1 | Turing Technology, Inc. | 16.226843 | USPAT | 18703.0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.