21 results about "Hash list" patented technology

The invention discloses an electronic archive intelligent retrieval method and system based on a block chain, and relates to the technical field of archive retrieval, and the method comprises the steps: extracting text features of an electronic archive, and generating metadata; generating a content hash value from the electronic file original text; writing the metadata, the content hash value and the ABE access strategy into the block chain smart contract; constructing a reverse index based on the metadata semantic tag, wherein an index entry is associated with a block chain storage address; calculating a root hash and anchoring the root hash to the block chain; analyzing a keyword and a digital identity certificate in the user retrieval request; calling an intelligent contract to verify whether the user attribute accords with the ABE access strategy of the target file; retrieving an encrypted hash list matched with the file in the distributed index; acquiring the encrypted file fragments from the distributed storage system; verifying data integrity; and combining the fragments to generate a final retrieval result. The method has the advantages that through deep coupling of the block chain and attribute encryption, an electronic archive management system considering security and intelligent retrieval is constructed.

An endpoint node of a multiple node environment includes a storage and a processor. The storage stores a public key for an owner of the endpoint node and a hash list. The processor receives, from a requestor node, a request including a work order for an operation to be performed in the endpoint node. In response to reception of the request, the processor determines whether the requestor node is authorized to provide the work order for the operation to be performed. In response to the requestor node not being authorized, the processor provides a prove authentication request. The processor further receives the requested authorization data. Based on the request authorization data, the processor performs the operation in the work order of the request.

The present application belongs to the field of data storage, and relates to a space arrangement method for distributed object storage. The method comprises: acquiring, as source objects, aggregation large objects meeting a hole ratio requirement, and inserting, into a hash list, source objects, fragment spaces of which meet a hole minimum threshold; selecting, from the hash list, the source objects having the highest fragment rate to undergo space arrangement, creating a target aggregation large object on the basis of requirements and using the target aggregation large object as a target object; generating a target object mapping relationship table; migrating data of small objects on the source objects to the target object on the basis of the target object mapping relationship table; after migration is successful, updating layout information corresponding to metadata of the small objects themselves; and executing a cleaning operation, so as to end the task. In the method of the present application, by means of migrating undeleted small objects from original large objects onto a new empty large object, the fragmentation and waste of a storage space are effectively reduced, thereby better improving the utilization rate of the storage space.

This application discloses an information storage method, device, and medium based on a blockchain distributed hash list, which is used to solve the technical problems in the prior art of high personal information storage costs and inability to store personal information according to user needs. The method includes: dividing personal information into several information domains based on the data type of each data in the personal information corresponding to the user node; determining different target nodes for storing the several information domains based on a preset routing algorithm; storing the several information domains with user node identifiers in the distributed hash list of the corresponding target node and determining the corresponding location information; determining the shortest path to the corresponding target node based on the distance between the user node and several next nodes, and determining the return path of the location information; sending the location information corresponding to the several information domains with identifiers to the user node based on the return path, and storing it in the distributed hash list corresponding to the user node, thereby reducing the cost of information storage.

The invention provides a key value cache scheduling method and system for language model inference, and is applied to the technical field of video memory management and key value cache multiplexing of a large-scale language model inference engine. The method comprises the following steps: acquiring an input sequence, extracting a candidate multiplexing fragment, calculating a fragment hash value of the candidate multiplexing fragment, querying a corresponding historical logic block hash list in a fragment index table, and generating a current logic block hash list for the fragment in a pre-filling process, mapping the Hash of the current logic block to the physical address of the historical physical key value cache block through a prefix Hash table to realize logic Hash alias, and scheduling key value cache data in an underlying video memory to participate in autoregressive decoding according to the logic Hash alias; by means of the scheme, prefix tree matching limitation can be broken through, zero-copy cross-context multiplexing of semantic fragments at any position is achieved, pre-filling calculation redundancy and first word delay are remarkably reduced, and GPU video memory utilization efficiency and reasoning throughput under a multi-agent concurrent scene are improved.

