[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN115147114A - Block chain rights management method and electronic equipment - Google Patents

Block chain rights management method and electronic equipment Download PDF

Info

Publication number
CN115147114A
CN115147114A CN202210759161.3A CN202210759161A CN115147114A CN 115147114 A CN115147114 A CN 115147114A CN 202210759161 A CN202210759161 A CN 202210759161A CN 115147114 A CN115147114 A CN 115147114A
Authority
CN
China
Prior art keywords
rights
equity
intelligent contract
issuer
binding
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.)
Pending
Application number
CN202210759161.3A
Other languages
Chinese (zh)
Inventor
陈�胜
蒋步云
李玉成
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Lianqi Technology Co ltd
Original Assignee
Beijing Lianqi Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Lianqi Technology Co ltd filed Critical Beijing Lianqi Technology Co ltd
Priority to CN202210759161.3A priority Critical patent/CN115147114A/en
Publication of CN115147114A publication Critical patent/CN115147114A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/382Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3825Use of electronic signatures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/382Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3827Use of message hashing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/40Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/401Transaction verification
    • G06Q20/4014Identity check for transactions

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Computer Security & Cryptography (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application provides a method and an electronic device for block chain rights management, wherein the method comprises the following steps: generating, by a first intelligent contract, an issuance batch for a first issuer to issue a first entitlement; generating, by the first intelligent contract, an issuance batch for the second issuer to issue the second entitlement; and when the first right and the second right are issued, if the issuing batch where the first right and the second right are located has a binding relationship, the first right and the second right are bound according to the binding relationship through the first intelligent contract. The whole process of issuing, binding, circulation and cashing of the equity and the equity related behaviors which can be traced and verified are realized through the intelligent contracts on the block chain.

Description

Block chain rights management method and electronic equipment
Technical Field
The invention relates to the technical field of a block chain, in particular to a block chain rights management method and electronic equipment.
Background
The Non-homogeneous token (NFT) is rapidly developed in the field of digital artworks, and the Non-homogeneous token determines the right of a digital collection through a public chain, so that the liquidity of the collection is increased, and the industrial value is improved. Meanwhile, the technology has the following limitations: policy supervision risk-since no admission restrictions are set for the issuer, the participants do anonymous transactions, wandering outside the real laws and regulations supervision, easily causing illegal financial activities; lack of a basis for use value: because the data model of the NFT is single, it cannot bear the rights and interests in real economic activities, and it is difficult to serve the physical economy.
Disclosure of Invention
The application aims to provide a method and electronic equipment for managing block chain rights and interests, wherein the whole processes of issuing, binding, circulation and cashing of the rights and interests and related rights and interests behaviors which can be traced and verified are realized through intelligent contracts on the block chain.
According to an aspect of the present application, a method for block chain rights management is provided, including:
generating, by a first intelligent contract, an issuance batch for a first issuer to issue a first entitlement;
generating, by the first intelligent contract, an issuance batch for the second issuer to issue the second entitlement;
and when the first right and the second right are issued, if the issuing batch where the first right and the second right are located has a binding relationship, the first right and the second right are bound according to the binding relationship through the first intelligent contract.
According to some embodiments, the method comprises:
the issuing batch comprises an issuing total number, a right interest type, an expiration duration and an initial quota.
According to some embodiments, the method comprises:
the binding relationship includes a master-slave relationship between rights to define the published batch.
According to some embodiments, the method further comprises:
authenticating the rights and interests issuer through a second intelligent contract, binding a digital certificate for the authenticated rights and interests issuer, and setting a rights and interests type allowed to be issued;
and authenticating the rights-holders through a second intelligent contract, and binding the digital certificates for the authenticated rights-holders.
According to some embodiments, the method further comprises:
the transfer of the rights between holders is conducted via the first smart contract.
According to some embodiments, the method comprises:
said transferring of said rights between holders via said first smart contract comprising:
modifying the holder of the right by calling a right selling method of the first intelligent contract so that the holder obtains the right.
According to some embodiments, the method comprises:
the transfer of the rights between holders via the first smart contract, further comprising:
if the issued rights and interests are set to allow transfer, the rights and interests holder obtains the rights and interests and then transfers the rights and interests to other rights and interests holders by calling a circulation method of the first intelligent contract;
if the issued equity has an expiration date and is not redeemed for use within the expiration date, the state of the equity is changed to invalid.
According to some embodiments, the method further comprises:
and carrying out rights and interests redemption through the first intelligent contract.
According to some embodiments, the method comprises:
the right and interest cashing through the first intelligent contract comprises the following steps:
and sending a right consumption certificate to the right issuer by the right holder for right redemption, wherein the right consumption certificate is a signature transaction for consuming the designated amount of the right.
According to some embodiments, the method comprises:
the right and interest cashing is carried out through the first intelligent contract, and the method further comprises the following steps:
and verifying the right consumption certificate by the right issuer, wherein the verification comprises the verification of a bearer signature, the verification of the right validity period and the verification of the right surplus limit.
According to some embodiments, the method comprises:
the right and interest cashing is carried out through the first intelligent contract, and the method further comprises the following steps:
submitting, by the equity issuer, a signed transaction to consume the equity specified credit to a blockchain after the verification passes and after the equity is consumed;
and after the signature transaction is blocked, deducting the consumption amount corresponding to the equity consumption.
According to some embodiments, the method further comprises:
and evaluating the rights and interests redemption through the first intelligent contract.
According to some embodiments, the method comprises:
the evaluating the equity redemption by the first smart contract comprises:
and after the rights holder consumes the rights, calling a rights evaluation method of the first intelligent contract to evaluate the redeemed rights.
According to some embodiments, the method comprises:
the evaluation of the equity redemption by the first intelligent contract further comprising:
after the rights holder consumes rights, a user evaluation method of the first intelligent contract is invoked by the rights issuer to evaluate the rights holder.
According to another aspect of the present application, there is provided an electronic device including:
a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the method of any of the above methods when executing the computer program.
According to another aspect of the application, there is provided a computer program product comprising a computer program or instructions which, when executed by a processor, implements the method of any of the above methods.
According to the exemplary embodiment of the present application, equity is made available to carry varied equity commitments in entity economic activities by introducing equity type definitions and equity limits.
According to the embodiment of the application, the identity authentication is carried out on each party participating in the application, and the rights and interests are stored in the whole process, so that the authenticity of the behaviors of each party can be traced, and the tracing of the illegal behaviors is facilitated.
According to an example embodiment of the present application, joint promotion and drainage activities between rights issuers are enabled through rights binding rules. The authenticity, normalization, fairness of the activity can be verified. By introducing a Verifiable Random Function (VRF) into the rights-binding rules, the binding results of the rights using the random binding rules are made to support redemption in the field and are unpredictable.
According to the embodiment of the application, transfer circulation of rights and interests is realized, and the true compliance of rights and interests sources can be conveniently verified, and the source of the evaluation result can be verified based on identity authentication and evaluation of rights and interests consumption.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings used in the description of the embodiments will be briefly introduced below.
Fig. 1 illustrates a flow diagram of a method for blockchain entitlement management, according to an example embodiment of the present application.
Fig. 2 illustrates a main flow diagram of blockchain entitlement management according to an example embodiment of the present application.
Fig. 3 shows a data model illustration of blockchain entitlement management according to an example embodiment of the present application.
Fig. 4 shows a rights state explanation diagram according to an example embodiment of the present application.
Fig. 5 illustrates a rights binding flow diagram according to an example embodiment of the present application.
Fig. 6 illustrates a rights redemption flow diagram according to an example embodiment of the present application.
FIG. 7 shows a block diagram of an electronic device according to an example embodiment.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The same reference numerals denote the same or similar parts in the drawings, and thus, a repetitive description thereof will be omitted.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the application. One skilled in the relevant art will recognize, however, that the subject matter of the present application can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the application.
The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
The flowcharts shown in the figures are illustrative only and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
It will be understood that, although the terms first, second, third, etc. may be used herein to describe various components, these components should not be limited by these terms. These terms are used to distinguish one element from another. Thus, a first component discussed below may be termed a second component without departing from the teachings of the present concepts. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
It should be understood by those skilled in the art that the drawings are merely schematic representations of exemplary embodiments, and that the blocks or flowchart illustrations in the drawings are not necessarily required to practice the present application and, therefore, should not be considered to limit the scope of the present application.
Since the data model of non-homogeneous tokens (NFT) is single, it cannot bear the rights and interests in real economic activities and is difficult to serve the physical economy. The present application employs the following concepts to overcome the above limitations.
Tokens are replaced with equity types so that equity can be used to represent a commitment to a service that is guaranteed by a merchant of the entity in an economic campaign.
The application discloses a rights and interests management method based on a block chain contract, wherein the rights and interests are issued by an authenticated rights and interests issuer and take the responsibility of cashing. Under the premise of agreement between rights issuers, different rights can be bound in a deterministic or random manner. For rights that the issuer allows to circulate, the transfer may be made between rights holders authenticated under real name. In the rights and interests exchange link, the authenticity and the compliance of the rights and interests sources can be verified. The equity consumers may evaluate redemption services.
By introducing a credible mechanism, the identity authentication contract authenticates the identities of the rights issuer and the rights holder, and the rights management contract stores the certificates of the behaviors of all parties on a chain, so that the related rights and interests behaviors can be traced, and evidence is provided for tracing the illegal behaviors.
Through the rights management contract, the binding between rights is realized, and the deterministic and random binding rules are supported, wherein the binding rules are determined by the disclosed contract logic, and the randomness, the unpredictability and the fairness can be verified.
Supporting transfer of the rights between holders for rights permitted to be transferred by the issuer through a rights management contract; through the equity management contract, the related parties can verify the validity of the equity, and can mutually evaluate based on equity exchange payment, and the authenticity of the evaluation result can be verified.
Before describing the technical solution of the present application in detail, the term convention used in the present application is first introduced as follows.
Contract: i.e. intelligent contracts, which may be loaded and executed by a blockchain contract container, contracts have a unique identity, contracts contain methods for signature transaction invocation, and contract methods read and write external states through interfaces provided by the contract container.
Contract Context (Contract Context): namely the context of contract method execution, including signature transactions that invoke contract methods, the Shim API interface that accesses chunk data and world State world states.
World State (World State): the external state of the block chain account book, referred to as the account book state or state for short, and all the states form the global state of the block chain. And a read-write state interface is provided in a contract container context interface Shim API, and the read-write of Key-Value state Key Value pairs to a Key-Value database is supported.
Marking: i.e., unique identifier, to distinguish and find the index of the digital object, where Id is the identifier, and Id herein can be generated by using a Universal Unique Identifier (UUID) method.
Certificate: i.e., a digital certificate, is an electronic file that contains a public key corresponding to the private signature key of an account.
Signature: the signature in the invention comprises an account identifier and a digital signature, wherein the digital signature is realized by using the technology in the field of public key encryption and is used for identifying digital information; the account identification is used to extract the public key of the signer from the associated transaction to verify its digital signature.
Signature transaction: the structured data containing the signature of the transaction initiator represents the authorized behavior of the signer, and the called contract name, contract method and calling parameters are specified in the signature transaction.
Hash: the general translation is hashing, or transliteration into a hash, which is to transform an input of arbitrary length (also called pre-mapped pre-image) into an output of fixed length by a hashing algorithm, where the output is a hash value.
VRF: a Verifiable Random Function (veriable Random Function) is an encryption scheme that maps an input to a Verifiable pseudo-Random output. Firstly, the VRF gets a random number, and secondly, since the signature contains the private key of the generator, the verifier can determine the validity of the random number through the public key. VRFs have three major characteristics: verifiability, uniqueness, and randomness.
Exemplary embodiments of the present application will be described below with reference to the accompanying drawings.
Fig. 1 illustrates a flow chart of a method of blockchain entitlement management according to an example embodiment of the present application.
Referring to FIG. 1, at S101, a publishing batch for a first publisher to publish a first entitlement is generated via a first intelligent contract.
The technical scheme adopted by the application comprises 4 stages: preparation phase, rights issue (including rights binding), rights circulation and rights exchange and payment.
According to some embodiments, identity authentication and rights management of rights-givers in a preparatory phase prior to rights issue may include the following steps.
Disclosing a chain administrator account and certificate, a block chain common identification node account and signature certificate, and an authenticator account and certificate in a founding block; a Verifiable Random Function (VRF) key pair is generated for the blockchain consensus node, and a VRF public key for the consensus node is disclosed in the foundational block.
Wherein, the meaning of the founder block is: the block chain is made up of a number of contiguous blocks, the first block constructed earliest being called a created block and having a unique ID number.
The equity is a digital certificate which is published by an issuer and bears the promise of the issuer to provide certain service for a holder in real activities, and the equity types comprise: tickets, redemption tickets, coupons, etc., the equity residual amount is used to handle multiple consumption situations, i.e., allowing only a portion of the amount to be consumed per equity redemption.
The equity relatives comprise equity issuers (short for issuers), namely entities which are qualified in the economic activities of the entities and provide certain services; rights holder (holder for short) -an entity that consumes a certain service in the entity's economic activity.
The chain administrator deploys a second intelligent contract on the blockchain, such as an account management contract CMAccount, which provides an entity account authentication method (signUpAccount) and an account certificate binding method (bindCert), and performs authority check in the contract method, and only accepts an authenticator account to call the account authentication method and the certificate binding method.
A chain administrator deploys a first intelligent contract, such as a equity management contract CMTicket, on the blockchain, which contains contract methods for issuing equity, binding equity, transferring equity, and redeeming equity, in which caller entitlements are checked.
The authenticator calls the CMAccount contract to authenticate the rights issuer, binds a digital certificate for the authenticated rights issuer, and sets the rights type allowed to be issued for the issuer.
The authentication party authenticates the rights and interests holder in real name, and binds the digital certificate for the authenticated rights and interests holder. The holder only allows the user account to hold the rights and interests after the holder passes the authentication.
In accordance with some embodiments, in the equity issuance phase, a first equity issuance Fang Diaoyong first intelligent contract, e.g., equity management contract, generates an issuance lot of a first equity to be issued.
The common characteristics of an issued batch used to constrain the equity of the same batch may include the total number of issues, the type of equity (which may include, for example, single tickets, multiple tickets, discount coupons, credits, etc.), the expiration time, the initial amount, the usage rule description, the details of the equity corresponding to the type of equity (e.g., percentage of discount), etc.
At S103, an issuance batch for issuing a second entitlement by a second issuer is generated by the first intelligent contract.
According to some embodiments, in the equity issue stage, a second equity issue Fang Diaoyong first intelligent contract, e.g., equity management contract, generates an issue batch of a second equity to be issued.
The issuer calls the contract method, can specify the information such as the type of the rights, whether the transfer is allowed, the lot is issued, issues the rights and saves the certificate on the chain. If the issued equity sets the transfer allowed, the equity may be transferred by the holder, otherwise the transfer is not allowed.
At S105, when the first interest and the second interest are issued, if the issuing batch where the first interest and the second interest are located has a binding relationship, the first interest and the second interest are bound according to the binding relationship through the first intelligent contract.
If the rights and interests exist in the issuing batch in the binding relationship when the rights and interests are issued, the rights and interests are bound in the master-slave relationship through the binding method in the first intelligent contract by the binding rule in the contract logic. The description of the specific rights data structure can be found in the data model description diagram shown in FIG. 3. The specific rights binding process can be seen in the rights binding process flow diagram shown in fig. 5.
According to some embodiments, the binding may be generated for the publishing rights of two publishing batches, signed by the issuers of the two batches together. The binding relationship restricts the master-slave relationship and the binding type between the two release batches. The binding types are classified into deterministic binding and stochastic binding, and the specific flow is described with reference to the rights and interests binding flow chart shown in fig. 5.
According to some embodiments, based on prior agreement between issuers and generation of binding rules on the chain, a primary right is obtained while a secondary right is obtained to which a binding is made, for example: the issuer scenic spot A and the issuer hotel B generate a binding rule c, and it is established that a lodging discount coupon r2 of the hotel issued by B is bound to a scenic spot ticket r1 issued by A, so that the visitor U1 purchases the right of R1 and also has the right of r2.
If the issued rights and interests belong to the batch with the binding constraint (namely the binding rule), at the end of the transaction sequence of each block, the binding relationship between the rights and interests is calculated through the binding rule and is stored in the book state of the block chain. The reason why the transaction sequence of each block is at the end of the transaction sequence is that all rights to be bound in the block need to be traversed, the transaction sequence is sequentially executed, issued rights are firstly stored in the state of the account book, and then binding information is calculated for the stored rights and stored in the state of the account book. The specific rights binding flow can be seen in fig. 5.
Fig. 2 illustrates a main flow diagram of blockchain entitlement management according to an example embodiment of the present application.
Referring to fig. 2, in accordance with some embodiments, the main process of block chain equity management is divided into 4 stages of preparation, equity issue, equity flow and equity exchange.
In the preparation stage, disclosing a chain administrator account and certificate, a block chain common identification node account and signature certificate, and an authenticator account and certificate in a founding block; a Verifiable Random Function (VRF) key pair is generated for the blockchain consensus node, and a VRF public key for the consensus node is disclosed in the foundational block.
A chain administrator deploys account management contracts on blockchains, which contracts provide entity account authentication methods and account certificate binding methods.
A chain administrator deploys equity management contracts on the blockchain that contain contract methods for issuing equity, binding equity, transferring equity, and redeeming equity, in which caller entitlements are checked.
The rights authenticator authenticates the rights issuer, binds the digital certificate to the authenticated rights issuer, and sets the rights type allowed to be issued for the issuer.
The authentication party authenticates the rights and interests party in real name, and binds the digital certificate for the authenticated rights and interests party. The holder only allows the user account to hold the rights and interests after the holder passes the authentication.
In the equity issue phase, the issuing party invokes the equity management contract to generate an issue batch. The description of the release lot is described with reference to the data model shown in FIG. 3.
The two issuing parties sign together, and binding is generated for the issuing rights and interests of the two issuing batches. The binding relationship constrains the master-slave relationship, the binding type, between the two release batches. The bound data model is illustrated with reference to the data model shown in FIG. 3.
The issuing party calls the contract method, specifies the information of the rights and interests type, whether the transfer is allowed or not, issues the batch and the like, issues the rights and saves the certificate on the chain.
In the equity circulation stage, the issuer modifies the holder who issues the equity into the holder by calling the equity selling method of the equity management contract, so that the holder obtains the equity.
If the issued rights are set to allow the transfer of the rights, the rights holder may then invoke the transfer method of the rights management contract to transfer to other rights holders after obtaining the rights. If the master equity is set to allow transfer, then at the transfer time, the above bound slave equity is also transferred to the new holder. If the slave rights are set to allow transfer, the master rights holder bound from the slave rights can unbind the slave rights and transfer the slave rights to a new holder.
In the equity exchange stage, the equity holder sends equity consumption certificate (i.e. signature transaction consuming the designated amount of equity) to the issuer according to the conditions set by equity, and requires consumption equity exchange service.
After the issuer verifies that the right and interest consumption certificate passes, and after the chain fulfills the right and interest promise, the right and interest consumption certificate is submitted to the block chain, and after the signature transaction is blocked, the consumption amount corresponding to the right and interest is deducted.
After the owner consumes the rights and interests, a rights and interests evaluation method of the rights and interests management contract is called, and the rights and interests of cashing are evaluated.
After the holder consumes the rights and interests, the rights issuer calls the user evaluation method of the rights and interests management contract, and evaluating the holder according to the interest of the cash.
Fig. 3 shows a data model illustration of blockchain entitlement management according to an example embodiment of the present application.
When the rights and interests are issued, the right and interests issuing method of the rights and interests management contract is called through an issuer, the issuer fills in the attribute values of Id, bId, sn, tn, tmIssue and issuer, signs the attribute values and stores the certificate on a chain; if the batch to which the rights and interests belong is not empty and the batch is associated with the rights and interests binding, setting a bound master rights and interests identifier Ticket. In the process of binding rights and interests, for random binding, a random distribution result pos of the rights and interests is determined according to a random distribution algorithm, and then the rights and interests are bound according to the random distribution result.
When the issuer sells rights and interests to the holder, the issuer calls a rights and interests management contract selling method, sets the holder socket.
When the rights and interests are transferred between the holders, the transfer party calls a rights and interests transfer method of the rights and interests management contract, and the ticket.
When the issuer exchanges the rights and interests with the holder, the holder constructs a signature transaction for consumption, and deducts the remaining amount of time. After the cashing is completed, the owner calls an interest evaluation method of the interest management contract and sets an interest score Ticket.
Issue batches have common characteristics for constraining the rights of the same batch, including the total number of issues batch, the type of rights batch, mode ("Ts" stands for single ticket, "Tm" stands for multiple ticket, "C" stands for discount coupon, "P" stands for score, etc.), the details of the rights corresponding to the type of rights (e.g., percentage of discount batch. Rate), the expiration time batch, the usage rule specification batch.
Rights binding establishes a binding relationship between rights of two lots, defining a master-slave relationship of the two (where bind. Mbid represents a bound rights lot identity and bind. Sbid represents a bound from rights lot identity), a binding type of bind. Mode ("D" represents a deterministic binding and "R" represents a random binding), confirmed by a common signature (signatureM, signatureS) of the issuers of the two lots.
The user account defines a unique identification Id of the user, including a digital certificate account, start of the user public key, a user group account, group ("1" chain administrator, "2" authenticator, "3" issuer, "4" owner), and for the issuer, a set account, issuemodes of rights types allowed to be issued are further described. The user credit calculated according to the determined rule is also included.
Fig. 4 shows a rights state explanation diagram according to an example embodiment of the present application.
Referring to fig. 4, the transition of rights between the various states is described as follows.
The rights and interests are disclosed: the issuer issues the rights and interests through the signature transaction, and after the signature transaction is finished, the rights and interests are in a public state. The equity may be retrieved by an equity identification, or a signed transaction identification.
And (4) rights and interests binding: if the rights and interests exist in the issuing batch in the binding relationship when the rights and interests are issued, the rights and interests are bound in the master-slave relationship through the tid attribute of the rights and interests data structure by the binding rule in the contract logic.
The rights and interests: the owner can obtain the main rights and interests from the issuer through purchase or gift, and can obtain the bound auxiliary rights and interests at the same time. For the rights to allow the transfer, the transfer may be between the holders.
For the rights set by the validity period, the rights are invalid after the validity period is exceeded.
And (4) equity exchange payment: the holder requests the issuer to pay the right through the signature transaction showing the consumption right, and after the issuer verifies the right to be valid, the transaction is submitted to the link, and the corresponding consumption amount is deducted. Non-one-time equity allows for multiple redemptions.
And (4) right evaluation: after redemption is complete, the issuer and the holder may mutually evaluate based on equity.
Fig. 5 illustrates a rights binding flow diagram according to an example embodiment of the present application.
Referring to fig. 5, the rights binding refers to binding the rights from the lot to the master at the time of rights issue according to the binding relationship between the lots to which the rights belong (i.e. set ticket.tid of the slave = ticket.id of the master), and the procedure is as follows:
1) Firstly, obtaining a binding set bs associated with the right lot according to the lot where the right t to be issued is located, namely bind.mbid = t.bid (the right to be issued is a main right in the binding relationship) of each binding in the binding set, or bind.sbid = t.bid (the right to be issued is a slave right in the binding relationship).
2) The current binding is obtained from the binding set.
3) And if the right to be issued belongs to the bound main right, taking the sequence number Ticket.sn in the batch as a distribution position Ticket.pos, and turning to the step 4).
4) Among the issued and unbound rights belonging to the binding rule, a slave right (the matching rule is the same for the distribution location ticket. In this case, the experience of the buyer of the principal right to obtain the subordinate right is similar to a blind box when the following conditions are satisfied: a. preceded by the benefit; b. the binding type is random binding; c. the principal rights and interests are issued immediately for instant selling, namely the principal rights and interests are not issued in advance, but are issued temporarily according to the increasing sequence number Ticket.
5) And if the rights and interests to be issued belong to the bound subordinate rights and interests, further judging whether the binding rule is a random binding rule, if so, calculating the distribution position of the rights and interests in the binding rule, and turning to the step 7).
6) And if the rights and interests to be issued belong to the bound subordinate rights and the binding rule is the deterministic binding, taking the sequence number Ticket.
7) And finding one of issued and unbound principal rights belonging to the binding rule (the matching rule is that the distribution positions are the same in Ticket.
8) And acquiring the next binding, if not, turning to the step 2), and otherwise, ending the flow.
According to some embodiments, the different rights may be bound in a deterministic or random manner, provided that agreement is reached between the rights issuers.
The main right and the auxiliary right are in one-to-many relationship, one main right can correspond to a plurality of auxiliary rights, and one auxiliary right only corresponds to one main right.
For the deterministic binding, the master rights and the slave rights are in one-to-one correspondence, so that the total number issued from the rights batch is only required to be consistent with the total number issued from the master rights batch, and then the serial number in the batch is taken from the distribution position of the rights.
For random bindings, the total number of issues of master-slave rights is not equal. The position calculation rule of randomness should guarantee randomness, fairness, unpredictability and verifiability of rights and interests binding. The verifiability is realized by issuing the calculation rule in a contract form and locally and repeatedly executing a signature transaction sequence of the block after acquiring the data of the block chain; an algorithm to achieve randomness, fairness, unpredictability is as follows:
setting a binding bi, namely binding N slave benefits to M master benefits according to a random drawing rule, wherein M is greater than N, namely the master benefits Ti (i takes values of 1-M) are issued in a total number M, and the slave benefits Tj (j takes values of 1-N) are issued in a total number N;
taking the position of the main right as a serial number in the batch, namely Ti.pos = Ti.sn;
the position calculation rule for the subordinate benefits is: pos = Hash (VRF (preblock _ Hash) + tj.id) mod M +1, and the specific steps are as follows:
a) The consensus adopts two-stage consensus, the first stage performs consensus on the signature transaction sequence and does not execute a contract method called by the signature transaction; the second phase executes the contract method invoked by the signature transaction sequence, performing consensus on the account book state transition caused by execution;
b) After a signature transaction sequence is determined in the first stage, hashing is carried out on the signature transaction sequence to obtain preblock _ hash, and then a block node collects preblock _ hash from each consensus node to execute a result Vk of VRF (k takes a value of 1-P, wherein P is the total number of the consensus nodes);
c) Sorting by using the account identifiers of the common identification nodes, and sequentially adding the results Vk to obtain VRF (preblock _ hash); VRF (preblock _ hash) is random and unpredictable unless all consensus nodes collude;
d) In a second stage of consensus, executing a contract method called in signature transaction, adding VRF (preblock _ Hash) and the identifier of the right Tj when the randomly distributed position (ctx.api. RandPos) of the slave right needs to be calculated in a right issue method CMTicket.issue, and then solving Hash for the result;
e) And (3) performing modulo operation on M by adopting a large number, performing modulo operation on the Hash result of the previous step to obtain a number randomly distributed between 0 and M, and adding 1 to obtain a position Tj.pos of the right Tj.
For the promotion activities with smaller preference, the distribution amount is larger, and the deterministic binding can be carried out. For promotions offering a larger (e.g. free) release the number is relatively small, then random binding is used. The application supports two binding rules by using one data model, and the implementation cost is low.
Through the rights and interests binding rule, the combined promotion and drainage activities among the rights and interests issuers are realized. The authenticity, the normative of the activity fairness can be verified. By introducing a Verifiable Random Function (VRF) in the rights-binding rules, the binding results of the rights using the random binding rules are made to support redemption in the field and are unpredictable.
Fig. 6 illustrates a rights redemption flow diagram according to an example embodiment of the present application.
Referring to fig. 6, the right and interest exchange payment means that the holder calls a contract method cmticket.pay through signature transaction, requires the issuer to provide a committed service, and calls a cmticket.mark through signature transaction after service exchange to evaluate the exchanged right and interest, and the process is as follows:
1) The holder selects rights and consumption limits, constructs signature transaction t, and calls a contract method CMTicket.
2) The issuer receives the signature transaction t, verifies the signature of the holder, and goes to the end if the verification fails, and goes to step 3) if the verification passes.
3) The issuer locally verifies whether the remaining amount of the rights is enough, the verification is not passed to the end, and the step 4) is passed.
4) The issuer submits the signature transaction t to the blockchain networking, and on the other hand, the issuer provides services according to the consumption amount online.
5) And (5) a transaction t-out block, and updating the surplus amount of the rights and interests in the state of the account book by the block chain node at the same time.
6) And after the transaction t is blocked, the holder calls a contract method CMTicket.
7) The flow ends.
According to some embodiments, through a chain contract, an issuer issues equity providing some service commitment; the holder gains the right through purchase or admission; appointing among the issuers and binding rights and interests; the rights and interests of allowing the circulation can be transferred among the holding parties; the issuer has obligation to provide corresponding service for the right and interest holder with the exchange right and interest promise; after the owner consumes the rights and interests, the owner has the right to evaluate the rights and interests exchange quality.
It should be clearly understood that this application describes how to make and use particular examples, but the application is not limited to any details of these examples. Rather, these principles can be applied to many other embodiments based on the teachings of the present disclosure.
Those skilled in the art will appreciate that all or part of the steps to implement the above embodiments are implemented as a computer program executed by a CPU. When the computer program is executed by the CPU, the program for executing the above-mentioned functions defined by the above-mentioned methods provided in the present application may be stored in a computer-readable storage medium, which may be a read-only memory, a magnetic or optical disk, or the like.
Furthermore, it should be noted that the above-mentioned figures are only schematic illustrations of the processes involved in the method according to exemplary embodiments of the present application, and are not intended to be limiting. It will be readily appreciated that the processes illustrated in the above figures are not intended to indicate or limit the temporal order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
Having described example embodiments, those skilled in the art will readily appreciate that the method of blockchain entitlement management according to embodiments of the present application has at least one or more of the following advantages.
According to an example embodiment, equity is made available to carry entity economic activity commitments by introducing equity type definitions. Identity authentication is carried out on each party, and the behaviors in the whole process of rights and interests are stored, so that the authenticity of the behaviors of each party can be traced, and the tracing of illegal behaviors is facilitated.
According to example embodiments, joint promotional and drainage activities between rights issuers are enabled through rights binding rules. The authenticity, normalization, fairness of the activity may be verified.
According to the example embodiment, transfer flow of equity is realized, and true compliance of equity sources can be conveniently verified. Based on the identity authentication and the evaluation of equity consumption, the source of the evaluation results may be verified.
FIG. 7 shows a block diagram of an electronic device according to an example embodiment.
An electronic device 200 according to this embodiment of the present application is described below with reference to fig. 7. The electronic device 200 shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 7, the electronic device 200 is embodied in the form of a general purpose computing device. The components of the electronic device 200 may include, but are not limited to: at least one processing unit 210, at least one memory unit 220, a bus 230 connecting different system components (including the memory unit 220 and the processing unit 210), a display unit 240, and the like.
Wherein the storage unit stores program code that can be executed by the processing unit 210 such that the processing unit 210 performs the methods according to various exemplary embodiments of the present application described herein.
The storage unit 220 may include readable media in the form of volatile storage units, such as a random access memory unit (RAM) 2201 and/or a cache memory unit 2202, and may further include a read only memory unit (ROM) 2203.
The storage unit 220 can also include a program/utility 2204 having a set (at least one) of program modules 2205, such program modules 2205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
Bus 230 may be one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 200 may also communicate with one or more external devices 300 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 200, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 200 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 250. Also, the electronic device 200 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via the network adapter 260. The network adapter 260 may communicate with other modules of the electronic device 200 via the bus 230. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 200, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. The technical solution according to the embodiments of the present application may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, or a network device, etc.) to execute the above method according to the embodiments of the present application.
The software product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable storage medium may include a propagated data signal with a baseband or as part of a carrier wave, in which readable program code is carried. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. The readable storage medium may also be any readable medium other than a readable storage medium, the readable medium can transmit, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. Where remote computing devices are involved, the remote computing devices may communicate over any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), to a user computing device, or may be connected to an external computing device (e.g., through an internet connection using an internet service provider).
Those skilled in the art will appreciate that the modules described above may be distributed in the apparatus according to the description of the embodiments, or may be modified accordingly in one or more apparatuses unique from the embodiments. The modules of the above embodiments may be combined into one module, or further split into multiple sub-modules.
Exemplary embodiments of the present application are specifically illustrated and described above. It is to be understood that the application is not limited to the details of construction, arrangement, or method of implementation described herein; on the contrary, the intention is to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims (15)

