Caringo Assigned Two Patents

Generation of seed value for pseudo random number generator
Caringo, Inc., Austin, TX, has been assigned a patent (8,843,539) developed by Eric Dey, Austin, TX, for the “generation of seed value for pseudo random number generator.”

The abstract of the patent published by the U.S. Patent and Trademark Office states: “Two or more numerical samples are read from a storage location (or many storage locations) and the samples are compared to generate a single bit of entropy. This method is repeated to populate two arrays which are also compared to generate a single bit. Comparison of the arrays is also repeated to generate a sequence of bits which are formed into computer words. The words are combined with a shift register to generate a seed block array of any length. The seed block array is used to seed a pseudo random number generator. The storage location is a register, accumulator, buffer, clock, address, memory location, etc., that changes periodically. Comparison may be performed by counting the number of certain types of bits in the two values and returning a one or zero depending upon the count.”

The patent application was filed on May 8, 2012 (13/466,974).

Elimination of duplicate objects in storage clusters
Caringo, Austin, TX, has been assigned a patent (8,843,454) developed by Paul R.M. Carpentier, Boechout, Belgium, and Russell Turpin, Corpus Christi, TX, for the “elimination of duplicate objects in storage clusters.”

The abstract of the patent published by the U.S. Patent and Trademark Office states: “Digital objects within a fixed-content storage cluster use a page mapping table and a hash-to-UID table to store a representation of each object. For each object stored within the cluster, a record in the hash-to-UID table stores the object’s hash value and its unique identifier (or portions thereof). To detect a duplicate of an object, a portion of its hash value is used as a key into the page mapping table. The page mapping table indicates a node holding a hash-to-UID table indicating currently stored objects in a particular page range. Finding the same hash value but with a different unique identifier in the table indicates that a duplicate of an object exists. Portions of the hash value and unique identifier may be used in the hash-to-UID table. Unneeded duplicate objects are deleted by copying their metadata to a manifest and then redirecting unique identifiers to point at the manifest.“

The patent application was filed on April 25, 2014 (14/262,628).