Abstract: Nodes determine a first measure of difficulty for a first branch of a split blockchain and a second measure of difficulty for a second branch of the split blockchain. The first measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the first branch. The second measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the second branch. One of the first branch and the second branch is identified as a legitimate branch based on a comparison of the first measure of difficulty and the second measure of difficulty.

Abstract: A record of authorization including user information is received and appended to a blockchain. The record of authorization authorizes access by a third-party application to the user information for an access duration. The user information is encrypted by a group key and access duration is based on a change to the group key. The group key comprises a public/private key pair, and the access duration is implemented by an authorization group of nodes having the group key. The group key corresponds to either a valid group key at or near the start of the access duration, that enables decryption of a message in the record of authorization that includes the user information, or an incompatible group key at or after the end of the access duration, that does not enable decryption of the message in the record of authorization that includes the user information.

Abstract: Nodes determine a first measure of difficulty for a first branch of a split blockchain and a second measure of difficulty for a second branch of the split blockchain. The first measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the first branch. The second measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the second branch. One of the first branch and the second branch is identified as a legitimate branch based on a comparison of the first measure of difficulty and the second measure of difficulty.

Abstract: Nodes determine a first measure of difficulty for a first branch of a split blockchain and a second measure of difficulty for a second branch of the split blockchain. The first measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the first branch. The second measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the second branch. One of the first branch and the second branch is identified as a legitimate branch based on a comparison of the first measure of difficulty and the second measure of difficulty.

Abstract: A method of trading data includes posting, in a data trading system, data information related to data that is located in a storage apparatus independent of the data trading system and available for purchase and receiving, from a purchaser device, a compensation for the data. The method also includes facilitating, at least partially through a smart contract on a blockchain, a transfer of the data directly from the storage apparatus to the purchaser device; and facilitating, at least partially through the smart contract on a blockchain, a transfer of the compensation from the data trading system to a provider account.

Abstract: A record of authorization including user information is received and appended to a blockchain. The record of authorization authorizes access by a third-party application to the user information for an access duration. The user information is encrypted by a group key and access duration is based on a change to the group key. The group key comprises a public/private key pair, and the access duration is implemented by an authorization group of nodes having the group key. The group key corresponds to either a valid group key at or near the start of the access duration, that enables decryption of a message in the record of authorization that includes the user information, or an incompatible group key at or after the end of the access duration, that does not enable decryption of the message in the record of authorization that includes the user information.

Abstract: A mechanism for managing a decentralized application functioning within an application shard in a decentralized network includes an access control mechanism and a resource control mechanism. The access control mechanism includes access logic that determines if a request to submit a transaction for execution by the decentralized application is valid. The request is received from an originator through the decentralized application. The resource control mechanism is called when a request is determined by the access control mechanism to be a valid request. The resource control mechanism includes resource logic that determines if a criterion is satisfied. The criterion may include one or more of a first criterion associated with the originator and a second criterion associated with the application shard. The resource control mechanism further includes forwarding logic that initiates a forwarding of the validated request to the application shard if the criterion is satisfied.

Abstract: Nodes determine a first measure of difficulty for a first branch of a split blockchain and a second measure of difficulty for a second branch of the split blockchain. The first measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the first branch. The second measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the second branch. One of the first branch and the second branch is identified as a legitimate branch based on a comparison of the first measure of difficulty and the second measure of difficulty.

Abstract: A packet including a message intended for a smart contract associated with the second subchain and a node identifier is constructed at each of a plurality of nodes associated with the first subchain. The message constructed by the plurality of nodes are identical and may be a transaction request requesting the smart contract to execute on a blockchain. Each of the packets is sent to one or more nodes associated with the second subchain. The packets and messages received by one or more of a plurality of nodes associated with the second subchain are monitored and processed at the second subchain to determine if a consensus on request has been reached from the first subchain. If a consensus on request has been reached from the first subchain, the smart contract associated with the second subchain executes on the blockchain in accordance with the transaction request.

Abstract: A packet including a message intended for a smart contract associated with the second subchain and a node identifier is constructed at each of a plurality of nodes associated with the first subchain. The message constructed by the plurality of nodes are identical and may be a transaction request requesting the smart contract to execute on a blockchain. Each of the packets is sent to one or more nodes associated with the second subchain. The packets and messages received by one or more of a plurality of nodes associated with the second subchain are monitored and processed at the second subchain to determine if a consensus on request has been reached from the first subchain. If a consensus on request has been reached from the first subchain, the smart contract associated with the second subchain executes on the blockchain in accordance with the transaction request.

Abstract: A mechanism for managing a decentralized application functioning within an application shard in a decentralized network includes an access control mechanism and a resource control mechanism. The access control mechanism includes access logic that determines if a request to submit a transaction for execution by the decentralized application is valid. The request is received from an originator through the decentralized application. The resource control mechanism is called when a request is determined by the access control mechanism to be a valid request. The resource control mechanism includes resource logic that determines if a criterion is satisfied. The criterion may include one or more of a first criterion associated with the originator and a second criterion associated with the application shard. The resource control mechanism further includes forwarding logic that initiates a forwarding of the validated request to the application shard if the criterion is satisfied.