1. A method for block chain entitlement management, comprising:
generating, by a first intelligent contract, an issuance batch for a first issuer to issue a first entitlement;
generating, by the first intelligent contract, an issuance batch for the second issuer to issue the second entitlement;
and when the first right and the second right are issued, if the issuing batch where the first right and the second right are located has a binding relationship, the first right and the second right are bound according to the binding relationship through the first intelligent contract.
2. The method of claim 1, wherein the issuance lot includes an issuance total, a type of equity, an expiration time, and an initial quota.
3. The method of claim 2, wherein the binding relationship comprises the first right and the second right being in a master-slave relationship.
4. The method of claim 3, further comprising:
authenticating the rights issuer through a second intelligent contract, binding a digital certificate for the authenticated rights issuer and setting a rights type allowed to be issued;
and authenticating the rights holder through the second intelligent contract, and binding a digital certificate for the authenticated rights holder.
5. The method of claim 4, further comprising:
the transfer of the rights between holders is conducted via the first intelligent contract.
6. The method of claim 5, wherein said transferring the rights between holders via the first intelligent contract comprises:
modifying the holder of the right by calling a right selling method of the first intelligent contract so that the holder obtains the right.
7. The method of claim 6, wherein said transferring said rights between holders via said first intelligent contract further comprises:
if the issued equity is set to allow transfer, the equity holder obtains the equity and transfers the equity to other equity holders by calling a circulation method of the first intelligent contract;
if the issued equity has an expiration date and is not redeemed for use within the expiration date, the state of the equity is changed to invalid.
8. The method of claim 7, further comprising:
and carrying out rights and interests cashing through the first intelligent contract.
9. The method of claim 8, wherein the redemption of rights via the first smart contract comprises:
and sending a right consumption certificate to the right issuer by the right holder for right redemption, wherein the right consumption certificate is a signature transaction for consuming the designated amount of the right.
10. The method of claim 9, wherein the redemption of rights via the first smart contract further comprises:
and verifying the right consumption certificate by the right issuer, wherein the verification comprises the verification of a bearer signature, the verification of the right validity period and the verification of the right surplus limit.
11. The method of claim 10, wherein the redemption of rights through the first smart contract further comprises:
submitting, by the equity issuer, a signed transaction to consume the equity designated credit to a blockchain after the verification passes and after the equity is consumed;
and after the signature transaction is blocked, deducting the consumption amount corresponding to the equity consumption.
12. The method of claim 11, further comprising:
and evaluating the rights and interests redemption through the first intelligent contract.
13. The method of claim 12, wherein said evaluating the redemption of the right by the first intelligent contract comprises:
and after the rights holder consumes the rights, calling a rights evaluation method of the first intelligent contract to evaluate the rights of the cash.
14. The method of claim 13, wherein the evaluating the redemption of the right by the first intelligent contract further comprises:
after the rights holder consumes rights, a user evaluation method of the first intelligent contract is invoked by the rights issuer to evaluate the rights holder.
15. An electronic device, comprising:
memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the method of any of the preceding claims 1-14 when executing the computer program.
CN202210759161.3A 2022-06-29 2022-06-29 Block chain rights management method and electronic equipment Pending CN115147114A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210759161.3A CN115147114A (en) 2022-06-29 2022-06-29 Block chain rights management method and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210759161.3A CN115147114A (en) 2022-06-29 2022-06-29 Block chain rights management method and electronic equipment

