A domain name management method and system based on a blockchain and a prophet

Abstract

This invention relates to the field of internet technology, specifically to a domain name management method and system based on blockchain and oracles. It includes steps for domain name registration initiation, domain name allocation, name duplication detection, domain name query, domain name update, and domain name renewal. Registration requests are processed by oracle and knowledge graph to parse text semantics and generate highly relevant candidate domain names. Name duplication detection avoids conflicts by querying off-chain domain name status via an oracle. The query employs a prefix tree structure and cross-validation mechanism to improve query efficiency and security. This technical solution utilizes the combination of knowledge graphs, oracles, and blockchain to significantly improve the security of the domain name system, reduce the risk of single points of failure, and also resist domain name abuse and domain name squatting through the domain name allocation mechanism.

Description

Technical Field

[0001] This invention relates to the field of Internet technology, and in particular to a domain name management method and system based on blockchain and oracles. Background Technology

[0002] Blockchain, with its high degree of decentralization, transparency, traceability, and tamper-proof nature, has become one of the most watched innovative technologies globally. In the early stages of blockchain technology development, smart contracts primarily relied on on-chain data, which limited its application scenarios. Many real-world applications, such as financial transactions, insurance claims, and supply chain management, often depend on external information, such as market prices and weather data. However, the closed nature of blockchain makes obtaining this off-chain data extremely difficult, preventing smart contracts from fully realizing their potential. To address this need, blockchain oracles emerged. Oracles drive the development of blockchain applications by introducing off-chain data into blockchain smart contracts, playing a crucial bridging role between the blockchain and the real world. The blockchain-based Domain Name System (DNS) is one of its key applications.

[0003] NameCoin, as the first blockchain-based domain name system solution, allowed users to communicate with its network remotely. Users could directly register domain names on the NameCoin blockchain by initiating transactions. However, this domain name registration process was not effectively managed, failing to prevent domain name squatting. Subsequently, Blockstack migrated its blockchain domain name system to Bitcoin to increase the difficulty of attacks, but its performance was limited by the Bitcoin system, resulting in slow transaction processing speeds. To address the domain name squatting problem, HandShake implemented the Vickrey auction mechanism to limit attackers from registering a large number of domain names in a short period. Under the Vickrey auction mechanism, initiating domain name registration first enters an auction phase. In this phase, all users can send their bids to the HandShake network, and the user with the highest bid ultimately wins the domain name and only needs to pay the second-highest bid.

[0004] The application of blockchain technology in the DNS field has brought greater transparency and security to the Domain Name System (DNS). However, at the same time, malware is also using techniques such as Domain Name Generation Algorithms (DGAs) to challenge the security of the DNS. In a distributed DNS system, it is difficult to detect domain name abuse. Attackers can use DGAs to generate and register a series of random malicious domain names to facilitate malware communication. Therefore, improving the security and compatibility of blockchain-based DNS systems and effectively preventing domain name abuse has become a pressing problem that needs to be solved. Summary of the Invention

[0005] The purpose of this invention is to provide a domain name management method and system based on blockchain and oracles, which solves the problem of how to improve the security and compatibility of the blockchain domain name system and effectively prevent domain name abuse, which are urgent problems to be solved in the current blockchain domain name system.

[0006] To achieve the above objectives, this invention provides a domain name management method based on blockchain and oracles, comprising the following steps:

[0007] Domain registration initiation: User submits domain registration request R init <A,C,L,PK> The registration transaction is generated and broadcast on the chain. The request is recorded and handed over to the subsequent knowledge graph generation domain name and duplicate name check update process.

[0008] Domain name allocation: After receiving a domain name registration request from a user, the blockchain submits the request to the oracle node. The oracle performs semantic segmentation on the text content C submitted by the user through natural language processing, extracts the key concepts, and selects the top n concept sets H with the highest semantic similarity to generate a candidate domain name set D.

[0009] Domain name verification: By calling an external API through an oracle in the blockchain, querying off-chain domain name system data, and initiating DNS queries for each domain name di in D in descending order of similarity;

[0010] Domain name lookup: For non-full nodes, a cross-validation query mechanism will be used. When a user initiates a query, the user will randomly select m nodes from the network to send query requests.

