Intuit, Inc.

Intuti, Inc.

Michael R Gabriel

Glenn Carter Scott

Roger Charles Meike

Parikshit Lingampally

Ian Maya Panchevre

Ian Pentland

George Mount

Glenn Scott

Amir R Eftekhari

Roy Goldman

Dante Emilio Cassanego

James Lee Showalter

Daniel J Richardson

Rachel Jack

Ian R Pentland

Roger Meike

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.

Competing updates from multiple servicing instances

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.

Securing hash chains via hybrid consensus

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.

Shareable and nested transactions on hash chains

The present disclosure relates to a trustworthy data exchange. Embodiments include receiving, from a device, a query, wherein the query comprises a question. Embodiments include identifying particular information related to the query. Embodiments include receiving credentials from a user for retrieving the particular information related to the query. Embodiments include retrieving, using the credentials, the particular information related to the query from one or more data repositories that are part of a distributed database comprising an immutable data store that maintains a verifiable history of changes to information stored in the distributed database. Embodiments include determining, based on the particular information related to the query, an answer to the query. Embodiments include providing the answer to the device.

Trustworthy data exchange using distributed databases

Certain aspects of the present disclosure provide techniques for summarizing data in a distributed system. Embodiments include generating an ordered list of blocks by iterating through a first group of blocks of a hash chain starting at a last block of the hash chain and adding each of the first group of blocks of the hash chain to the ordered list. Embodiments further include generating summary data by applying a summary function to the first group of blocks based on the ordered list. The summary function may take the ordered list as an input and provide the summary data of the first group of blocks as an output. Embodiments further include generating a summary block comprising the summary data and adding the summary block to a summary chain.

Summary chains in distributed systems

Techniques are disclosed for managing encrypted data stored in one or more blocks of a first data structure. One embodiment presented herein includes a computer-implemented method, which includes retrieving the encrypted data from the one or more blocks. The method further includes placing the encrypted data in a container object. The method further includes applying an encryption technique to the container object to generate an encrypted container object and a key. The method further includes generating a second data structure. A first block of the second data structure may include either the encrypted container object or information related to the encrypted container object.

Re-encrypting data on a hash chain

The present disclosure relates to generating composite user identities in a distributed computing system. According to one embodiment, an example method generally includes transmitting, to a plurality of identity providers, a request for user identity information. A service provider receives, from a subset of the plurality of identity providers, the user identity information and selects a subset of the received user identity information to be used in verifying an identity of a user based, at least in part, on a reputation score associated with each identity provider in the subset of identity providers. The service provider generates a composite user identity based on the selected subset of the received user identity information. The service provider takes one or more actions to enable use of a service based on the generated composite user identity.

Composite user identities in distributed computing systems

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.

Systems and methods for hash chain migration

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.

Systems and methods for storing object state on hash chains

Techniques are disclosed for managing a series of blocks in a distributed system. One embodiment presented herein includes a computer-implemented method, which includes dividing the series of blocks into a plurality of groups. The method further includes distributing the plurality of groups to a plurality of processors. The plurality of processors may apply one or more functions to each group of the plurality of groups in parallel. The method further includes receiving, from the plurality of processors, results of the one or more functions. The method further includes merging the results to generate combined results. The combined results may be used in processing data.

Parallel map and reduce on hash chains

The invention relates to a method for documenting subjects using hash chains. The method includes receiving a subject data write request including one or more subject attribute values, generating a fingerprint from a current last block of a hash chain, and generating a payload from the subject data, the payload including the one or more subject attribute values and one or more keys identifying the one or more subject attribute values. The method further includes appending a block to the hash chain. The appended block includes the payload and the fingerprint.

Method and system for secure digital documentation of subjects using hash chains

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.

System and methods for loading objects from hash chains

Techniques are disclosed for managing data of an application. One embodiment presented herein includes a computer-implemented method, which includes scanning a distributed system to identify one or more blocks comprising data associated with the application. The method further includes generating a witness block based on the one or more blocks. The witness block may comprise a state of the data from the one or more blocks. The method further includes adding the witness block to the distributed system.

Growing community of inventors

Mountain View, CA, United States of America

Michael R Gabriel