Decentralization-based domain name access method, device, equipment and storage medium

Abstract

This application provides a decentralized domain name access method, apparatus, device, and storage medium, relating to the field of blockchain technology. The method includes: obtaining a target access request sent by a first access device, the target access request including a target decentralized identity identifier; whether the target decentralized identity identifier can be registered on a second blockchain is determined by the second blockchain based on a preset verification algorithm to verify the target registration request sent by a preset management system, and the target decentralized identity identifier has been successfully registered on the first blockchain; if it is determined that the target decentralized identity identifier has been successfully registered on the second blockchain, then accessing the target blockchain address corresponding to the target decentralized identity identifier according to the target access request, thereby enabling the registration of a target decentralized identity identifier representing the same user on multiple blockchains, thus ensuring domain name consistency across the entire blockchain.

Description

Technical Field

[0001] This application relates to the field of blockchain technology, and in particular to a decentralized domain name access method, device, equipment and storage medium. Background Technology

[0002] A blockchain is essentially a chain of blocks. Each block contains specific information, and these blocks are linked together in chronological order of their creation. This chain is stored on various servers, and as long as at least one server in the system is operational, the entire blockchain is secure. These servers are called nodes in the blockchain system, and they provide storage space and computing power for the entire system.

[0003] In existing technologies, when registering a decentralized identity (DID) based on the current blockchain, it is often only necessary to complete the registration process on the current blockchain.

[0004] As can be seen, the existing registration method is relatively simple. Therefore, there are often situations where a user registers a domain name on the current blockchain, but other users register it first, which makes it impossible to register on other blockchains and achieve domain name unification across the entire blockchain. Summary of the Invention

[0005] The purpose of this application is to address the shortcomings of the prior art by providing a decentralized domain name access method, device, equipment, and storage medium that can achieve domain name unification across the entire blockchain.

[0006] To achieve the above objectives, the technical solutions adopted in the embodiments of this application are as follows:

[0007] In a first aspect, the present invention provides a decentralized domain name access method applied to a second blockchain, the second blockchain being communicatively connected to a preset management system, the method comprising:

[0008] Obtain a target access request sent by a first access device. The target access request includes a target decentralized identity identifier. Whether the target decentralized identity identifier can be registered on the second blockchain is determined by the second blockchain based on a preset verification algorithm to verify the target registration request sent by the preset management system. The target decentralized identity identifier has been successfully registered on the first blockchain. The preset verification algorithm is used to determine whether the target registration request is valid.

[0009] If it is determined that the target decentralized identity has been successfully registered on the second blockchain, then the target blockchain address corresponding to the target decentralized identity is accessed according to the target access request.

[0010] In an optional implementation, the method further includes:

[0011] The system receives a target registration request sent by a preset management system. The target registration request is generated based on an initial registration request sent by a first blockchain. The initial registration request carries initial registration parameters, and the target registration request carries the initial registration parameters and a first master hash value corresponding to the target hash sequence in the initial registration parameters. The initial registration parameters include: a target blockchain address, an identifier of a second blockchain, a target decentralized identity identifier, a second preset registration parameter corresponding to the target decentralized identity identifier, and the position of the target hash value corresponding to the target decentralized identity identifier in the target hash sequence. The target hash value is obtained by performing a hash operation on the first preset registration parameters and the target decentralized identity identifier.

[0012] Based on a preset verification algorithm, the initial hash value corresponding to the target decentralized identity is calculated according to the target decentralized identity and the second preset registration parameter corresponding to the target decentralized identity.

[0013] Based on the initial hash value, the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, and the target hash sequence, it is determined whether the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain.

[0014] In an optional implementation, determining whether the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain based on the initial hash value, the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, and the target hash sequence includes:

[0015] Based on the position of the target hash value in the target hash sequence, the target hash sequence is updated using the initial hash value to obtain the initial hash sequence;

[0016] Calculate the second master hash value corresponding to the initial hash sequence;

[0017] If the first master hash value is determined to be the same as the second master hash value, then the target decentralized identity can be registered on the second blockchain, and the target decentralized identity is registered at the target blockchain address of the second blockchain.

[0018] In an optional implementation, calculating the second master hash value corresponding to the initial hash sequence includes:

[0019] Based on a preset grouping algorithm, the initial hash sequence is grouped to obtain at least one first hash group;

[0020] Calculate the sub-hash value of each of the first hash groups, and combine them according to the sub-hash values ​​of each of the first hash groups to obtain a first combined hash sequence;

[0021] If it is determined that the first combined hash sequence contains multiple sub-hash values, then the first combined hash sequence is cyclically grouped based on the preset grouping algorithm, thereby iterating over the second main hash value corresponding to the initial hash sequence.

[0022] In an optional implementation, the step of calculating the sub-hash value of each of the first hash groups and combining them according to the sub-hash values ​​of each of the first hash groups to obtain a first combined hash sequence includes:

[0023] Based on the Merkle tree algorithm, the initial hash value within each of the first hash groups is hashed to obtain the sub-hash value of each of the first hash groups;

[0024] The sub-hash values ​​of each of the first hash groups are combined to obtain the first combined hash sequence.