[0011] Domain name update: The user submits an update request, and the verification nodes in the blockchain network check whether the Sign submitted by the user matches the public key PK in the existing record. If the signature verification passes, the resolution address is updated.

[0012] Domain renewal: To ensure that domain registrants can continue to use existing domain resources, users can initiate a domain lease renewal request before or within a certain grace period after the domain expires. The user submits the renewal request. <Sign,d s To ensure the legitimacy of the renewer's identity, the signature of the renewer is verified. If the signature verification is successful, the domain name is renewed.

[0013] In the step "Domain Registration Initiation", A is the resource address associated with the domain name, C is the text description of the application associated with the address, L is the domain name level, and PK represents the user's public key.

[0014] In the "domain name allocation" step, the oracle first performs semantic segmentation on the user-submitted text content C using natural language processing to extract the key concept K. The calculation process is as follows:

[0015] K = Seg(C) = {c1, c2, ..., c n}, n≥L

[0016] Among them, c i Representing the key information extracted from the text content C, for each set K, a concept set K consists of every L distinct concepts. i <c1,c2,...,c L > Calculate semantic similarity Sim(K) using knowledge graph i After calculating the similarity of all concept sets, the top n concept sets H with the highest semantic similarity are selected as the basis for domain name generation. The candidate domain name set D = {d1, d2, ..., dn} is obtained through H. n This improves the semantic relevance and recognizability of domain names in the system.

[0017] In the step "domain name allocation", the semantic similarity Sim(K) is used. i The calculation method for ) is as follows:

[0018]

[0019] path_length(K i )=∑length(C i C j ),(C i C j )∈K i ×K i C i ≠C j

[0020] in, Used to represent concept set K i The sum of the weight coefficients of the concepts in the path_length(K) is used to quantify the frequency of the concept set in the domain knowledge graph. i ) represents K i The sum of the shortest path lengths of concepts in the knowledge graph is squared to enhance the impact of path length on similarity.

[0021] In the "Domain Name Query" step, for full node queries, to perform efficient DNS domain name queries locally, each full node maintains a prefix compression tree, where each node represents the prefix of the domain name. This structure can keep the domain name lookup complexity within O(n) while ensuring data consistency, where n is the length of the domain name. This structure also reduces the number of redundant nodes. Let a domain name be d = {d1, d2, ..., dn}. n}, where d i Let represent the domain name prefix of the i-th level. For each domain name d, the query process can be represented as a recursive function Query(T,d), which is defined as follows:

[0022]

[0023] For non-full-node queries, some nodes return incorrect DNS data. A cross-validation mechanism is used to ensure the domain name information received by the user is reliable. When a user initiates a query, they randomly select m nodes from the network to send the query request. Let S represent the query result set, and r... i Let represent the return result of the i-th node, then:

[0024] S={r1,r2,...,r m}

[0025] The calculation process for the cross-validation method used to query DNS data in step "Domain Name Query" is as follows:

[0026]

[0027] Where m represents the total number of nodes participating in the query, and to determine the final domain name resolution result, the user performs a multi-node consistency check on the results in set S. If the proportion of the mode result exceeds the threshold θ, then the result is considered a correct DNS resolution, and... Represents the indicator function, r mode The result that appears most frequently in S is the DNS query result. If this condition is not met, the user considers the query to be abnormal and will re-initiate the DNS query request until a result that meets the condition is obtained.

[0028] In the "Domain Name Update" step, the user submits an update request. <Sign,d s In the domain name record ,A',Update>, where Sign is the user's signature used to verify the registrant's identity, ds is the domain name requesting a change of resource address, and A' represents the updated resource address. Assume the existing domain name record D is... <d sThe expression is defined as follows: A, C, L, PK, T>, where A represents the unupdated resource address, C represents the resource content submitted by the user when registering the domain name, L represents the domain level, PK represents the user's public key, and T represents the domain lease period. The verification nodes in the blockchain network first check whether the Sign submitted by the user matches the public key PK in the existing record. If the signature verification passes, the resolution address is updated.

[0029] The present invention also provides a domain name management system based on blockchain and oracles, which is applied to the domain name management method based on blockchain and oracles as described above.

