Systems and methods for optimizing data writing to a blockchain
Through the blockchain management application, the problem of unidentified transaction correlation in the existing blockchain system is solved, efficient writing of transaction data and resource savings are achieved, and blockchain is improved management efficiency.
Patent Information
- Application Number
- CN201980074933.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2018-11-15
- Filing Date
- 2019-11-14
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2039-11-14
AI Technical Summary
The existing blockchain system fails to effectively identify whether seemingly separate transactions are related when writing transactions, resulting in waste of resources and reduced efficiency, and related transactions are scattered to multiple blocks, increasing the length of the blockchain.
Automatically determine the correlation of transactions through blockchain management applications, aggregate relevant transaction data, and reassign priority levels so that relevant transactions can be written into individual blocks of the blockchain, or in successive blocks, reducing Waste of resources and improve efficiency.
It realizes efficient writing of transaction data, reduces blockchain length, saves computing resources, improves management efficiency, and reduces dependence on manual input.
Smart Images

Figure CN113015993B_ABST
Abstract
Description
Technical Field
[0001] The present invention generally relates to blockchain technology, and more particularly to automatically redistributing the priority level of memory pool data of miners in a blockchain system according to various embodiments. Background Art
[0002] In the past few decades, rapid progress has been made in the fields of computer technology and telecommunications, and enterprises and end users are now more involved in electronic activities than ever before. Recently, blockchain technology has been introduced to improve the security of electronic transactions. Blockchain systems can include a growing list of records (also known as blocks) that are linked together using cryptography. Compared with conventional systems, blockchain systems are more resistant to modifications to data stored in blocks, thus providing protection against hackers. However, existing blockchain systems may still have various disadvantages. For example, existing blockchain systems do not consider whether seemingly separate transactions are actually related to each other. As a result, multiple transactions that are related to each other may be written into the blockchain system as separate transactions and occupy separate blocks, which may waste resources and / or degrade the efficiency of the blockchain. A system and method are needed to automatically determine whether seemingly different transactions are actually related to each other and perform blockchain writes accordingly. BRIEF DESCRIPTION OF THE DRAWINGS
[0003] Figure 1 is a block diagram of a networked system in accordance with various aspects of the present disclosure.
[0004] Figure 2-Figure 4 is a block diagram of a blockchain system according to various aspects of the present disclosure.
[0005] Figure 5-Figure 6 is a flow chart illustrating a method involving a blockchain according to various aspects of the present disclosure.
[0006] Figure 7 is an exemplary computer system according to various aspects of the present disclosure.
[0007] Figure 8 is a simplified example of a cloud-based computing architecture in accordance with various aspects of the present disclosure.
[0008] Embodiments of the present disclosure and their advantages are best understood by referring to the following detailed description. It should be appreciated that similar reference numerals are used to identify similar elements illustrated in one or more figures, wherein the illustrations herein are for illustrating embodiments of the present disclosure, rather than for limiting embodiments of the present disclosure. DETAILED DESCRIPTION
[0009] It should be understood that the following disclosure provides many different embodiments or examples for realizing the different features of the present disclosure. Specific examples of components and arrangements are described below to simplify the present disclosure. Of course, these are merely examples and are not intended to be restrictive. For simplicity and clarity, various features may be arbitrarily drawn with different scales.
[0010] The present disclosure relates to a system and method for determining the "relevance" of seemingly separate transactions and merging data to be written to a blockchain system according to the determined relevance. For example, a miner in a blockchain system may have a memory pool that contains a list of transactions that have been mined but have not yet been written to the main blockchain system. In other words, the memory pool can be used as a temporary storage place for mined transactions. Eventually, the transactions stored in the memory pool will be written to the blockchain system. Transactions in the memory pool may have priority levels that specify when (or how long) the transactions should be written to the blockchain system. However, under conventional blockchain schemes, transactions in the memory pool may be arranged in a self-organizing order. In such a scheme, two transactions that are actually related may still be considered two different transactions and may have different priority levels. Therefore, although the transactions are related, they may still be written to the blockchain system as two different transactions, and it is likely that the time is also different. This leads to a waste of resources and inefficiency. For example, more computing resources are used to perform separate blockchain writes, and the blockchain length is also unnecessarily increased.
[0011] The present disclosure relates to an improved blockchain system in which the relevance of multiple transactions is determined. As a non-limiting example, multiple transactions may be determined to be related, for example, if they are conducted by the same party / parties with the same merchant, paid by the same payment instrument, processed by the same payment processor, and / or originate from the same location or within a predetermined time frame relative to each other. Once multiple transactions are determined to be related, data associated with them may be aggregated so that the aggregated data is written to a single block of the blockchain system. In order to facilitate writing the aggregated data to a single block, the priority levels of these transactions are also reassigned. For example, if these transactions previously had different priority levels, they may be assigned the same priority level so that the aggregated data is written together to the same block of the blockchain system. In some embodiments, re-prioritization may also involve increasing the priority level of the transaction. For example, transaction A may initially have a priority level of 2, and transaction B may initially have a priority level of 3. After determining that transaction A and transaction B are related, they may each be re-prioritized to a priority level of 1 to speed up writing their aggregated data to the blockchain system. In some embodiments, if different transaction data is written to different blocks of the blockchain system, these blocks may be consecutive blocks. Figures 1 to 8Various aspects of the disclosure are discussed in greater detail.
[0012] Figure 1 1 is a block diagram of a networked system or architecture suitable for conducting electronic online transactions according to an embodiment. Networked system 100 may include or implement a plurality of servers and / or software components that operate to perform various payment transactions or processes. Exemplary servers may include, for example, servers operating such as MICROSOFT TM OS, UNIX TM OS、LINUX TM OS or other suitable server-based OS, etc. for standalone and enterprise-level servers. It can be appreciated that Figure 1 The illustrated servers may be deployed in other ways, and the operations performed by such servers and / or the services provided by such servers may be combined or separated for a given implementation, and may be performed by a greater or lesser number of servers. One or more servers may be operated and / or maintained by the same or different entities.
[0013] The system 100 may include a user device 110, a merchant server 140, a payment provider server 170, an acquirer host 165, an issuer host 168, and a payment network 172 that communicate with each other through a network 160. The payment provider server 170 may be maintained by a payment service provider such as PayPal, Inc. of San Jose, California. A user 105, such as a consumer, may utilize the user device 110 to perform an electronic transaction using the payment provider server 170. For example, the user 105 may utilize the user device 110 to access a merchant website provided by the merchant server 140 or a merchant's physical store to browse products provided by the merchant. In addition, the user 105 may utilize the user device 110 to initiate a payment transaction, receive a transaction approval request, or reply to the request. Note that a transaction as used herein refers to any suitable action performed using a user device, including payment, transmission of information, and display of information, etc. Although only one merchant server is shown, multiple merchant servers may be utilized if the user is purchasing products from multiple merchants.
[0014] The user device 110, the merchant server 140, the payment provider server 170, the acquirer host 165, the issuer host 168, and the payment network 172 may each include one or more electronic processors, electronic memory, and other appropriate electronic components for executing instructions, such as program code and / or data stored on one or more computer-readable media, to implement the various applications, data, and steps described herein. For example, such instructions may be stored in one or more computer-readable media, such as memory or data storage devices that are internal and / or external to the various components of the system 100 and / or accessible via the network 160. The network 160 may be implemented as a single network or a combination of multiple networks. For example, in various embodiments, the network 160 may include the Internet or one or more intranets, landline networks, wireless networks, and / or other appropriate types of networks.
[0015] The user device 110 may be implemented using any suitable hardware and software configured for wired and / or wireless communication over the network 160. For example, in one embodiment, the user device may be a personal computer (PC), a smartphone, a smartphone with additional hardware such as an NFC chip, BLE hardware, etc., a wearable device with a similar hardware configuration such as a gaming device, a virtual reality headset, or a smartphone that talks to a smartphone with a unique hardware configuration and running appropriate software, a laptop computer, and / or other types of computing devices capable of transmitting and / or receiving data, such as from APPLE TM IPAD TM .
[0016] The user device 110 may include one or more browser applications 115, which may, for example, be used to provide a convenient interface to allow the user 105 to browse information available through the network 160. For example, in one embodiment, the browser application 115 may be implemented as a web browser configured to view information available through the Internet, such as a user account for online shopping and / or a merchant site for viewing and purchasing goods and services. The user device 110 may also include one or more toolbar applications 120, which may, for example, be used to provide client-side processing for performing desired tasks in response to an operation selected by the user 105. In one embodiment, the toolbar application 120 may display a user interface associated with the browser application 115.
[0017] User device 110 may also include other applications that perform functions, such as email, text messaging, voice, and IM applications that allow user 105 to send and receive email, calls, and texts over network 160, as well as applications that enable the user to communicate, transfer information, make payments, and otherwise utilize digital wallets through payment providers as discussed herein.
[0018] The user device 110 may include one or more user identifiers 130, which may be implemented, for example, as operating system registry entries, cookies associated with the browser application 115, identifiers associated with the hardware of the user device 110, or other suitable identifiers, such as for payment / user / device authentication. In one embodiment, the user identifier 130 may be used by a payment service provider to associate the user 105 with a particular account maintained by the payment provider. A communication application 122 with an associated interface enables the user device 110 to communicate within the system 100.
[0019] In conjunction with the user identifier 130, the user device 110 may also include a trusted zone 135 owned or provided by the payment service provider under agreement with the device manufacturer. The trusted zone 135 may also be part of a telecom provider SIM that is used to store appropriate software by the payment service provider that is able to act as a proxy for the user's payment credentials and generate secure industry standard payment credentials based on the user's 105 credentials / status / age / risk level and other similar parameters in the payment provider system.
[0020] User device 110 may install and execute a payment application received from a payment service provider to facilitate the payment process. The payment application may allow a user to send a payment transaction request to a payment service provider, the request including communication of data or information (eg, source of funds information) required to complete the request.
[0021] Still reference Figure 1 , the merchant server 140 may be maintained, for example, by a merchant or seller that provides a variety of products and / or services. The merchant may have a physical point of sale (POS) storefront. The merchant may be a participating merchant that has a merchant account at a payment service provider. The merchant server 140 may be used for POS or online purchases and transactions. Typically, the merchant server 140 may be maintained by anyone or any entity that receives money, including charities and retailers and restaurants. For example, a purchase transaction may be a payment or gift to an individual. The merchant server 140 may include a database 145 that identifies available products and / or services (e.g., collectively referred to as items) that can be viewed and purchased by the user 105. Therefore, the merchant server 140 may also include a market application 150 that may be configured to provide information to the browser 115 of the user device 110 via a network 160. In one embodiment, user 105 may interact with marketplace application 150 via a browser application over network 160 to view various products, food items, or services identified in database 145 .
[0022] The merchant server 140 may also include a checkout application 155, which may be configured to facilitate the purchase of goods or services by the user 105 online or at a physical POS or storefront. The checkout application 155 may be configured to accept payment information from or on behalf of the user 105 via a payment provider server 170 over the network 160. For example, the checkout application 155 may receive and process payment confirmations from the payment provider server 170, as well as transmit transaction information to the payment provider, and receive information (e.g., a transaction ID) from the payment provider. The checkout application 155 may be configured to receive payment via a variety of payment methods including cash, credit cards, debit cards, checks, money orders, etc.
[0023] The payment vendor server 170 may be maintained, for example, by an online payment service provider that may provide payment between the user 105 and the operator of the merchant server 140. In this regard, the payment vendor server 170 may include one or more payment applications 175 that may be configured to interact with the user device 110 and / or the merchant server 140 over the network 160 to facilitate the purchase of goods or services, convey / display information, and send payment by the user 105 of the user device 110.
[0024] The payment vendor server 170 also maintains a plurality of user accounts 180, each of which may include account information 185 associated with consumers, merchants, and funding sources such as credit card companies, etc. For example, the account information 185 may include private financial information of the user of the device, such as an account number, password, device identifier, username, phone number, credit card information, bank information, or other financial information that may be used to facilitate online transactions conducted by the user 105. Advantageously, the payment application 175 may be configured to interact with the merchant server 140 on behalf of the user 105 during transactions with the checkout application 155 to track and manage purchases made by the user and which funding sources are used and when.
[0025] The transaction processing application 190 may be part of the payment application 175 or may be separate and may be configured to receive information from the user device and / or the merchant server 140 for processing and storage in the payment database 195. The transaction processing application 190 may include one or more applications that process information from the user 105 in order to process orders and payments using various selected funding instruments, as described herein. Thus, the transaction processing application 190 may store details of orders from various users, including the funding sources used and available credit options, etc. The payment application 175 may also be configured to determine the existence of the user 105 and manage the user's 105 account, as well as create new accounts when necessary.
[0026] According to various aspects of the present disclosure, the blockchain management application 200 may also be implemented on or otherwise accessible by the payment vendor server 170. The blockchain management application 200 may include one or more software applications or software programs that are capable of being automatically executed (e.g., without explicit instructions from a human user) to perform certain tasks. For example, the blockchain management application 200 may evaluate mined blockchain transactions to determine their "relevance." Relevance of seemingly separate transactions may be established based on factors including, but not limited to, whether the transactions were conducted by the same party or parties with the same merchant, whether they were paid by the same payment instrument, whether they were processed by the same payment processor, whether they originated from the same location or within a predetermined time frame relative to each other, whether they share a tenant, etc., but multiple transactions need not satisfy all of the factors listed above to be considered relevant.
[0027] In some embodiments, the blockchain management application 200 may use a scoring system to determine whether seemingly separate transactions are indeed related. For example, two seemingly separate transactions may initially start with a correlation score of 0. If the blockchain management application 200 determines that the two transactions have the same parties (e.g., the same payer and the same payee), it increases the correlation score by a predefined amount. If the blockchain management application 200 determines that the two transactions share the same merchant (e.g., a restaurant), it increases the correlation score by a predefined amount. If the blockchain management application 200 determines that the two transactions use the same payment processor (e.g., both use ), it increases the relevance score by a predefined amount. If the blockchain management application 200 determines that two transactions occurred at the same location (e.g., the same GPS coordinates), it increases the relevance score by a predefined amount. If the blockchain management application 200 determines that two transactions occurred within a predetermined time frame relative to each other (e.g., less than 2 minutes), it increases the relevance score by a predefined amount. The above is a non-limiting example of how metadata or data about transactions can be used to calculate relevance scores. When the relevance score exceeds a predefined threshold, the blockchain management application 200 can determine that the transactions are related or have originated from the same underlying event. Otherwise, the blockchain management application 200 can consider the transactions to be unrelated to each other.
[0028] Once transactions are determined to be related, their transaction data is aggregated and written to a single block of the blockchain. For example, suppose 3 users A, B, and C (who may be friends) transact with each other at location D, perhaps because they have lunch together and then pay for lunch separately. The transactions between these users, the associated metadata, and the name of the transaction processor (e.g. ) can be aggregated during a predetermined time frame (e.g., 2 minutes). Metadata can include data such as the location of the transaction, transaction notes, social engine patterns (if sharing is involved), etc. According to the present disclosure, instead of feeding the data of each transaction to a different block of the blockchain system, the data of these related transactions can be aggregated and fed to a single block of the blockchain, which can be considered a context block. As a result, the length of the blockchain system is reduced because the aggregated data now occupies only one block, as opposed to having data from multiple transactions occupy multiple blocks under conventional blockchain schemes.
[0029] It should be understood that data aggregation may involve reallocating the priority levels of transactions in the memory pool. In this regard, the memory pool in the blockchain system is a temporary storage space for mined blockchain transactions that have not yet been written to the blockchain system. Each transaction may have its own initial priority level. For example, in the example transactions involving users A, B, and C above, the transaction involving user A paying for his lunch may have a priority level of 1, the transaction involving user B paying for his lunch may have a priority level of 3, and the transaction involving user C paying for his lunch may have a priority level of 2. Due to these different priority levels, the transactions involving users A, B, and C will be written to the blockchain system at different times (e.g., the transaction involving user A first, the transaction involving C second, and the transaction involving user B last), and written to separate blockchain blocks. However, upon determining that the three transactions are actually related to each other (e.g., originating from the same underlying event), the blockchain management application 200 herein may reallocate the priority levels of the three transactions to facilitate writing them to the same blockchain block in some embodiments, or writing them to consecutive blocks in other embodiments. In some embodiments, re-prioritization may involve adjusting the priority levels of the three transactions so that they all have the same priority level (e.g., all have priority level 2, or all have priority level 1). In some embodiments, adjusting the priority level of the transactions may also involve increasing the priority level for at least some of the transactions in the group (e.g., moving the transactions involving B and C up to priority level 1).
[0030] It is understood that the miner may not be mining related transactions at the same time. For example, the miner may have first mined a transaction involving user A and placed the transaction in the memory pool. At some later time, the miner may be mining a transaction involving user B. As the transaction involving user B is being mined (or has just completed mining), the miner can compare the data of the transaction involving user B with the data of the transaction involving user A that has been saved in the memory pool. Based on a set of predefined rules (e.g., whether these transactions share common participants, common locations, common merchants, whether they occur within a predefined time frame, etc.), the miner can determine that these transactions are related. The predefined rules can weigh various factors equally or differently based on the transaction data. Then, the determination can then generate a number (e.g., a number from 0 to 1, or an equivalent), where the number exceeds a predetermined threshold for transactions to be considered related. The threshold can be a number such as .5, or any number greater than .5 or their equivalents. As with these factors, the thresholds may vary depending on the system and / or transaction data, e.g., for larger transaction volumes (e.g., above a certain dollar amount), the thresholds may be higher than for lower transaction volumes. As a result, the priority levels of these transactions may be adjusted in the manner discussed above. One or more of the above steps may be performed by the blockchain management application 200.
[0031] In some embodiments, the blockchain management application 200 introduces an artificial delay as to when transactions should be written to the blockchain system. For example, assume that transaction A is mined at a first point in time, and transaction B is mined at a second point in time after the first point in time. The data for transaction A and transaction B may initially be saved in the memory pool. At a third point in time after the second point in time, transaction A should be written to the blockchain system according to the priority level of transaction A in the memory pool. Assume that at the third point in time, the blockchain management application 200 may have determined that transaction A and transaction B are related to each other, or that they may be related to each other, but more time is needed to verify / confirm the determination. However, because the blockchain management application 200 may still be in the process of determining (or has just finished determining) their relevance, the priority levels of transaction A and transaction B have not yet been readjusted to take into account their potential "relevance".
[0032] In order to avoid unnecessarily writing transaction A and transaction B as two separate transactions into separate blocks of the blockchain system, the blockchain management application 200 introduces a delay in when transaction A should be written into the blockchain system. In some embodiments, the delay may be a predetermined amount of time, for example, x number of minutes, hours, or days. In other embodiments, the delay may be the next available scheduled time slot (which may be predetermined) for writing data into the blockchain system. For example, instead of writing transaction A into the blockchain system at a third point in time, transaction A may be scheduled to be written into the blockchain system at a fourth point in time after the third point in time. If it is determined that transaction B is related to transaction A, the priority levels of both transaction A and transaction B may be adjusted so that they can be written into the blockchain system together at the fourth point in time.
[0033] In some embodiments, the mining fee associated with multiple transactions may be higher than for conventional blockchain mined transactions. For example, the payment vendor server 170 (via the blockchain management application 200) may award additional mining fees to miners that mine related transactions as an incentive to mine related transactions. As another example, assume there is a first mining fee associated with mined transaction A and a second mining fee associated with mined transaction B. The payment vendor server 170 (via the blockchain management application 200) may determine that data for different transactions A and B should be combined / merged and written into the same blockchain block. In response to this determination, a new mining fee for merging the transaction data may be calculated, where the new mining fee is greater than the first mining fee or the second mining fee.
[0034] Despite Figure 1 In the embodiment of the present invention, the blockchain management application 200 is shown as being implemented on the payment vendor server 170, but it should be appreciated that it may also be sent to the user device 110 or the merchant server 140 via the network 160 (e.g., periodically or when needed) for execution thereon. In some embodiments, instead of or in addition to the blockchain management application 200 being implemented on the payment vendor server 170, the blockchain management application 200 (or an application similar to the blockchain management application 200) may have been implemented on the user device 110 or on the merchant server 140. In addition, although in Figure 1 In the illustrated embodiment, the blockchain management application 200 is illustrated as being separate from the transaction processing application 190, but in other embodiments the transaction processing application 190 may implement some or all of the functionality of the blockchain management application 200. In other words, in some embodiments, the blockchain management application 200 may be integrated within the transaction processing application 190.
[0035] Still reference Figure 1 The payment network 172 may be provided by a payment card service provider or a card association such as AMERICAN and CHINAUNION Payment card service providers may provide services, standards, rules and / or policies for issuing various payment cards. A network of communication devices, servers, etc. may also be established to relay payment-related information between different parties to a payment transaction.
[0036] The acquirer host 165 may be a server operated by an acquiring bank. An acquiring bank is a financial institution that accepts payments on behalf of merchants. For example, a merchant may establish an account with an acquiring bank to receive payments made via various payment cards. When a user presents a payment card as payment to a merchant, the merchant may submit the transaction to the acquiring bank. The acquiring bank may verify the payment card number, transaction type, and amount with the issuing bank, and reserve a credit line for the user for the merchant. The authorization agency will generate an approval code, which the merchant stores with the transaction.
[0037] The issuer host 168 may be a server operated by a bank or organization that issues the payment card. The issuing bank may have agreements with various merchants to accept payments made using payment cards. After the user has established a card account with the issuing bank, the issuing bank may issue a payment card to the user. The user may then use the payment card to make payments at or with various merchants that agree to accept the payment card.
[0038] Figure 2 The diagram illustrates an example use scenario involving a blockchain management application 200 and a blockchain system 300 according to various aspects of the present disclosure. The blockchain system 300 includes a main blockchain 310, which, as shown, is a simplified segment of what may be a much larger chain. The main blockchain 310 includes block 0, block 1, and block N. Block 0 is a supply chain block, block 1 is a raw material rendering block, and block N is a crop production block. Each block in the main blockchain 310 includes a respective header.hash, a nonce, and a timestamp. The header.hash can be used as an identifier for the block. The header.hash of each block is also calculated based on the hash of the previous block. For example, Figure 2As shown, block 0 sends the hash value of block 0 to block 1, so that block 1 calculates its header.hash value based on the hash value of block 0. Block 1 sends the hash value of block 1 to block N, so that block N calculates its header.hash value based on the hash value of block 1. The current value can be a random number or pseudo-random number and an arbitrary number that is used only once in cryptographic communication. The random number adds more variation to the block and makes it more difficult to generate a valid hash value for a given block. The timestamp tracks the creation and modification of the transactions of the block. Each block can have its own appropriate content, such as the transaction data in block 0 or the next delivery date (for simplicity, the contents of block 1 and block N are not specifically illustrated here).
[0039] The blockchain system 300 also includes a memory pool 320 for the miners. As discussed above, the memory pool 320 can be viewed as a temporary storage space for storing mined transactions that have not yet been written to the main blockchain 310. The blockchain management application 200 discussed above or its functions can be implemented in the memory pool 320. For example, the memory pool 320 includes a core functional module 330 configured to determine the relevance of seemingly independent transactions, prioritize / re-prioritize transactions in the memory pool 320, aggregate data from related transactions, and manage or route the aggregated data (e.g., introduce delays) to feed to the main blockchain 310.
[0040] The memory pool also includes a multi-tenant / sub-tenant module 340, which can be used to separate transactions in a multi-tenant or sub-tenant context. In more detail, transactions with different financial entities (e.g., ) are stored in different compartments. These different financial entities can be considered independent tenants. However, some tenants may be sub-tenants of other tenants. For example, and Can be a separate financial entity, but Depend on possessed, so it is considered Module 340 may store transactions involving sub-tenants in the same compartment as transactions involving the main tenant, and / or create other sub-compartments within the main compartment to store transactions involving sub-tenants.
[0041] As a non-limiting example, Figure 2 A compartment 350 of a memory pool 320 is shown, which in this case belongs to in other words, is the primary tenant of compartment 350 of memory pool 320. Compartment 350 may also contain The associated transaction, in this case, is a subtenant. Compartment 350 contains three example mined blockchain transactions. In mined blockchain transaction T1, user A pays user B $20. In mined blockchain transaction T2, user A pays user B $5. In mined blockchain transaction T3, user C pays user D $30. User A, user B, user C, and user D are not only of users, and also users.
[0042] It may be advantageous to partition the storage of mined blockchain transactions in the memory pool 320 by tenant / sub-tenant. For example, it may be easier to process the group of transactions within the compartment because they may share certain common properties. Another advantage is that the partitioned transaction data may be written to one or more blocks in the main blockchain 310 in a manner indicating that they all share a common tenant. For example, with All associated transactions can be divided in the memory pool 320. When the partitioned memory pool data of is written to the main blockchain 310, the header of the block can be updated to indicate that they contain the data related to For example, the header of a block may specify Tenant=PayPal, which indicates that the block contains transactions initiated or finalized by PayPal between parties using PayPal services. In this way, blocks in the main blockchain 310 can be "branded" according to tenants, which not only makes the data in the block more searchable / accessible, but also provides advertising opportunities.
[0043] According to various aspects of the present disclosure, some of the transactions within the compartments may also be linked (e.g., related). Figure 2 In the illustrated embodiment, transactions T1 and T2 may be based at least in part on their common tenants ( and ) are determined to be linked. For example, T1 and T2 may originate from the same potential transaction, where T1 may be a payment for the purchase price and T2 may be a payment for shipping costs associated with the purchase. Of course, other factors discussed above may be considered when determining whether transactions T1 and T2 should be linked together. For example, some of these factors may include the merchant with whom transactions T1 and T2 are transacted, the payment instrument or payment processor used for transactions T1 and T2, and the location or time frame in which transactions T1 and T2 are conducted, etc.
[0044] Linked transactions may be assigned a higher priority level. For example, transactions T1 and T2 may initially be assigned a lower priority level than transaction T3, but after T1 and T2 are linked together, their priority levels may be increased, such as both to priority level 1. In some embodiments, the priority level of transaction T3 (which has been determined to be unrelated to any other transaction) may actually be lowered (e.g., from priority level 1 to priority level 2) to accommodate the upward adjustment of the priority levels of transactions T1 and T2. Data associated with linked transactions T1 and T2 may be aggregated together and pushed to the main blockchain 310 and into the same block. Data associated with transaction T3 may be pushed to a different block of the main blockchain 310 at a later point in time.
[0045] According to various aspects of the present disclosure, blockchain miners may also prioritize tenants with higher mining fees. For example, as discussed above, a miner may mine blockchain transactions from different tenants and store them in memory pool 320. Each of the tenants may have a respective mining fee associated with its transactions. For example, tenant A (e.g., ) may have a mining fee of $2 per transaction, while tenant B (e.g. ) may have a mining fee of $3 per transaction. Based on the value of the mining fee, the memory pool 320 may assign or reallocate the priority levels of transactions from tenant A and tenant B. In this example, since tenant B has a higher mining fee than tenant A, the memory pool 320 may increase the priority level of transactions associated with tenant B so that these transactions will be written to the main blockchain 310 more quickly. This prioritization scheme based on mining fees may be interchangeable across the entire range of the memory pool 320. Therefore, when the memory pool stores transaction data for more than two tenants, the priority levels of the transaction data may be classified or sorted according to the mining fees associated with the tenants.
[0046] Another aspect of the present disclosure relates to skipping / bypassing the memory pool if certain criteria of a mined blockchain transaction are met. Figure 3 is a block diagram illustrating a non-limiting example of this scenario. Figure 3 The block diagram in FIG. 1 includes a main blockchain 310 and a miner 360 configured to mine blockchain transactions. The miner 360 can be a user's mobile device (e.g., a smart phone), a user's desktop or laptop computer, or a server computer of a corporate entity. In various embodiments, the miner 360 can be implemented using the user device 110, the merchant server 140, or the payment provider 170. The blockchain management application 200 discussed above can be implemented as part of the miner 360.
[0047] The miner 360 also includes a memory pool, such as the memory pool 320 discussed above. Currently, the memory pool 320 has two transactions stored therein: transaction A and transaction B. While transactions A and B are still stored in the memory pool 320 and are waiting for their turn to be written to the main blockchain 310, the miner 360 mines another transaction C. Assume that the mined metadata of transaction C indicates that it is a payment of $1,000 from entity M to entity N, where the tenant name is "IRS", the transaction type is "Instant Funds Withdrawal / Refund", fee = $5, and memory pool exclusion flag = "yes". The mined metadata indicates that this transaction C should skip memory pool storage and should be written directly to the main blockchain 310. For example, the memory pool exclusion flag is "yes", which may indicate that this transaction C is a high priority transaction and should skip memory pool storage. Other criteria indicating the high priority of transaction C include: tenant name (e.g., IRS), the value of the transaction (e.g., greater than or equal to a predetermined threshold, such as $1,000), and / or the nature of the transaction (e.g., withdrawal or refund). It is understood that not all of the above conditions need to be met to skip memory pool storage. In some embodiments, memory pool storage can be skipped (and the transaction written directly to the main blockchain 310) when only one (or more) of the criteria is met. In addition, the criteria listed above are only non-limiting examples, and in various embodiments, they can be any other predetermined criteria.
[0048] In some embodiments, the skipping of memory pool storage is performed not only due to the high priority of the incoming transaction, but also due to the lack of available storage in the memory pool 320. For example, in some embodiments, the storage capacity limit of the memory pool 320 is two transactions. In this case, the memory pool 320 is already full of transaction A and transaction B, and it has no available space to store another transaction C. As a result, the miner 360 may not store transaction C in the memory pool 320, but write it directly to the main blockchain 310.
[0049] As another example, miner 360 may determine that memory pool 320 will soon become unavailable. The unavailability of memory pool 320 may be due to low battery power of miner 360. In other words, the battery or power supply of miner 360 may have reached a predetermined threshold (e.g., equal to or below 2% of the battery capacity) and is about to shut down (e.g., within the next 5 minutes). The urgent expected shutdown of miner 360 means that memory pool 320 is not a good candidate for storing transaction C, so miner 360 should write transaction C directly to main blockchain 310.
[0050] As yet another example, the miner 360 may determine that it is in an area with spotty or otherwise reliable network coverage / connectivity. For example, the miner 360 may determine that it is in or about to enter a geographic area known to have poor network coverage (e.g., a mountainous area or a building with poor cellular signal reception and no Wi-Fi) based on saved historical maps or GPS (Global Positioning System) data. As another example, the miner 360 may periodically monitor the strength of its network signal. Based on the monitoring, for example, in response to determining that the network signal strength varies too much or is unavailable for an extended period of time, the miner 360 may determine that it is entering an area with unreliable network coverage. Regardless of how unreliable network coverage / connectivity is determined, once determined, the miner 360 may skip saving the incoming transaction (e.g., transaction C) to the memory pool 320 and instead write it directly to the main blockchain 310.
[0051] Figure 4 is a block diagram illustrating another scenario where an incoming mined blockchain transaction skips the memory pool storage of the miner 360 that mined the transaction. For reasons of simplicity and consistency, Figure 3 and Figure 4 Similar parts appearing in both will be marked as identical. Figure 4 , assuming that miner 360 has transactions A and B stored in its memory pool 320, which is at or near the storage capacity of transactions A and B stored therein. When miner 360 mines transaction C, it may determine that memory pool 320 does not have sufficient storage capacity to store transaction C. Therefore, miner 360 broadcasts a message to network 380, which includes other miners of the blockchain, such as miner A, miner B, miner C, miner D, ... and miner N. In the broadcasted message, miner 360 may request to rent or temporarily rent the memory pool storage of one or more miners in network 380, so that the data of transaction C can be stored in the rented / borrowed memory pool of the miner that agrees to the request. In exchange, miner 360 may pay a commission fee to the miner that agrees to rent its memory pool. The commission fee may be paid in part or in full after the other miner pushes transaction C from its memory pool into the main blockchain 310. In some embodiments, an agreement between two (or more) miners may be established via a “smart contract” that is created, executed, and / or implemented without human intervention (e.g., in a blockchain or distributed mining environment).
[0052] It should be appreciated that in addition to the memory pool 320 storage being full, the miner 360 may also generate a broadcast message to the network 380 in response to a determination that the memory pool 320 will become unavailable, such as due to a low charge of the battery of the miner 360, or in response to a determination that the miner 360 is or will enter an area with poor network coverage / connectivity. In these cases, the consenting miners may agree to have their memory pools rented by the miner 360 to store the data of the transaction C, which will eventually be pushed to the main blockchain 310 by the consenting miners.
[0053] Figure 5 4 is a flow chart illustrating a method 400 for writing to a blockchain based on transaction relevance according to various aspects of the present disclosure. The method 400 includes a step 410 of accessing a memory pool of a mining machine of a blockchain system. The memory pool includes at least a first transaction and a second transaction.
[0054] The method 400 includes a step 415 of determining that the first transaction and the second transaction are related to each other.
[0055] The method 400 includes a step 420 of linking the first transaction and the second transaction, the linking including aggregating the aggregated data associated with the first transaction and the aggregated data associated with the second transaction into an aggregated data set. Step 420 may be performed in response to the determination in step 415.
[0056] The method 400 includes a step 425 of writing the aggregated data set into a single block of the blockchain system.
[0057] In some embodiments, the first transaction and the second transaction each include a respective priority written into the blockchain system, and the linking in step 420 includes reassigning a priority of at least the first transaction or the second transaction. In some embodiments, reassigning a priority includes increasing a priority of at least the first transaction or the second transaction. In some embodiments, reassigning a priority includes assigning the same priority to both the first transaction and the second transaction.
[0058] In some embodiments, the determination of step 415 includes determining that the first transaction and the second transaction share a common user, a common merchant, a common payment processor, a common location, or are performed within a predetermined time period relative to each other.
[0059] In some embodiments, the determination of step 415 includes determining that the first transaction and the second transaction originate from the same underlying event.
[0060] It should be appreciated that additional method steps may be performed before, during, or after steps 410-425 discussed above. For example, method 400 may include the following steps: introducing a delay for writing the first transaction or the second transaction to the blockchain system until it is determined that it has been completed. As another embodiment, method 400 may include the step of storing transaction data from different tenants in different compartments of the memory pool. As yet another embodiment, method 400 may include the following steps: writing the name of the first tenant to the header of a selected block of the blockchain system; and writing transaction data associated only with the first tenant to the selected block. As a further embodiment, the memory pool further includes a third transaction and a fourth transaction, and wherein method 400 further includes the following steps: determining a first mining fee associated with mining the third transaction and a second mining fee associated with mining the fourth transaction; and in response to determining that the first mining fee is greater than the second mining fee, assigning a higher priority to the third transaction; or in response to determining that the second mining fee is greater than the first mining fee, assigning a higher priority to the fourth transaction. For simplicity, other additional steps are not discussed in detail herein.
[0061] Figure 6 4 is a flow chart illustrating a method 450 for writing to a blockchain by skipping a memory pool according to various aspects of the present disclosure. The method 450 includes step 460 of accessing mining data associated with mined transactions performed by a miner of a blockchain system.
[0062] The method 450 includes step 465 of making a first determination that the mined transactions satisfy one or more predefined criteria. Step 465 is performed based on the mined data.
[0063] The method 450 includes step 470 of making a second determination that the available storage space of the mining machine's memory pool is below a predetermined threshold or that the memory pool will become unavailable.
[0064] The method 450 includes step 475: in response to the first determination or the second determination, bypassing storing the mined data in the blockchain system, causing the mined data to be written to the blockchain system.
[0065] In some embodiments, step 475 includes writing the mined data directly to the blockchain system without first storing the mined data in a memory pool of a mining machine.
[0066] The method 450 includes step 475, which includes: broadcasting a request to rent a memory pool from at least one of the miners to a network including multiple miners of a blockchain system; receiving consent from one or more miners of the network to rent the memory pool of the one or more miners; and sending mining data to the one or more miners to be stored in the one or more miner memory pools.
[0067] In some embodiments, the first determination is made by determining that the mined transactions are associated with a predetermined tenant or have a value exceeding a predetermined amount.
[0068] In some embodiments, the second determination is made by determining that the miner is using a device to perform mining operations, the battery of the device has dropped below a predetermined percentage, or determining that the device is located in or will enter an area with unreliable network coverage or unreliable connectivity.
[0069] Based on the above discussion, it can be seen that the present disclosure provides multiple significant advantages over conventional methods and systems. However, it should be understood that not all advantages must be discussed in detail herein, different embodiments may provide different advantages, and no specific advantages are required for all embodiments. One advantage is the improved functionality of the computer. For example, by implementing the blockchain management application 200 as discussed above, data from transactions that appear independent but are actually related can be written to the same block of the blockchain. As a result, the length of the blockchain can be reduced. As a result, since there are fewer blocks, the present disclosure saves computer resources (e.g., fewer blocks) and improves the efficiency of managing and / or traversing the blockchain. The present disclosure further improves the functionality of the computer by increasing the speed at which transactions can be saved in the blockchain, because the blockchain management application 200 is automatically executed and does not rely on manual user input (which may be slow) to complete. Other advantages include compatibility with existing blockchain systems and ease and low cost of implementation.
[0070] Figure 7 is a block diagram of a computer system 500 suitable for implementing the various methods and apparatus described herein (e.g., blockchain management application 200 and various method steps of methods 400 and 450 or user device 110, merchant server 140, or payment provider server 170). In various implementations, the apparatus capable of performing these steps may include a network communication apparatus (e.g., a mobile cellular phone, a laptop computer, a personal computer, and a tablet computer, etc.), a network computing apparatus (e.g., a network server, a computer processor, an electronic communication interface, etc.), or other suitable devices. Therefore, it should be appreciated that the apparatus capable of implementing blockchain management application 200 (or user device 110, merchant server 140, or payment provider server 170) and various method steps of methods 400 and 450 may be implemented as computer system 500 in the following manner.
[0071] According to various embodiments of the present disclosure, a computer system 500, such as a network server or a mobile communication device, includes a bus component 502 or other communication mechanism for transmitting information, which interconnects subsystems and components, such as a computer processing component 504 (e.g., a processor, a microcontroller, and a digital signal processor (DSP)), a system memory component 506 (e.g., RAM), a static storage component 508 (e.g., ROM), a disk drive component 510 (e.g., magnetic or optical), a network interface component 512 (e.g., a modem or an Ethernet card), a display component 514 (e.g., a cathode ray tube (CRT) or a liquid crystal display (LCD)), an input component 516 (e.g., a keyboard), a cursor control component 518 (e.g., a mouse or trackball), and an image capture component 520 (e.g., an analog or digital camera). In one implementation, the disk drive component 510 may include a database having one or more disk drive components. In some embodiments, the memory pool discussed above may be implemented using the system memory component 506 or the disk drive component 510. In some implementations, the blockchain management application 200 may also be implemented at least partially within the system memory component 506 or the disk drive component 510.
[0072] According to an embodiment of the present disclosure, the computer system 500 performs specific operations by executing one or more sequences of one or more instructions contained in the system memory component 506 by the processor 504. Such instructions can be read into the system memory component 506 from another computer-readable medium such as a static storage component 508 or a disk drive component 510. In other embodiments, hard-wired circuits can be used instead of (or in combination with) software instructions to implement the present disclosure. In some embodiments, various components of the blockchain management application 200 (e.g., the execution engine 230) can take the form of software instructions that can be executed by the processor 504 to automatically perform tasks appropriate to the context on behalf of the user.
[0073] Logic may be encoded in a computer readable medium, which may refer to any medium that participates in providing instructions to the processor 504 for execution. Such media may take many forms, including but not limited to non-volatile media and volatile media. In one embodiment, the computer readable medium is non-transitory. In various implementations, non-volatile media include optical or magnetic disks, such as disk drive component 510, and volatile media include dynamic memory, such as system memory component 506. In one aspect, data and information related to the execution of instructions may be transmitted to the computer system 500 via a transmission medium such as in the form of sound waves or light waves, including those generated during radio waves and infrared data communications. In various implementations, the transmission medium may include coaxial cables, copper wires, and optical fibers, including wires with bus 502.
[0074] Thus, common forms of computer-readable media include, for example, floppy disks, disks, hard disks, magnetic tapes, any other magnetic media, CD-ROMs, any other optical media, punched card tapes, any other physical storage media with patterns of holes, RAM, PROMs, EPROMs, FLASH-EPROMs, any other memory chips or cassettes, carrier waves, or any other media from which a computer is suitable for reading. These computer-readable media can also be used to store mined blockchain transaction data.
[0075] In various embodiments of the present disclosure, the execution of the instruction sequences for practicing the present disclosure may be performed by a computer system 500. In various other implementations of the present disclosure, multiple computer systems 500 coupled via a communication link 530 (e.g., a communication network such as a LAN, WLAN, PTSN, and / or various other wired or wireless networks, including telecommunications, mobile networks, and cellular telephone networks) may execute the instruction sequences to practice the present disclosure in cooperation with each other.
[0076] The computer system 500 may send and receive messages, data, information, and instructions, including one or more programs (i.e., application code), via the communication link 530 and the communication interface 512. The received program code may be executed by the computer processor 504 when received and / or stored in the disk drive component 510 or some other non-volatile storage component for execution. The communication link 530 and / or the communication interface 512 may be used to electronically communicate between the blockchain management application 200 and external devices, such as with the user device 110, with the merchant server 140, or with the payment provider server 170, depending on where the blockchain management application 200 is implemented.
[0077] Where applicable, hardware, software, or a combination of hardware and software may be used to implement the various embodiments provided by the present disclosure. Moreover, where applicable, without departing from the spirit of the present disclosure, the various hardware components and / or software components set forth herein may all be combined into composite components comprising software, hardware, and / or both. Where applicable, without departing from the scope of the present disclosure, the various hardware components and / or software components set forth herein may all be divided into subcomponents comprising software, hardware, or both. In addition, where applicable, it is contemplated that software components may be implemented as hardware components, and vice versa.
[0078] Software according to the present disclosure, such as computer program code and / or data, can be stored on one or more computer-readable media. It is also contemplated that the software identified herein can be implemented using one or more general or special-purpose computers and / or computer systems, networked and / or otherwise. Where applicable, the order of the various steps described herein can be changed, combined into composite steps, and / or divided into sub-steps to provide the features described herein. It should be appreciated that at least a portion of the blockchain management application 200 can be implemented as such software code.
[0079] Figure 7 An exemplary cloud-based computing architecture 600 is illustrated, which may also be used to implement various aspects of the present disclosure. The cloud-based computing architecture 600 includes mobile devices 604 (e.g., Figure 1 In one example, a consumer has a mobile device 604 that communicates with a cloud-based resource 608, which may include one or more computers, such as a server computer, with sufficient memory resources to handle requests from various users. A given embodiment may divide functionality between the mobile device 604 and the cloud-based resource 608 in any appropriate manner. For example, an application on the mobile device 604 may perform basic input / output interactions with the user, but most processing and caching may be performed by the cloud-based resource 608. However, in various embodiments, other divisions of responsibility are possible. In some embodiments, using this cloud architecture, the blockchain management application 200 may reside on the user device 110, but its functionality may be accessed or utilized by the merchant server 140 or the payment vendor server 170. Similarly, the blockchain management application 200 may reside on the merchant server 140 or on the payment vendor server 170, but its functionality may be accessed or utilized by the user device 110.
[0080] The cloud-based computing architecture 600 also includes a personal computer 602 in communication with a cloud-based resource 608. In one embodiment, a participating merchant or consumer / user may access information from the cloud-based resource 608 by logging into a merchant account or a user account on the computer 602. The systems and methods involving blockchain discussed above may be implemented at least in part based on the cloud-based computing architecture 600.
[0081] It should be appreciated that the various components of cloud-based computing architecture 600 are shown only as examples. For example, a given user may access cloud-based resources 608 through multiple devices, not all of which are mobile devices. Similarly, a merchant or another user may access cloud-based resources 608 from any number of suitable mobile or non-mobile devices. Furthermore, in various embodiments, cloud-based resources 608 may accommodate many merchants and users.
[0082] It should be appreciated that like reference numerals are used to identify similar elements illustrated in one or more of the figures, wherein such referenced figures are for the purpose of illustrating embodiments of the present disclosure and not for the purpose of limiting the same.
[0083] One aspect of the present disclosure relates to a method, comprising the steps of: accessing a memory pool of a mining machine of a blockchain system, the memory pool comprising at least a first transaction and a second transaction; determining that the first transaction and the second transaction are related to each other; in response to the determination, linking the first transaction and the second transaction, wherein the linking comprises aggregating data associated with the first transaction and data associated with the second transaction into an aggregated data set; and writing the aggregated data set into a single block of the blockchain system.
[0084] Another aspect of the present disclosure relates to a system, which includes a non-volatile memory and one or more hardware processors, which are coupled to the non-volatile memory and configured to read instructions from the non-volatile memory to cause the system to perform operations including the following: accessing a memory pool of a mining machine of a blockchain system, the memory pool including at least a first transaction with a first priority and a second transaction with a second priority; determining whether the first transaction and the second transaction are related to each other based on one or more factors, the one or more factors including: whether the first transaction and the second transaction share a common user, a common merchant, a common payment processor, or a common location, or whether the first transaction and the second transaction are performed within a predetermined time period relative to each other; in response to determining that the first transaction and the second transaction are related, linking the first transaction and the second transaction, wherein the linking includes aggregating data associated with the first transaction and data associated with the second transaction into an aggregate data set and raising at least one of the first priority and the second priority; and writing the aggregate data set to a single block of the blockchain system.
[0085] Another aspect of the present disclosure relates to a method, comprising the steps of: accessing mining data associated with mined transactions performed by a miner of a blockchain system; making a first determination based on the mining data that the mined transactions meet one or more predefined criteria; making a second determination that the available storage space of a memory pool of the mining machine is below a predetermined threshold or that the memory pool will be unavailable; and in response to the first determination or the second determination, bypassing storing the mining data in the memory pool of the mining machine and writing the mining data to the blockchain system.
[0086] The foregoing disclosure is not intended to limit the present disclosure to the precise form disclosed or to the specific field of use. Thus, it is contemplated that various alternative embodiments and / or modifications to the present disclosure are possible in light of the present disclosure, whether or not explicitly described or implied herein. Having thus described the embodiments of the present disclosure, it will be appreciated by those of ordinary skill in the art that changes may be made in form and detail without departing from the scope of the present disclosure. Therefore, the present disclosure is limited only by the claims.
Claims
1. A method for optimizing data writing to a blockchain, comprising: Accessing a memory pool of a mining machine of a blockchain system, the memory pool comprising at least a first transaction and a second transaction, the first transaction and the second transaction each comprising a corresponding priority for being written into the blockchain system; determining that the first transaction and the second transaction are related to each other, wherein the determining comprises: determining that the first transaction and the second transaction share a common user, a common merchant, a common payment processor, and a common location, or that the first transaction and the second transaction are performed within a predetermined time period relative to each other, or that the first transaction and the second transaction result from the same underlying event; In response to the determining, linking the first transaction and the second transaction, wherein the linking comprises aggregating data associated with the first transaction and data associated with the second transaction into an aggregated data set, wherein the linking comprises reassigning a priority of at least the first transaction or the second transaction, wherein reassigning the priority comprises: assigning the same priority to both the first transaction and the second transaction; The aggregated data set is written into a single block of the blockchain system.
2. The method of claim 1, wherein the reassigning of priorities comprises: The priority of at least the first transaction or the second transaction is increased.
3. The method according to claim 1, further comprising: A delay is introduced for writing the first transaction or the second transaction into the blockchain system until the determination has been completed.
4. The method according to claim 1, further comprising: Transaction data from different tenants are stored in different compartments of the memory pool.
5. The method according to claim 4, further comprising: writing the name of the first tenant into a header of a selected block of the blockchain system; as well as Transaction data associated only with the first tenant is written into the selected block.
6. The method of claim 1, wherein the memory pool further comprises a third transaction and a fourth transaction, and wherein the method further comprises: determining a first mining fee associated with mining the third transaction and a second mining fee associated with mining the fourth transaction; as well as assigning a higher priority to the third transaction in response to determining that the first mining fee is greater than the second mining fee; or A higher priority is assigned to the fourth transaction in response to determining that the second mining fee is greater than the first mining fee.
7. A system for optimizing data writing to a blockchain, comprising: non-transitory memory; and One or more hardware processors coupled to the non-transitory memory and configured to read instructions from the non-transitory memory to cause the system to perform operations including: Accessing a memory pool of a mining machine of a blockchain system, wherein the memory pool includes at least a first transaction with a first priority and a second transaction with a second priority; determining an indication of a correlation between the first transaction and the second transaction based at least on one or more factors, the one or more factors including: whether the first transaction and the second transaction share a common user, a common merchant, a common payment processor, or a common location, or whether the first transaction and the second transaction are performed within a predetermined time period relative to each other, or the first transaction and the second transaction result from a same underlying event; In response to the correlation indication exceeding a predetermined threshold, linking the first transaction and the second transaction, wherein the linking comprises: aggregating data associated with the first transaction and data associated with the second transaction into an aggregated data set, and the linking comprises reassigning at least one of the first priority and the second priority, wherein reassigning the priority comprises: assigning the same priority to both the first transaction and the second transaction; and The aggregated data set is written into a single block of the blockchain system.
8. The system of claim 7, wherein the reassigning of priorities comprises raising the priority of at least the first transaction or the second transaction.
9. The system of claim 7, wherein the operations further comprise: Writing of the first transaction or the second transaction into the blockchain system is postponed until the determination has been completed.
10. The system of claim 7, wherein the operations further comprise: Storing transaction data from different tenants in different compartments of the memory pool; writing the name of the first tenant into a header of a selected block of the blockchain system; as well as Transaction data associated only with the first tenant is written into the selected block.
11. The system of claim 7, wherein the memory pool further comprises a third transaction and a fourth transaction, and wherein the operation further comprises: determining a first mining fee associated with mining the third transaction and a second mining fee associated with mining the fourth transaction; as well as assigning a higher priority to the third transaction in response to determining that the first mining fee is greater than the second mining fee; or A higher priority is assigned to the fourth transaction in response to determining that the second mining fee is greater than the first mining fee.
12. A computer-readable storage medium comprising instructions which, when executed by a processor, cause the processor to: Accessing a memory pool of a mining machine of a blockchain system, the memory pool comprising at least a first transaction and a second transaction, the first transaction and the second transaction each comprising a corresponding priority for being written into the blockchain system; determining that the first transaction and the second transaction are related to each other, wherein the determining comprises: determining that the first transaction and the second transaction share a common user, a common merchant, a common payment processor, and a common location, or that the first transaction and the second transaction are performed within a predetermined time period relative to each other, or that the first transaction and the second transaction result from the same underlying event; In response to the determining, linking the first transaction and the second transaction, wherein the linking comprises aggregating data associated with the first transaction and data associated with the second transaction into an aggregated data set, wherein the linking comprises reassigning a priority of at least the first transaction or the second transaction, wherein reassigning the priority comprises: assigning the same priority to both the first transaction and the second transaction; The aggregated data set is written into a single block of the blockchain system.
13. The computer-readable storage medium of claim 12, wherein the reassigning of priorities comprises: The priority of at least the first transaction or the second transaction is increased.
14. The computer-readable storage medium of claim 12, wherein the instructions further cause the processor to: introduce a delay in writing the first transaction or the second transaction to the blockchain system until the determination is complete.
15. The computer-readable storage medium of claim 12, wherein the instructions further cause the processor to: store transaction data from different tenants in different compartments of the memory pool.
16. The computer-readable storage medium of claim 15, wherein the instructions further cause the processor to: writing the name of the first tenant into a header of a selected block of the blockchain system; and Transaction data associated only with the first tenant is written into the selected block.
17. The computer-readable storage medium of claim 12, wherein the memory pool further comprises a third transaction and a fourth transaction, the instructions further causing the processor to: determining a first mining fee associated with mining the third transaction and a second mining fee associated with mining the fourth transaction; and assigning a higher priority to the third transaction in response to determining that the first mining fee is greater than the second mining fee; or A higher priority is assigned to the fourth transaction in response to determining that the second mining fee is greater than the first mining fee.