The invention belongs to the technical field of geological exploration, and discloses a fast access method and device for super-large first arrival data, electronic equipment and a medium, and the method comprises a file adaptive segmentation process, a multi-core multi-thread reading process, a dual hash list establishment process and a data access process. Reading of first arrival data is completed in a mode of combining file self-adaptive segmentation, multi-thread reading and writing and a hash list; according to the data access method, the index corresponding to the keyword is positioned through the keyword, so that the first-arrival information of the keyword is quickly accessed and read to obtain the first-arrival data, and the quick access of the super-large first-arrival data is realized. According to the method, the problems of low speed, low retrieval efficiency, memory overflow, software jamming and the like in conventional software access are solved, and the access and quality control efficiency of the super-large first arrival data is improved. The method is suitable for quick access of the super-large first arrival data.

The present application belongs to the field of data storage, and relates to a space arrangement method for distributed object storage. The method comprises: acquiring, as source objects, aggregation large objects meeting a hole ratio requirement, and inserting, into a hash list, source objects, fragment spaces of which meet a hole minimum threshold; selecting, from the hash list, the source objects having the highest fragment rate to undergo space arrangement, creating a target aggregation large object on the basis of requirements and using the target aggregation large object as a target object; generating a target object mapping relationship table; migrating data of small objects on the source objects to the target object on the basis of the target object mapping relationship table; after migration is successful, updating layout information corresponding to metadata of the small objects themselves; and executing a cleaning operation, so as to end the task. In the method of the present application, by means of migrating undeleted small objects from original large objects onto a new empty large object, the fragmentation and waste of a storage space are effectively reduced, thereby better improving the utilization rate of the storage space.

A computing device includes at least one processor configured to determine a retrieved secret share from each of at least two secret share storage devices or media that are retrieved from at least two of a plurality of shareholders. The at least one processor is also configured to determine whether each respective retrieved secret share is one of the plurality of secret shares that were generated based on whether the respective hash of the respective retrieved secret share matches any hash in the list of hashes of the plurality of secret shares within the metadata. The at least one processor is also configured to, in response to determining that each retrieved secret share is among the plurality of secret shares that were generated, attempt to reconstitute a secret using retrieved secret shares from the at least two secret share storage devices or media.

The invention discloses an electronic invoice processing method and device, a medium and a product. Relates to the technical field of block chains, can be applied to the technical field of finance, and comprises the following steps: a business unit node submits a transaction hash value corresponding to transaction original text data, an uplink data abstract and a compliance proof to an uplink based on a transaction aggregation contract; in response to an electronic invoice issuing request of a requesting customer, the operation node determines a to-be-issued transaction hash list associated with the requesting customer, and calls an invoice generation contract to verify the transaction hash list; and if the verification is passed, generating an electronic invoice identifier and creating an invoice object to trigger an invoicing event, so that the operation node performs invoicing request generation and signature to generate a transaction request and submit the transaction request to a preset electronic invoice service platform for invoicing. According to the technical scheme of the invention, unified issuing of electronic invoices can be carried out while the security of transaction data is ensured, and safe, efficient and credible business electronic invoice management is realized.

The invention relates to the technical field of virtualization frameworks, in particular to a customized component sharing method and electronic equipment. According to the scheme, the method comprises the steps that a virtual machine is started in an Android system, and a small Android system is loaded in the virtual machine; calculating a hash value of each file of the customized component to generate a hash list, and performing digital signature operation on the hash list; starting a server application in the Android system, and enabling the server application to monitor a connection request from the small Android system; starting an authentication file system in the small Android system, sending a connection request to a server application of the Android system through the authentication file system to establish connection, and after the connection is successful, obtaining the hash list and each file of the customized component through the server application; and verifying the digital signature of the obtained Hash list through an authentication file system, and installing the Hash list and the customized component in the small Android system after the verification is passed. According to the method, the complexity and the cost of system maintenance are remarkably reduced.