[0030] This invention discloses a domain name management method and system based on blockchain and oracles, including a domain name registration initiation step, a domain name allocation step, a name duplication detection step, a domain name query step, a domain name update step, and a domain name renewal step. The registration request uses an oracle and knowledge graph to parse the semantics of the text, generating highly relevant candidate domain names. Name duplication detection avoids conflicts by querying the status of off-chain domain names through an oracle. The query employs a prefix tree structure and cross-validation mechanism to improve query efficiency and security. This technical solution utilizes the combination of knowledge graphs, oracles, and blockchain to significantly improve the security of the domain name system, reduce the risk of single points of failure in the domain name system, and also resist domain name abuse and domain name squatting through the domain name allocation mechanism. Attached Figure Description

[0031] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0032] Figure 1 This is an operational diagram of the domain name management method based on blockchain and oracle provided by the present invention. Detailed Implementation

[0033] Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and intended to explain the present invention, and should not be construed as limiting the present invention.

[0034] Please see Figure 1 This invention provides a domain name management method based on blockchain and oracles, comprising the following steps:

[0035] Domain registration initiation: User submits domain registration request R init<A,C,L,PK>The registration transaction is generated and broadcast on the chain. The request is recorded and handed over to the subsequent knowledge graph generation domain name and duplicate name check update process.

[0036] Domain name allocation: After receiving a domain name registration request from a user, the blockchain submits the request to the oracle node. The oracle performs semantic segmentation on the text content C submitted by the user through natural language processing, extracts the key concepts, and selects the top n concept sets H with the highest semantic similarity to generate a candidate domain name set D.

[0037] Domain name verification: By calling an external API through an oracle in the blockchain, querying off-chain domain name system data, and initiating DNS queries for each domain name di in D in descending order of similarity;

[0038] Domain name lookup: For non-full nodes, a cross-validation query mechanism will be used. When a user initiates a query, the user will randomly select m nodes from the network to send query requests.

[0039] Domain name update: The user submits an update request, and the verification nodes in the blockchain network check whether the Sign submitted by the user matches the public key PK in the existing record. If the signature verification passes, the resolution address is updated.

[0040] Domain renewal: To ensure that domain registrants can continue to use existing domain resources, users can initiate a domain lease renewal request before or within a certain grace period after the domain expires. The user submits the renewal request. <Sign,d s To ensure the legitimacy of the renewer's identity, the signature of the renewer is verified. If the signature verification is successful, the domain name is renewed.

[0041] In this embodiment, the technical solution includes a domain name registration initiation step, a domain name allocation step, a name duplication detection step, a domain name query step, a domain name update step, and a domain name renewal step. The registration request uses an oracle and a knowledge graph to parse the semantics of the text and generate highly relevant candidate domain names. Name duplication detection avoids conflicts by querying the off-chain domain name status through an oracle. The query adopts a prefix tree structure and cross-validation mechanism to improve query efficiency and security. This technical solution utilizes the combination of knowledge graph, oracle, and blockchain to significantly improve the security of the domain name system, reduce the risk of single point of failure in the domain name system, and resist domain name abuse and domain name squatting through the domain name allocation mechanism.

[0042] Furthermore, in the step "Domain Registration Initiation", A is the resource address associated with the domain name, C is the text description of the application associated with the address, L is the domain name level, and PK represents the user's public key.

[0043] Furthermore, in the "domain allocation" step, the oracle first performs semantic segmentation on the user-submitted text content C using natural language processing to extract the key concept K. The calculation process is as follows:

[0044] K = Seg(C) = {c1, c2, ..., c n}, n≥L

[0045] Among them, c i Representing the key information extracted from the text content C, for each set K, a concept set K consists of every L distinct concepts. i <c1,c2,...,c L > Calculate semantic similarity Sim(K) using knowledge graph i After calculating the similarity of all concept sets, the top n concept sets H with the highest semantic similarity are selected as the basis for domain name generation. The candidate domain name set D = {d1, d2, ..., dn} is obtained through H. n This improves the semantic relevance and recognizability of domain names in the system.

[0046] Furthermore, in the "domain name allocation" step, semantic similarity Sim(K) is used. i The calculation method for ) is as follows:

[0047]

[0048] path_length(K i )=∑length(C i C j ),(C i C j )∈K i ×K i C i ≠C j

[0049] in, Used to represent concept set K i The sum of the weight coefficients of the concepts in the path_length(K) is used to quantify the frequency of the concept set in the domain knowledge graph. i ) represents K i The sum of the shortest path lengths of concepts in the knowledge graph is squared to enhance the impact of path length on similarity.

