47 results about "Splaysort" patented technology

Certain example embodiments relate to systems and / or methods for determining and / or executing an appropriate subset of tests in response to a code change. In certain example embodiments, hash digests or other unique values for code structures (such as, for example, classes, methods, and / or other structural elements) may be created. Tests associated those associated code structures may be identified. New hash digests or other unique values may be generated for the code structures after the source code has been modified. In response to a mismatch as between the existing and new hash digests or other unique values, a list of associated tests for possible subsequent execution may be retrieved. Certain example embodiments additionally or alternatively provide an incremental but consistent way of analyzing performance issues, e.g., in connection with a profiler.

A representation used in a computer system to represent a set of data items that correspond to and are accessible by means of a set of keys. The representation includes an array of the data items and a bit string associated with the array. Each key is mapped onto a bit of the bit string by means of a hash function that is perfect for the set of keys. The mapped bit is set. The data item corresponding to the key has a position in the array that corresponds to the position of the bit for the key in the bit string. Methods for reading and writing the representation are disclosed as well as a technique based on the mod operation and a set of co-prime numbers for finding a perfect hash function for a given set of keys.

A system and method is provided for providing security to components or assemblies employed by application programs during runtime. Assemblies carry version information that can be used to enforce the versioning rules described by the application program. At runtime, version numbers requested by the application programs are compared with those version numbers of the assemblies that are actually found. In addition to comparing version numbers, the present invention offers a stricter form of version checking based on cryptographic hashes. An assembly is provided with module information that contains a list of the files that make up the assembly. Part of the information recorded about each module is a hash of the module's contents at the time the manifest was built. An assembly referencing another assembly computes the hash of the manifest of the referenced assembly. An assembly manifest may include dependency information, which is information about other assemblies that the assembly depends on or references. Part of the information stored as part of an assembly reference or manifest is a hash of the dependent assembly's manifest.

The invention is applicable to the technical field of computers, and provides a PoW certification method in a blockchain network and a blockchain, the PoW certification method comprises the followingsteps: acquiring a hash value of a previous block; according to the numerical value of the hash value of the previous block and a corresponding relationship between the numerical value and a hash algorithm, determining the sequence of the hash algorithm; sequentially carrying out hash calculation on blocks consisting of a random value and the transaction information to be packaged according to thethe sequence of a hash algorithm to generate hash values; and replacing the random value, repeating the previous steps until the hash value meets the PoW certification requirement, and broadcasting the block to other nodes for verification. According to the PoW method provided by the invention, the sequence of the hash algorithm is linked with the numerical value of the previous block, so that ahash algorithm used by the blockchain decentralization method each time is a random sequence, and a CPU and a GPU can better adapt to the random sequence, so that the advantages of ASIC in computing power are offset, and the distributed idea of blockchain decentralization is maintained.

An input file is processed according to hash algorithm that references sets of literals to preceding sets of literals to facilitate copy-offset command generation. Preceding instances are identified by generating a hash of the literal set and looking up a corresponding entry in a hash table. The hash table may be accessed by placing look-up requests in a FIFO buffer. When the FIFO buffer is full, generation of the hash chain is suspended until it is no longer full. When repeated literals are found, generation of the hash chain is likewise suspended. The hash chain is used to generate a command file, such as according to the LZ algorithm. Runs of consecutive literals are replaced by a run-length command. The command file may then be encoded using Huffman encoding.

A method, system and non-transitory computer readable instructions for data change detection includes decrypting encrypted patch data that includes compressed variable sized patch data chunks. The compressed variable sized patch data chunks are decompressed and a strong hash value is generated. The strong hash values are compared with strong hash values of corresponding variable sized application data chunks to determine a potentially non-referable patch data chunk. A bloom filter is generated for the variable sized application data chunks. A rolling hash value for a window of the potentially non-referable patch data chunk is used to determine a potentially referable area from the potentially non-referable patch data chunk. The potentially referable area is designated as referable when a weak hash and a strong hash of an application data chunk matches the weak hash and the strong hash of the potentially referable area.

