Distributed incorruptible accordant management of nonlocal data fusion, unified scheduling and engage-ability

1. A system comprising:

a computing system, having one or more processors coupled with memory, configured to:

maintain a secured chain of linked messages for an object, each message of the linked messages including: (i) a respective state of a plurality of states for the object, and (ii) and a respective portion of a schedule, the schedule defining a timeline for the plurality of states for the object;

receive a first message to update a state of an object in the secured chain of linked messages;

determine to link the updated state with the secured chain of linked messages;

determine, responsive to the determination to link the updated stated with the secured chain of linked messages, as proof of work, a portion of the schedule for the updated state of the object based on the updated state of the object and the timeline of the schedule for the plurality of states for the object in the linked messages in the secured chain of linked messages;

create a second message including (i) the updated state of the object and (ii) the determined portion of the schedule to link to the secured chain of linked messages;

determine the portion of the schedule by evaluating a cost function beginning at an arbitrary start point;

evaluate the cost function by finding a set of times that result in a cost below a threshold cost;

encode the determined portion of the schedule;

create the second message including the encoded portion of the schedule as the proof of work; and

broadcast the second message as the secured chain of linked messages.

2. The system of claim 1 , wherein the computing system is further configured to:

determine to link the updated state of the object with the secured chain of linked messages by checking a length of a hash of the received first message; and

validate the proof of work by checking the determined portion of the schedule against a physics model of a physical object corresponding to the object using an error metric.

3. The system of claim 2 , wherein the computing system is further configured to:

evaluate a plurality of the validated schedule portions against a predefined activation function of weighted schedule parameters.

4. The system of claim 1 , wherein the computing system is further configured to:

create the second message by determining a hash of the message and a previous message.

5. The system of claim 1 , wherein the computing system is further configured to:

encrypt the second message.

6. The system of claim 1 , wherein the computing system is further configured to:

determine the portion of the schedule beginning at the arbitrary start point by:

obtaining a list of initial schedules;

randomly selecting an initial schedule from the list of initial schedules;

and

perturbing parameters of the selected initial schedule until a local minimum of the cost function is reached.

7. The system of claim 1 , wherein the computing system is further configured to:

evaluate the cost function, which for given target states and engagement platform states, finds laser weapon start and stop times and missile intercept times that result in the cost below the threshold cost.

8. The system of claim 1 , wherein the respective state of the object includes target state measurements and data fusion results from non-collocated sensors, and

wherein the computing system receives the first message that includes a hash of linked previous messages in the secured chain of linked messages containing the target state measurements and the data fusion results and the determined schedule portion.

9. A method comprising:

maintaining, by a computing system, a secured chain of linked messages for an object, each message of the linked messages including: (i) a respective state of a plurality of states for the object, and (ii) and a respective portion of a schedule, the schedule defining a timeline for the plurality of states for the object;

receiving, by the computing system, a first message to update a state of an object in the secured chain of linked messages;

determining, by the computing system, to link the updated state of the object should be linked into the secured chain of linked messages;

determining, by the computing system, responsive to determining to link the updated stated with the secured chain of linked messages, as proof of work, a portion of the schedule for the updated state of the object based on the updated state of the object and the timeline of the schedule for the plurality of states for the object in the linked messages in the secured chain of linked messages, wherein the determining the portion of the schedule includes evaluating a cost function beginning at an arbitrary start point, and wherein the evaluating of the cost function includes finding a set of times that result in a cost below a threshold cost;

encoding, by the computing system, the determined portion of the schedule;

creating, by the computing system, a second message including (i) the updated state of the object and (ii) the encoded portion of the schedule as the proof of work to link to the secured chain of linked messages; and

broadcasting, by the computing system, the second message as the secured chain of linked messages.

10. The method of claim 9 , further comprising:

determining, by the computing system, to link the updated state of the object with the secured chain of linked messages by checking a length of a hash of the received first message, and

validating, by the computing system, the proof of work by checking the determined portion of the schedule against a physics model of a physical object corresponding to the object using an error metric.

11. The method of claim 10 , further comprising evaluating, by the computing system, a plurality of the validated schedule portions against a predefined activation function of weighted schedule parameters.

12. The method of claim 9 , wherein the creating the second message includes determining a hash of the message and a previous message.

13. The method of claim 9 , further comprising:

encrypting, by the computing system, the second message.

14. The method of claim 9 , wherein the determining the portion of the schedule beginning at the arbitrary start point is by:

obtaining a list of initial schedules;

randomly selecting an initial schedule from the list of initial schedules; and

perturbing parameters of the selected initial schedule until a local minimum of the cost function is reached.

15. The method of claim 9 , further comprising evaluating, by the computing system, the cost function, which for given target states and engagement platform states, finds laser weapon start and stop times and missile intercept times that result in the cost below the threshold cost.

16. The method of claim 9 , wherein the respective state of the object includes target state measurements and data fusion results from non-collocated sensors, and

wherein the receiving the first message related to updated state of the object includes receiving a hash of linked previous messages in the secured chain of linked messages containing the target state measurements and the data fusion results and the determined schedule portion.