[0050] Furthermore, in the "Domain Name Query" step, for full node queries, in order to perform efficient DNS domain name queries locally, each full node maintains a prefix compression tree, where each node represents the prefix of the domain name. This structure can keep the domain name lookup complexity within O(n) while ensuring data consistency, where n is the length of the domain name. At the same time, this structure can reduce the number of redundant nodes. Let a domain name be d = {d1, d2, ..., dn}. n}, where d i Let represent the domain name prefix of the i-th level. For each domain name d, the query process can be represented as a recursive function Query(T,d), which is defined as follows:

[0051]

[0052] For non-full-node queries, some nodes return incorrect DNS data. A cross-validation mechanism is used to ensure the domain name information received by the user is reliable. When a user initiates a query, they randomly select m nodes from the network to send the query request. Let S represent the query result set, and r... i Let represent the return result of the i-th node, then:

[0053] S={r1,r2,...,r m}

[0054] Furthermore, the calculation process for the cross-validation method used to query DNS data in step "Domain Name Query" is as follows:

[0055]

[0056] Where m represents the total number of nodes participating in the query, and to determine the final domain name resolution result, the user performs a multi-node consistency check on the results in set S. If the proportion of the mode result exceeds the threshold θ, then the result is considered a correct DNS resolution, and... Represents the indicator function, r mode The result that appears most frequently in S is the DNS query result. If this condition is not met, the user considers the query to be abnormal and will re-initiate the DNS query request until a result that meets the condition is obtained.

[0057] Furthermore, in the "Domain Name Update" step, the user submits an update request. <Sign,d s In the domain name record ,A',Update>, where Sign is the user's signature used to verify the registrant's identity, ds is the domain name requesting a change of resource address, and A' represents the updated resource address. Assume the existing domain name record D is... <d sThe expression is defined as follows: A, C, L, PK, T>, where A represents the unupdated resource address, C represents the resource content submitted by the user when registering the domain name, L represents the domain level, PK represents the user's public key, and T represents the domain lease period. The verification nodes in the blockchain network first check whether the Sign submitted by the user matches the public key PK in the existing record. If the signature verification passes, the resolution address is updated. Specific implementation examples:

[0059] This invention provides a domain name management method based on blockchain and oracles, comprising the following steps:

[0060] 1. Domain registration initiation

[0061] User submits domain registration request R init <A,C,L,PK> The system generates a registration transaction and broadcasts it on the blockchain. Here, A represents the resource address associated with the domain name, such as a traditional IP address, Web3 contract address, decentralized storage address, or smart contract address; C represents the text description of the application associated with that address; L represents the domain name level; and PK represents the user's public key. The system records this request and passes it to the subsequent knowledge graph generation and name duplication check update process.

[0062] 2. Domain Name Allocation

[0063] Oracle O KG First, semantic segmentation is performed on the user-submitted text content C using natural language processing to extract the key concept K. The calculation process is shown below:

[0064] K = Seg(C) = {c1, c2, ..., c n}, n≥L

[0065] Among them, c i This represents the key information extracted from the text content C.

[0066] For each set K, there is a concept set K consisting of every L distinct concepts. i <c1,c2,...,c L > Calculate semantic similarity Sim(K) using knowledge graph i The calculation process is shown in the following formula:

[0067]

[0068] path_length(K i )=∑length(C i C j ),(C i C j )∈K i ×Ki C i ≠C j

[0069] in, Used to represent concept set K i The sum of the weight coefficients of the concepts in the path_length(K) is used to quantify the frequency of the concept set in the domain knowledge graph. i ) represents K i The sum of the shortest path lengths of concepts in the knowledge graph is squared to enhance the impact of path length on similarity.

[0070] After calculating the similarity of all concept sets, the top n concept sets H with the highest semantic similarity are selected as the basis for domain name generation. The candidate domain name set D = {d1, d2, ..., dn} is obtained through H. n This improves the semantic relevance and recognizability of domain names in the system.

[0071] 3. Duplicate Name Detection

[0072] The system utilizes oracles within the blockchain to call external APIs and query data from off-chain domain name systems. Based on the similarity score from highest to lowest, a DNS query is initiated for each domain di in the candidate domain set D.

