Block chain consensus method based on node mutual reputation

The invention relates to a block chain consensus method based on node mutual evaluation reputation. The method comprises the following steps: creating a kth-round consensus group according to a reputation value of a (k-1) th round of each node, and determining a main node of the kth-round consensus...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: CHENG JUMING, YUAN YAJING, DU GENYUAN, ZHANG XIANGQUN, ZHANG KE, YAN PEIHAO
Format: Patent
Sprache:chi ; eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator CHENG JUMING
YUAN YAJING
DU GENYUAN
ZHANG XIANGQUN
ZHANG KE
YAN PEIHAO
description The invention relates to a block chain consensus method based on node mutual evaluation reputation. The method comprises the following steps: creating a kth-round consensus group according to a reputation value of a (k-1) th round of each node, and determining a main node of the kth-round consensus group; starting from the kth round of consensus, carrying out transaction among the nodes to obtain an evaluation value set of the nodes in the kth round; the main node of the kth-round consensus group packs and adds transaction items among the nodes into the block of the kth round, and calculates the reputation value of each node in the kth round according to the evaluation value set of each node in the kth round and the reputation value of each node in the (k-1) th round; the main node of the kth-round consensus group uses a secret key of the main node to sign the block of the kth round to generate a Hash value of the block of the kth round, and a submission message of the kth round is formed and sent to other no
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN116781270A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN116781270A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN116781270A3</originalsourceid><addsrcrecordid>eNrjZLBxyslPzlZIzkjMzFNIzs8rTs0rLi1WyE0tychPUUhKLE5NUcjPU8jLT0lVyC0tKU3MUShKLSgtSSzJzM_jYWBNS8wpTuWF0twMim6uIc4euqkF-fGpxQWJyal5qSXxzn6GhmbmFoZG5gaOxsSoAQDjqC_a</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Block chain consensus method based on node mutual reputation</title><source>esp@cenet</source><creator>CHENG JUMING ; YUAN YAJING ; DU GENYUAN ; ZHANG XIANGQUN ; ZHANG KE ; YAN PEIHAO</creator><creatorcontrib>CHENG JUMING ; YUAN YAJING ; DU GENYUAN ; ZHANG XIANGQUN ; ZHANG KE ; YAN PEIHAO</creatorcontrib><description>The invention relates to a block chain consensus method based on node mutual evaluation reputation. The method comprises the following steps: creating a kth-round consensus group according to a reputation value of a (k-1) th round of each node, and determining a main node of the kth-round consensus group; starting from the kth round of consensus, carrying out transaction among the nodes to obtain an evaluation value set of the nodes in the kth round; the main node of the kth-round consensus group packs and adds transaction items among the nodes into the block of the kth round, and calculates the reputation value of each node in the kth round according to the evaluation value set of each node in the kth round and the reputation value of each node in the (k-1) th round; the main node of the kth-round consensus group uses a secret key of the main node to sign the block of the kth round to generate a Hash value of the block of the kth round, and a submission message of the kth round is formed and sent to other no</description><language>chi ; eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2023</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230919&amp;DB=EPODOC&amp;CC=CN&amp;NR=116781270A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230919&amp;DB=EPODOC&amp;CC=CN&amp;NR=116781270A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>CHENG JUMING</creatorcontrib><creatorcontrib>YUAN YAJING</creatorcontrib><creatorcontrib>DU GENYUAN</creatorcontrib><creatorcontrib>ZHANG XIANGQUN</creatorcontrib><creatorcontrib>ZHANG KE</creatorcontrib><creatorcontrib>YAN PEIHAO</creatorcontrib><title>Block chain consensus method based on node mutual reputation</title><description>The invention relates to a block chain consensus method based on node mutual evaluation reputation. The method comprises the following steps: creating a kth-round consensus group according to a reputation value of a (k-1) th round of each node, and determining a main node of the kth-round consensus group; starting from the kth round of consensus, carrying out transaction among the nodes to obtain an evaluation value set of the nodes in the kth round; the main node of the kth-round consensus group packs and adds transaction items among the nodes into the block of the kth round, and calculates the reputation value of each node in the kth round according to the evaluation value set of each node in the kth round and the reputation value of each node in the (k-1) th round; the main node of the kth-round consensus group uses a secret key of the main node to sign the block of the kth round to generate a Hash value of the block of the kth round, and a submission message of the kth round is formed and sent to other no</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLBxyslPzlZIzkjMzFNIzs8rTs0rLi1WyE0tychPUUhKLE5NUcjPU8jLT0lVyC0tKU3MUShKLSgtSSzJzM_jYWBNS8wpTuWF0twMim6uIc4euqkF-fGpxQWJyal5qSXxzn6GhmbmFoZG5gaOxsSoAQDjqC_a</recordid><startdate>20230919</startdate><enddate>20230919</enddate><creator>CHENG JUMING</creator><creator>YUAN YAJING</creator><creator>DU GENYUAN</creator><creator>ZHANG XIANGQUN</creator><creator>ZHANG KE</creator><creator>YAN PEIHAO</creator><scope>EVB</scope></search><sort><creationdate>20230919</creationdate><title>Block chain consensus method based on node mutual reputation</title><author>CHENG JUMING ; YUAN YAJING ; DU GENYUAN ; ZHANG XIANGQUN ; ZHANG KE ; YAN PEIHAO</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN116781270A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2023</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>CHENG JUMING</creatorcontrib><creatorcontrib>YUAN YAJING</creatorcontrib><creatorcontrib>DU GENYUAN</creatorcontrib><creatorcontrib>ZHANG XIANGQUN</creatorcontrib><creatorcontrib>ZHANG KE</creatorcontrib><creatorcontrib>YAN PEIHAO</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>CHENG JUMING</au><au>YUAN YAJING</au><au>DU GENYUAN</au><au>ZHANG XIANGQUN</au><au>ZHANG KE</au><au>YAN PEIHAO</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Block chain consensus method based on node mutual reputation</title><date>2023-09-19</date><risdate>2023</risdate><abstract>The invention relates to a block chain consensus method based on node mutual evaluation reputation. The method comprises the following steps: creating a kth-round consensus group according to a reputation value of a (k-1) th round of each node, and determining a main node of the kth-round consensus group; starting from the kth round of consensus, carrying out transaction among the nodes to obtain an evaluation value set of the nodes in the kth round; the main node of the kth-round consensus group packs and adds transaction items among the nodes into the block of the kth round, and calculates the reputation value of each node in the kth round according to the evaluation value set of each node in the kth round and the reputation value of each node in the (k-1) th round; the main node of the kth-round consensus group uses a secret key of the main node to sign the block of the kth round to generate a Hash value of the block of the kth round, and a submission message of the kth round is formed and sent to other no</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN116781270A
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Block chain consensus method based on node mutual reputation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T17%3A54%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=CHENG%20JUMING&rft.date=2023-09-19&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN116781270A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true