Publications (1)

Publication Number Publication Date
CN115147114A true CN115147114A (en) 2022-10-04

Family

ID=83410953

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210759161.3A Pending CN115147114A (en) 2022-06-29 2022-06-29 Block chain rights management method and electronic equipment

Country Status (1)

Country Link
CN (1) CN115147114A (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103617539A (en) * 2013-11-27 2014-03-05 上海新大陆翼码信息科技有限公司 Method and system for electronic ticket management
CN107146101A (en) * 2017-04-24 2017-09-08 杭州趣链科技有限公司 A kind of universal electric issuing preferential tickets method based on block chain
CN111784517A (en) * 2020-06-24 2020-10-16 杭州溪塔科技有限公司 Block chain-based coupon management method and system, electronic equipment and storage medium
CN111967894A (en) * 2020-07-23 2020-11-20 王李琰 Ticket marketing method and system and block chain platform
WO2022016453A1 (en) * 2020-07-23 2022-01-27 王李琰 Ticket marketing method and system, and blockchain platform
CN114377402A (en) * 2022-01-23 2022-04-22 北京瑞策科技有限公司 Lottery drawing method and device in block chain game
CN114548989A (en) * 2022-02-25 2022-05-27 北京天德科技有限公司 Rights and interests management system based on NFR
CN114548987A (en) * 2022-02-25 2022-05-27 北京天德科技有限公司 Anti-cheating and supervision NFR (network File System) rights and interests flow conversion intelligent contract and method thereof
CN114663093A (en) * 2022-03-28 2022-06-24 上海星图比特信息技术服务有限公司 Block chain-based digital collection transaction method and equipment

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103617539A (en) * 2013-11-27 2014-03-05 上海新大陆翼码信息科技有限公司 Method and system for electronic ticket management
CN107146101A (en) * 2017-04-24 2017-09-08 杭州趣链科技有限公司 A kind of universal electric issuing preferential tickets method based on block chain
CN111784517A (en) * 2020-06-24 2020-10-16 杭州溪塔科技有限公司 Block chain-based coupon management method and system, electronic equipment and storage medium
CN111967894A (en) * 2020-07-23 2020-11-20 王李琰 Ticket marketing method and system and block chain platform
WO2022016453A1 (en) * 2020-07-23 2022-01-27 王李琰 Ticket marketing method and system, and blockchain platform
CN114377402A (en) * 2022-01-23 2022-04-22 北京瑞策科技有限公司 Lottery drawing method and device in block chain game
CN114548989A (en) * 2022-02-25 2022-05-27 北京天德科技有限公司 Rights and interests management system based on NFR
CN114548987A (en) * 2022-02-25 2022-05-27 北京天德科技有限公司 Anti-cheating and supervision NFR (network File System) rights and interests flow conversion intelligent contract and method thereof
CN114663093A (en) * 2022-03-28 2022-06-24 上海星图比特信息技术服务有限公司 Block chain-based digital collection transaction method and equipment

Similar Documents

Publication Publication Date Title
JP7429281B2 (en) Methods and systems for directing exchanges associated with tokens held anonymously on a blockchain
CN109155036B (en) System and method for controlling asset-related actions via blockchain
US20220156738A1 (en) Methods and systems of using a cryptocurrency system to manage payments and payment alternatives
Baum et al. P2DEX: privacy-preserving decentralized cryptocurrency exchange
JP7377312B2 (en) Systems and methods realized by blockchain
JP6511201B1 (en) Registry and Automated Management Method for Sophisticated Trading Enforced by Blockchain
JP6851386B2 (en) Methods and systems for efficient transfer of entities on the blockchain
JP6925346B2 (en) Exchange using blockchain-based tokenization
US20200058023A1 (en) Decentralized Data Marketplace
CN114730422A (en) System and method for commerce in a distributed system with blockchain protocol and intelligent contracts
CN110520883B (en) Method and apparatus for processing certificates in a blockchain system
CN118037290A (en) System and method for block chain implementation
CN106991573A (en) Art work fidelity method and server based on block chain technology
CN110178338A (en) Digital securitisation, blurring, strategy and the commercial affairs of event ticket
CN110796449B (en) Transaction processing method, system, medium and computing device
Babel et al. Enabling end-to-end digital carbon emission tracing with shielded NFTs
CN109937420A (en) Go the distributed bridge joint network platform of identificationization
CN111429134A (en) Data transaction method and device based on block chain
CN111915349A (en) Cross-platform integral using system and method based on block chain
CN113221191B (en) Block chain-based data evidence storage method, device, equipment and storage medium
Parra-Moyano et al. Optimized and dynamic kyc system based on blockchain technology
CN115147114A (en) Block chain rights management method and electronic equipment
WO2021060340A1 (en) Transaction information processing system
Datta et al. BlockChain I/O: Enabling Cross-Chain Commerce
Castell Ferreres Development of a DAPP

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