[0073] If the query results show domain name d s If not registered, the system will initiate a registration success transaction. Success <d s ,T>. Here, T represents the domain lease period. When all domains in the candidate domain set D conflict, it is necessary to query the sequence number Num of the second-level domains in d1 in the knowledge graph. By appending Num to the second-level domains in d1, a new, non-conflicting domain d can be obtained. s ', initiate transaction R Success <d s ',T>.

[0074] 4. Domain Name Lookup

[0075] To improve the query efficiency and security of blockchain-based distributed domain name systems, this invention presents a domain name query scheme based on a prefix tree structure and a cross-validation mechanism for user queries. This method includes two modules: full node query and non-full node query, to improve the time efficiency of domain name queries and enhance the ability to resist data tampering.

[0076] For full node queries, blockchain full nodes possess complete DNS data. To perform efficient DNS domain name queries locally, each full node maintains a compressed prefix tree, where each node represents a domain name prefix. This structure can keep the domain name lookup complexity within O(n) while ensuring data consistency, where n is the length of the domain name.

[0077] Simultaneously, a compressed prefix tree can reduce the number of redundant nodes. Let a domain name be d = {d1, d2, ..., dn}. n}, where d i Let represent the domain name prefix at level i. For each domain name d, the query process can be represented as a recursive function Query(T,d), defined as follows:

[0078]

[0079] For non-full node queries, due to the large number of nodes in the blockchain network, some nodes may return incorrect DNS data, posing a potential data tampering attack. To ensure the accuracy of user and light node queries, this invention uses a cross-validation mechanism to ensure that the domain name information received by the user is trustworthy. When a user initiates a query, the user randomly selects m nodes from the network and sends query requests to them. Let S represent the query result set, and r... i Let represent the return result of the i-th node, then:

[0080] S={r1,r2,...,r m}

[0081] Where m is the total number of nodes participating in the query. To determine the final domain name resolution result, the user performs a consistency check on the results in set S. If the proportion of the mode result exceeds the threshold θ, the result is considered a correct DNS resolution. The calculation process is as follows:

[0082]

[0083] in, Represents the indicator function, r mode The result that appears most frequently in S is the DNS query result. If this condition is not met, the user considers the query to be abnormal and will re-initiate the DNS query request until a result that meets the condition is obtained.

[0084] 5. Domain name update

[0085] User submits update request <Sign,d s ,A',Update>, where Sign represents the user's signature, used to verify the registrant's identity, d sFor a domain name requesting a change of resource address, A' represents the updated resource address. Assume the existing domain name record D is... <d s The expression is defined as follows: A, C, L, PK, T>, where A represents the unupdated resource address, C represents the resource content submitted by the user when registering the domain name, L represents the domain level, PK represents the user's public key, and T represents the domain lease period. The verification nodes in the blockchain network first check whether the Sign submitted by the user matches the public key PK in the existing record. If the signature verification passes, the resolution address is updated.

[0086] 6. Domain name renewal

[0087] To ensure that domain registrants can continue to use existing domain resources, users can initiate a domain lease renewal request before or within a certain grace period after the domain expires. Users submit the renewal request. <Sign,d s To ensure the legitimacy of the renewer's identity, the renewer's signature is verified. Here, Sign is the registrant's signature used to verify the renewer's identity, d s This is the domain name for which renewal is requested. If the signature verification passes, the domain name will be renewed.

[0088] The present invention also provides a domain name management system based on blockchain and oracles, which is applied to the domain name management method based on blockchain and oracles as described above.

[0089] The above description discloses only one preferred embodiment of the present invention, and should not be construed as limiting the scope of the present invention. Those skilled in the art will understand that all or part of the processes of the above embodiments can be implemented, and equivalent changes made in accordance with the claims of the present invention are still within the scope of the invention.

Claims

