CN114579670A - Data credit increasing method and system based on block chain and electronic equipment - Google Patents
Data credit increasing method and system based on block chain and electronic equipment Download PDFInfo
- Publication number
- CN114579670A CN114579670A CN202210489517.6A CN202210489517A CN114579670A CN 114579670 A CN114579670 A CN 114579670A CN 202210489517 A CN202210489517 A CN 202210489517A CN 114579670 A CN114579670 A CN 114579670A
- Authority
- CN
- China
- Prior art keywords
- chain
- main
- interaction
- link
- side chain
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 230000003993 interaction Effects 0.000 claims abstract description 134
- 230000002452 interceptive effect Effects 0.000 claims description 22
- 230000007246 mechanism Effects 0.000 claims description 13
- 238000004590 computer program Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 230000002708 enhancing effect Effects 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000012790 confirmation Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 206010044565 Tremor Diseases 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
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
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Computer Security & Cryptography (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Bioethics (AREA)
- Data Mining & Analysis (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Train Traffic Observation, Control, And Security (AREA)
- Traffic Control Systems (AREA)
Abstract
The application discloses a data trust increasing method, a data trust increasing system and electronic equipment based on a block chain, wherein when a first side chain and a first main chain are determined to carry out a first interaction event and a first side chain and a second main chain carry out a second interaction event, the first main chain sends chain crossing permission information to the first side chain; the cross-chain permission information comprises related information of a first main chain and a first side chain, and the related information exists only on the first main chain and does not exist on a second main chain; when the first side link receives the cross-link permission information and then performs cross-link interaction with other main chains, relevant information is transferred to the other main chains; wherein the other backbone does not include the first backbone. Due to the endorsement of the first main chain, the credibility of the related information during chain crossing can be improved.
Description
Technical Field
The present application relates to the field of block chain technologies, and in particular, to a data credit increasing method and system based on a block chain, and an electronic device.
Background
Based on the core idea of web3.0, each user can form a data chain of the user, and when cross-chain interaction is performed between different data chains, the data chains are not trusted with each other, so how to increase trust of data on the data chains of the users is an urgent technical problem to be solved.
Disclosure of Invention
In view of the above, a main objective of the present application is to provide a block chain-based data trust enhancing method, system, storage medium and electronic device, which can improve the credibility of cross-chain interaction information.
In a first aspect, an embodiment of the present application provides a data trust enhancing method based on a block chain, where the method includes the following steps:
when determining that a first sidelink and a first main chain carry out a first interaction event and the first sidelink and a second main chain carry out a second interaction event, the first main chain sends chain crossing permission information to the first sidelink; wherein the cross-link permission information comprises related information of the first main link and the first side chain, and the related information exists only on the first main link but not on the second main link;
when the first side link performs cross-link interaction with other main chains after receiving the cross-link permission information, the related information is transferred to the other main chains; wherein the other backbone does not include the first backbone.
In a second aspect, an embodiment of the present application further provides a data credit enhancement system based on a block chain, where the system includes:
the chain crossing permission module is used for sending chain crossing permission information to a first side chain by the first main chain when the first side chain and the first main chain are determined to carry out a first interaction event and the first side chain and the second main chain carry out a second interaction event; wherein the cross-link permission information comprises related information of the first main link and the first side chain, and the related information exists only on the first main link but not on the second main link;
the information unloading module is used for unloading the related information to other main chains when the first side link performs chain-crossing interaction with other main chains after receiving the chain-crossing permission information; wherein the other backbone does not include the first backbone.
In a third aspect, an embodiment of the present application further provides a computer device, which includes a memory and a processor, where the memory stores a computer program, and the processor implements the steps of the method in the foregoing method when executing the computer program.
In a fourth aspect, the present application further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the steps of the above method.
According to the data trust increasing method, system and electronic device based on the block chain, after a first interaction event and a second interaction event are determined to occur simultaneously, the first main chain initiates cross-chain permission, the first main chain plays a role similar to a notary at the moment, the credibility and authenticity of relevant information of the first main chain and other main chains can be proved to the other main chains when the first main chain and the other main chains perform cross-chain interaction, the credibility of the relevant information is improved, the acceptance and trust willingness of the other main chains to the relevant information are higher, when the first main chain receives the cross-chain permission information sent by the first main chain and performs cross-chain interaction with the other main chains, the relevant information is transferred to the other main chains, the other main chains can perform effective interaction events based on the relevant information after the first main chain is fair, and sharing of the relevant information is achieved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic flowchart of a data trust enhancing method based on a block chain according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a data trust system based on a block chain according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In Web3.0, digital content created by a user, the ownership of which is specifically owned by the user, is controlled by the user, and the value created by the user is distributed according to an agreement the user has with others. Under this architecture, the digital content is no longer simply data, but rather digital assets, because its rights are guaranteed at the asset level. This is similar to the market among digital economies, identifying, respecting, and protecting personal digital property rights, with value exchange based on contracts.
The blockchain technology, also called as distributed ledger technology, is actually a decentralized computing protocol, and provides agreement on how different benefit agents create and maintain a distributed computing infrastructure in a decentralized manner, so as to realize separation between the "infrastructure management right" and the "user data control right", and prevent a single platform from realizing control over user data, user assets and user identities through the computing infrastructure management right.
The blockchain is also a transparent and credible right confirmation and tracing system, once one right is digitalized into a certificate on the blockchain, the right can be reliably confirmed, and the whole process of circulation, transaction, conversion and deformation can be tracked in the whole process. The blockchain is also a protocol creation and automation platform. Smart contracts are a centralized embodiment of this capability. Through the intelligent contract, the right and value distribution protocol can be efficiently, accurately and credibly executed without a credible third party, and the whole process can be audited. Blockchains are therefore an essential infrastructure for Web 3.0. However, the blockchain is only a means for realizing the confirmation and protection of the rights and interests of the digital assets of the user.
On the blockchain, only the certificate can be confirmed and managed, general data still cannot enjoy equal treatment, and a user needs to verify and protect the digital rights of the user if the user wants to confirm and protect the digital rights of the user.
The vast majority of the notations on the Web3.0 are NFT (Non-homogeneous Tokens) which originated in EIP-721 (Ethereum evaluation pro sale 721) introduced at the end of 2017, which contains identifying information recorded in its smart contracts that gives each token its uniqueness, Non-substitutability and Non-dividable nature.
Example 1
Based on the core idea of web3.0, the application provides a data trust increasing method based on a block chain, and referring to fig. 1, the method comprises the following steps:
s100, when it is determined that a first side chain and a first main chain perform a first interaction event and the first side chain and a second main chain perform a second interaction event, the first main chain sends chain crossing permission information to the first side chain. Wherein the chain crossing permission information comprises the related information of the first main chain and the first side chain. The relevant information is only present on the first backbone and not on the second backbone.
S200, after the first side link receives the cross-link permission information, when the first side link performs cross-link interaction with other main chains, the related information is transferred to the other main chains. Wherein the other backbone does not include the first backbone.
It should be noted that, the first interaction event refers to an event that the interaction frequency of the first side chain and the first main chain reaches a first preset interaction frequency, the second interaction event refers to an event that the interaction frequency of the first side chain and the second main chain reaches a second preset interaction frequency, and the first preset interaction frequency is much larger than the second preset interaction frequency.
In one embodiment, that the first preset interaction frequency is greater than the second preset interaction frequency means that the first preset interaction frequency and the second preset interaction frequency are in different magnitude levels, for example: the first preset interaction frequency is a certain numerical value above 1000 times, and the second preset interaction frequency is a certain numerical value below 100 times.
In the data trust increasing method based on the block chain in this embodiment, when a first interactive event (i.e., a frequent interactive event) occurs between a first side chain and a first main chain, it indicates that a main body (e.g., a certain IP, a certain topic, a certain point of interest, a certain idol, a certain celebrity, etc.) corresponding to the first side chain has a large influence, and a large amount of related information (e.g., release information, creation information, registration information, comment information, etc.) is generated between the first side chain and the first main chain (e.g., a certain platform data chain, a certain centralized main body data chain, etc.), when a second interactive event (i.e., an initial interactive event) occurs between the first side chain and the second main chain at the same time, it indicates that the main chain does not want to be limited to the occurrence of the influence on the first main chain, and exerts an influence sign on other main chains, but the other main chains are not necessarily trusting on the related information previously generated and accumulated by the main chain, a third party, which can prove the trustworthiness of the data, is then required to augment the information previously accumulated on the first side chain. Therefore, when the first interaction event and the second interaction event are detected to occur simultaneously, the first main chain is added as a role similar to a notary, and the trust is added to the related data accumulated between the first side chain and the first main chain. The method is characterized in that when a first interaction event and a second interaction event occur simultaneously, a first main chain sends cross-chain permission information to a first side chain, the first side chain performs cross-chain interaction with other main chains after receiving the cross-chain permission information, at the moment, the first main chain stores all related information of the first side chain and the first main chain in other main chains so that the other main chains perform corresponding interaction events based on the related information, and the stored related information is authenticated by the first main chain, so that the effect of data trust increase can be realized.
It should be noted here that the inter-chain permission information can be initiated only by the first main chain, because only when the first main chain permission is approved, the first main chain can forward the authenticated related information to other main chains when the first side chain performs inter-chain interaction with other side chains, thereby achieving the purpose of data trust increase. The chain crossing permission information includes related information of the first main chain and the first side chain, that is, when the first main chain sends the chain crossing permission information to the first side chain, the first side chain is also acquiescently permitted to share the related information on other main chains. The term "dump" in this embodiment does not mean that the related information is not provided on the first main chain after the related information is stored on the other main chains from the first main chain, but the first main chain carries out endorsement, and the other main chains also have the related information at the same time.
It should be noted that the other main chains in the above embodiments may be the second main chain, or may be one or more of the third main chain, the fourth main chain, … or the nth main chain other than the second main chain, or may be a plurality of main chains including the second main chain, the third main chain, the fourth main chain and the … nth main chain. Preferably, the other backbone is the second backbone, because the first side-chain has shown evidence of establishing interaction with the second backbone, indicating that the first side-chain tends to establish cross-chain interaction with the second backbone. Wherein, the platform or the centralization main body in the above embodiment comprises: microblogs, blogs, trembles, WeChat friend circles, and the like. The related information exists only on the first main chain and does not exist on the second main chain, and therefore the fairness of the first main chain to the related information and the information sharing to other main chains can be achieved.
For example, if the main body corresponding to the first side chain is a "star," the main body of the first main chain is a public platform 1 (e.g., a microblog), the main body of the second main chain is a public platform 2 (e.g., a twitter), when the first side chain and the first main chain are in a frequent interaction stage (i.e., a first interaction event occurs), it is indicated that the "star" has grown from a "small V" to a "large V" with a larger influence, and when the first side chain and the second main chain are in an initial interaction stage (i.e., a second interaction event occurs), it is indicated that the "star" has already shown a sign of its influence to other public data platforms. When the first interactive event and the second interactive event occur simultaneously, if the public platform 1 prevents the "star" from fighting other public platforms in a single story, it is not necessarily a good thing for itself, and at the same time, the star wants to exert its influence on other public data platforms, and preferably can transfer the earlier stage and the information (such as fan information) accumulated by the public platform 1 to the corresponding public platform, other public platforms, however, generally consider the recorded data to be non-trustworthy, and therefore require the addition of third parties who can prove the trustworthiness of the data to prove the trustworthiness of the data, the public platform 1 is relatively credible and objectively fair to the public or other platforms, the related information recorded on the public platform 1 and the related information recorded on the first side chain can be verified by mutual verification, so that the credibility of the related information of the first side chain can be improved by adding the public platform 1 as a role similar to a notary. In this process, only the public platform 1 can initiate a cross-chain license because the first public platform acts like a notary here, and if it does not allow cross-chain, it cannot have the effect of justifying data trust. After the first side chain receives the cross-chain permission information, a cross-chain request is sent to other main chains, cross-chain interaction between the first side chain and the other main chains is established, and related information is stored in the second main chain, so that the other main chains can perform corresponding interaction events based on the related information. Meanwhile, from the perspective of each public platform, resource sharing is realized.
In one embodiment, the step of performing a cross-link interaction with other main chains after the first sidelink receives the cross-link permission information includes:
A1. and acquiring the cross-chain request information initiated to the other main chains after the first side chain receives the cross-chain permission information.
A2. And confirming the cross-chain interaction between the first side chain and the other main chains according to the cross-chain request information.
The embodiment is a specific implementation manner of performing inter-link interaction between a first side link and other main links, after receiving inter-link permission information of the first main link, the first side link initiates an inter-link request to the main link which the first side link wants to cross, and simultaneously sends inter-link request information to the first main link, where the inter-link request information includes identification information identifying unique identities of the other main links, so that the first main link can confirm inter-link interaction between the first side link and the other main links according to the inter-link request information and forward relevant information of the first side link to the corresponding other main links, thereby realizing sharing of the relevant information.
In one embodiment, when confirming the inter-chain interaction between the first side chain and the other main chain according to the inter-chain request information, the method includes:
B1. a transaction allocation mechanism is provided between the first side chain and the other main chain.
B2. When the first side chain and the other main chains are subjected to cross-chain interaction, transaction profits are distributed to the first main chain, the first side chain and the other main chains according to the transaction distribution mechanism.
In this embodiment, when the first side chain and the other main chains perform cross-chain interaction, a trade allocation mechanism is arranged between the first side chain and the other main chains, and the trade allocation mechanism determines a trade profit allocation manner among the first main chain, the first side chain and the other main chains, so that the first main chain shares corresponding profit returns while sharing data resources, and meanwhile, the first side chain and the other main chains also obtain considerable profit returns when performing interaction events, thereby promoting long-term cooperation among the data chains.
In one embodiment, when the related information is transferred to the other main chain, a hash key is given to the related information.
The first main chain gives the hash key to the related information, so that the related information is not easy to be tampered, the authenticity and the reliability of the related information are further ensured, and on the other hand, the first main chain is also a basis for obtaining corresponding profits in the interaction events by other main chains, so that the profits obtained by all data chains are relatively fair and fair.
In one embodiment, the transaction allocation mechanism is: and acquiring the decryption times for decrypting the hash key of the related information when the other main chains and the first side chain perform the interaction event, and determining the profit sharing proportion among the first main chain, the first side chain and the other main chains according to the decryption times.
Further, the step of obtaining the decryption times for decrypting the hash key of the related information when the other main chain performs the interaction event with the first side chain includes: and acquiring a decryption request sent by the other main chains when the hash key is decrypted, and determining the decryption times according to the key request times.
Because the first main chain encrypts the related information between the first main chain and the first side chain, if other main chains want to interact across the chains, a decryption request must be sent to the first main chain, and the number of times of the hash decryption request can be regarded as the number of times of the other main chains decrypting the hash key, so that on one hand, the first main chain monitors the interaction events of the other main chains, the self profit sharing is ensured not to be lost, on the other hand, the profit sharing proportion can be determined according to the contribution of the other main chains, and the profit fairness is ensured.
In one embodiment, the step of determining the profit sharing ratio among the first main chain, the first side chain and the other main chains from the decryption times comprises: the larger the number of decryptions in the other main chain, the higher the proportion of the corresponding profit share, and the first main chain and the first side chain will get a predetermined proportion of profit share each time the other main chain is decrypted.
For example: when a certain star grows from a small V to a large V, information is always issued on a microblog platform (a first main chain), vermicelli interaction and the like are carried out, at the moment, the relevant information of the large V is stored on the first main chain of the microblog platform, when the large V is about to exert influence on platforms such as a WeChat platform and a buffalo platform, the microblog stores the relevant information to the WeChat and the buffalo, the relevant information on the WeChat and the buffalo is encrypted through the microblog at the moment, a key needs to be asked for the microblog when any platform of the WeChat and the buffalo carries out an interaction event, and if the profit corresponding to the interaction event is 1, the key is asked for each of the WeChat and the buffalo in the interaction event once, the microblog can be divided according to the proportions of 1/3 (' large V '), 1/3 ' (microblog), 1/6 (buffalo) and 1/6 (WeChao).
In one embodiment, when it is determined that the first side chain performs the first interaction event with the first main chain and the first side chain performs the second interaction event with the second main chain, there are two implementation manners:
the first is that the first main chain actively monitors the occurrence of an interaction event, specifically: the first main chain actively detects whether the interaction frequency between the first main chain and the first side chain reaches the first preset interaction frequency, and whether the interaction frequency between the first side chain and the second main chain reaches the second preset interaction frequency; if so, determining that the first interaction event and the second interaction event occur simultaneously; if not, the cross-link permission information is not sent to the first side link.
The second is that the first side-chain actively provides the first backbone with the occurrence of an interaction event: and receiving a report request of the first interactive event and the second interactive event which are reported by the first side chain and occur at the same time, and determining that the first interactive event and the second interactive event occur at the same time by the report request.
The method specifically comprises the following steps: receiving a first interactive event report request actively reported by a first side chain when the frequency of interaction with the first main chain reaches a first preset interactive frequency, and a second interactive event report request when the frequency of interaction with the second main chain reaches a second preset interactive frequency, determining a first interactive event between the first side chain and the first main chain according to the first interactive event report request, and determining a second interactive event between the first side chain and the second main chain according to the second interactive event report request.
The two modes are implemented simultaneously, so that the interaction events can be ensured not to be missed. Of course, one of the ways can be selected optionally, the first way of the active monitoring of the first main chain is relatively objective and fair, and the second way of the active reporting of the first side chain can effectively mobilize the positivity of the first side chain to exert the influence thereof.
Example 2
In addition, the embodiment of the application also provides a data credit increasing system based on the block chain. Referring to fig. 2, fig. 2 is a schematic structural diagram of a data communications system based on a block chain in an embodiment of the present application, where the control system specifically includes: the chain crossing permission module 100 is configured to, when it is determined that a first side chain performs a first interaction event with a first main chain and the first side chain performs a second interaction event with a second main chain, send chain crossing permission information to the first side chain by the first main chain; wherein, the cross-chain permission information comprises the relevant information of the first main chain and the first side chain, and the relevant information only exists on the first main chain and does not exist on the second main chain. An information dump module 200, configured to dump the relevant information to other main chains when the first side link performs a cross-link interaction with the other main chains after receiving the cross-link permission information; wherein the other backbone does not include the first backbone.
In the data trust enhancing system based on the block chain in this embodiment, after it is determined that the first interaction event and the second interaction event occur simultaneously, the first main chain initiates the cross-chain permission, at this time, the first main chain acts as a role similar to a notary, and when the first main chain performs cross-chain interaction with other main chains, the credibility and authenticity of the relevant information of the first main chain and the first main chain can be proved to the other main chains, so that the credibility of the relevant information is improved, the acceptance and trust willingness of the other main chains to the relevant information are higher, when the first main chain performs cross-chain interaction with the other main chains after receiving the cross-chain permission information sent by the first main chain, the relevant information is transferred to the other main chains, and the other main chains can perform effective interaction events based on the relevant information after the first main chain is fair, thereby realizing the sharing of the relevant information.
In one embodiment, the first interaction event refers to an event that the interaction frequency of the first side chain and the first main chain reaches a first preset interaction frequency, the second interaction event refers to an event that the interaction frequency of the first side chain and the second main chain reaches a second preset interaction frequency, and the first preset interaction frequency is much larger than the second preset interaction frequency.
In one embodiment, the information unloading module 200 includes: and the cross-chain request unit is used for acquiring cross-chain request information initiated by the other main chains after the first side link receives the cross-chain permission information. And the cross-chain interaction unit is used for confirming the cross-chain interaction between the first side chain and the other main chains according to the cross-chain request information.
In one embodiment, the system further comprises a trading mechanism setting module and a profit sharing module. The transaction mechanism setting module is used for setting a transaction distribution mechanism between the first side chain and the other main chains. The profit sharing module is configured to share transaction profits to the first main chain, the first side chain and the other main chains according to the transaction sharing mechanism when the first side chain and the other main chains perform cross-chain interaction.
In one specific embodiment, the method further includes a key assigning module, configured to assign a hash key to the relevant information when the relevant information is transferred to the other main chain.
In one embodiment, the transaction allocation mechanism comprises: and the decryption module is used for acquiring the decryption times for decrypting the hash key of the related information when the other main chains and the first side chain perform the interaction event, and determining the profit sharing proportion among the first main chain, the first side chain and the other main chains according to the decryption times.
In one embodiment, the inter-chain permission module 100 includes an active detection unit, configured to actively detect whether the frequency of interaction between the first main chain and the first side chain reaches the first preset frequency of interaction, and whether the frequency of interaction between the first side chain and the second main chain reaches the second preset frequency of interaction; if so, determining that the first interaction event and the second interaction event occur simultaneously; and if not, not sending the cross-link permission information to the first side link.
In one specific embodiment, the cross-chain license module 100 includes a reporting unit, configured to receive a report request that the first interactivity event and the second interactivity event reported by the first side chain occur at the same time, and determine, by the report request, that the first interactivity event and the second interactivity event occur at the same time.
Example 3
The present embodiment provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program performs each process of the embodiment of the data trust method based on a block chain described in embodiment 1, and can achieve the same technical effect. For specific implementation, refer to method embodiment 1, which is not described herein again.
Example 4
In addition, referring to the schematic structural diagram of an electronic device shown in fig. 3, the present embodiment further provides an electronic device, where the electronic device includes a bus 51, a processor 52, a transceiver 53, a bus interface 54, a memory 55, and a user interface 56. The electronic device comprises a memory 55.
In this embodiment, the electronic device further includes: one or more programs stored on the memory 55 and executable on the processor 52 are configured to be executed by the processor for performing the following steps (1) and (2), and the same technical effects can be achieved:
(1) when determining that a first sidelink and a first main chain carry out a first interaction event and the first sidelink and a second main chain carry out a second interaction event, the first main chain sends chain crossing permission information to the first sidelink; wherein the chain crossing permission information comprises related information of the first main chain and the first side chain, and the related information only exists on the first main chain and does not exist on the second main chain.
(2) When the first side link performs cross-link interaction with other main chains after receiving the cross-link permission information, the related information is transferred to the other main chains; wherein the other backbone does not include the first backbone.
A transceiver 53 for receiving and transmitting data under the control of the processor 52.
Where a bus architecture (represented by bus 51) is used, bus 51 may include any number of interconnected buses and bridges, with bus 51 linking together various circuits including one or more processors, represented by processor 52, and memory, represented by memory 55. The bus 51 may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further in this embodiment. A bus interface 54 provides an interface between the bus 51 and the transceiver 53. The transceiver 53 may be one element or may be multiple elements, such as multiple receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. For example: the transceiver 53 receives external data from other devices. The transceiver 53 is used for transmitting data processed by the processor 52 to other devices. Depending on the nature of the computing system, a user interface 56, such as a keypad, display, speaker, microphone, joystick, may also be provided.
The processor 52 is responsible for managing the bus 51 and the usual processing, running a general-purpose operating system as described above. And memory 55 may be used to store data used by processor 52 in performing operations.
Alternatively, processor 52 may be, but is not limited to: a central processing unit, a singlechip, a microprocessor or a programmable logic device.
It will be appreciated that the memory 55 in embodiments of the invention may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of illustration and not limitation, many forms of RAM are available, such as Static random access memory (Static RAM, SRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic random access memory (Synchronous DRAM, SDRAM), Double Data Rate Synchronous Dynamic random access memory (ddr Data Rate SDRAM, ddr SDRAM), Enhanced Synchronous SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and Direct Rambus RAM (DRRAM). The memory 55 of the systems and methods described in this embodiment is intended to comprise, without being limited to, these and any other suitable types of memory.
In some embodiments, memory 55 stores elements, executable modules or data structures, or a subset thereof, or an expanded set thereof as follows: an operating system 551 and application programs 552.
The operating system 551 includes various system programs, such as a framework layer, a core library layer, a driver layer, and the like, for implementing various basic services and processing hardware-based tasks. The application 552 includes various applications, such as a Media Player (Media Player), a Browser (Browser), and the like, for implementing various application services. A program implementing the method of an embodiment of the present invention may be included in the application 552.
It should be noted that, in the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments may be referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
It is further noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (12)
1. A data trust increasing method based on a block chain is characterized by comprising the following steps:
when determining that a first sidelink and a first main chain carry out a first interaction event and the first sidelink and a second main chain carry out a second interaction event, the first main chain sends chain crossing permission information to the first sidelink; wherein the cross-link permission information comprises related information of the first main link and the first side chain, and the related information exists only on the first main link but not on the second main link;
when the first side link performs cross-link interaction with other main chains after receiving the cross-link permission information, the related information is transferred to the other main chains; wherein the other backbone does not include the first backbone.
2. The method of claim 1, wherein the first interaction event is an event that the frequency of interaction between the first side chain and the first main chain reaches a first preset frequency of interaction, and the second interaction event is an event that the frequency of interaction between the first side chain and the second main chain reaches a second preset frequency of interaction, and the first preset frequency of interaction is much larger than the second preset frequency of interaction.
3. The method of claim 1, wherein the step of the first sidelink interacting with other main chains after receiving the cross-chain permission information comprises:
acquiring chain crossing request information initiated to the other main chains after the first side chain receives the chain crossing permission information;
and confirming the cross-chain interaction between the first side chain and the other main chains according to the cross-chain request information.
4. The method of claim 3, wherein when confirming the cross-link interaction of the first side-link with the other main-links according to the cross-link request information comprises:
setting a transaction allocation mechanism between the first side chain and the other main chain;
when the first side chain and the other main chains are subjected to cross-chain interaction, transaction profits are distributed to the first main chain, the first side chain and the other main chains according to the transaction distribution mechanism.
5. The method of claim 4, wherein a hash key is assigned to the related information when the related information is unloaded onto the other backbone.
6. The method of claim 5, wherein the transaction allocation mechanism is:
and acquiring the decryption times for decrypting the hash key of the related information when the other main chains and the first side chain perform the interaction event, and determining the profit share proportion among the first main chain, the first side chain and the other main chains according to the decryption times.
7. The method of claim 6, wherein the step of obtaining the decryption times for decrypting the hash key of the related information when the other main chain interacts with the first side chain comprises:
and acquiring a decryption request sent by the other main chains when the hash key is decrypted, and determining the decryption times according to the key request times.
8. The method of claim 2, wherein the step of determining that the first sidechain is performing a first interaction event with the first backbone and that the first sidechain is performing a second interaction event with the second backbone comprises:
the first main chain actively detects whether the interaction frequency between the first main chain and the first side chain reaches the first preset interaction frequency, and whether the interaction frequency between the first side chain and the second main chain reaches the second preset interaction frequency; if so, determining that the first interaction event and the second interaction event occur simultaneously; and if not, not sending the cross-link permission information to the first side link.
9. The method of claim 1, wherein the step of determining that the first sidechain is performing a first interaction event with the first backbone and that the first sidechain is performing a second interaction event with the second backbone comprises:
and receiving a report request of the first interactive event and the second interactive event which are reported by the first side chain and occur at the same time, and determining that the first interactive event and the second interactive event occur at the same time by the report request.
10. A data trust system based on a block chain, the system comprising:
the chain crossing permission module is used for sending chain crossing permission information to a first side chain by the first main chain when the first side chain and the first main chain are determined to carry out a first interaction event and the first side chain and the second main chain carry out a second interaction event; wherein the cross-link permission information comprises related information of the first main link and the first side chain, and the related information exists only on the first main link but not on the second main link;
the information unloading module is used for unloading the related information to other main chains when the first side link performs chain-crossing interaction with other main chains after receiving the chain-crossing permission information; wherein the other backbone does not include the first backbone.
11. 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 according to any one of the claims 1 to 9.
12. An electronic device, comprising: memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the computer program is configured to perform the steps of the method of any of claims 1-9 by the processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210489517.6A CN114579670B (en) | 2022-05-07 | 2022-05-07 | Data trust increasing method and system based on block chain and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210489517.6A CN114579670B (en) | 2022-05-07 | 2022-05-07 | Data trust increasing method and system based on block chain and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114579670A true CN114579670A (en) | 2022-06-03 |
| CN114579670B CN114579670B (en) | 2022-08-16 |
Family
ID=81769374
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210489517.6A Active CN114579670B (en) | 2022-05-07 | 2022-05-07 | Data trust increasing method and system based on block chain and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114579670B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111681111A (en) * | 2020-06-16 | 2020-09-18 | 深圳前海点金保理有限公司 | Credit increase and financing platform system, method and storage medium based on block chain |
| CN113450119A (en) * | 2021-06-25 | 2021-09-28 | 北京市大数据中心 | Cross-chain docking method and system for directory block chain combined trusted repeater |
| CN113965329A (en) * | 2021-10-25 | 2022-01-21 | 浙江师范大学 | Cross-chain interoperation system, method, medium and data processing terminal |
-
2022
- 2022-05-07 CN CN202210489517.6A patent/CN114579670B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111681111A (en) * | 2020-06-16 | 2020-09-18 | 深圳前海点金保理有限公司 | Credit increase and financing platform system, method and storage medium based on block chain |
| CN113450119A (en) * | 2021-06-25 | 2021-09-28 | 北京市大数据中心 | Cross-chain docking method and system for directory block chain combined trusted repeater |
| CN113965329A (en) * | 2021-10-25 | 2022-01-21 | 浙江师范大学 | Cross-chain interoperation system, method, medium and data processing terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114579670B (en) | 2022-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109691015B (en) | Dynamic access control method and system on block chain | |
| US10592642B2 (en) | Systems and methods for decentralized content distribution | |
| CN112311735B (en) | Credible authentication method, network equipment, system and storage medium | |
| CN111681007B (en) | Credit scoring method, transaction method and related device for blockchain | |
| US9037849B2 (en) | System and method for managing network access based on a history of a certificate | |
| CN109614813B (en) | Privacy transaction method and device based on block chain and application method and device thereof | |
| KR102251161B1 (en) | How to manage house scores using smart contracts in a blockchain network | |
| WO1997050205A9 (en) | Digitally signing agreements from remotely located nodes | |
| CN100383694C (en) | Maintaining privacy for transactions performable by a user device having a security module | |
| US11089028B1 (en) | Tokenization federation service | |
| CN110908786A (en) | Intelligent contract calling method, device and medium | |
| KR101407373B1 (en) | Method of implementing a state tracking mechanism in a communications session between a server and a client system | |
| CN111193755B (en) | Data access method, data encryption method and data encryption and access system | |
| Coss et al. | Cloud privacy objectives a value based approach | |
| CN109146482B (en) | Block chain-based user rights and interests providing method and device | |
| di Vimercati et al. | Empowering owners with control in digital data markets | |
| CN111192054B (en) | Multi-block chain linkage method and device and storage medium | |
| CN114579670B (en) | Data trust increasing method and system based on block chain and electronic equipment | |
| Lei et al. | A distributed trust model for e-commerce applications | |
| US20230275751A1 (en) | Decentralized Cryptography | |
| CN114692198A (en) | Anonymous network expert review method and system based on block chain | |
| Raje | Security and Microservice Architecture on AWS | |
| CN111194441B (en) | Data management method and related system based on block chain | |
| CN113395289A (en) | Authentication method, authentication device, electronic equipment and storage medium | |
| CN111737725B (en) | User marking method, device, server and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231207 Address after: 430014 Building 2, Guannan Industrial Park, Donghu New Technology Development Zone, Wuhan City, Hubei Province Patentee after: WUHAN LONGJIN SCIENCE AND TECHNOLOGY Inc. Patentee after: WUHAN University Address before: 430070 Building 2, Guannan Industrial Park, East Lake New Technology Development Zone, Wuhan City, Hubei Province (Station No.: txzc a0089) (Wuhan area of the free trade zone) Patentee before: WUHAN LONGJIN SCIENCE AND TECHNOLOGY Inc. |