Abstract: An example operation may include one or more of receiving a request for blockchain information from a user device, acquiring blockchain data from a plurality of blockchains which are actively operating and available for joining, determining an amount of trust for each blockchain among the plurality of blockchains based on acquired blockchain data of the respective blockchain, and outputting a list identifying the plurality of blockchains where each blockchain on the list comprises a trust indicator indicating a determined amount of trust for the respective blockchain.

Abstract: A node in a blockchain network may generate a configuration override for the blockchain network, approve the configuration override by the blockchain network, transmit the approval for the configuration override to peers in the blockchain network, and submit the configuration override to the blockchain network for validation. The validation will be based on the configuration override matching the approval.

Abstract: A node in a blockchain network may generate a configuration override for the blockchain network, approve the configuration override by the blockchain network, transmit the approval for the configuration override to peers in the blockchain network, and submit the configuration override to the blockchain network for validation. The validation will be based on the configuration override matching the approval.

Abstract: An example operation may include one or more of generating a data block for a hash-linked chain of blocks stored on a distributed ledger and accessible to a plurality of computing nodes of a blockchain network, storing governance policies within the data block, the governance polices governing interaction with the hash-linked chain of blocks, and transmitting the generated data block with the encoded governance policies therein to a plurality of peer nodes of the distributed ledger.

Abstract: An example operation may include one or more of receiving a request to commit a blockchain request to a hash-linked chain of blocks stored on a distributed ledger, extracting governance policies which are encoded within a data block of the hash-linked chain of blocks on the distributed ledger, determining if the blockchain request satisfies the extracted governance policies of the hash-linked chain of blocks on the distributed ledger, and in response to the blockchain request satisfying the extracted governance policies, executing the blockchain request and storing the executed blockchain request within another data block of the hash-linked chain of data blocks on the distributed ledger.

Abstract: An example operation may include one or more of receiving a request to modify a governance policy of a blockchain, identifying a principal identity that controls the governance policy, determining an allowable combination of signatures of the principal identity required for modifying the governance policy based on a graph data structure storing signature policies for endorsing modifications to governance policies, and modifying the governance policy of the blockchain based on the request in response to an allowable combination of signatures being received.

Abstract: An example operation may include one or more of receiving a request to implement a modification to previously established governance policies of a blockchain, identifying one or more requirements for the modification based on the blockchain, determining whether the one or more identified requirements are satisfied based on signature data included within the request, and in response to the signature data satisfying the one or more requirements, transmitting the modification to an ordering node for inclusion within a data block of a hash-linked chain of blocks of the blockchain.

Abstract: An example operation may include one or more of generating a data block for a hash-linked chain of blocks stored on a distributed ledger and accessible to a plurality of computing nodes of a blockchain network, storing governance policies within the data block, the governance polices governing interaction with the hash-linked chain of blocks, and transmitting the generated data block with the encoded governance policies therein to a plurality of peer nodes of the distributed ledger.

Abstract: An example operation may include one or more of receiving a request to implement a modification to previously established governance policies of a blockchain, identifying one or more requirements for the modification based on the blockchain, determining whether the one or more identified requirements are satisfied based on signature data included within the request, and in response to the signature data satisfying the one or more requirements, transmitting the modification to an ordering node for inclusion within a data block of a hash-linked chain of blocks of the blockchain.

Abstract: An example operation may include one or more of receiving a request to modify a governance policy of a blockchain, identifying a principal identity that controls the governance policy, determining an allowable combination of signatures of the principal identity required for modifying the governance policy based on a graph data structure storing signature policies for endorsing modifications to governance policies, and modifying the governance policy of the blockchain based on the request in response to an allowable combination of signatures being received.

Abstract: An example operation may include one or more of receiving a request to commit a blockchain request to a hash-linked chain of blocks stored on a distributed ledger, extracting governance policies which are encoded within a data block of the hash-linked chain of blocks on the distributed ledger, determining if the blockchain request satisfies the extracted governance policies of the hash-linked chain of blocks on the distributed ledger, and in response to the blockchain request satisfying the extracted governance policies, executing the blockchain request and storing the executed blockchain request within another data block of the hash-linked chain of data blocks on the distributed ledger.

Abstract: An example operation may include one or more of receiving a request for blockchain information from a user device, acquiring blockchain data from a plurality of blockchains which are actively operating and available for joining, determining an amount of trust for each blockchain among the plurality of blockchains based on acquired blockchain data of the respective blockchain, and outputting a list identifying the plurality of blockchains where each blockchain on the list comprises a trust indicator indicating a determined amount of trust for the respective blockchain.