A method, apparatus and computer program product for detecting malicious content and predicting cyberattacks are described herein. In the context of a method, the method receives a hash query comprising a file hash based on one or more files. The method queries a cyberattack case studies information database based on the hash query to generate one or more attack correlation information items associated with at least one of the one or more files. The method also generates and outputs a file security analysis based on the attack correlation information items for authorization of the one or more files.

Cryptographic method for verifying data method, implemented by at least one apparatus, for comparing a first dataset and a second dataset, in particular with a view to determining whether these two datasets are identical, this method not requiring the presence of these two datasets in the apparatus, and comprising the following steps: a) mixing a number, called the mixer number, with the first dataset, using a mixing function in order to obtain mixed data, b) hashing the mixed data using a hash function, and c) comparing the hash thus obtained in step b) with a third dataset assumed to be the hash of the second dataset mixed with the same mixer number as that used in step a) and with the same mixing function.

A method is provided for consistent data processing by first and second distributed processing systems having different data partitioning and routing mechanisms such that the first system is without states and the second system is with states. The method includes dividing data in each system into a same number of partitions based on a same key and a same hash function. The method includes mapping partitions between the systems in a one-to-one mapping. The mapping step includes (i) checking if a partition in the first system is mapped to a partition in the second system; and (ii) calculating a partition ID based on the hash function and a total number of partitions, and dynamically mapping the partition in the first system to the partition in the second system, responsive to the partition in the first system being unmapped to the partition in the second system.

A representation of a new rule, defined as a set of a new transition(s), is inserted into a perfect hash table which includes previously placed transitions to generate an updated perfect hash table. This may be done by, for each new transition: (a) hashing the new transition; and (b) if there is no conflict, inserting the hashed new transition into the table. If, however, the hashed new transition conflicts with any of the previously placed transitions, either (A) any transitions of the state associated with the conflicting transition are removed from the table, the hashed new transition is placed into the table, and the removed transitions are re-placed into the table, or (B) any previously placed transitions of the state associated with the new transition are removed, and the transitions of the state associated with the new transition are re-placed into the table.

A control module transferring data between a shard and destination shards within a database comprising a plurality of shards, the control module: generating a first hash wheel distribution of shard allocations by applying a defined hashing function to a first integer value per shard allocation; generating a further hash wheel distribution of shard allocations by applying the defined hashing function to a further integer value per shard allocation; determining a range of hash values associated with data to be transferred between the shard and a destination shard, wherein the range of hash values, the shard and the destination shard are defined based on determining a difference between the first hash wheel distribution of shard allocations and the further hash wheel distribution of shard allocations; selecting and controlling the transfer of data associated with the determined range of hash values between the shard and the destination shard.

A versioning system determines an amount by which a first collection and a second collection of data objects overlap. The system divides the first collection of data objects into m possibly overlapping groups of average size s and computes one combined hash result for each group. The system then constructs a first sketch vector with n elements based on the combined hash results. A respective element of the first sketch vector is selected, using a selection function, from the combined hash results that are computed with the hash function corresponding to the element's index. Next, the system receives a second sketch vector for the second collection of data objects, and determines a sketch-vector overlap between the first and second sketch vectors. The system then computes a data-object overlap between the first and second collections of data objects based on the sketch-vector overlap.

A method is provided for consistent data processing by first and second distributed processing systems having different data partitioning and routing mechanisms such that the first system is without states and the second system is with states. The method includes dividing data in each system into a same number of partitions based on a same key and a same hash function. The method includes mapping partitions between the systems in a one-to-one mapping. The mapping step includes (i) checking if a partition in the first system is mapped to a partition in the second system; and (ii) calculating a partition ID based on the hash function and a total number of partitions, and dynamically mapping the partition in the first system to the partition in the second system, responsive to the partition in the first system being unmapped to the partition in the second system.

A method, computer program product, and computing system for receiving a candidate data portion; calculating a distance-preserving hash for the candidate data portion; and performing an entropy analysis on the distance-preserving hash to generate a hash entropy for the candidate data portion.