1. A domain name management method based on blockchain and oracles, characterized in that, Includes the following steps: Domain registration initiation: A user submits a domain registration request. The registration transaction is generated and broadcast on the chain. The request is recorded and handed over to the subsequent knowledge graph generation domain name and duplicate name check update process. Domain name allocation: After receiving a domain name registration request from a user, the blockchain submits the request to the oracle node. The oracle performs semantic segmentation on the text content C submitted by the user when registering the domain name through natural language processing, extracts the key concepts, and selects the top n concept sets H with the highest semantic similarity to generate a candidate domain name set D. Domain name verification: By calling an external API through an oracle in the blockchain, querying off-chain domain name system data, and initiating DNS queries for each domain name di in D in descending order of similarity; Domain name lookup: For non-full nodes, a cross-validation query mechanism will be used. When a user initiates a query, the user will randomly select m nodes from the network to send query requests. Domain name update: The user submits an update request, and the verification nodes in the blockchain network check whether the Sign submitted by the user matches the public key PK in the existing record. If the signature verification passes, the resolution address is updated. Domain renewal: To ensure that domain registrants can continue to use existing domain resources, users can initiate a domain lease renewal request before or within a certain grace period after the domain expires. The user submits the renewal request. To ensure the legitimacy of the renewer's identity, the renewer's signature is verified. If the signature verification is successful, the domain name will be renewed. In the step "Domain Registration Initiation", A is the resource address associated with the domain name, C represents the text content submitted by the user when registering the domain name, L is the domain name level, and PK represents the user's public key.

2. The domain name management method based on blockchain and oracle as described in claim 1, characterized in that, In the "Domain Name Allocation" step, the oracle first performs semantic segmentation on the text content C submitted by the user when registering a domain name using natural language processing, extracting the key concept K. The calculation process is as follows: in, This represents the key information extracted from the text content C submitted by the user when registering the domain name, and is a concept set consisting of every L distinct concepts in each set K. Sim uses knowledge graphs to calculate semantic similarity. After calculating the similarity of all concept sets, the top n concept sets H with the highest semantic similarity are selected as the basis for domain name generation, and a set of candidate domain names is obtained through H. This improves the semantic relevance and recognizability of domain names in the system.

3. The domain name management method based on blockchain and oracle as described in claim 2, characterized in that, In the step "Domain Name Allocation", semantic similarity Sim The calculation method is as follows: in, This represents the key information extracted from the text content C submitted by the user when registering the domain. Used to represent concept sets The sum of the weight coefficients of the concepts in the domain name knowledge graph is used to quantify the frequency of the concept set appearing in the domain name knowledge graph. express The sum of the shortest path lengths of concepts in the knowledge graph is squared to enhance the impact of path length on similarity.

4. The domain name management method based on blockchain and oracle as described in claim 3, characterized in that, In the "Domain Name Query" step, for full node queries, to perform efficient DNS domain name queries locally, each full node maintains a prefix compression tree, where each node represents the prefix of the domain name. This structure can keep the domain name lookup complexity within O(n) while ensuring data consistency, where n is the length of the domain name. This structure also reduces the number of redundant nodes. Let a certain domain name be... ,in, This represents the domain name prefix at level i. For each domain name d, the query process can be represented as a recursive function. Its definition is as follows: For non-full-node queries, some nodes return incorrect DNS data. A cross-validation mechanism is used to ensure the domain name information received by the user is reliable. When a user initiates a query, they randomly select m nodes from the network to send the query request. Let S represent the query result set. Let represent the return result of the i-th node, then: 。 5. The domain name management method based on blockchain and oracle as described in claim 4, characterized in that, The calculation process for the cross-validation method used to query DNS data in step "Domain Name Query" is as follows: Where m represents the total number of nodes participating in the query, and to determine the final domain name resolution result, the user performs a multi-node consistency check on the results in set S. If the proportion of the mode result exceeds the threshold θ, then the result is considered a correct DNS resolution, and... Represents an indicator function. The result that appears most frequently in S is the DNS query result. If this condition is not met, the user considers the query to be abnormal and will re-initiate the DNS query request until a result that meets the condition is obtained.

6. The domain name management method based on blockchain and oracle as described in claim 5, characterized in that, In the "Domain Update" step, the user submits an update request. Where Sign is the user's signature used to verify the registrant's identity, ds is the domain name requesting a change of resource address, and A' represents the updated resource address. Assume the existing domain name record D is... Where A represents the unupdated resource address, C represents the text content submitted by the user when registering the domain name, L represents the domain level, PK represents the user's public key, and T represents the domain lease period. The verification nodes in the blockchain network first check whether the Sign submitted by the user matches the public key PK in the existing record. If the signature verification passes, the resolution address is updated.

Images