The application discloses a kind of based on blockchain electronic archives intelligent retrieval method and system, it is related to the technical field of archives retrieval, including: extracting the text features of electronic archives, generating metadata;Electronic archives original text generates content hash value;Metadata, content hash value and ABE access policy are written into blockchain smart contract;Based on metadata semantic label construction inverted index, index item is associated with blockchain storage address;Root hash is calculated and anchored to blockchain;Resolve keyword and digital identity credentials in user search request;Call smart contract to verify whether user attributes meet the ABE access policy of target archives;Retrieve the encrypted hash list of matching archives in distributed index;From distributed storage system, obtain encrypted archives fragment;Verify data integrity;Combine fragment, generate final search result.The application has the advantages that: through the deep coupling of blockchain and attribute encryption, an electronic archives management system that takes into account security and intelligent retrieval is constructed.

Disclosed are a consensus method and device, and a blockchain system. A primary node directly broadcasts a transaction hash list including a hash value of at least one unverified transaction in the system, so that a backup node and the primary node simultaneously verify the at least one unverified transaction, and the backup node stores a first verification result obtained by verification and a first hash value of the at least one unverified transaction. The primary node broadcasts an obtained second verification result and a second hash value of the at least one unverified transaction in a pre-preparation message after completing the verification, so that the backup node searches for the first verification result based on the second hash value, and broadcast a preparation message when the second verification result is the same as the searched first verification result, to enter a subsequent consensus stage, and complete the consensus processing.

The application provides a dangerous source information management method, and belongs to the field of safety management. The method sets a global dangerous source HASH list, and saves and manages dangerous source information based on a published state machine and a block chain; each publication generates a state of a target dangerous source, the data of the target dangerous source in the state is saved into a current block, then the HASH of the target dangerous source is recalculated and the global dangerous source HASH list is updated, and the state conversion of the target dangerous source is completed; each publication is recorded in the current block, and when the number of publications exceeds a threshold value, a new block is created. The application can truly realize a user anonymous mechanism, while ensuring that an anonymous user can track the dangerous source state filled by the user in real time, and ensuring a full-cycle and tamper-proof risk evaluation record. In addition, when a dangerous source under continuous monitoring reinitiates dangerous source identification, the problem of data conflict caused by dangerous source version upgrade is solved.

The invention discloses a prediction synchronization method and device for a block chain global pre-assembled block, and the method comprises the steps: generating a transaction hash list through a node, generating an identifier of the transaction hash list, and storing a key value pair composed of the identifier and a node I into a distributed hash table network; wherein the identifier is a hash value of the transaction hash list; periodically broadcasting the identifier which appears most frequently in the DHT network, and determining whether the pre-assembled block body is correct or not by the node based on the identifier which appears most frequently and the identifier generated by the node; under the condition that the identifier with the highest occurrence frequency is different from the identifier generated by the node, the node queries the node I P with the identifier with the highest occurrence frequency, obtains a correct transaction list and corrects the local pre-assembled block body; and after the local pre-assembled block body is corrected, re-storing a key value pair formed by the identifier of the corrected node and the node IP into the DHT network to realize global synchronization. According to the method, the prediction accuracy of the pre-assembled block can be improved.

Embodiments of the present application disclose a mirror distribution method, device and system in a network element cluster. The method comprises: separating a mirror file, sending a hash list of each mirror block to all edge nodes for separate maintenance; distributing all mirror blocks to multiple different edge nodes; analyzing a received mirror transmission request for a hash list carried by the mirror transmission request, finding out a set of edge nodes that have corresponding mirror blocks for each hash value in the hash list, determining an edge node with minimum network delay according to network quality of the edge nodes in the set monitored dynamically, forwarding the mirror transmission request to the edge node for transmission of the corresponding mirror block, and updating mirror block information owned by each edge node after the transmission is completed. The present application utilizes bandwidth of each edge node to transmit the mirror, improves mirror download speed, reduces transmission time, improves scalability of mirror distribution, and ensures reliability and success rate of mirror transmission.

The present invention relates to a method for reorganizing a distributed object storage space, belonging to the field of data storage. The method includes: obtaining an aggregated large object that meets the hole rate requirement as a source object, and inserting the source object whose fragmented space meets the minimum hole threshold into a hash list; selecting the source object with the highest fragmentation rate from the hash list for space reorganization, and creating a target aggregated large object as a target object according to requirements; generating a target object mapping relationship table; migrating the small object data on the source object to the target object according to the target object mapping relationship table; after the migration is successful, updating the layout information corresponding to the metadata of the small object itself; and performing a cleaning operation to end the task. The method of the present invention effectively reduces the fragmentation and waste of the storage space and better improves the storage space utilization rate by migrating the undeleted small objects from the original large object to a new empty large object.

