Decentralized cryptographic coinage is growing. As cryptographic coinage continues to gain acceptance, many entities will want to offer their own cryptographic coinage.
The features, aspects, and advantages of the exemplary embodiments are understood when the following Detailed Description is read with reference to the accompanying drawings, wherein:
The exemplary embodiments will now be described more fully hereinafter with reference to the accompanying drawings. The exemplary embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. These embodiments are provided so that this disclosure will be thorough and complete and will fully convey the exemplary embodiments to those of ordinary skill in the art. Moreover, all statements herein reciting embodiments, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future (i.e., any elements developed that perform the same function, regardless of structure).
Thus, for example, it will be appreciated by those of ordinary skill in the art that the diagrams, schematics, illustrations, and the like represent conceptual views or processes illustrating the exemplary embodiments. The functions of the various elements shown in the figures may be provided through the use of dedicated hardware as well as hardware capable of executing associated software. Those of ordinary skill in the art further understand that the exemplary hardware, software, processes, methods, and/or operating systems described herein are for illustrative purposes and, thus, are not intended to be limited to any particular named manufacturer.
As used herein, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless expressly stated otherwise. It will be further understood that the terms “includes,” “comprises,” “including,” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will be understood that when an element is referred to as being “connected” or “coupled” to another element, it can be directly connected or coupled to the other element or intervening elements may be present. Furthermore, “connected” or “coupled” as used herein may include wirelessly connected or coupled. As used herein, the term “and/or” includes any and all combinations of one or more of the associated listed items.
It will also be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first device could be termed a second device, and, similarly, a second device could be termed a first device without departing from the teachings of the disclosure.
The data layer server 24 may also receive the additional blockchains 20b and 20c. Blockchain 20b, for example, may be generated by the entity server 26b that is operated on behalf of the entity 28b.
The data layer server 24 thus receives the multiple blockchains 20a-c. The data layer server 24 accepts the private blockchains 20a-c as inputs and generates the blockchain data layer 40. The blockchain data layer 40 contains the various data records 38, as later paragraphs will explain. Moreover, the blockchain data layer 40 may also add another layer of cryptographic hashing to generate one or more cryptographic proofs 48. The cryptographic proofs 48 may then be incorporated into one or more public blockchains 50. The blockchain data layer 40 may thus acts as a validation service 52 for the private blockchains 20a-c. The public blockchain 50 thus publishes the cryptographic proofs 48 as a public ledger 52 that establishes chains of blocks of immutable evidence. Each cryptographic proof 48 thus provides evidentiary documentation of the blocks of data contained within the respective private blockchains 20a-c.
Exemplary embodiments, though, may limit or allocate the data layer server 24 and/or the blockchain data layer 40. That is, as the data layer server 24 receives the private blockchains 20a-c and generates the blockchain data layer 40, exemplary embodiments may implement a blockchain load balancing mechanism 60. The blockchain load balancing mechanism 60 analyzes any information or data (such as the one or more load parameters 22) to determines how and/or when data layer server 24 processes the private blockchains 20a-c to generate the blockchain data layer 40. The blockchain load balancing mechanism 60 thus determines how the multiple blockchains 20a-c share, consume, or monopolize the processing capabilities of the data layer server 24 and/or the blockchain data layer 40.
The load parameter 22 may thus represent financial transactions. Blockchain 20a, for example, may contain blocks 74a of data representing financial transactions 76a associated with the entity's private cryptocoinage 70a. Blockchains 20b and 20c would similarly contain blocks 74b-c of data representing financial transactions 76b-c associated with the entity's private cryptocoinage 70b-c. As the blockchains 20a-c stream as inputs to the data layer server 24, the blockchain load balancing mechanism 60 determines a rate 78 of the financial transactions 76 that corresponds to each different blockchain 20a-c. While the rate 78 may be measured or defined according to any measure, most readers are thought familiar with a count or sum of the financial transactions 76 per unit time (such as seconds, minutes, hours, or per day). The blockchain load balancing mechanism 60 may read, inspect, or sample any of the blockchains 20 and count or sum any blocks 74 of data representing a financial transaction 76 occurring within a window of time. The blockchain load balancing mechanism 60 computes or determines the rate 78 (e.g., number of the financial transactions 76 per second). The blockchain load balancing mechanism 60 may then use the rate 78 to determine how the multiple blockchains 20a-c share, consume, or monopolize the processing capabilities of the data layer server 24 and/or the blockchain data layer 40.
Load balancing may be desired. As the data layer server 24 may provide resources to many different entity servers 26, optimal management techniques may be desired. That is, as the entity servers 26 make requests for data or processing, some of the shared resources in the data layer server 24 may be over utilized. The blockchain load balancing mechanism 60 may thus balance or distribute processing and/or memory loads among the virtual machines 80. The blockchain load balancing mechanism 60 may assign or distribute one of the private blockchains 20 to a particular virtual machine 80 for processing. Suppose, for example, that each virtual machine 80a-d is assigned a corresponding share 82a-c of the total resources of the data layer server 24. As the private blockchains 20a-c are received as inputs, the blockchain load balancing mechanism 60 inspects the private blockchains 20a-c and determines a corresponding processing ratio 84a-c (which later paragraphs will explain in more detail). The blockchain load balancing mechanism 60 may then assign a particular one of the virtual machines 80a-c, based on the processing ratio 84a-c and the share 82a-c assigned to each virtual machine 80a-c. Each private blockchain 20, in other words, may be assigned a processing bandwidth or slice of the data layer server 24 according to its processing load or burden.
Exemplary embodiments include still more publication mechanisms. For example, the cryptographic proof 48 and/or the public blockchain 50 may be sent (via the communications network 110 illustrated in
Exemplary embodiments may be applied regardless of networking environment. Exemplary embodiments may be easily adapted to stationary or mobile devices having cellular, wireless fidelity (WI-FI®), near field, and/or BLUETOOTH® capability. Exemplary embodiments may be applied to mobile devices utilizing any portion of the electromagnetic spectrum and any signaling standard (such as the IEEE 802 family of standards, GSM/CDMA/TDMA or any cellular standard, and/or the ISM band). Exemplary embodiments, however, may be applied to any processor-controlled device operating in the radio-frequency domain and/or the Internet Protocol (IP) domain. Exemplary embodiments may be applied to any processor-controlled device utilizing a distributed computing network, such as the Internet (sometimes alternatively known as the “World Wide Web”), an intranet, a local-area network (LAN), and/or a wide-area network (WAN). Exemplary embodiments may be applied to any processor-controlled device utilizing power line technologies, in which signals are communicated via electrical wiring. Indeed, exemplary embodiments may be applied regardless of physical componentry, physical configuration, or communications standard(s).
Exemplary embodiments may utilize any processing component, configuration, or system. Any processor could be multiple processors, which could include distributed processors or parallel processors in a single machine or multiple machines. The processor can be used in supporting a virtual processing environment. The processor could include a state machine, application specific integrated circuit (ASIC), programmable gate array (PGA) including a Field PGA, or state machine. When any of the processors execute instructions to perform “operations,” this could include the processor performing the operations directly and/or facilitating, directing, or cooperating with another device or component to perform the operations.
Exemplary embodiments may packetize. When the entity server 26 and the data layer server 24 communicate via the communications network 110, the entity server 26 and the data layer server 24 may collect, send, and retrieve information. The information may be formatted or generated as packets of data according to a packet protocol (such as the Internet Protocol). The packets of data contain bits or bytes of data describing the contents, or payload, of a message. A header of each packet of data may contain routing information identifying an origination address and/or a destination address.
As
Exemplary embodiments may use any hashing function. Many readers may be familiar with the SHA-256 hashing algorithm. The SHA-256 hashing algorithm acts on any electronic data or information to generate a 256-bit hash value as a cryptographic key. The key is thus a unique digital signature. There are many hashing algorithms, though, and exemplary embodiments may be adapted to any hashing algorithm.
Load balancing may be desired. The blockchain load balancing mechanism 60 may query an electronic database 180 to determine virtual assignments. That is, the blockchain load balancing mechanism 60 may assign or distribute any of the private blockchains 20 to a particular one of the virtual machines 80 according to the informational content within the electronic database 180.
The database 180 may specify the bandwidths. The database 180 may be preloaded or preconfigured with the processor bandwidth 200 and/or the memory bandwidth 202 assigned to each virtual machine 80. As the data layer server 24 receives the private blockchain 20, the data layer application 132 (executing or applying the blockchain load balancing mechanism 60) may determine the corresponding blockchain processor bandwidth 204 (perhaps in bits per second) that is required of the processor 130 to process the private blockchain 20. The blockchain load balancing mechanism 60 may also determine the corresponding blockchain memory bandwidth 206 (perhaps in bits per second) that is required of the memory device 134 to process the private blockchain 20. The blockchain load balancing mechanism 60 may query the database 180 for the blockchain processor bandwidth 204 and/or the blockchain memory bandwidth 206 to identify the corresponding virtual machine 80. If the blockchain processor bandwidth 204 and/or the blockchain memory bandwidth 206 match or satisfy a range of values associated with an entry, then the blockchain load balancing mechanism 60 may assigned the private blockchain 20 to the corresponding virtual machine 80. Once the virtual machine 80 is identified, the blockchain load balancing mechanism 60 may establishes any other parameters for processing.
The bit rate 210 may thus determine the virtual machine 80. One of the virtual machines 80 may be reserved for private blockchains 20 having a heavy, disproportionate, or abnormally large bit rate 210. Another virtual machine 80 may be reserved for private blockchains 20 having a medium, intermediate, or historically average bit rate 210. Still another one of the virtual machines 80 may be reserved for the private blockchains 20 having a light, low, or historically below average bit rate 210. The resources available from the data layer server 24 and/or the blockchain data layer 40 may be assigned based on slices or portions as determined by the bit rate 210.
The rate 78 of the financial transactions 76 may thus determine the virtual machine 80. One of the virtual machines 20 may be reserved for private blockchains 20 having a heavy, disproportionate, or abnormally large number of the transactions 76 per second. Another virtual machine 80 may be reserved for private blockchains 20 having a medium, intermediate, or historically average number of the transactions 76 per second. Another virtual machine 80 may be reserved for the private blockchains 20 having a light, low, or historically below average number of the transactions 76 per second. The resources available from the data layer server 24 and/or the blockchain data layer 40 may be assigned based on slices or portions as determined by the cryptocoinage transactions 76 per second.
The private cryptocoinage 70 may be required to access the private blockchain 20. The entity 28, for example, may require that a user spend or redeem a credit token (not shown for simplicity) of the private cryptocoinage 70. The user, for example, may burn one or more of credit tokens to access the blocks of data and/or hash values incorporated into the private blockchain 20. The credit token may or may not be transferrable, depending on policies established by the entity 28. A tradeable token (again not shown for simplicity) may also be established, and the tradeable token may be bought, sold, and/or earned, again according to the policies established by the entity 28. Regardless, the private cryptocoinage 70 must be consumed to access, read, or otherwise use the entity's private blockchain 20.
The rate 220 of generation may thus be a feedback mechanism. As the private blockchains 20 are received, the rate 220 of generation of the data records 38 may determine the virtual machine 80 assigned adequate capacity or bandwidth. Again, one of the virtual machines 20 may be reserved for private blockchains 20 having a heavy, disproportionate, or abnormally large rate 220 of generation. Another virtual machine 80 may be reserved for private blockchains 20 having a medium, intermediate, or historically average rate 220 of generation. Another virtual machine 80 may be reserved for the private blockchains 20 having a light, low, or historically below average rate 220 of generation. The rate 220 of generation may thus be a gauge or measure of which virtual machine 80 is assigned the resources that process the private blockchain 20.
Exemplary embodiments may be applied to any signaling standard. Most readers are thought familiar with the Global System for Mobile (GSM) communications signaling standard. Those of ordinary skill in the art, however, also recognize that exemplary embodiments are equally applicable to any communications device utilizing the Time Division Multiple Access signaling standard, the Code Division Multiple Access signaling standard, the “dual-mode” GSM-ANSI Interoperability Team (GAIT) signaling standard, or any variant of the GSM/CDMA/TDMA signaling standard. Exemplary embodiments may also be applied to other standards, such as the I.E.E.E. 802 family of standards, the Industrial, Scientific, and Medical band of the electromagnetic spectrum, BLUETOOTH®, and any other.
Exemplary embodiments may be physically embodied on or in a computer-readable storage medium. This computer-readable medium, for example, may include CD-ROM, DVD, tape, cassette, floppy disk, optical disk, memory card, memory drive, and large-capacity disks. This computer-readable medium, or media, could be distributed to end-subscribers, licensees, and assignees. A computer program product comprises processor-executable instructions for load balancing, as the above paragraphs explain.
While the exemplary embodiments have been described with respect to various features, aspects, and embodiments, those skilled and unskilled in the art will recognize the exemplary embodiments are not so limited. Other variations, modifications, and alternative embodiments may be made without departing from the spirit and scope of the exemplary embodiments.
This patent application is a continuation of U.S. application Ser. No. 15/983,595 filed May 18, 2018 and since issue as U.S. Patent X, which is incorporated herein by reference in its entirety. This patent application relates to U.S. application Ser. No. 15/983,572 filed May 18, 2018 and incorporated herein by reference in its entirety. This patent application also relates to U.S. application Ser. No. 15/983,612 filed May 18, 2018 and incorporated herein by reference in its entirety. This patent application also relates to U.S. application Ser. No. 15/983,632 filed May 18, 2018 and incorporated herein by reference in its entirety. This patent application also relates to U.S. application Ser. No. 15/983,655 filed May 18, 2018 and incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4309569 | Merkle | Jan 1982 | A |
5499294 | Friedman | Mar 1996 | A |
5862218 | Steinberg | Jan 1999 | A |
5920629 | Rosen | Jul 1999 | A |
5966446 | Davis | Oct 1999 | A |
7028263 | Maguire | Apr 2006 | B2 |
7212808 | Engstrom | May 2007 | B2 |
7272179 | Siemens et al. | Sep 2007 | B2 |
7572179 | Choi et al. | Aug 2009 | B2 |
7729950 | Mendizabal et al. | Jun 2010 | B2 |
8245038 | Golle et al. | Aug 2012 | B2 |
8266439 | Haber et al. | Sep 2012 | B2 |
8442903 | Zadoorian et al. | May 2013 | B2 |
8560722 | Gates et al. | Oct 2013 | B2 |
8706616 | Flynn | Apr 2014 | B1 |
8712887 | DeGroeve et al. | Apr 2014 | B2 |
8867741 | McCorkindale et al. | Oct 2014 | B2 |
8943332 | Horne et al. | Jan 2015 | B2 |
9124423 | Jennas, II et al. | Sep 2015 | B2 |
9378343 | David | Jun 2016 | B1 |
9396006 | Kundu et al. | Jul 2016 | B2 |
9398018 | MacGregor | Jul 2016 | B2 |
9407431 | Bellare et al. | Aug 2016 | B2 |
9411524 | O'Hare et al. | Aug 2016 | B2 |
9411976 | Irvine | Aug 2016 | B2 |
9411982 | Dippenaar et al. | Aug 2016 | B1 |
9424576 | Vandervort | Aug 2016 | B2 |
9436935 | Hudon | Sep 2016 | B2 |
9472069 | Roskowski | Oct 2016 | B2 |
9489827 | Quinn et al. | Nov 2016 | B2 |
9584493 | Leavy | Feb 2017 | B1 |
9588790 | Wagner | Mar 2017 | B1 |
9722790 | Ebrahimi | Aug 2017 | B2 |
9818109 | Loh | Nov 2017 | B2 |
9830580 | MacGregor | Nov 2017 | B2 |
9875510 | Kasper | Jan 2018 | B1 |
9876646 | Ebrahimi | Jan 2018 | B2 |
9882918 | Ford et al. | Jan 2018 | B1 |
10102265 | Madisetti | Oct 2018 | B1 |
10102526 | Madisetti | Oct 2018 | B1 |
10108954 | Dunlevy | Oct 2018 | B2 |
10135607 | Roets | Nov 2018 | B1 |
10163080 | Chow | Dec 2018 | B2 |
10346815 | Glover | Jul 2019 | B2 |
10373129 | James | Aug 2019 | B1 |
10628268 | Baruch | Apr 2020 | B1 |
10929842 | Arvanaghi | Feb 2021 | B1 |
10958418 | Ajoy | Mar 2021 | B2 |
20030018563 | Kilgour et al. | Jan 2003 | A1 |
20040085445 | Park | May 2004 | A1 |
20050206741 | Raber | Sep 2005 | A1 |
20060075228 | Black et al. | Apr 2006 | A1 |
20060184443 | Erez et al. | Aug 2006 | A1 |
20070027787 | Tripp | Feb 2007 | A1 |
20070094272 | Yeh | Apr 2007 | A1 |
20070174630 | Shannon | Jul 2007 | A1 |
20070296817 | Ebrahimi et al. | Dec 2007 | A1 |
20080010466 | Hopper | Jan 2008 | A1 |
20080028439 | Shevade | Jan 2008 | A1 |
20080059726 | Rozas | Mar 2008 | A1 |
20090025063 | Thomas | Jan 2009 | A1 |
20090287597 | Bahar | Nov 2009 | A1 |
20100049966 | Kato | Feb 2010 | A1 |
20100058476 | Isoda | Mar 2010 | A1 |
20100161459 | Kass et al. | Jun 2010 | A1 |
20100228798 | Kodama | Sep 2010 | A1 |
20100241537 | Kass et al. | Sep 2010 | A1 |
20110061092 | Bailloeul | Mar 2011 | A1 |
20110161674 | Ming | Jun 2011 | A1 |
20120203670 | Piersol | Aug 2012 | A1 |
20130142323 | Chiarella | Jun 2013 | A1 |
20130222587 | Roskowski | Aug 2013 | A1 |
20130276058 | Buldas | Oct 2013 | A1 |
20140201541 | Paul | Jul 2014 | A1 |
20140229738 | Sato | Aug 2014 | A1 |
20140282852 | Vestevich | Sep 2014 | A1 |
20140289802 | Lee | Sep 2014 | A1 |
20140344015 | Puertolas-Montasnes et al. | Nov 2014 | A1 |
20150193633 | Chida | Jul 2015 | A1 |
20150206106 | Yago | Jul 2015 | A1 |
20150242835 | Vaughan | Aug 2015 | A1 |
20150244729 | Mao | Aug 2015 | A1 |
20150309831 | Powers | Oct 2015 | A1 |
20150332256 | Minor | Nov 2015 | A1 |
20150378627 | Kitazawa | Dec 2015 | A1 |
20150379484 | McCarthy | Dec 2015 | A1 |
20160071096 | Rosea | Mar 2016 | A1 |
20160098578 | Hincker | Apr 2016 | A1 |
20160119134 | Hakoda | Apr 2016 | A1 |
20160148198 | Kelley | May 2016 | A1 |
20160162897 | Feeney | Jun 2016 | A1 |
20160217436 | Brama | Jul 2016 | A1 |
20160239653 | Loughlin-Mchugh | Aug 2016 | A1 |
20160253663 | Clark et al. | Sep 2016 | A1 |
20160260091 | Tobias | Sep 2016 | A1 |
20160267472 | Lingham et al. | Sep 2016 | A1 |
20160267558 | Bonnell et al. | Sep 2016 | A1 |
20160275294 | Irvine | Sep 2016 | A1 |
20160283920 | Fisher et al. | Sep 2016 | A1 |
20160292396 | Akerwall | Oct 2016 | A1 |
20160292672 | Fay et al. | Oct 2016 | A1 |
20160292680 | Wilson, Jr. et al. | Oct 2016 | A1 |
20160294783 | Piqueras Jover | Oct 2016 | A1 |
20160300200 | Brown et al. | Oct 2016 | A1 |
20160300234 | Moss-Pultz et al. | Oct 2016 | A1 |
20160321675 | McCoy et al. | Nov 2016 | A1 |
20160321751 | Creighton, IV et al. | Nov 2016 | A1 |
20160328791 | Parsells et al. | Nov 2016 | A1 |
20160330031 | Drego et al. | Nov 2016 | A1 |
20160330244 | Denton | Nov 2016 | A1 |
20160337119 | Hosaka et al. | Nov 2016 | A1 |
20160342977 | Lam | Nov 2016 | A1 |
20160342989 | Davis | Nov 2016 | A1 |
20160344737 | Anton | Nov 2016 | A1 |
20160371771 | Serrano | Dec 2016 | A1 |
20170005797 | Lane et al. | Jan 2017 | A1 |
20170005804 | Zinder | Jan 2017 | A1 |
20170033933 | Haber | Feb 2017 | A1 |
20170053249 | Tunnell et al. | Feb 2017 | A1 |
20170061396 | Melika et al. | Mar 2017 | A1 |
20170075938 | Black | Mar 2017 | A1 |
20170103167 | Shah | Apr 2017 | A1 |
20170124534 | Savolainen | May 2017 | A1 |
20170124535 | Juels et al. | May 2017 | A1 |
20170161439 | Raduchel | Jun 2017 | A1 |
20170177898 | Dillenberger | Jun 2017 | A1 |
20170178237 | Wong | Jun 2017 | A1 |
20170213287 | Bruno | Jul 2017 | A1 |
20170221052 | Sheng | Aug 2017 | A1 |
20170228731 | Sheng | Aug 2017 | A1 |
20170243208 | Kurian et al. | Aug 2017 | A1 |
20170243289 | Rufo | Aug 2017 | A1 |
20170244757 | Castinado et al. | Aug 2017 | A1 |
20170330279 | Ponzone | Nov 2017 | A1 |
20170344983 | Muftic | Nov 2017 | A1 |
20170352031 | Collin | Dec 2017 | A1 |
20170353309 | Gray | Dec 2017 | A1 |
20170373859 | Shors et al. | Dec 2017 | A1 |
20180005186 | Hunn | Jan 2018 | A1 |
20180075239 | Boutnaru | Mar 2018 | A1 |
20180075527 | Nagla et al. | Mar 2018 | A1 |
20180091524 | Setty | Mar 2018 | A1 |
20180097779 | Karame et al. | Apr 2018 | A1 |
20180101701 | Barinov | Apr 2018 | A1 |
20180101842 | Ventura | Apr 2018 | A1 |
20180108024 | Greco | Apr 2018 | A1 |
20180139042 | Binning | May 2018 | A1 |
20180157700 | Roberts | Jun 2018 | A1 |
20180167201 | Naqvi | Jun 2018 | A1 |
20180173906 | Rodriguez | Jun 2018 | A1 |
20180176017 | Rodriguez | Jun 2018 | A1 |
20180181768 | Leporini | Jun 2018 | A1 |
20180182042 | Vinay | Jun 2018 | A1 |
20180189333 | Childress | Jul 2018 | A1 |
20180189781 | McCann | Jul 2018 | A1 |
20180204213 | Zappier | Jul 2018 | A1 |
20180219683 | Deery | Aug 2018 | A1 |
20180219685 | Deery | Aug 2018 | A1 |
20180225640 | Chapman | Aug 2018 | A1 |
20180241565 | Paolini-Subramanya | Aug 2018 | A1 |
20180260888 | Paolini-Subramanya | Sep 2018 | A1 |
20180260889 | Paolini-Subramanya | Sep 2018 | A1 |
20180268162 | Dillenberger | Sep 2018 | A1 |
20180268382 | Wasserman | Sep 2018 | A1 |
20180268504 | Paolini-Subramanya | Sep 2018 | A1 |
20180276668 | Li | Sep 2018 | A1 |
20180276745 | Paolini-Subramanya | Sep 2018 | A1 |
20180285879 | Gadnis | Oct 2018 | A1 |
20180285970 | Snow | Oct 2018 | A1 |
20180285971 | Rosenoer | Oct 2018 | A1 |
20180288022 | Madisetti | Oct 2018 | A1 |
20180315051 | Hurley | Nov 2018 | A1 |
20180316502 | Nadeau | Nov 2018 | A1 |
20180365764 | Nelson | Dec 2018 | A1 |
20180367298 | Wright | Dec 2018 | A1 |
20190012637 | Gillen | Jan 2019 | A1 |
20190013948 | Mercuri | Jan 2019 | A1 |
20190018947 | Li | Jan 2019 | A1 |
20190036887 | Miller | Jan 2019 | A1 |
20190043048 | Wright | Feb 2019 | A1 |
20190044727 | Scott | Feb 2019 | A1 |
20190050855 | Martino | Feb 2019 | A1 |
20190073666 | Ortiz | Mar 2019 | A1 |
20190080284 | Kim | Mar 2019 | A1 |
20190081793 | Martino | Mar 2019 | A1 |
20190087446 | Sharma | Mar 2019 | A1 |
20190123889 | Schmidt-Karaca | Apr 2019 | A1 |
20190132350 | Smith | May 2019 | A1 |
20190188699 | Thibodeau | Jun 2019 | A1 |
20190197532 | Jayachandran | Jun 2019 | A1 |
20190205563 | Gonzales, Jr. | Jul 2019 | A1 |
20190236286 | Scriber | Aug 2019 | A1 |
20190251557 | Jin | Aug 2019 | A1 |
20190253258 | Thekadath | Aug 2019 | A1 |
20190268141 | Pandurangan | Aug 2019 | A1 |
20190268163 | Nadeau | Aug 2019 | A1 |
20190281259 | Palazzolo | Sep 2019 | A1 |
20190287107 | Gaur | Sep 2019 | A1 |
20190288832 | Dang | Sep 2019 | A1 |
20190296915 | Lancashire | Sep 2019 | A1 |
20190303623 | Reddy | Oct 2019 | A1 |
20190303887 | Wright | Oct 2019 | A1 |
20190324867 | Tang | Oct 2019 | A1 |
20190334715 | Gray | Oct 2019 | A1 |
20190342422 | Li | Nov 2019 | A1 |
20190347444 | Lowagie | Nov 2019 | A1 |
20190347628 | Al-Naji | Nov 2019 | A1 |
20190349190 | Smith | Nov 2019 | A1 |
20190349426 | Smith | Nov 2019 | A1 |
20190354606 | Snow | Nov 2019 | A1 |
20190354607 | Snow | Nov 2019 | A1 |
20190354611 | Snow | Nov 2019 | A1 |
20190354724 | Lowagie | Nov 2019 | A1 |
20190354725 | Lowagie | Nov 2019 | A1 |
20190354964 | Snow | Nov 2019 | A1 |
20190356733 | Snow | Nov 2019 | A1 |
20190372770 | Xu | Dec 2019 | A1 |
20190378128 | Moore | Dec 2019 | A1 |
20190391540 | Westervelt | Dec 2019 | A1 |
20190391858 | Studnicka | Dec 2019 | A1 |
20190394044 | Snow | Dec 2019 | A1 |
20190394048 | Deery | Dec 2019 | A1 |
20200004946 | Gilpin | Jan 2020 | A1 |
20200005290 | Madisetti | Jan 2020 | A1 |
20200034813 | Calinog | Jan 2020 | A1 |
20200042635 | Douglass | Feb 2020 | A1 |
20200042960 | Cook | Feb 2020 | A1 |
20200042982 | Snow | Feb 2020 | A1 |
20200042983 | Snow | Feb 2020 | A1 |
20200042984 | Snow | Feb 2020 | A1 |
20200042985 | Snow | Feb 2020 | A1 |
20200042986 | Snow | Feb 2020 | A1 |
20200042987 | Snow | Feb 2020 | A1 |
20200042988 | Snow | Feb 2020 | A1 |
20200042990 | Snow | Feb 2020 | A1 |
20200042995 | Snow et al. | Feb 2020 | A1 |
20200044827 | Snow | Feb 2020 | A1 |
20200044856 | Lynde | Feb 2020 | A1 |
20200044857 | Snow | Feb 2020 | A1 |
20200065761 | Tatchell | Feb 2020 | A1 |
20200089690 | Qiu | Mar 2020 | A1 |
20200099534 | Lowagie | Mar 2020 | A1 |
20200104712 | Katz | Apr 2020 | A1 |
20200145219 | Sebastian | May 2020 | A1 |
20200167870 | Isaacson | May 2020 | A1 |
20200175506 | Snow | Jun 2020 | A1 |
20200211011 | Anderson | Jul 2020 | A1 |
20200279324 | Snow | Sep 2020 | A1 |
20200279325 | Snow | Sep 2020 | A1 |
20200279326 | Snow | Sep 2020 | A1 |
20200280447 | Snow | Sep 2020 | A1 |
20200302433 | Green | Sep 2020 | A1 |
20200389294 | Soundararajan | Dec 2020 | A1 |
20210174353 | Snow | Jun 2021 | A1 |
20210266174 | Snow | Aug 2021 | A1 |
20210272103 | Snow | Sep 2021 | A1 |
20210273810 | Lynde | Sep 2021 | A1 |
20210273816 | Deery et al. | Sep 2021 | A1 |
Number | Date | Country |
---|---|---|
110392052 | Oct 2019 | CN |
10128728 | Jan 2003 | DE |
3726438 | Oct 2020 | EP |
5383297 | Jan 2014 | JP |
100653512 | Dec 2006 | KR |
101747221 | Jun 2017 | KR |
WO 0049797 | Aug 2000 | WO |
WO 2007069176 | Jun 2007 | WO |
WO 2015077378 | May 2015 | WO |
WO 2018013898 | Jan 2018 | WO |
WO 2018109010 | Jun 2018 | WO |
WO 2018127923 | Jul 2018 | WO |
Entry |
---|
Watanabe, Hiroki, et al. “Blockchain contract: Securing a blockchain applied to smart contracts.” 2016 IEEE International Conference on Consumer Electronics (ICCE). IEEE, 2016. |
Crosby, Michael et al., “BlockChain Technology, Beyond Bitcoin”, Sutardja Center for Entrepreneurship & Technology, Berkeley Engineering, Oct. 16, 2015, 35 pages. |
Alsolami, Fahad, and Terrance E. Boult. “CloudStash: using secret-sharing scheme to secure data, not keys, in multi-clouds.” Information Technology: New Generations (ITNG), 2014 11th International Conference on. IEEE, 2014. |
Unknown, “Midex”, https://promo.midex.com/Midex_EN.pdf, 25 pages. |
Unknown, Xtrade White Paper, https://xtrade1.9649.kxedn.com/wp-content/uploads/2017/09/xtrade-whitepaper.pdf Feb. 7, 2018, 37 pages. |
Haarmann, et al., “DMN Decision Execution on the Ethereum Blockchain,” Hasso Plattner Institute, University of Potsdam, 15 pages. |
Kim et al., “A Perspective on Blockchain Smart Contracts,” Schulich School of Business, York University, Toronto, Canada, 6 pages. |
Chakravorty, Antorweep, and Chunming Rong, “Ushare: user controlled social media based on blockchain.” Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication. ACM, 2017. |
Chen, Zhixong, and Yixuan Zhu. “Personal Archive Service System using Blockchain Technology: Case Study, Promising and Challenging.” AI & Mobile Services (AIMS), 2017 IEEE International Conference on. IEEE, 2017. |
Al-Naji, Nader et al., “Basis: A Price-Stable Cryptocurrency with an Algorithmic Central Bank” www.basis.io Jun. 20, 2017, 27 pages. |
Unkown, “Federated Learning: Collaborative Machine Learning without Centralized Training Data” Apr. 6, 2017, 11 pages. |
Casey, “BitBeat: Factom Touts Blockchain Tool for Keeping Record Keepers Honest”, Wall Street Journal, Nov. 5, 2014. |
Menezes, Alfred. J., et al. “Handbook of Applied Cryptography,” 1997, CRC Press, p. 527-28. |
White, Ron, “How Computers Work,” Oct. 2003, QUE, Seventh Edition (Year: 2003), 23 pages. |
Luu et al., Making Smart Contracts Smarter, 2016. |
Feng and Luo, “Evaluating Memory-Hard Proof-of-Work Algorithms on Three Processors,” PVLDB, 13(6): 898-911, 2020. |
ValueWalk: Do We Need A “Fedcoin” Cryptocurrency?, Newstex Global Business Blogs, Dec. 30, 2015 (Year: 2015). |
Iddo Bentov, Bitcoin and Secure Computation with Money, May 2016 (Year: 2016). |
United States: New Generation cryptocurrency, USDX Protocol, Offers Crypto Advantages and Fiat Pegging, Apr. 2, 2018 (Year: 2018). |
Ana Reyna et al.; “On blockchain and its integration with IoT. Challenges and opportunities.” Future Generation Computer Systems. vol. 88, Nov. 2018, pp. 173-190. https://www.sciencedirect.com/science/article/pii/S0167739X17329205 (Year: 2018). |
Krol, Michal et al., “SPOC: Secure Payments for Outsourced Computations” https://arxiv.org/pdf/1807.06462.pdf. (Year: 2018). |
Number | Date | Country | |
---|---|---|---|
20220030054 A1 | Jan 2022 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15983595 | May 2018 | US |
Child | 17448942 | US |