[0025] In an optional implementation, the target hash sequence includes multiple hash values, which include the target hash value and at least one other hash value, each of the other hash values ​​corresponding to a decentralized identity identifier, and the target hash value and at least one other hash value in the target hash sequence are ordered sequentially according to the registration order of each of the decentralized identity identifiers on the first blockchain.

[0026] In an optional implementation, the first blockchain is the Ethereum blockchain, and the second blockchain is the Solana blockchain.

[0027] Secondly, the present invention provides a decentralized domain name access device applied to a second blockchain, the second blockchain being communicatively connected to a preset management system, the domain name access device comprising:

[0028] The acquisition module is used to acquire a target access request sent by a first access device. The target access request includes a target decentralized identity identifier. Whether the target decentralized identity identifier can be registered on the second blockchain is determined by the second blockchain based on a preset verification algorithm to verify the target registration request sent by the preset management system. The target decentralized identity identifier has been successfully registered on the first blockchain. The preset verification algorithm is used to determine whether the target registration request is valid.

[0029] The access module is used to access the target blockchain address corresponding to the target decentralized identity if it is determined that the target decentralized identity has been successfully registered on the second blockchain, based on the target access request.

[0030] In an optional implementation, the domain name access device further includes: a registration module, configured to receive a target registration request sent by a preset management system, the target registration request being generated based on an initial registration request sent by a first blockchain, the initial registration request carrying initial registration parameters, and the target registration request carrying the initial registration parameters and a first master hash value corresponding to a target hash sequence in the initial registration parameters; the initial registration parameters include: a target blockchain address, an identifier of a second blockchain, a target decentralized identity identifier, a second preset registration parameter corresponding to the target decentralized identity identifier, and the position of the target hash value corresponding to the target decentralized identity identifier in the target hash sequence, the target hash value being obtained by performing a hash operation on the first preset registration parameters and the target decentralized identity identifier;

[0031] Based on a preset verification algorithm, the initial hash value corresponding to the target decentralized identity is calculated according to the target decentralized identity and the second preset registration parameter corresponding to the target decentralized identity.

[0032] Based on the initial hash value, the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, and the target hash sequence, it is determined whether the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain.

[0033] In an optional implementation, the registration module is specifically used to update the target hash sequence using the initial hash value based on the position of the target hash value in the target hash sequence, thereby obtaining an initial hash sequence;

[0034] Calculate the second master hash value corresponding to the initial hash sequence;

[0035] If the first master hash value is determined to be the same as the second master hash value, then the target decentralized identity can be registered on the second blockchain, and the target decentralized identity is registered at the target blockchain address of the second blockchain.

[0036] In an optional implementation, the registration module is specifically used to perform a grouping operation on the initial hash sequence based on a preset grouping algorithm to obtain at least one first hash group;

[0037] Calculate the sub-hash value of each of the first hash groups, and combine them according to the sub-hash values ​​of each of the first hash groups to obtain a first combined hash sequence;

[0038] If it is determined that the first combined hash sequence contains multiple sub-hash values, then the first combined hash sequence is cyclically grouped based on the preset grouping algorithm, thereby iterating over the second main hash value corresponding to the initial hash sequence.

[0039] In an optional implementation, the registration module is specifically used to perform hash calculations on the initial hash values ​​within each of the first hash groups based on the Merkle tree algorithm to obtain the sub-hash values ​​of each of the first hash groups;

[0040] The sub-hash values ​​of each of the first hash groups are combined to obtain the first combined hash sequence.

[0041] In an optional implementation, the target hash sequence includes multiple hash values, which include the target hash value and at least one other hash value, each of the other hash values ​​corresponding to a decentralized identity identifier, and the target hash value and at least one other hash value in the target hash sequence are ordered sequentially according to the registration order of each of the decentralized identity identifiers on the first blockchain.

[0042] In an optional implementation, the first blockchain is the Ethereum blockchain, and the second blockchain is the Solana blockchain.

[0043] Thirdly, the present invention provides an electronic device, comprising: a processor, a storage medium, and a bus, wherein the storage medium stores machine-readable instructions executable by the processor, and when the electronic device is running, the processor communicates with the storage medium via the bus, and the processor executes the machine-readable instructions to perform the steps of the decentralized domain name access method as described in any of the foregoing embodiments.

[0044] Fourthly, the present invention provides a computer-readable storage medium storing a computer program, which, when executed by a processor, performs the steps of the decentralized domain name access method as described in any of the foregoing embodiments.

[0045] The beneficial effects of this application are:

[0046] This application provides a decentralized domain name access method, apparatus, device, and storage medium that can be applied to a second blockchain. The method includes: obtaining a target access request sent by a first access device, the target access request including a target decentralized identity identifier, wherein whether the target decentralized identity identifier can be registered on the second blockchain is determined by the second blockchain based on a preset verification algorithm to verify the target registration request sent by a preset management system, and the target decentralized identity identifier has been successfully registered on the first blockchain. The preset verification algorithm is used to determine whether the target registration request is valid. If it is determined that the target decentralized identity identifier has been successfully registered on the second blockchain, then the target blockchain address corresponding to the target decentralized identity identifier is accessed according to the target access request. By applying this application embodiment, through the settings of the preset management system, even if the target decentralized identity identifier has been successfully registered on the first blockchain, the second blockchain can also verify the validity of the target registration request sent by the preset management system based on the preset verification algorithm, and if the verification is successful, it can successfully access its corresponding target blockchain address, so that the same domain name represents the same user on different blockchains, achieving domain name unification across the entire blockchain. Attached Figure Description

