CN114756627B - Alliance-chain-based digital asset processing method, system and storage medium - Google Patents
Alliance-chain-based digital asset processing method, system and storage medium Download PDFInfo
- Publication number
- CN114756627B CN114756627B CN202210658802.6A CN202210658802A CN114756627B CN 114756627 B CN114756627 B CN 114756627B CN 202210658802 A CN202210658802 A CN 202210658802A CN 114756627 B CN114756627 B CN 114756627B
- Authority
- CN
- China
- Prior art keywords
- hash value
- file
- digital asset
- target file
- perceptual
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2272—Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Computational Linguistics (AREA)
- Computing Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to a digital asset processing method, a system and a storage medium based on a alliance chain, wherein a hash algorithm interface is returned to a terminal by responding to a request message initiated by the terminal; acquiring a first identifier returned by a terminal after calling a hash algorithm interface, wherein the first identifier is obtained by splicing a first file hash value and a first perception hash value; the method comprises the steps of searching a digital asset index library, judging whether a second file hash value identical to a first file hash value exists or not, determining a second perception hash value with the highest similarity to the first perception hash value under the condition that the second file hash value identical to the first file hash value does not exist in the digital asset index library, constructing a non-homogeneous certified intelligent contract corresponding to a target file under the condition that the reference similarity is lower than a preset threshold or a first instruction is received, operating the non-homogeneous certified intelligent contract to realize casting of the digital asset, and solving the problem that the digital asset cannot be effectively screened.
Description
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a method, a system, and a storage medium for processing digital assets based on a federation chain.
Background
NFT (Non fungal Token, Non-homogeneous certification) uses blockchain technology to enable ownership of digital assets. Generally, the digital assets corresponding to the NFT are stored in a separate server or a decentralized storage System, such as an InterPlanetary File System (IPFS). A separate server or decentralized storage system may generate an Identifier for the digital asset, where the Identifier is stored in a URI (Uniform Resource Identifier) in the NFT intelligent Contract, and when the intelligent Contract is deployed in a federation chain platform, a unique Contract Address (contact Address) may be generated, and the user may implement the casting of the digital asset NFT by invoking the execution of the intelligent Contract. Each NFT generates a token id as its unique and non-divisible identity, wherein the contract address of the smart contract and the token id together form the unique identifier of the non-homogeneous document NFT in this federation chain platform.
Although the digital assets uniquely represented can be found by the unique identifiers (contract address and token id), the unique identifiers do not reflect the characteristics of the digital assets themselves, and thus it is difficult to distinguish the same or similar digital assets by their unique identifiers. Especially, for digital assets formed by original and valuable digital works such as pictures, audio, video and the like, a large amount of repetition or similarity exists inevitably, which not only causes waste of storage resources, but also infringes ownership to be realized by the digital assets NFT.
Aiming at the problem that the digital assets cannot be effectively screened in the related technology, no effective solution is provided at present.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a federation chain-based digital asset processing method, system, and storage medium capable of efficiently discriminating digital assets.
In a first aspect, the present application provides a method for processing digital assets based on a federation chain, which is applied to a federation chain platform, and the method includes:
responding to a request message initiated by a terminal, and returning a hash algorithm interface to the terminal, wherein the hash algorithm interface is configured to calculate a first file hash value and a first perception hash value of a target file;
acquiring a first identifier returned by the terminal after calling the hash algorithm interface, wherein the first identifier is obtained by splicing the first file hash value and the first perception hash value;
retrieving a digital asset index library established on the alliance link platform, judging whether a second file hash value identical to the first file hash value exists or not, determining a second perception hash value with the highest similarity to the first perception hash value under the condition that the second file hash value identical to the first file hash value does not exist in the digital asset index library, and taking the similarity between the second perception hash value and the first perception hash value as reference similarity;
and in the case that the reference similarity is lower than a preset threshold or a first instruction is received, constructing a non-homogenization certification intelligent contract corresponding to the target file, and running the non-homogenization certification intelligent contract to realize casting of the digital assets.
In some of these embodiments, the second file hash value is stored in the digital asset index repository in a hash table structure, the hash table comprising at least one key-value pair, the key in each key-value pair being used to store a sequence index, the value in each key-value pair being used to store the second file hash value.
In some embodiments, determining whether a second file hash value identical to the first file hash value exists comprises:
and traversing and accessing data stored in the hash table, and comparing the hash value of the first file with the value in the traversed key value pair.
In some embodiments, the second perceptual hash values are stored in the digital asset index repository in a merkel tree structure, where the hash value stored in each parent node is obtained by concatenating the hash values stored in its two child nodes, and the lowest node stores the second perceptual hash value of the corresponding digital asset.
In some embodiments, determining the second perceptual hash value having the highest similarity to the first perceptual hash value comprises:
accessing the data stored in the Mercker tree in the order from top to bottom starting from the root node, and circularly executing the following steps in the accessing process until the lowest node is accessed:
step S1, comparing the second perceptual hash value with a left child node and a right child node under a parent node which is accessed currently, and determining a target node which is similar to the second perceptual hash value in the left child node and the right child node;
and step S2, taking the target node as a father node to be accessed in the next stage.
In some embodiments, in a case where there is no second file hash value identical to the first file hash value in the digital asset index repository, and the reference similarity is lower than a preset threshold or the first instruction is received, the method further includes:
storing the first file hash value and the first perceptual hash value into the digital asset index repository.
In some of these embodiments, retrieving the index repository of digital assets that have been published at the federation chain platform comprises:
running a first intelligent contract to implement the retrieval function of the digital asset index repository, wherein the digital asset index repository is created according to the first intelligent contract.
In some of these embodiments, the method further comprises:
under the condition that the second file hash value identical to the first file hash value exists in the digital asset index library, generating prompt information of the digital asset identical to the target file, and refusing to generate the digital asset of the target file; alternatively, the first and second electrodes may be,
under the condition that the reference similarity is judged to be not lower than a preset threshold value, generating prompt information of digital assets with higher similarity to the target file, and refusing to generate the digital assets of the target file; alternatively, the first and second liquid crystal display panels may be,
and under the condition of receiving a second instruction, generating prompt information of the digital assets with higher similarity to the target file, and refusing to generate the digital assets of the target file.
In a second aspect, the present application provides a method for processing digital assets based on a federation chain, applied to a terminal, the method including:
initiating a request message to a alliance chain platform, acquiring a hash algorithm interface returned by the alliance chain platform after responding to the request message, and calling the hash algorithm interface to calculate a first file hash value and a first perception hash value of a target file;
splicing the first file hash value and the first perception hash value to obtain a first identifier of the target file, and sending the first identifier to the alliance link platform;
acquiring a response result returned by the alliance chain platform after responding to the first identifier, and determining that the digital asset corresponding to the target file is successfully cast in the alliance chain platform under the condition that the response result comprises a second identifier of the target file, wherein the second identifier carries the first identifier and information of a storage address of the digital asset corresponding to the target file;
the alliance link platform is configured to be capable of retrieving an issued digital asset index library after receiving the first identifier, judging whether a second file hash value identical to the first file hash value exists or not, determining a second perceptual hash value with the highest similarity to the first perceptual hash value under the condition that the second file hash value identical to the first file hash value does not exist in the digital asset index library, taking the similarity of the second perceptual hash value and the first perceptual hash value as a reference similarity, constructing a non-homogeneous evidence-based intelligent contract corresponding to the target file under the condition that the reference similarity is lower than a preset threshold or a first instruction is received, and running the non-homogeneous evidence-based intelligent contract to cast the digital asset.
In some embodiments, invoking the hash algorithm interface to calculate the first file hash value and the first perceptual hash value of the target file comprises:
dividing the target file to obtain block specification information, and generating the first file hash value according to the block specification information;
extracting image features of the target file, and generating the first perceptual hash value according to the image features; or extracting the audio feature of the target file, and generating the first perceptual hash value according to the audio feature.
In a third aspect, the present application provides a digital asset processing system, including a federation chain platform and a terminal, where the federation chain platform is communicatively connected to the terminal, the federation chain platform is configured to perform the steps of the method according to the first aspect, and the terminal is configured to perform the steps of the method according to the second aspect.
In a fourth aspect, the present application provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method of the first or second aspect described above.
According to the digital asset processing method, the digital asset processing system and the storage medium based on the alliance chain, a hash algorithm interface is returned to the terminal by responding to a request message initiated by the terminal on the alliance chain platform side, and the hash algorithm interface is configured to calculate a first file hash value and a first perception hash value of a target file; acquiring a first identifier returned by a terminal after calling a hash algorithm interface, wherein the first identifier is obtained by splicing a first file hash value and a first perception hash value; retrieving a digital asset index library published on a alliance chain platform, judging whether a second file hash value identical to the first file hash value exists or not, and determining the similarity of a second perception hash value most similar to the first perception hash value under the condition that the second file hash value identical to the first file hash value does not exist in the digital asset index library; under the condition that the similarity is lower than a preset threshold or a first instruction is received, a non-homogeneous accreditation intelligent contract corresponding to the target file is constructed, and the non-homogeneous accreditation intelligent contract is operated to realize casting of the digital assets, so that the problem that the digital assets cannot be effectively screened in the related technology is solved, and the beneficial effect of efficiently screening the digital assets is realized.
Drawings
FIG. 1 is a diagram of an application environment of a federation chain-based digital asset processing method in one embodiment;
FIG. 2 is a flow diagram of a federation chain-based digital asset processing method in one embodiment;
FIG. 3 is a diagram illustrating a data storage structure for a hash value of a second file in an embodiment;
FIG. 4 is a diagram illustrating a data storage structure for a second perceptual hash value in one embodiment;
FIG. 5 is a flow diagram of a federation chain-based digital asset processing method of one embodiment;
FIG. 6 is a flow diagram that illustrates data interaction between a federation chain platform and a terminal, under an embodiment;
FIG. 7 is a diagram that illustrates the architecture of the federation chain platform, under an embodiment;
FIG. 8 is an internal structural diagram of a node device in one embodiment;
fig. 9 is an internal structural view of a terminal in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of and not restrictive on the broad application.
The alliance chain-based digital asset processing method provided by the embodiment of the application can be applied to the application environment shown in fig. 1. The terminal communicates with the alliance link platform through a network. The terminal can be but is not limited to various personal computers, notebook computers, smart phones, tablet computers and portable wearable devices, and the portable wearable devices can be smart watches, smart bracelets, head-mounted devices and the like. The alliance chain platform is formed by connecting a plurality of node devices through a point-to-point network, the alliance chain platform is formed by determining the accounting right through a Byzantine fault-tolerant consensus algorithm by a preset number of node devices, and compared with a public block chain platform, the digital asset processing efficiency on the alliance chain platform is higher.
In one embodiment, as shown in fig. 2, there is provided a flowchart of a federation chain-based digital asset processing method applied to a federation chain platform, the flowchart including the steps of:
step S201, responding to a request message initiated by a terminal, and returning a hash algorithm interface to the terminal, wherein the hash algorithm interface is configured to calculate a first file hash value and a first perception hash value of a target file.
The request message is used for applying for issuing a digital asset corresponding to the target file to the alliance chain platform, the alliance chain platform is provided with a hash algorithm service, the terminal can execute a hash calculation task through a hash algorithm interface which provides the hash algorithm service to the terminal, and a first file hash value and a first perception hash value are obtained.
The target file comprises multimedia material of one or more items of characters, pictures, audios and videos.
The first file hash value refers to a hash value generated without considering the contents of the target file, and only attachment attributes such as author, name, art type, publication date, data occupation, and the like are considered. The first perceptual hash value refers to a hash value generated in consideration of the content of the target file, for example, in consideration of image characteristics such as color, hue, texture, shading, gradation, saturation, and the like, for example, in consideration of audio characteristics such as tone, timbre, frequency, and the like.
Step S202, a first identifier returned after the terminal calls the hash algorithm interface is obtained, and the first identifier is obtained by splicing a first file hash value and a first perception hash value.
The first identifier may be obtained by directly combining the first file hash value and the first perceptual hash value, or may be obtained by performing hash calculation on a value obtained by combining the first file hash value and the first perceptual hash value. Illustratively, assuming that the first file hash value is Ha and the first perceptual hash value is Hb, the first identifier may be Ha + Hb or H (Ha + Hb).
The related art usually uses the file hash value as the file identity, but for the files of picture and video types, the file hash value is not enough to distinguish two similar files, that is, two files with different file hash values, and there may be a similar situation, and the similar files may infringe ownership to be guaranteed by a certain digital asset, so that the alliance chain platform cannot provide protection for the digital asset. The perceptual hash value can make up for the defect of the file hash value, and the unique representativeness of the first identifier can be ensured by splicing the first file hash value and the first perceptual hash value.
Step S203, retrieving the digital asset index library released on the alliance link platform, judging whether a second file hash value identical to the first file hash value exists, determining a second perception hash value with the highest similarity to the first perception hash value under the condition that the second file hash value identical to the first file hash value does not exist in the digital asset index library, and taking the similarity between the second perception hash value and the first perception hash value as reference similarity.
And a digital asset index library is deployed in the alliance chain platform and used for storing a second file hash value and a second perception hash value, wherein the second file hash value and the second perception hash value are both the hash values of the issued and cast digital assets. In addition, a digital asset library is also deployed in the alliance chain platform and used for storing digital assets. It should be noted that digital collections, digital certificates created by NFT technology, and the like are all included in the digital assets described in the present application.
The retrieval result of the file hash value only needs to compare whether the whole numerical value is consistent, and on the premise of ignoring hash collision, if the two numerical values are inconsistent, the two files can be considered to be different, otherwise, the two files can be considered to be the same. The search result of the perceptual hash value needs to be the same or different according to the similarity of the bits in the two values, and the time complexity of the algorithm is high during searching. Therefore, in order to improve the duplicate checking efficiency, the hash value of the second file is searched first, and the second perceptual hash value is searched again under the condition that the hash values of the same files are not different.
And step S204, under the condition that the reference similarity is lower than a preset threshold or a first instruction is received, constructing a non-homogenization certification-oriented intelligent contract corresponding to the target file, and operating the non-homogenization certification-oriented intelligent contract to cast the digital assets.
And the reference similarity is lower than a preset threshold value, which represents that the digital assets similar to the target file do not exist in the alliance chain platform, and the target file is cast into the digital assets without infringing the ownership of a certain digital asset. The preset threshold may be preset. Or, after the reference similarity is judged manually, the first instruction is input to instruct the alliance chain platform to cast the target file into the digital asset.
The alliance chain platform generates a storage address for the digital assets to be issued, generates a second identifier according to the storage address and the first identifier, writes the second identifier into a non-homogeneous accreditation intelligent contract and runs the non-homogeneous accreditation intelligent contract to realize casting of the digital assets.
The federation chain platform also feeds back to the terminal a second identifier that uniquely identifies the digital asset corresponding to the target file and accesses that digital asset in the federation chain platform.
In the above steps S201 to S204, the dual retrieval of the file hash value and the perceptual hash value is performed on the target file through the alliance chain platform, so as to improve the weight-finding degree of the digital asset and the retrieval efficiency of the digital asset index library, and for the digital asset with very high reference similarity, the effective weight-removing of the digital asset is realized, and the infringement judgment efficiency is improved, thereby protecting the copyright of the digital asset.
In addition, the operation load of the alliance chain platform can be reduced by transferring the task of calculating the hash value to the terminal; the identity identifier of the target file in the auditing stage can be ensured to be unique and representative by using the spliced file hash value and the perception hash value as the identity identifier.
In one embodiment, fig. 3 is a schematic diagram illustrating a data storage structure of a second file hash value, where as shown in fig. 3, the second file hash value is stored in a hash table structure in a digital asset index library, the hash table includes at least one key-value pair, a key in each key-value pair is used for storing a sequence index, and a value in each key-value pair is used for storing the second file hash value.
Further, in one embodiment, determining whether there is a second file hash value that is the same as the first file hash value comprises: and traversing and accessing data stored in the hash table, and comparing the hash value of the first file with the value in the traversed key value pair.
By the arrangement, only the hash values of the files need to be compared to be the same, and the retrieval efficiency is improved.
In an embodiment, fig. 4 is a schematic diagram illustrating a data storage structure of a second perceptual hash value, and as shown in fig. 4, the second perceptual hash value is stored in a merkel tree structure in the digital asset index repository, where the hash value stored in each parent node is obtained by concatenating the hash values stored in its two child nodes, and the lowest node stores the second perceptual hash value of the corresponding digital asset.
As an example, only three levels of nodes are shown in the figure, where nodes N1 to N4 store the second perceptual hash value of each digital asset, N5 is obtained by splicing N1 and N2, N6 is obtained by splicing N3 and N4, N7 is obtained by splicing N5 and N6, and the splicing may be obtained by directly combining two hash values or by performing hash calculation on a value obtained by combining two hash values.
Further, in one embodiment, determining the second perceptual hash value having the highest similarity to the first perceptual hash value comprises: accessing the data stored in the Mercker tree in the order from the root node to the top, and circularly executing the following steps in the accessing process until the lowest node is accessed:
step S1, comparing the second perceptual hash value with the left child node and the right child node under the currently accessed father node, and determining a target node which is similar to the second perceptual hash value in the left child node and the right child node; and step S2, taking the target node as a parent node to be accessed in the next stage.
In steps S1 to S2, whether the left side branches are the same or the right side branches are the same is distinguished according to the bits of the perceptual hash value, and the lower node is accessed along one of the left side branches. For example, assuming that the first perceptual hash value is 1100, the perceptual hash value of N5 is 1110, and the perceptual hash value of N6 is 0110, the first perceptual hash value is identical to N5 by 3 bits, and the first perceptual hash value is identical to N6 by 2 bits, it is considered that N5 is relatively similar to the first perceptual hash value, and N5 is used as a target node; taking N5 as a parent node, assuming that the perceptual hash value of N1 is 1101 and the perceptual hash value of N2 is 1001, the first perceptual hash value is consistent with N1 by 3 bits, and the first perceptual hash value is consistent with N2 by 2 bits, then N1 is considered to be more similar to the first perceptual hash value, and at the moment, the bottommost node is visited, and then it is determined that N1 stores the second perceptual hash value which is most similar to the first perceptual hash value.
By the arrangement, the retrieval process can be completed without traversing all nodes, so that the retrieval efficiency is further improved; and the difference comparison requirement of the file characteristic information can be realized.
In one embodiment, the digital asset index repository stores the corresponding hash values in the data storage structures shown in fig. 3 and 4 to optimally save storage space of the federation chain platform.
In one embodiment, in a case that a second file hash value identical to the first file hash value does not exist in the digital asset index repository, and the reference similarity is lower than a preset threshold or a first instruction is received, the method further includes: storing the first file hash value and the first perceptual hash value in a digital asset index repository.
Specifically, the first file hash value is stored in a hash table structure in a digital asset index repository, and a key-value pair may be added, where the key is used to store a sequence index and the value is used to store the first file hash value.
Specifically, a first perception hash value is stored in a digital asset index base in a merkel tree structure, the first perception hash value is stored in the bottommost node, every two adjacent nodes in the bottommost node are combined to obtain a previous layer of nodes, every two adjacent nodes in the previous layer of nodes are combined to obtain a previous layer of nodes, and the steps are repeated until a final root node is obtained through combination, so that the whole merkel tree is updated.
In one embodiment, retrieving the index library of digital assets that have been published on the federation chain platform comprises: the first intelligent contract is run to implement the retrieval function of the digital asset index library, wherein the digital asset index library is created according to the first intelligent contract.
In one embodiment, in the case that the second file hash value identical to the first file hash value is judged to exist in the digital asset index library, prompt information that the digital asset identical to the target file exists is generated, and the digital asset of the target file is rejected from being generated.
In one embodiment, in the case that the reference similarity is judged to be not lower than the preset threshold, prompt information that the digital assets with higher similarity to the target file exist is generated, and the digital assets of the target file are rejected from being generated.
In one embodiment, in the case of receiving the second instruction, prompt information that there is a digital asset with a higher similarity to the target file is generated, and the digital asset of the target file is rejected from being generated.
In one embodiment, as shown in fig. 5, there is further provided another method for processing a digital asset based on a federation chain in a terminal, the method including the following steps:
step S501, a request message is sent to the alliance link platform, a Hash algorithm interface returned by the alliance link platform after responding to the request message is obtained, and the Hash algorithm interface is called to calculate a first file Hash value and a first perception Hash value of the target file.
Step S502, the first file hash value and the first perception hash value are spliced to obtain a first identifier of the target file, and the first identifier is sent to the alliance link platform.
Step S503, obtaining a response result returned by the federation chain platform in response to the first identifier, and determining that the digital asset corresponding to the target file is successfully cast in the federation chain platform when the response result includes a second identifier of the target file, where the second identifier carries the first identifier and information of a storage address of the digital asset corresponding to the target file.
The alliance chain platform is configured to be capable of retrieving an issued digital asset index library after receiving a first identifier, judging whether a second file hash value identical to a first file hash value exists or not, determining a second perception hash value with the highest similarity to the first perception hash value under the condition that the second file hash value identical to the first file hash value does not exist in the digital asset index library, taking the similarity of the second perception hash value and the first perception hash value as a reference similarity, constructing a non-homogeneous certified intelligent contract corresponding to a target file under the condition that the reference similarity is lower than a preset threshold or a first instruction is received, and operating the non-homogeneous certified intelligent contract to realize casting of the digital asset.
In one embodiment, invoking the hash algorithm interface to calculate the first file hash value of the target file comprises: and dividing the target file to obtain block specification information, and generating a first file hash value according to the block specification information. The block Size information indicates the Size of the divided blocks, and the first File hash value includes three types, namely a full File block hash value (WFC), a Fixed Size block hash value (FSC), and a Content Defined block hash value (CDC).
In one embodiment, invoking the hash algorithm interface to calculate the first perceptual hash value of the target file comprises: extracting image characteristics of a target file, and generating a first perception hash value according to the image characteristics; or extracting the audio features of the target file and generating a first perception hash value according to the audio features.
Digital assets like images and videos contain inside their files many pieces of characteristic implicit characteristic information, such as gray scale, saturation, etc. After the image is rotated, cropped, modified, scaled, etc., the image is not identical to the original image, which causes the hash value of the first part of the file to be changed greatly, but the file itself has high similarity. The key step of calculating the perceptual hash is feature extraction, which can be divided into hash based on transformation, hash based on color component and hash based on deep learning according to different feature extraction modes. The Transform-based hash mainly includes Discrete Cosine Transform (DCT), Discrete Fourier Transform (DFT), Discrete Wavelet Transform (DWT), and the like; the hash based on the color component mainly uses information of RGB (Red, Green, Blue), shadow, hue, saturation and the like of the image to generate a unique image hash value; the Hash based on deep learning is to complete the feature extraction of an image by using a deep learning method, and the adopted Network models comprise a Convolutional Neural Network (CNN) and a generation countermeasure Network (GAN).
In combination with the alliance-chain-based digital asset processing method in the foregoing embodiment, there is also provided a digital asset processing system in this embodiment, referring to fig. 1, the system includes: the alliance chain platform is in communication connection with the terminal, the alliance chain platform is used for executing the steps of the alliance chain based digital asset processing method shown in the figure 2, and the terminal is used for executing the steps of the alliance chain based digital asset processing method shown in the figure 5.
The terminal may be, but is not limited to, a user terminal such as a personal computer, a notebook computer, a smart phone, a tablet computer, and a portable wearable device, which may be a smart watch, a smart band, or a head-mounted device.
FIG. 6 is a flowchart of data interaction between a federation link platform and a client, where the flowchart includes the following steps:
step S601, a user side initiates a request message to a alliance chain platform;
step S602, the alliance chain platform responds to the request message and returns a hash algorithm calling interface;
step S603, a user side calls a hash algorithm calling interface, locally calculates a first file hash value and a first perception hash value of a target file, and splices the first file hash value and the first perception hash value into a first identifier;
step S604, the user side sends the first identifier to the alliance chain platform;
step S605, the alliance chain platform carries out double retrieval in the digital asset index database based on the first identifier, and determines whether the same or similar digital assets exist according to the retrieval result;
step S606, under the condition that the same or similar digital assets do not exist in the retrieval result, constructing a non-homogenization certification-compliant intelligent contract and operating the non-homogenization certification-compliant intelligent contract;
step S607, the federation link platform sends the second identifier to the user end.
In one embodiment, in step S606, in the case that the same or similar digital assets exist as a result of the search, the alliance chain platform will reject the digital assets of the casting target file and send a prompt message to the user end.
In an embodiment, fig. 7 is a schematic structural diagram of a federation chain platform, where the federation chain platform is formed by connecting a plurality of node devices through a peer-to-peer network, each node device is connected to a corresponding database, and a digital asset index library and a digital asset library are disposed in the database. In the alliance chain platform, the accounting right is determined by a preset number of node devices through a Byzantine fault-tolerant consensus algorithm, and compared with a public block chain platform, the digital asset processing efficiency on the alliance chain platform is higher.
In one embodiment, a schematic diagram of a node device is shown, where the node device may be a server, and an internal structure diagram of the node device may be as shown in fig. 8. The computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database (memory) of the node device may be used to store the digital asset index value and the digital asset. The network interface of the node device is used for communicating with other external node devices or terminals through network connection. The computer program is executed by a processor to implement a federation chain-based digital asset processing method.
In one embodiment, a terminal is provided, an internal structure of which may be as shown in fig. 9. The terminal comprises a processor, a memory, a communication interface, a display screen and an input device which are connected through a system bus. Wherein the processor of the terminal is configured to provide computing and control capabilities. The memory of the terminal comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The communication interface of the terminal is used for communicating with an external alliance chain platform in a wireless mode, and the wireless mode can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a federation chain-based digital asset processing method. The display screen of the terminal can be a liquid crystal display screen or an electronic ink display screen, and the input device of the terminal can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on a shell of the terminal, an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the configuration shown in fig. 9 is a block diagram of only a portion of the configuration associated with the present application and does not constitute a limitation on the terminal to which the present application is applied, and that a particular terminal may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
Based on the same inventive concept, the present application further provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the federation chain-based digital asset processing method of any one of the above embodiments.
It should be understood that, although the steps in the flowcharts related to the embodiments as described above are sequentially displayed as indicated by arrows, the steps are not necessarily performed sequentially as indicated by the arrows. The steps are not limited to being performed in the exact order illustrated and, unless explicitly stated herein, may be performed in other orders. Moreover, at least a part of the steps in the flowcharts related to the embodiments described above may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the execution order of the steps or stages is not necessarily sequential, but may be rotated or alternated with other steps or at least a part of the steps or stages in other steps.
It should be noted that, the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, presented data, etc.) referred to in the present application are information and data authorized by the user or sufficiently authorized by each party.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, database, or other medium used in the embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high-density embedded nonvolatile Memory, resistive Random Access Memory (ReRAM), Magnetic Random Access Memory (MRAM), Ferroelectric Random Access Memory (FRAM), Phase Change Memory (PCM), graphene Memory, and the like. Volatile Memory can include Random Access Memory (RAM), external cache Memory, and the like. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others. The databases involved in the embodiments provided herein may include at least one of relational and non-relational databases. The non-relational database may include, without limitation, a distributed database based on a federation chain platform, and the like. The processors referred to in the various embodiments provided herein may be, without limitation, general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, or the like.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is specific and detailed, but not construed as limiting the scope of the present application. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present application shall be subject to the appended claims.
Claims (9)
1. A digital asset processing method based on a alliance chain is applied to an alliance chain platform, and is characterized in that the method comprises the following steps:
in response to a request message initiated by a terminal, returning a hash algorithm interface to the terminal, wherein the hash algorithm interface is configured to calculate a first file hash value and a first perceptual hash value of a target file, the first file hash value refers to a hash value generated by considering only the attachment property of the target file without considering the content of the target file, and the first perceptual hash value refers to a hash value generated by considering the content of the target file;
acquiring a first identifier returned by the terminal after calling the hash algorithm interface, wherein the first identifier is obtained by splicing the first file hash value and the first perception hash value;
searching a digital asset index library published on the alliance chain platform, and judging whether a second file hash value identical to the first file hash value exists or not;
under the condition that a second file hash value identical to the first file hash value does not exist in the digital asset index library, determining a second perceptual hash value with the highest similarity to the first perceptual hash value, and taking the similarity between the second perceptual hash value and the first perceptual hash value as reference similarity;
under the condition that the reference similarity is lower than a preset threshold value, constructing a non-homogenization certification intelligent contract corresponding to the target file, and operating the non-homogenization certification intelligent contract to realize casting of the digital assets; or, under the condition that the reference similarity is not lower than the preset threshold, generating prompt information of digital assets with higher similarity to the target file, and refusing to generate the digital assets of the target file.
2. A federation chain-based digital asset processing method as recited in claim 1, wherein the second file hash value is stored in the digital asset index repository in a hash table structure, the hash table comprising at least one key-value pair, the key in each key-value pair being used to store a sequence index and the value in each key-value pair being used to store the second file hash value.
3. A federation chain-based digital asset processing method as recited in claim 2, wherein determining whether there is a second file hash value that is the same as the first file hash value comprises:
and traversing and accessing data stored in the hash table, and comparing the hash value of the first file with the value in the traversed key value pair.
4. A federation chain-based digital asset processing method as claimed in claim 1, wherein the second perceptual hash values are stored in the digital asset index repository in a merkel tree structure, wherein the hash value stored by each parent node is spliced from the hash values stored by its two child nodes, and the lowest node stores the second perceptual hash value of the corresponding digital asset.
5. A federation chain-based digital asset processing method according to claim 1, wherein in the event that there is no second file hash value in the digital asset index repository that is the same as the first file hash value, and the reference similarity is below a preset threshold, the method further comprises:
storing the first file hash value and the first perceptual hash value into the digital asset index repository.
6. A digital asset processing method based on a alliance chain is applied to a terminal, and is characterized in that the method comprises the following steps:
initiating a request message to a alliance chain platform, acquiring a hash algorithm interface returned by the alliance chain platform after responding to the request message, and calling the hash algorithm interface to calculate a first file hash value and a first perception hash value of a target file, wherein the first file hash value is a hash value generated by considering only the attachment attribute of the target file without considering the content of the target file, and the first perception hash value is a hash value generated by considering the content of the target file;
splicing the first file hash value and the first perception hash value to obtain a first identifier of the target file, and sending the first identifier to the alliance link platform;
acquiring a response result returned by the alliance chain platform after responding to the first identifier, and determining that the digital asset corresponding to the target file is successfully cast in the alliance chain platform under the condition that the response result comprises a second identifier of the target file, wherein the second identifier carries the first identifier and information of a storage address of the digital asset corresponding to the target file;
wherein the federation chain platform is configured to retrieve the published digital asset index repository after receiving the first identifier and determine whether a second file hash value identical to the first file hash value exists; under the condition that a second file hash value identical to the first file hash value does not exist in the digital asset index library, determining a second perceptual hash value with the highest similarity to the first perceptual hash value, and taking the similarity between the second perceptual hash value and the first perceptual hash value as reference similarity; under the condition that the reference similarity is lower than a preset threshold value, constructing a non-homogenization certification intelligent contract corresponding to the target file, and operating the non-homogenization certification intelligent contract to realize casting of the digital assets; or, under the condition that the reference similarity is not lower than the preset threshold, generating prompt information of digital assets with higher similarity to the target file, and refusing to generate the digital assets of the target file.
7. A federation chain-based digital asset processing method as recited in claim 6, wherein invoking the hash algorithm interface to calculate a first file hash value and a first perceptual hash value for a target file comprises:
dividing the target file to obtain block size information, and generating the first file hash value according to the block size information;
extracting image features of the target file, and generating the first perceptual hash value according to the image features; or extracting the audio feature of the target file, and generating the first perceptual hash value according to the audio feature.
8. A digital asset processing system comprising a federation chain platform and a terminal, said federation chain platform being communicatively connected to said terminal, wherein the federation chain platform is configured to perform the steps of the method of any one of claims 1 to 5 and the terminal is configured to perform the steps of the method of any one of claims 6 to 7.
9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 5 or 6 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210658802.6A CN114756627B (en) | 2022-06-10 | 2022-06-10 | Alliance-chain-based digital asset processing method, system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210658802.6A CN114756627B (en) | 2022-06-10 | 2022-06-10 | Alliance-chain-based digital asset processing method, system and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114756627A CN114756627A (en) | 2022-07-15 |
| CN114756627B true CN114756627B (en) | 2022-09-30 |
Family
ID=82336479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210658802.6A Active CN114756627B (en) | 2022-06-10 | 2022-06-10 | Alliance-chain-based digital asset processing method, system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114756627B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP4311157A1 (en) * | 2022-07-19 | 2024-01-24 | Nagravision Sarl | Method for generating an nft associated with a digital asset, method for verifying a similarity between digital assets, corresponding computer program products and devices |
| CN116957592B (en) * | 2023-09-20 | 2023-12-22 | 中铱数字科技有限公司 | Method for generating digital collection based on blockchain |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108566372A (en) * | 2018-03-01 | 2018-09-21 | 云易天成（北京）安全科技开发有限公司 | Fileinfo leakage prevention method, medium and equipment based on hash algorithm |
| CN109614775A (en) * | 2018-11-20 | 2019-04-12 | 安徽大学 | A kind of protect-ing frame structure and method that the copyright based on block chain is traced to the source |
| CN110427895A (en) * | 2019-08-06 | 2019-11-08 | 李震 | A kind of video content similarity method of discrimination based on computer vision and system |
| CN110991358A (en) * | 2019-12-06 | 2020-04-10 | 腾讯科技（深圳）有限公司 | Text comparison method and device based on block chain |
| CN111460394A (en) * | 2020-03-30 | 2020-07-28 | 陈兴芜 | Copyright file verification method and device and computer readable storage medium |
| CN112307440A (en) * | 2020-10-29 | 2021-02-02 | 云南师范大学 | Method for protecting online education and teaching video property right by using block chain technology |
| CN113032735A (en) * | 2021-05-21 | 2021-06-25 | 浙江数秦科技有限公司 | Digital asset evidence and infringement monitoring system and method based on block chain technology |
| EP3993318A1 (en) * | 2020-10-30 | 2022-05-04 | Bundesdruckerei GmbH | Blockchain-based digital document system |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150142742A1 (en) * | 2013-11-17 | 2015-05-21 | Zhen-Chao HONG | System and method for syncing local directories that enable file access across multiple devices |
| CN113901005A (en) * | 2021-09-01 | 2022-01-07 | 微易签(杭州)科技有限公司 | Portable file storage method, system and medium based on block chain |
| CN114070554B (en) * | 2021-11-11 | 2024-01-19 | 杭州安存网络科技有限公司 | Method and device for determining ownership of block chain machine generated data |
| CN114493583A (en) * | 2022-01-13 | 2022-05-13 | 深圳市玖昔科技发展股份有限公司 | Member management method and device based on decentralized peer-to-peer network technology |
-
2022
- 2022-06-10 CN CN202210658802.6A patent/CN114756627B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108566372A (en) * | 2018-03-01 | 2018-09-21 | 云易天成（北京）安全科技开发有限公司 | Fileinfo leakage prevention method, medium and equipment based on hash algorithm |
| CN109614775A (en) * | 2018-11-20 | 2019-04-12 | 安徽大学 | A kind of protect-ing frame structure and method that the copyright based on block chain is traced to the source |
| CN110427895A (en) * | 2019-08-06 | 2019-11-08 | 李震 | A kind of video content similarity method of discrimination based on computer vision and system |
| CN110991358A (en) * | 2019-12-06 | 2020-04-10 | 腾讯科技（深圳）有限公司 | Text comparison method and device based on block chain |
| CN111460394A (en) * | 2020-03-30 | 2020-07-28 | 陈兴芜 | Copyright file verification method and device and computer readable storage medium |
| CN112307440A (en) * | 2020-10-29 | 2021-02-02 | 云南师范大学 | Method for protecting online education and teaching video property right by using block chain technology |
| EP3993318A1 (en) * | 2020-10-30 | 2022-05-04 | Bundesdruckerei GmbH | Blockchain-based digital document system |
| CN113032735A (en) * | 2021-05-21 | 2021-06-25 | 浙江数秦科技有限公司 | Digital asset evidence and infringement monitoring system and method based on block chain technology |
Non-Patent Citations (1)
| Title |
|---|
| "局部敏感哈希算法的内容相似度比较";童学杰 等;《电脑知识与技术》;20190410;162-163页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114756627A (en) | 2022-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114756627B (en) | Alliance-chain-based digital asset processing method, system and storage medium | |
| US10725981B1 (en) | Analyzing big data | |
| US10855637B2 (en) | Architecture for large data management in communication applications through multiple mailboxes | |
| WO2016169237A1 (en) | Data processing method and device | |
| US20240086381A1 (en) | Efficient deduplication of randomized file paths | |
| CN112559913A (en) | Data processing method and device, computing equipment and readable storage medium | |
| CN111813842B (en) | Data processing method, device, system, equipment and storage medium | |
| CN117763247A (en) | Link downloading method, device, computer equipment and storage medium | |
| US11983165B1 (en) | Load history calculation in internal stage replication | |
| CN117290302B (en) | Directory separation method, apparatus, computer device and storage medium | |
| US11669564B2 (en) | System and method for aggregating, tagging and distributing unstructured data as structured data in real time | |
| CN116910115A (en) | Group query method, device, computer equipment and storage medium | |
| CN114610688A (en) | Log aggregation method and device, computer equipment and storage medium | |
| CN116910069A (en) | Database updating method, device, computer equipment and storage medium | |
| CN116562608A (en) | Service receipt status determining method and related products | |
| CN117667999A (en) | Data pushing method, device, computer equipment and computer readable storage medium | |
| CN114647630A (en) | File synchronization method, information generation method, file synchronization device, information generation device, computer equipment and storage medium | |
| CN116737140A (en) | Business component construction method, device, computer equipment and storage medium | |
| CN117435651A (en) | Test data processing method, device, computer equipment and storage medium | |
| CN117648336A (en) | Data query method, device, computer equipment and storage medium | |
| CN116166851A (en) | Directory information query method, directory information query device, computer equipment and storage medium | |
| CN117389859A (en) | Method, device, computer equipment and storage medium for determining influence range | |
| CN117435589A (en) | Data transfer method, device, computer equipment and storage medium | |
| CN116074111A (en) | Data access method, device, computer equipment and storage medium | |
| CN117880100A (en) | Resource determination method, device, computer equipment, medium and product |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220824 Address after: Room 308, building 13, 199 Wensan Road, Xihu District, Hangzhou City, Zhejiang Province 310012 Applicant after: Hangzhou Liancheng Digital Technology Co.,Ltd. Applicant after: Hangzhou Zhanlian Technology Co.,Ltd. Address before: Room 308, building 13, 199 Wensan Road, Xihu District, Hangzhou City, Zhejiang Province 310013 Applicant before: Hangzhou Liancheng Digital Technology Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |