Abstract: A method secures hash chains via hybrid consensus. A proximate payload for a proximate chain block for a proximate chain is obtained. A first identifier of the proximate chain and the proximate payload are hashed with a hash function to generate a second identifier of the proximate chain. The proximate chain block is added to the proximate chain. The proximate chain block includes the first identifier, the second identifier, and the proximate payload. A request to add the second identifier to a reporting chain is transmitted. A response indicating that the second identifier is incorporated into the reporting chain using the consensus mechanism is received.

Abstract: A method for using shareable and nested transaction on hash chains includes storing transaction data of a transaction of a hash chain. A lock block is appended to the hash chain. Appending the lock block includes setting a tail block identifier of the hash chain from a preceding tail block of a preceding transaction to the lock block. A data block is appended to the hash chain. Appending the data block includes setting the tail block identifier of the hash chain to the data block. The method further includes removing the transaction data from the transaction without invalidating the hash chain. The method further includes appending an updated data block to the hash chain to update the transaction with updated transaction data.

Abstract: A method uses private information with a shared single source of truth. A message is received responsive to adding a first shared block to a shared object ledger of a shared object. The message includes message data. A private block is added to a private object ledger to update a private object. The private block includes private data from the message data. A second shared block is added to the shared object ledger to update the shared object. The second shared block includes shared data from the message data.

Abstract: A method implements verifiable cacheable calculations. A result is calculated. The result is hashed to generate a name of the result. The result is an input of a set of inputs from which the name is generated. Each input of the set of inputs identifies one of a data set, a query, and a function. The result is stored in a cache using the name generated from hashing the result. A request is received to access the result using the name. The result is retrieved from the cache using the name generated from hashing the result corresponding to the input. The result is presented in response to the request.

Abstract: A method secures hash chains via hybrid consensus. A proximate payload for a proximate chain block for a proximate chain is obtained. A first identifier of the proximate chain and the proximate payload are hashed with a hash function to generate a second identifier of the proximate chain. The proximate chain block is added to the proximate chain. The proximate chain block includes the first identifier, the second identifier, and the proximate payload. A request to add the second identifier to a reporting chain is transmitted. A response indicating that the second identifier is incorporated into the reporting chain using the consensus mechanism is received.

Abstract: A method services competing updates from multiple servicing instances. An update message is received by a class of a plurality of classes that service an object. The update message includes an update to the object and an expected version for the object. A version match is determined between the expected version and a current version of the object. When the version match is successful, the update is applied to the object. A response message including the current version of the object is generated. The response message is transmitted. When the update is successfully applied, the response message is transmitted as a success message. When the update is not successfully applied, the response message is transmitted as a failure message.

Abstract: A method for hash chain migration includes detecting a version update of an object that includes a hash chain that stores fields of the object. Sub chains are identified from the hash chain. Migration sub chains are generated from the plurality of sub chains using a plurality of processes. Container blocks are generated from the plurality of migration sub chains. A migration chain is generated from the plurality of container blocks. The object is accessed using the migration chain.

Abstract: A method for storing object state on hash chains. A block of a hash chain is located with an accessor function. The block includes a field value of a field of an object. Version data is located using the block. The version data identifies a block version of the block. The block version is compared to a function version of the accessor function. The field value from the block is returned when the block version matches the function version. A version matched accessor function is called to return the field value when the block version does not match the function version.

Abstract: A method for using shareable and nested transaction on hash chains includes storing transaction data of a transaction of a hash chain. A lock block is appended to the hash chain. Appending the lock block includes setting a tail block identifier of the hash chain from a preceding tail block of a preceding transaction to the lock block. A data block is appended to the hash chain. Appending the data block includes setting the tail block identifier of the hash chain to the data block. The method further includes removing the transaction data from the transaction without invalidating the hash chain. The method further includes appending an updated data block to the hash chain to update the transaction with updated transaction data.

