Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Credible time sequence partial order calculation method for decentralized P2P network

A P2P network, decentralized technology, applied in the field of trusted timing partial order computing, which can solve the problems of lack of timing intelligence, unreliable network, lack of effective timing calculation methods, etc.

Active Publication Date: 2019-07-30
苏州黑云智能科技有限公司 +1
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] In the current decentralized P2P network, considering the unreliability of the network, there is still a lack of effective timing calculation methods that can ensure that the entire network nodes can efficiently reach a consensus on a certain time node or timing relationship, resulting in many Algorithms and applications based on sequential logic are truly deployed in decentralized P2P networks, and therefore lack intelligence based on timing

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Credible time sequence partial order calculation method for decentralized P2P network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] The technical solutions of the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings of the present invention.

[0026] A trusted time-sequence partial order calculation method for decentralized P2P networks disclosed in the embodiment of the present invention mainly provides a non-repudiable and tamper-proof time-sequence partial order calculation semantics and method; the method mainly consists of prefix source message structure, message sender node, message receiver node, and message receiver node message chain.

[0027] Scenes:

[0028] In the decentralized P2P network, there is a node set Miners, each of which stores the messages sent by all other nodes on the current network; node A is not in the Miners; the message sent by A recently and agreed by the Miner is prefix A , prefix A .TimeStampFiel="15:00"; A wants to transfer 10 yuan to B after 16:00, so he sends a message, the original co...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a method for establishing, verifying and calculating a time sequence partial sequence between global P2P nodes in a decentralized network environment. According to the method, the established time sequence partial order relation is non-repudiation and tamper-proof, and the method comprises the following steps of S1, establishing a prefix source message; s2, sending a prefixmessage source; s3, verifying a prefix message source timestamp; and S4, calculating a time sequence partial order relation. According to the invention, the non-repudiation and tamper-proofing globaltime sequence partial sequence semantics are provided for the first-order predicate logic calculation of the trusted time sequence in the decentralized P2P network, and the intelligent characteristicand the trusted time sequence partial sequence characteristic of the P2P network are increased.

Description

technical field [0001] The invention relates to a decentralized P2P network, in particular to a trusted time sequence partial order calculation method for the decentralized P2P network. Background technique [0002] In the current decentralized P2P network, considering the unreliability of the network, there is still a lack of effective timing calculation methods that can ensure that the entire network nodes can efficiently reach a consensus on a certain time node or timing relationship, resulting in many Algorithms and applications based on sequential logic are truly deployed in decentralized P2P networks, and therefore lack intelligence based on timing. Contents of the invention [0003] The purpose of the present invention is to overcome the defects of the prior art and provide a method by which the decentralized P2P network nodes can quickly reach the consensus on the timing of the entire network. Within the error, the consensus is the latest maximum starting value of...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04J3/06
CPCH04J3/0635
Inventor 谢绍韫
Owner 苏州黑云智能科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com