Scheduler Proof of Work for Secure Data Fusion

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing blockchain systems face challenges in securely fusing data from remote sensors and coordinating assets across networks, particularly in environments prone to cyber-attacks and network errors, where conventional proof of work methods are insufficient for ensuring data integrity and scheduling accuracy.

Innovation Solution

A blockchain-type system that employs scheduler proof of work, where nodes contribute to solving a constrained optimization problem to determine an optimal schedule, and a conflict resolution method that scores chains based on physical plausibility and chain length, ensuring secure data fusion and collaborative scheduling.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional proof of work methods are used in blockchain systems, then basic security is provided, but data integrity and scheduling accuracy cannot be ensured in environments prone to cyber-attacks and network errors

Engineering Contradiction:
Improvedata integrityVSAvoidcyber-attacks and network errors
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent segments the proof of work function into two distinct components: (1) conventional cryptographic proof of work for basic security, and (2) scheduler proof of work based on constrained optimization problems for data integrity and scheduling accuracy. This segmentation allows each component to address specific security requirements independently, resolving the contradiction between basic security and advanced integrity protection against cyber-attacks and network errors.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent merges conventional proof of work mechanisms with scheduler proof of work based on constrained optimization. By combining these two approaches, the system achieves both basic security (from conventional POW) and enhanced data integrity with scheduling accuracy (from scheduler POW), thereby resisting cyber-attacks and network errors while maintaining blockchain security.

Inventive Principle:
Principle #5Merging (Combining)

2Reliability

If scheduler proof of work is implemented to ensure data integrity and scheduling accuracy, then resistance to cyber-attacks improves, but system complexity increases

Engineering Contradiction:
Improvescheduling accuracyVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The scheduler proof of work mechanism serves multiple functions simultaneously: it provides data integrity verification, establishes scheduling accuracy for asset coordination, and contributes to cyber-attack resistance. This multi-functionality reduces the need for separate mechanisms, thereby managing system complexity while achieving high reliability in scheduling and data integrity.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The constrained optimization problems in the scheduler proof of work are designed such that nodes independently solve scheduling problems using their own computational resources. This self-service approach distributes the computational burden across the network rather than requiring centralized complex verification, thereby maintaining scheduling accuracy while managing overall system complexity.

Inventive Principle:
Principle #25Self-service

3Reliability

If nodes contribute to solving constrained optimization problems for scheduler proof of work, then proof of loyalty is established, but computational effort and time increase

Engineering Contradiction:
Improveproof of loyaltyVSAvoidcomputational time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

Nodes perform scheduler proof of work by solving constrained optimization problems in advance before finalizing blockchain blocks. This preliminary action establishes proof of loyalty upfront, allowing the system to verify node commitment and trustworthiness before processing transactions, thereby reducing later verification time while maintaining high reliability of proof of loyalty.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent allows the difficulty and parameters of constrained optimization problems to be adjusted dynamically. By changing problem parameters based on network conditions and security requirements, the system can balance the computational effort required for proof of loyalty against the time cost, optimizing the trade-off between reliability and computational time loss.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11443221B2Distributed incorruptible accordant management of nonlocal data fusion, unified scheduling and engage-ability
Publication Date: 2022.09.13 LOCKHEED MARTIN CORP
  • US11443221B2 patent drawing
  • US11443221B2 patent drawing
  • US11443221B2 patent drawing

AI summary

A system and method that uses scheduling problems as proof of work in a blockchain system, and that evaluate schedules based on a physics model and a timeline. The system and method can maintain a secured chain of linked messages that include object states and schedule portions. Processing circuitry can receive a message related to an updated state of an object, determine whether the updated state of the object should be linked into the secured chain of linked messages, determine a portion of a schedule for addressing the object based on the updated state of the object as proof of work, create a new message that links the updated state of the object into the secured chain to form an updated chain of linked object state messages and that includes the determined portion of the schedule, and broadcast the new message as the secured chain of linked messages.