Embodiments of the present invention provide a time- and space-efficient system for representing and searching a set of intervals to find all the intervals that overlap with a given query interval or point. A new structure called an interval hash table is introduced to significantly reduce the average search time, thereby improving computing and search technology. During operation, the system obtains data indicating a set of intervals to be hashed. The system divides a respective interval into a set of sub-intervals based on a locality-preserving hashing. The system then obtains a hash code associated with a respective sub-interval, and inserts the respective sub-interval into an interval hash table at a location corresponding to the hash code. The system may further search the interval hash table.

A method, system and non-transitory computer readable instructions for data change detection includes decrypting encrypted patch data that includes compressed variable sized patch data chunks. The compressed variable sized patch data chunks are decompressed and a strong hash value is generated. The strong hash values are compared with strong hash values of corresponding variable sized application data chunks to determine a potentially non-referable patch data chunk. A bloom filter is generated for the variable sized application data chunks. A rolling hash value for a window of the potentially non-referable patch data chunk is used to determine a potentially referable area from the potentially non-referable patch data chunk. The potentially referable area is designated as referable when a weak hash and a strong hash of an application data chunk matches the weak hash and the strong hash of the potentially referable area.

An example operation may include one or more of obtaining data of a simulation, identifying checkpoints within the simulation data, generating a plurality of sequential data structures based on the identified checkpoints, where each data structure identifies an evolving state of the simulation with respect to a previous data structure among the sequential data structures, and transmitting the generated sequential data structures to nodes of a blockchain network for inclusion in one or more data blocks within a hash-linked chain of data blocks.

The invention discloses a multi-window leakage processing method and device and a computer readable storage medium, and the method comprises the steps: obtaining a process number of an application when the application applies to display a window; obtaining application times corresponding to the application in preset hash data according to the process number; judging whether the application frequency is greater than a preset value or not; if the number of times of application is larger than the preset value, a process corresponding to the application is killed, and if the number of times of application is smaller than the preset value, 1 is added to the number of times of application in the hash data. According to the technical scheme, an efficient memory leak processing scheme applying multiple windows is achieved, window creation is effectively controlled through clear and simple logic condition judgment, the jamming phenomenon is avoided, the fluency of a system is improved, and the use experience of a user is enhanced.

In some examples, a computing device creates an event log when an event occurs. If the event log includes a path comprising one or more components, the computing device may determine a hash, using a hash function and a salt, for each of the components and substitute each component in the path with an index to the hash stored in a dictionary. In this way, the computing device replaces each component of the path with an index to a hash in the dictionary to create a modified path. The resulting modified path can be traversed and searched. For example, a search term may be hashed using the hash function and salt, and the dictionary associated with the logs searched for a match. In this way, a particular file name or a particular folder name can be identified in the modified path.

A method may include: receiving, by a smart contract, a request for a random number and a randomness seed from a user; deploying the request as a transaction that is written on a first block in the decentralized ledger; generating, by an oracle, a plurality of pseudorandom quantum circuits using the randomness seed; providing the plurality of pseudorandom quantum circuits to a quantum randomness source, wherein the quantum randomness source executes the quantum circuits and returns a sequence of random bits to the oracle; writing the sequence of random bits to a new block in the decentralized ledger; hashing the sequence of random bits and a block hash for the new block; and returning the hash of the sequence of random bits and the block hash to the user computer program, wherein the user consumes hash of the sequence of random bits and the block hash.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for processing encrypted and hashed versions of raw data. One of the methods includes receiving, by a system, a message that comprises an encrypted version of raw data and a hash of the raw data; determining, using the hash of the raw data, a first location in a hash map; inserting the encrypted version of the raw data to the first location in the hash map; determining to transmit, to another system, data for a second location in the hash map; selecting, using the second location, at least a subset of the data for the second location in the hash map; and transmitting, to the other system, the subset of the data for the second location in the hash map.

A method includes searching for data contained in a structured data structure. The method includes receiving a query. The query includes a structured data structure path and a first element related to the structured data structure path. One or more patterns are created comprising at least a portion of the structured data structure path and one or more elements related to the first element. For each of the one or more patterns, a hash is created. The created hashes are looked-up in a hash index to identify one or more structured data structures correlated to the hashes. The one or more structured data structures are identified to a user.