The invention discloses a physical question solution visual generation method and system based on natural language processing, and aims to solve the problems of abstraction and poor interactivity of traditional physical learning. The method comprises the following steps: 1, performing multi-modal analysis on a topic text / formula / screenshot, verifying and correcting an entity position by REL, and extracting physical elements by NLP; 2, constructing a parameterized model through field mapping, attribute standardization and constraint management; 3, performing scene difference processing on multiple question surfaces, and performing physical engine and time step combined stable simulation; 4, rendering a dynamic scene and supporting parameter adjustment; and 5, generating an offline package and a hash list. The system comprises a multi-modal analysis module, a scene modeling module, a physical engine module and the like. According to the method, abstract questions are converted into interactive scenes, the understanding threshold is reduced, the learning initiative and the question solving accuracy are improved, teaching and autonomous learning scenes are adapted, and the computing power deployment cost is reduced.

This invention discloses a method for pairing quantum keys and quantum ciphertext data packets. A first terminal assembles identification information into the front end of each quantum ciphertext data packet, and the front end of the quantum key corresponding to all quantum ciphertext data packets is assembled with the same identification information. A second terminal establishes a hash list, storing the assembled quantum ciphertext data packets and quantum keys in the hash list using the identification information, and then performs pairing and decryption. This invention improves the efficiency of pairing and decryption by adding an entry code (RID) and a message sequence number (MsgID) before transmitting the quantum ciphertext data packets and quantum keys, and then classifying and storing them in the hash list according to the message sequence number (MsgID). By finding quantum ciphertext data packets and quantum keys with the same entry code (RID) and message sequence number (MsgID) at the first terminal, pairing and quantum decryption are performed, saving a significant amount of reading time.

This invention relates to the field of artificial intelligence technology and can be applied to business system platforms in fields such as healthcare and fintech. It discloses a data anomaly identification method, apparatus, computer equipment, and storage medium. The method involves acquiring data to be identified input from a client, calculating the hash value of each data unit in the data, and generating a hash list of the data based on these hash values. A Merkle tree of the data is constructed based on the hash list, and the Merkle root is calculated from the Merkle tree and written to a blockchain. A first anomaly identification result is generated based on an on-chain anomaly identification strategy. A second anomaly identification result is generated based on a pre-trained data anomaly identification model. The first and second anomaly identification results are then fused to generate a comprehensive anomaly identification result, which is returned to the client. This enables efficient and accurate data anomaly identification.

Systems and methods for presenting forensic data in a forensic data review user interface and for generating reference hash sets are provided. The method includes receiving a selection via the forensic data review user interface to display a forensic data collection; in response to receiving the selection, hashing at least one forensic data item in the forensic data collection to generate a hash value; determining that the hash value matches a reference hash value in at least one reference hash set; varying a default display property of the at least one forensic data item according to a presentation rule encoded in the reference hash set and associated with the reference hash value to obtain a varied display property; and displaying the forensic data collection in the forensic data review user interface including the at least one forensic data item according to the varied display property.

This application provides a method, apparatus, device, and medium for attribute notification in an IPTV system, relating to the field of IPTV technology, to address the problem of low efficiency in obtaining attribute information by applications in existing IPTV systems. The method includes: creating a file descriptor under ` / dev / socket / ` through an init process to create a first socket; establishing connections with multiple application terminals through the first socket; when the init process receives an attribute change request for a target attribute, modifying the attribute value of the target attribute in the IPTV system, and querying a pre-stored hash list to see if the target attribute exists; wherein the hash list includes multiple attributes and the socket associated with each attribute; if it exists, notifying the target application terminal that the target attribute has changed through the target socket associated with the target attribute. This method only notifies the application terminal when the attribute changes, thereby improving the efficiency of applications obtaining attribute information.