Abstract: A method for loading objects from hash chains. A version chain of a class for a serialized object is located in an instance block of an instance chain. A class version of the serialized object is compared to a current version of the class. When the class version of the serialized object matches the current version of the class, a runtime object is loaded by deserializing the serialized object. When the class version of the serialized object does not match the current version of the class: one or more field values are extracted from the serialized object; a converter function is applied to the one or more field values to generate one or more converted field values; and a runtime object that matches the current version is loaded with the one or more converted field values.

Abstract: A method for hash chain migration includes detecting a version update of an object that includes a hash chain that stores fields of the object. Sub chains are identified from the hash chain. Migration sub chains are generated from the plurality of sub chains using a plurality of processes. Container blocks are generated from the plurality of migration sub chains. A migration chain is generated from the plurality of container blocks. The object is accessed using the migration chain.

Abstract: A method for loading objects from hash chains. A version chain of a class for a serialized object is located in an instance block of an instance chain. A class version of the serialized object is compared to a current version of the class. When the class version of the serialized object matches the current version of the class, a runtime object is loaded by deserializing the serialized object. When the class version of the serialized object does not match the current version of the class: one or more field values are extracted from the serialized object; a converter function is applied to the one or more field values to generate one or more converted field values; and a runtime object that matches the current version is loaded with the one or more converted field values.

Abstract: A method for storing object state on hash chains. A read request that includes a received field name is received by an object with a plurality of fields. A field value that corresponds to the received field name is retrieved from a hash chain of the object by traversing the hash chain. A block is found that includes the field value from the plurality of field values that corresponds to the received field name. A response to the read request that includes the field value is generated and transmitted.

Abstract: A method for storing object state on hash chains. A block of a hash chain is located with an accessor function. The block includes a field value of a field of an object. Version data is located using the block. The version data identifies a block version of the block. The block version is compared to a function version of the accessor function. The field value from the block is returned when the block version matches the function version. A version matched accessor function is called to return the field value when the block version does not match the function version.

Abstract: A method for storing object state on hash chains. A read request that includes a received field name is received by an object with a plurality of fields. A field value that corresponds to the received field name is retrieved from a hash chain of the object by traversing the hash chain. A block is found that includes the field value from the plurality of field values that corresponds to the received field name. A response to the read request that includes the field value is generated and transmitted.

Abstract: An invisible light sensing device senses invisible light from a plurality of invisible light emitting or reflecting objects in which each of the invisible light emitting or reflecting objects emits or reflects invisible light in an identification pattern that is distinct from other identification patterns. An identification pattern is based on a sequenced pulsing pattern of invisible light that is emitted by an invisible light emitting object to form the identification pattern. An identification pattern is also based on an invisible light reflective coating that is applied to an invisible light reflecting object.

Abstract: A method for message management is disclosed. The method includes: deriving, by a first subscriber node (SN), a secret value associated with a publisher node (PN); generating, by the first SN, a first expected sequence number using a one-way function and the secret value; receiving, by the first SN, a first publisher message generated by the PN and including a first sequence number; validating, by the first SN, the first publisher message by comparing the first sequence number with the first expected sequence number; processing, by the first SN, a payload of the first publisher message in response to the first sequence number and the first expected sequence number matching; and generating, by the first SN node, a second expected sequence number using the one-way function, the first sequence number, and the secret value.

Abstract: An invisible light sensing device senses invisible light from a plurality of invisible light emitting objects in which each of the invisible light emitting objects emits invisible light in an identification pattern that is distinct from other identification patterns. An identification pattern is based on one or more apertures through which invisible light is emitted to form the identification pattern. An identification pattern is also based on a plurality of invisible light emitters in which at least a portion of the invisible light emitters are positioned and activated to form the identification pattern.

Abstract: A method for message management is disclosed. The method includes: deriving, by a first subscriber node (SN), a secret value associated with a publisher node (PN); generating, by the first SN, a first expected sequence number using a one-way function and the secret value; receiving, by the first SN, a first publisher message generated by the PN and including a first sequence number; validating, by the first SN, the first publisher message by comparing the first sequence number with the first expected sequence number; processing, by the first SN, a payload of the first publisher message in response to the first sequence number and the first expected sequence number matching; and generating, by the first SN node, a second expected sequence number using the one-way function, the first sequence number, and the secret value.