[0047] To more clearly illustrate the technical solutions of the embodiments of this application, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of this application and should not be regarded as a limitation of the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0048] Figure 1 A decentralized domain name access system architecture diagram is provided for embodiments of this application;

[0049] Figure 2 A flowchart illustrating a decentralized domain name access method provided in this application embodiment;

[0050] Figure 3 A flowchart illustrating another decentralized domain name access method provided in this application embodiment;

[0051] Figure 4 A flowchart illustrating yet another decentralized domain name access method provided in this application embodiment;

[0052] Figure 5 A schematic diagram of the functional modules of another decentralized domain name access device provided in this application embodiment;

[0053] Figure 6A schematic diagram of the functional modules of another decentralized domain name access device provided in this application embodiment;

[0054] Figure 7 A schematic diagram of the functional modules of a decentralized domain name access device provided in this application embodiment;

[0055] Figure 8 This is a schematic diagram of an electronic device structure provided in an embodiment of this application. Detailed Implementation

[0056] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. The components of the embodiments of this application described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.

[0057] Therefore, the following detailed description of the embodiments of this application provided in the accompanying drawings is not intended to limit the scope of the claimed application, but merely to illustrate selected embodiments of the application. All other embodiments obtained by those skilled in the art based on the embodiments of this application without inventive effort are within the scope of protection of this application.

[0058] It should be noted that similar labels and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures.

[0059] In existing technologies, when registering a decentralized identity (DID) based on the current blockchain, the registration process typically only needs to be completed on the current blockchain. This means that existing registration methods do not consider transactions on other blockchains. Therefore, current registration methods often suffer from the problem that a domain name registered by a user on the current blockchain cannot be registered on other blockchains. For example, taking the Ethereum blockchain as an example, the current registration method can only ensure that a domain name XXXX represents user A on the Ethereum blockchain, while on other blockchains (such as Solana), it might be registered by user B. This demonstrates that the current registration method suffers from a lack of domain name consistency across the entire blockchain.

[0060] In view of this, this application provides a decentralized domain name access method that enables the same domain name to represent the same user on different blockchains, thereby achieving domain name unification across the entire blockchain.

[0061] Figure 1 A decentralized domain name access system architecture diagram is provided for embodiments of this application, such as... Figure 1 As shown, the system may include: a first blockchain 10, a second blockchain 20, and a preset management system 30. The first blockchain 10 and the second blockchain 20 are different blockchains and independent of each other. The first blockchain 10 can serve as the first blockchain for the decentralized identity identifier of the registration target, and the second blockchain 20 can serve as a non-first blockchain for the decentralized identity identifier of the registration target, such as the second, third, or fifth blockchain, etc., without limitation. The first blockchain 10 and the second blockchain 20 can be connected to the preset management system 30 via a network 40. Optionally, the first blockchain 10 may include multiple first nodes 101, which can communicate with each other; the second blockchain may include multiple second nodes 201, which can communicate with each other.

[0062] Figure 2 This is a flowchart illustrating a decentralized domain name access method provided in an embodiment of this application. The method can be applied to the second blockchain in the aforementioned domain name access system. Optionally, the second blockchain can be the Ethereum blockchain, and the first blockchain can be the Solana blockchain. Figure 2 As shown, the method may include:

[0063] S101. Obtain the target access request sent by the first access device. The target access request includes: target decentralized identity identifier.

[0064] Whether the target decentralized identity can be registered on the second blockchain is determined by the second blockchain based on a preset verification algorithm to verify the target registration request sent by the preset management system, and the target decentralized identity has been successfully registered on the first blockchain.

[0065] As can be seen, for the first blockchain, since the target decentralized identity has been successfully registered on the first blockchain, the corresponding first blockchain address can be successfully accessed on the first blockchain through the target decentralized identity.

[0066] Optionally, the target decentralized identity can be set based on blockchain decentralized domain name systems such as the Ethereum Name System (ENS), the Decentralized Account System (DAS), and the Decentralized Domain Name Protocol (FIO). In some embodiments, the created target decentralized identity may include the following domain name keywords: eth, crypto, wallet, coin, etc., without limitation, and can be flexibly set according to the actual application scenario.

[0067] Based on the above explanation, it can be seen that for this target decentralized identity, it can first be registered on the first blockchain. After successful registration, if it is necessary to register on the second blockchain with the same target decentralized identity, the second blockchain can verify the validity of the target registration request sent by the preset verification management system based on a preset verification algorithm. If the verification is valid, it means that the target decentralized identity can be successfully registered on the second blockchain; otherwise, it means that the target decentralized identity cannot be successfully registered on the second blockchain. It can be understood that if the target decentralized identity can be successfully registered on the second blockchain, it means that the corresponding target blockchain address can be accessed through the target decentralized identity on the second blockchain.

[0068] Optionally, the aforementioned target access request can be initiated by the first accessing user through a first accessing device. Optionally, the first accessing device can be a computer, mobile terminal, wearable device (e.g., smartwatch), mining machine, etc., and is not limited here. It can be understood that the target access request carries a target decentralized identity identifier, that is, the accessing user intends to access the target blockchain address corresponding to it through the target decentralized identity identifier.

