Prestochastic Timing for Blockchain Node Synchronization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In blockchain networks, deterministic timing can lead to unwanted conditions such as deadlock and contention, particularly when all nodes expire or update simultaneously, causing network instability and inefficiencies.

Innovation Solution

Implementing prestochastic and deterministic techniques to manage timing decisions, such as using prestochanistic processes for node re-registration and software updates, which generate dynamic expiration lifetimes and update-timing values, allowing nodes to operate independently while maintaining system determinism.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If deterministic timing is used for node operations, then system consistency is maintained, but synchronous events cause deadlocks and contentions

Engineering Contradiction:
Improvesystem consistencyVSAvoiddeadlocks and contentions
Core Design Contradiction:
ReliabilityVSObject-generated harmful factors

Solution Approach 1:

The patent applies dynamics by transitioning from static deterministic timing to dynamic prestochastic timing. Nodes generate timing values based on stochastic functions of block identifiers and node identifiers, creating dynamic expiration lifetimes and update-timing values that adapt to each node's characteristics while maintaining system-wide consistency through deterministic validation rules.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the timing parameter from fixed deterministic values to prestochastic values generated by cryptographic functions. Each node computes its timing parameters (expiration lifetime, update timing) as deterministic functions of public inputs (block ID, node ID), transforming the timing mechanism from uniform to differentiated while preserving verifiability.

Inventive Principle:
Principle #35Parameter changes

2Device complexity

If all nodes expire simultaneously, then registration management is simplified, but network deadlock occurs

Engineering Contradiction:
Improveregistration managementVSAvoidnetwork stability
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent segments the simultaneous expiration event into distributed, staggered expiration times for different nodes. Each node's expiration time is segmented based on its unique identifier and the block identifier, creating a segmented timeline where nodes expire at different moments, preventing network-wide deadlock while maintaining manageable registration complexity.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces asymmetry in node expiration timing by using node-specific identifiers in the prestochastic function. Instead of symmetric simultaneous expiration, each node receives asymmetric timing treatment based on its unique characteristics, ensuring that no single expiration moment affects all nodes uniformly and preventing cascading failures.

Inventive Principle:
Principle #4Asymmetry

3Productivity

If all nodes update simultaneously, then software deployment is efficient, but network contention and failures increase

Engineering Contradiction:
Improvesoftware deployment efficiencyVSAvoidnetwork contention
Core Design Contradiction:
ProductivityVSObject-generated harmful factors

Solution Approach 1:

The patent implements periodic action by scheduling node updates at different times based on prestochastic timing values. Instead of a single simultaneous update event, nodes perform updates periodically at staggered intervals determined by their individual timing parameters, maintaining deployment progress while avoiding network contention and simultaneous failures.

Inventive Principle:
Principle #19Periodic action

Solution Approach 2:

The patent applies preliminary action by having nodes compute their update timing in advance using the prestochastic function before the actual update occurs. Nodes determine their update schedule ahead of time based on block identifiers and node identifiers, allowing proactive preparation and coordination without real-time contention, thus maintaining efficiency while preventing conflicts.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11729007B2Methods and apparatus to manage timing in a blockchain network
Publication Date: 2023.08.15 INTEL CORP
  • US11729007B2 patent drawing
  • US11729007B2 patent drawing
  • US11729007B2 patent drawing

AI summary

In a method for operating a node in a blockchain network, a node in the network automatically determines whether a new block has been committed to a blockchain in the network. In response to determining that the new block has been committed, the node automatically uses a block identifier for the new block to generate a prestochanistic timing value. Also, the node automatically uses the prestochanistic timing value to determine whether to trigger a contingent operation. For instance, the node may automatically use a function that is both prestochastic and deterministic to determine a current expiration value for the node, and the node may use the current expiration value to determine whether registration for the node should be renewed. The node may automatically send a re-registration request to the blockchain network in response to a determination that registration for the node should be renewed. Other embodiments are described and claimed.