According to one aspect of the present invention, a system-implemented (e.g., computer-implemented) method for generating a hash set representing known good state sequences includes determining a priori all known good state sequences of a system. Effective paths for the determined sequence of known good states are enumerated by constructing aggregated hashes containing history representing states along these paths, whereby the resulting set of hashes represents all effective states when the system traverses the known good sequence. An aggregated hash containing a history is stored. A state advance call is received from the system, and in response to receiving the call, the stored aggregated hash containing the history is sent to the system.

The present application relates to a data processing method, device, computer equipment and storage medium. The method collects the data to be processed, extracts the key value from the data to be processed, uses the set hash rule to hash the key value, obtains the corresponding target hash value, and maps the target hash value to the pre-set hash value. The corresponding bit in the created bit array, if there is no data in the corresponding bit in the bit array, it means that the data to be processed is new data, so the data to be processed is processed according to the data processing request of the business system, and the processing is returned to the business system The target data obtained after processing the data is processed, because only the new data is processed, thus solving the problem of unreliable calculation results of stream processing due to data duplication.

Methods, apparatus, and software for hashing data. The methods and apparatus employ novel improvements to hash algorithms, such as a SHA-2 hash algorithm to reduce computations and increase performance. In one aspect, calculation of SHA-2 message scheduling and SHA compression operations are separated under which an SHA-2 message schedule is applied to multiple rounds of SHA compression operations over multiple chunks of data for the data item being hashed. In another aspect, the SHA-2 message schedule is implemented such that message schedules for multiple message words or data blocks are performed in parallel. The approaches may be employed to reduce hash calculations for various purposes, including generating Filecoin nodes.

A method of providing a hash value for a piece of data is disclosed, wherein the hash value specifies a time stamp for the piece of data when verified, for limiting the risk of collisions between the hash values. The method includes collecting one or more root timestamps for the root of a hash tree structure defining a hash function, where the root timestamp is a root timestamp from the past, determining whether a nonce value can be received from the server, and when the nonce value cannot be received from the server When a nonce is received, a hash value is provided by a hash function of the piece of data and the root timestamp, or when a nonce is successfully received from the server, by the nonce, the piece of data and the root timestamp A hash function of the root timestamp described above is used to provide the hash value. An electronic device and a computer program are also disclosed.

Systems, devices, and methods discussed herein are directed to modifying aspects of a compute instance. A user may request a change to the compute instance. The system may derive a state object indicating a future state of the compute instance were the change to be applied. A hash of a subset of the state object's attributes may be computed and provided to the requesting computing component. The system may subsequently proceed with applying the change. A current state object indicating a current state of the compute instance may be derived based on applying the change. An additional hash of the subset of the current state object's attributes may be computed and provided to the requesting computing component. The two hashes may be configured to enable the requesting computing component to verify the change to the compute instance has been implemented.

Method for searching an item using a parametric hash filter includes forming an input vector from input data stream; forming a hash matrix having a first portion and a second portion; multiplying the hash matrix with the input vector to generate a second input vector including a hash values of the first input vector; generating a perfect hash vector and a universal hash vector, by applying a smooth periodic function to the second input vector; mapping onto a Markov random field the coordinates of locations of hash values in a search domain for which there is no possibility of collisions in the perfect hash vector to form an energy function; minimizing the energy function to generate a compressed hash table; fitting a band of acceptable locations in the compressed hash table, based on a predetermined false positive rate; and searching for a new item in the band of acceptable locations.

Systems, methods and products for enabling parallelized verification of a forensic copy generated using a non-parallelizable hashing algorithm. Disclosed embodiments generate the forensic copy of a data source using a non-parallelizable algorithm. In addition to generating a hash of the source data, intermediate hash states are stored for successive blocks of data from the data source. During verification of the forensic copy, the intermediate hash states and identifiers of the data blocks are retrieved from a data structure that is saved with the forensic copy. The non-parallelizable algorithm is used to hash each data block using the intermediate hash state preceding the data block as a starting hash state, then the hash of the data block is compared to the intermediate hash state following the data block to verify the data block. If all data blocks are successfully verified, the forensic copy is verified, otherwise verification fails.