[0069] It should be noted that this application does not limit the specific access type. Optionally, the access type may be a buy transaction, sell transaction, transfer transaction, etc., which is not limited here and may vary depending on the actual application scenario.

[0070] S102. If it is determined that the target decentralized identity has been successfully registered on the second blockchain, then access the target blockchain address corresponding to the target decentralized identity according to the target access request.

[0071] The target blockchain address corresponding to the target decentralized identity can indicate the target transaction address. Optionally, the target blockchain address can also be understood as the transaction wallet address.

[0072] For the second blockchain, if it verifies that the target decentralized identity has been successfully registered on the second blockchain, then the second blockchain can access the target blockchain address corresponding to the target decentralized identity based on the target access request. In a specific transaction scenario, the second blockchain can then initiate a corresponding transaction application to the target blockchain address based on the target access request and complete the relevant transaction.

[0073] By applying the embodiments of this application, the second blockchain can verify the validity of the target registration request sent by the preset management system based on a preset verification algorithm after the target decentralized identity has been successfully registered on the first blockchain. If the verification is successful, the corresponding target blockchain address can be successfully accessed, so that the same domain name represents the same user on different blockchains, thus achieving domain name unification across the entire blockchain.

[0074] In summary, this application provides a decentralized domain name access method that can be applied to a second blockchain. The second blockchain is connected to a preset management system. The method includes: obtaining a target access request sent by a first access device. The target access request includes a target decentralized identity identifier. Whether the target decentralized identity identifier can be registered on the second blockchain is determined by the second blockchain based on a preset verification algorithm to verify the target registration request sent by the preset management system. The target decentralized identity identifier has been successfully registered on the first blockchain. The preset verification algorithm is used to determine whether the target registration request is valid. If it is determined that the target decentralized identity identifier has been successfully registered on the second blockchain, the target blockchain address corresponding to the target decentralized identity identifier is accessed according to the target access request. By applying this application embodiment, through the settings of the preset management system, even if the target decentralized identity identifier has been successfully registered on the first blockchain, the second blockchain can also verify the validity of the target registration request sent by the preset management system based on the preset verification algorithm. If the verification is successful, the corresponding target blockchain address can be successfully accessed, so that the same domain name represents the same user on different blockchains, achieving domain name unification across the entire blockchain.

[0075] Figure 3 This is a flowchart illustrating another decentralized domain name access method provided in an embodiment of this application. Optionally, as... Figure 3 As shown, the above method also includes:

[0076] S201. Receive the target registration request sent by the preset management system. The target registration request is generated based on the initial registration request sent by the first blockchain.

[0077] The initial registration request carries initial registration parameters, and the target registration request carries initial registration parameters and the first master hash value corresponding to the target hash sequence in the initial registration parameters.

[0078] The initial registration parameters include: the target blockchain address, the identifier of the second blockchain, the target decentralized identity identifier, the second preset registration parameter corresponding to the target decentralized identity identifier, and the position of the target hash value corresponding to the target decentralized identity identifier in the target hash sequence. The target hash value is obtained by performing a hash operation on the first preset registration parameter and the target decentralized identity identifier.

[0079] Optionally, the preset management system can be built on an Oracle network, and the preset management system can also communicate with the first blockchain. In some embodiments, if it is necessary to register a target decentralized identity that has been successfully registered on the first blockchain on the second blockchain, the user can initiate a registration application to the first blockchain through a registration device. The registration application can carry the first blockchain address bound to the target decentralized identity on the first blockchain, the identifier of the second blockchain, the target decentralized identity, the second preset registration parameters corresponding to the target decentralized identity, and the target blockchain address. The target blockchain address is also the preset blockchain address corresponding to the target decentralized identity registered on the second blockchain. Let the first blockchain address be addr_1, the identifier of the second blockchain be solana, the target decentralized identity be jack, the target blockchain address be addr_2, and the second preset registration parameter corresponding to the target decentralized identity be skinfo_2. Then, the information carried in the registration application can be recorded as (addr_1, solana, jack, skinfo_2, addr_2).

[0080] After receiving the registration application, the first blockchain can generate an initial registration request, which may carry the aforementioned initial registration parameters.

[0081] The second preset registration parameter corresponding to the target decentralized identity can be used to calculate the initial hash value corresponding to the target decentralized identity.

[0082] The target hash sequence is a hash sequence generated on the first blockchain that includes the target hash value. The position of the target hash value corresponding to the target decentralized identity in the target hash sequence indicates the order of the target hash value within the sequence. Optionally, this position can be any value such as 1, 3, or 5, depending on the specific application scenario.

[0083] Furthermore, the target hash value can be obtained by performing a hash operation on the first preset registration parameter and the target decentralized identity identifier. For example, let the target hash value be H. n+1If the first preset registration parameter is pkInfo_1, and the target decentralized identity is Jack, then the relationship between these three can be represented as: H n+1 =hash(Jack, pkInfo_1), where hash(skinfo_1)=pkinfo_1.

[0084] Based on the above explanation, it should be noted that, for the preset management system, after receiving the initial registration request carrying the initial registration parameters sent by the first blockchain, it can further calculate the first master hash value corresponding to the target hash sequence in the initial registration parameters.