Abstract: Embodiments of the invention provide for the optimization of utilization of non-volatile memory in message queuing. In an embodiment of the invention, a method for optimizing utilization of non-volatile memory in message queuing includes receiving a new message in a message queuing system implemented in a host computing system. The method also includes storing the new message as a master message in non-volatile memory of the host computing system. The method yet further includes subsequently receiving different messages that each share redundant information with the master message. The method even yet further includes delta encoding each of the different messages and storing the delta encoded different messages in the non-volatile memory. Finally, the method includes deleting the master message from the non-volatile memory only once each of the different messages and the master message have been acknowledged by at least one consumer subscribing to the message queuing system.

Abstract: Embodiments of the invention provide for the optimization of utilization of non-volatile memory in message queuing. In an embodiment of the invention, a method for optimizing utilization of non-volatile memory in message queuing includes receiving a new message in a message queueing system implemented in a host computing system. The method also includes storing the new message as a master message in non-volatile memory of the host computing system. The method yet further includes subsequently receiving different messages that each share redundant information with the master message. The method even yet further includes delta encoding each of the different messages and storing the delta encoded different messages in the non-volatile memory. Finally, the method includes deleting the master message from the non-volatile memory only once each of the different messages and the master message have been acknowledged by at least one consumer subscribing to the message queuing system.

Abstract: Embodiments relate to method and computer program products for routing messages based on geolocation information. Aspects include receiving a message from a publisher, computing a geo-hash for the message based on a location associated with the message, and traversing a geo-hash tree associated with a subscriber to determine if the geo-hash of the message corresponds to a geo-hash grid in the geo-hash tree. Based on determining that the geo-hash of the message corresponds to an identified geo-hash grid in the geo-hash tree, a point in a polygon algorithm is performed to determine if the location associated with the message is inside an area of interest associated with the identified geo-hash grid. If the location associated with the message is inside the area of interest, the message is forwarded to the subscriber.

Abstract: Embodiments relate to method and computer program products for routing messages based on geolocation information. Aspects include receiving a message from a publisher, computing a geo-hash for the message based on a location associated with the message, and traversing a geo-hash tree associated with a subscriber to determine if the geo-hash of the message corresponds to a geo-hash grid in the geo-hash tree. Based on determining that the geo-hash of the message corresponds to an identified geo-hash grid in the geo-hash tree, a point in a polygon algorithm is performed to determine if the location associated with the message is inside an area of interest associated with the identified geo-hash grid. If the location associated with the message is inside the area of interest, the message is forwarded to the subscriber.

Abstract: Embodiments of the invention provide for the optimization of utilization of non-volatile memory in message queuing. In an embodiment of the invention, a method for optimizing utilization of non-volatile memory in message queuing includes receiving a new message in a message queueing system implemented in a host computing system. The method also includes storing the new message as a master message in non-volatile memory of the host computing system. The method yet further includes subsequently receiving different messages that each share redundant information with the master message. The method even yet further includes delta encoding each of the different messages and storing the delta encoded different messages in the non-volatile memory. Finally, the method includes deleting the master message from the non-volatile memory only once each of the different messages and the master message have been acknowledged by at least one consumer subscribing to the message queuing system.

Abstract: Embodiments of the invention provide for the optimization of utilization of non-volatile memory in message queuing. In an embodiment of the invention, a method for optimizing utilization of non-volatile memory in message queuing includes receiving a new message in a message queueing system implemented in a host computing system. The method also includes storing the new message as a master message in non-volatile memory of the host computing system. The method yet further includes subsequently receiving different messages that each share redundant information with the master message. The method even yet further includes delta encoding each of the different messages and storing the delta encoded different messages in the non-volatile memory. Finally, the method includes deleting the master message from the non-volatile memory only once each of the different messages and the master message have been acknowledged by at least one consumer subscribing to the message queuing system.

Abstract: Embodiments relate to method and computer program products for routing messages based on geolocation information. Aspects include receiving a message from a publisher, computing a geo-hash for the message based on a location associated with the message, and traversing a geo-hash tree associated with a subscriber to determine if the geo-hash of the message corresponds to a geo-hash grid in the geo-hash tree. Based on determining that the geo-hash of the message corresponds to an identified geo-hash grid in the geo-hash tree, a point in a polygon algorithm is performed to determine if the location associated with the message is inside an area of interest associated with the identified geo-hash grid. If the location associated with the message is inside the area of interest, the message is forwarded to the subscriber.

Abstract: Embodiments relate to method and computer program products for routing messages based on geolocation information. Aspects include receiving a message from a publisher, computing a geo-hash for the message based on a location associated with the message, and traversing a geo-hash tree associated with a subscriber to determine if the geo-hash of the message corresponds to a geo-hash grid in the geo-hash tree. Based on determining that the geo-hash of the message corresponds to an identified geo-hash grid in the geo-hash tree, a point in a polygon algorithm is performed to determine if the location associated with the message is inside an area of interest associated with the identified geo-hash grid. If the location associated with the message is inside the area of interest, the message is forwarded to the subscriber.