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

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.