[0085] Optionally, the registered user and the first access user may be the same user or different users; in addition, the registered device may be a computer, mobile terminal, wearable device (e.g., smartwatch), mining machine, etc., which are not limited here.

[0086] S202. Based on the preset verification algorithm, calculate the initial hash value corresponding to the target decentralized identity according to the target decentralized identity and the second preset registration parameter corresponding to the target decentralized identity.

[0087] Based on the above explanation, after the second blockchain receives the target registration request, it can calculate the initial hash value corresponding to the target decentralized identity based on the target decentralized identity identifier and the second preset registration parameters corresponding to the target decentralized identity identifier.

[0088] For example, let the initial hash value be H. k If the target decentralized identity is Jack and the second preset registration parameter is skinfo_2, then the initial hash value corresponding to the target decentralized identity can be calculated using the following formula: H n+1 =hash(Jack, hash(skinfo_2)), where hash(skinfo_2)=pkinfo_2.

[0089] S203. Based on the initial hash value, the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, and the target hash sequence, determine whether the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain.

[0090] Based on the above explanation, after calculating the initial hash value, the second blockchain can update the target hash sequence according to the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, thus obtaining the initial hash sequence. The initial hash sequence and the target hash sequence are then compared to determine whether the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain. If they are the same, it means the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain; otherwise, registration fails. Optionally, in this case, the second blockchain can delete the content related to the target decentralized identity, thereby freeing up memory on the second blockchain.

[0091] It should be noted that, for the pre-defined management system, after obtaining the first master hash value corresponding to the target hash sequence, it can store the target decentralized identity identifier and the corresponding first master hash value. Let the target decentralized identity identifier be 'jack', and the first master hash value be 'hash_root_1'. Optionally, a pre-defined mapping table (jack, hash_root_1) can be used to record this mapping relationship. In this way, when the pre-defined management system stores multiple decentralized identities, the pre-defined mapping table can be used to conveniently manage the master hash values ​​corresponding to each decentralized identity identifier.

[0092] Of course, it should be noted that, depending on the actual application scenario, the master hash value corresponding to each decentralized identity can also be updated. Optionally, for the second blockchain, a second preset mapping table can also be stored. This second preset mapping table can include at least one successfully registered decentralized identity and the master hash value corresponding to each decentralized identity. In some embodiments, if the preset management system includes multiple management nodes, and a preset number of these management nodes have updated the master hash value corresponding to a certain decentralized identity on the second blockchain and synchronized this update operation to the second blockchain, then the second blockchain can update the second preset mapping table accordingly, thereby achieving synchronous updates. Optionally, this preset number can be 2 / 3, 3 / 5, etc., of the total number of management nodes, and is not limited here.

[0093] Figure 4 This is a flowchart illustrating another decentralized domain name access method provided in an embodiment of this application. Optionally, as... Figure 4 As shown, the above determination of whether a target decentralized identity can be successfully registered at the target blockchain address in the second blockchain, based on the initial hash value, the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, and the target hash sequence, includes:

[0094] S301. Based on the position of the target hash value in the target hash sequence, update the target hash sequence using the initial hash value to obtain the initial hash sequence.

[0095] Specifically, during the update process, the target hash value in the target hash sequence can be replaced with the initial hash value based on the position of the target hash value in the target hash sequence, thereby obtaining the initial hash sequence.

[0096] S302. Calculate the second master hash value corresponding to the initial hash sequence.

[0097] S303. If it is determined that the first master hash value and the second master hash value are the same, then it is determined that the target decentralized identity can be registered on the second blockchain, and the target decentralized identity is registered at the target blockchain address on the second blockchain.

[0098] Based on the determined initial hash sequence, the second master hash value corresponding to this initial hash sequence can then be calculated. The first master hash value is then compared with this second master hash value. If they are the same, the verification is successful, confirming that the target decentralized identity can be registered at the target blockchain address on the second blockchain. Therefore, the target decentralized identity can be registered on the second blockchain. It should be noted that registration binds the target decentralized identity to the target blockchain address on the second blockchain; that is, access to the target blockchain address can be achieved through the target decentralized identity.

[0099] Figure 5 This is a flowchart illustrating another decentralized domain name access method provided in an embodiment of this application. Optionally, as... Figure 5 As shown, the calculation of the second primary hash value corresponding to the initial hash sequence includes:

[0100] S401. Based on a preset grouping algorithm, perform grouping operations on the initial hash sequence to obtain at least one first hash group.

[0101] S402. Calculate the sub-hash value of each first hash group, and combine the sub-hash values ​​of each first hash group to obtain the first combined hash sequence.

[0102] The preset grouping algorithm can indicate the number of hash values ​​within each hash group. Optionally, the number of hash values ​​within each hash group can be 2, meaning the initial hash sequence can be divided into at least one first hash group by grouping two hash values ​​together. Then, for each hash group, the sub-hash values ​​of each hash group can be calculated, and the sub-hash values ​​of each first hash group can be recombine to obtain the first combined hash sequence.

[0103] It should be noted that each hash group can correspond to a sub-hash value. The sub-hash values ​​in the first combined hash sequence obtained by the above calculation can include one or more, which is not limited here.

[0104] S403. If it is determined that there are multiple sub-hash values ​​in the first combined hash sequence, then the first combined hash sequence is cyclically grouped based on a preset grouping algorithm, thereby iterating over the second main hash value corresponding to the initial hash sequence.

[0105] Based on the first combined hash sequence obtained above, the number of sub-hash values ​​in the first combined hash sequence can be counted. If the number is determined to be multiple, the first combined hash sequence can be cyclically grouped according to the grouping principle of the preset grouping algorithm to obtain at least one second hash group. Referring to S402 above, for each second hash group, the sub-hash value of each second hash group can be calculated, and the second combined hash sequence can be obtained by combining the sub-hash values ​​of each second hash group. Referring to S403 above, for the second combined hash sequence, the cyclic grouping operation can be performed again until the second master hash value corresponding to the initial hash sequence can be determined.

[0106] It should be noted that the initial hash sequence corresponds to a second primary hash value. Furthermore, the calculation process for the first primary hash value is the same as that for the second primary hash value, and will not be repeated here.

[0107] Figure 6 This is a flowchart illustrating another decentralized domain name access method provided in an embodiment of this application. Optionally, as... Figure 6 As shown, the above calculation of the sub-hash values ​​of each first hash group, and the combination of the sub-hash values ​​of each first hash group to obtain the first combined hash sequence, includes:

[0108] S501. Based on the Merkle tree algorithm, perform hash calculation on the initial hash value in each first hash group to obtain the sub-hash value of each first hash group.

[0109] Based on the Merkle tree algorithm, each first hash group can be calculated separately to obtain its sub-hash value.

[0110] For example, if a first hash group includes initial hash values ​​h0 and h1, then the sub-hash value M0 of the first hash group can be expressed as: M0 = hash(h0 + h1). The calculation process for the sub-hash values ​​of other first hash groups can be found in the calculation process, which will not be repeated here.

[0111] S502. Combine the sub-hash values ​​of each first hash group to obtain the first combined hash sequence.

[0112] Based on the above explanation, after obtaining the sub-hash values ​​of each first hash group, the sub-hash values ​​of each first hash group can be combined sequentially to obtain the first combined hash sequence.

[0113] For example, in a certain application scenario, based on the order of some of the first hash groups in the initial hash sequence, the sub-hash values ​​corresponding to these first hash groups are M0, M1, M2, M3, M4, and M5, respectively. When combining them, they can be combined sequentially to obtain the first hash sequence L(M0, M1, M2, M3, M4, M5). It should be noted that this application does not limit the number of sub-hash values ​​in this first combined hash sequence; this number can vary depending on the actual application scenario.

[0114] Optionally, the target hash sequence includes multiple hash values, which include a target hash value and at least one other hash value, each other hash value corresponding to a decentralized identity identifier, and the target hash value and at least one other hash value in the target hash sequence are ordered sequentially according to the registration order of each decentralized identity identifier on the first blockchain.

[0115] Based on the above explanation, it can be seen that for the first blockchain, the target hash sequence stored on it may include a target hash value and at least one other hash value. The number of other hash values ​​is determined by the number of decentralized identity identifiers registered on the second blockchain during the historical time period, and the order of the target hash value and at least one other hash value in the target hash sequence is determined by the registration order of their corresponding decentralized identity identifiers.

[0116] For example, before the target decentralized identity corresponding to the target hash value is registered on the first blockchain, n other hash values ​​H1, H2, ..., H have already been registered on the first blockchain. nThe corresponding decentralized identity identifier, then the current hash sequence on the first blockchain should be K1(H1, H2, ..., H...). n Based on the current hash sequence, the target hash value H is... n+1 The corresponding target decentralized identity will be registered on the first blockchain as the (n+1)th decentralized identity. If the target decentralized identity is successfully registered on the first blockchain, the current hash sequence will be updated to obtain the target hash sequence, which can be represented as K2(H1, H2, ..., H...). n H n+1 ).

[0117] Optionally, the first blockchain is the Ethereum blockchain, and the second blockchain is the Solana blockchain.

[0118] The first blockchain and the second blockchain are different blockchains, but the specific types are not limited to this. Taking the first blockchain as an example, the first blockchain can optionally be any of the following blockchains: Solana, Polygon (formerly known as MATIC), Polkadot, Avalanche, etc., without limitation.

[0119] Furthermore, it is worth noting that, for the first blockchain, the aforementioned decentralized identity identifier is bound to the first blockchain address of the first blockchain.

[0120] In summary, by applying the embodiments of this application, the same domain name can represent the same user on multiple types of blockchains. Furthermore, when a target decentralized identity corresponds to a target user and has been registered on the first blockchain, even if the target decentralized identity is not registered on the second blockchain, other users cannot preemptively register the target decentralized identity on the second blockchain. In other words, regardless of whether the target user registers the target decentralized identity on the second blockchain, the target decentralized identity belongs to the target user, and other users cannot preemptively register it, which can improve the applicability of the method of this application.

[0121] Figure 7 This is a functional module diagram of a decentralized domain name access device provided in an embodiment of this application. The domain name access device is applied to a second blockchain, which is communicatively connected to a preset management system. The basic principle and technical effects of this device are the same as those in the aforementioned corresponding method embodiments. For the sake of brevity, parts not mentioned in this embodiment can be referred to the corresponding content in the method embodiments. Figure 7 As shown, the domain name access device 200 includes:

[0122] The acquisition module 210 is used to acquire a target access request sent by the first access device. The target access request includes a target decentralized identity identifier. Whether the target decentralized identity identifier can be registered on the second blockchain is determined by the second blockchain based on a preset verification algorithm to verify the target registration request sent by the preset management system. The target decentralized identity identifier has been successfully registered on the first blockchain. The preset verification algorithm is used to determine whether the target registration request is valid.

[0123] The access module 220 is used to access the target blockchain address corresponding to the target decentralized identity according to the target access request if it is determined that the target decentralized identity has been successfully registered on the second blockchain.

[0124] In an optional implementation, the domain name access device further includes: a registration module, configured to receive a target registration request sent by a preset management system, the target registration request being generated based on an initial registration request sent by a first blockchain, the initial registration request carrying initial registration parameters, and the target registration request carrying the initial registration parameters and a first master hash value corresponding to a target hash sequence in the initial registration parameters; the initial registration parameters include: a target blockchain address, an identifier of a second blockchain, a target decentralized identity identifier, a second preset registration parameter corresponding to the target decentralized identity identifier, and the position of the target hash value corresponding to the target decentralized identity identifier in the target hash sequence, the target hash value being obtained by performing a hash operation on the first preset registration parameters and the target decentralized identity identifier;

[0125] Based on a preset verification algorithm, the initial hash value corresponding to the target decentralized identity is calculated according to the target decentralized identity and the second preset registration parameter corresponding to the target decentralized identity.

[0126] Based on the initial hash value, the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, and the target hash sequence, it is determined whether the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain.

[0127] In an optional implementation, the registration module is specifically used to update the target hash sequence using the initial hash value based on the position of the target hash value in the target hash sequence, thereby obtaining an initial hash sequence;

[0128] Calculate the second master hash value corresponding to the initial hash sequence;

[0129] If the first master hash value is determined to be the same as the second master hash value, then the target decentralized identity can be registered on the second blockchain, and the target decentralized identity is registered at the target blockchain address of the second blockchain.

[0130] In an optional implementation, the registration module is specifically used to perform a grouping operation on the initial hash sequence based on a preset grouping algorithm to obtain at least one first hash group;

[0131] Calculate the sub-hash value of each of the first hash groups, and combine them according to the sub-hash values ​​of each of the first hash groups to obtain a first combined hash sequence;

[0132] If it is determined that the first combined hash sequence contains multiple sub-hash values, then the first combined hash sequence is cyclically grouped based on the preset grouping algorithm, thereby iterating over the second main hash value corresponding to the initial hash sequence.

[0133] In an optional implementation, the registration module is specifically used to perform hash calculations on the initial hash values ​​within each of the first hash groups based on the Merkle tree algorithm to obtain the sub-hash values ​​of each of the first hash groups;

[0134] The sub-hash values ​​of each of the first hash groups are combined to obtain the first combined hash sequence.

[0135] In an optional implementation, the target hash sequence includes multiple hash values, which include the target hash value and at least one other hash value, each of the other hash values ​​corresponding to a decentralized identity identifier, and the target hash value and at least one other hash value in the target hash sequence are ordered sequentially according to the registration order of each of the decentralized identity identifiers on the first blockchain.

[0136] In an optional implementation, the first blockchain is the Ethereum blockchain, and the second blockchain is the Solana blockchain.

[0137] The above-described device is used to execute the method provided in the foregoing embodiments, and its implementation principle and technical effect are similar, so they will not be described again here.

[0138] These modules can be one or more integrated circuits configured to implement the above methods, such as one or more Application Specific Integrated Circuits (ASICs), one or more microprocessors, or one or more Field Programmable Gate Arrays (FPGAs). Alternatively, when a module is implemented using processing element scheduler code, the processing element can be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of calling program code. Furthermore, these modules can be integrated together as a system-on-a-chip (SOC).

[0139] Figure 8 This is a schematic diagram of an electronic device provided in an embodiment of this application. This electronic device can be integrated into the aforementioned domain name access device. Figure 8 As shown, the electronic device may include a processor 310, a storage medium 320, and a bus 330. The storage medium 320 stores machine-readable instructions executable by the processor 310. When the electronic device is running, the processor 310 communicates with the storage medium 320 via the bus 330, and the processor 310 executes the machine-readable instructions to perform the steps of the above method embodiment. The specific implementation and technical effects are similar and will not be described in detail here.

[0140] Optionally, this application also provides a computer-readable storage medium storing a computer program, which, when run by a processor, executes the steps of the above-described method embodiments. The specific implementation and technical effects are similar and will not be repeated here.

[0141] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0142] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0143] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or in a combination of hardware and software functional units.

[0144] The integrated units implemented as software functional units described above can be stored in a computer-readable storage medium. These software functional units, stored in a storage medium, include several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute some steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0145] It should be noted that, in this document, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes the element.

[0146] The above are merely preferred embodiments of this application and are not intended to limit this application. Various modifications and variations are possible for those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application. It should be noted that similar reference numerals and letters in the following figures indicate similar items; therefore, once an item is defined in one figure, it does not need further definition and explanation in subsequent figures. The above are merely preferred embodiments of this application and are not intended to limit this application. Various modifications and variations are possible for those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application.

Claims

1. A decentralized domain name access method, characterized in that, Applied to a second blockchain, which is communicatively connected to a pre-defined management system, the method includes: Obtain a target access request sent by a first access device. The target access request includes a target decentralized identity identifier. Whether the target decentralized identity identifier can be registered on the second blockchain is determined by the second blockchain based on a preset verification algorithm to verify the target registration request sent by the preset management system. The target decentralized identity identifier has been successfully registered on the first blockchain. The preset verification algorithm is used to determine whether the target registration request is valid. If it is determined that the target decentralized identity has been successfully registered on the second blockchain, then the target blockchain address corresponding to the target decentralized identity is accessed according to the target access request; The method further includes: The system receives a target registration request sent by a preset management system. The target registration request is generated based on an initial registration request sent by a first blockchain. The initial registration request carries initial registration parameters. The target registration request carries the initial registration parameters, which include: a target decentralized identity identifier, a second preset registration parameter corresponding to the target decentralized identity identifier, and the position of the target hash value corresponding to the target decentralized identity identifier in the target hash sequence. Based on a preset verification algorithm, the initial hash value corresponding to the target decentralized identity is calculated according to the target decentralized identity and the second preset registration parameter corresponding to the target decentralized identity. Based on the initial hash value, the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, and the target hash sequence, it is determined whether the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain.

2. The method according to claim 1, characterized in that, The target registration request also carries the first master hash value corresponding to the target hash sequence in the initial registration parameters; The initial registration parameters also include: the target blockchain address and the identifier of the second blockchain. The target hash value is obtained by performing a hash operation on the first preset registration parameters and the target decentralized identity identifier.

3. The method according to claim 2, characterized in that, The step of determining whether the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain based on the initial hash value, the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, and the target hash sequence includes: Based on the position of the target hash value in the target hash sequence, the target hash sequence is updated using the initial hash value to obtain the initial hash sequence; Calculate the second master hash value corresponding to the initial hash sequence; If the first master hash value is determined to be the same as the second master hash value, then the target decentralized identity can be registered on the second blockchain, and the target decentralized identity is registered at the target blockchain address of the second blockchain.

4. The method according to claim 3, characterized in that, The calculation of the second master hash value corresponding to the initial hash sequence includes: Based on a preset grouping algorithm, the initial hash sequence is grouped to obtain at least one first hash group; Calculate the sub-hash value of each of the first hash groups, and combine them according to the sub-hash values ​​of each of the first hash groups to obtain a first combined hash sequence; If it is determined that the first combined hash sequence contains multiple sub-hash values, then the first combined hash sequence is cyclically grouped based on the preset grouping algorithm, thereby iterating over the second main hash value corresponding to the initial hash sequence.

5. The method according to claim 4, characterized in that, The step of calculating the sub-hash value of each of the first hash groups and combining the sub-hash values ​​of each of the first hash groups to obtain the first combined hash sequence includes: Based on the Merkle tree algorithm, the initial hash value within each of the first hash groups is hashed to obtain the sub-hash value of each of the first hash groups; The sub-hash values ​​of each of the first hash groups are combined to obtain the first combined hash sequence.

6. The method according to claim 2, characterized in that, The target hash sequence includes multiple hash values, which include the target hash value and at least one other hash value. Each other hash value corresponds to a decentralized identity identifier, and the target hash value and at least one other hash value in the target hash sequence are ordered sequentially according to the registration order of each decentralized identity identifier on the first blockchain.

7. The method according to any one of claims 1-6, characterized in that, The first blockchain is the Ethereum blockchain, and the second blockchain is the Solana blockchain.

8. A decentralized domain name access device, characterized in that, Applied to a second blockchain, which is communicatively connected to a pre-defined management system, the domain name access device includes: The acquisition module is used to acquire a target access request sent by a first access device. The target access request includes a target decentralized identity identifier. Whether the target decentralized identity identifier can be registered on the second blockchain is determined by the second blockchain based on a preset verification algorithm to verify the target registration request sent by the preset management system. The target decentralized identity identifier has been successfully registered on the first blockchain. The preset verification algorithm is used to determine whether the target registration request is valid. The access module is used to access the target blockchain address corresponding to the target decentralized identity if it is determined that the target decentralized identity has been successfully registered on the second blockchain, according to the target access request. The registration module is used to receive a target registration request sent by a preset management system. The target registration request is generated based on an initial registration request sent by the first blockchain. The initial registration request carries initial registration parameters. The target registration request carries the initial registration parameters, which include: a target decentralized identity identifier, a second preset registration parameter corresponding to the target decentralized identity identifier, and the position of the target hash value corresponding to the target decentralized identity identifier in the target hash sequence. Based on a preset verification algorithm, the initial hash value corresponding to the target decentralized identity is calculated according to the target decentralized identity and the second preset registration parameter corresponding to the target decentralized identity. Based on the initial hash value, the position of the target hash value corresponding to the target decentralized identity in the target hash sequence, and the target hash sequence, it is determined whether the target decentralized identity can be successfully registered at the target blockchain address of the second blockchain.

9. An electronic device, characterized in that, include: The device includes a processor, a storage medium, and a bus, wherein the storage medium stores machine-readable instructions executable by the processor, and when the electronic device is running, the processor communicates with the storage medium via the bus, and the processor executes the machine-readable instructions to perform the steps of the decentralized domain name access method as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, performs the steps of the decentralized domain name access method as described in any one of claims 1-7.

Images