Data structures for computationally efficient data promulgation among devices in decentralized networks

Disclosed are approaches for computationally-efficient data promulgation among devices in a network. Structured databases may comprise standardized and immutable bytes, each byte linked to a unique data field, a mutable state element, and a mutable activation element. The state element may indicate...

Full description

Saved in:
Bibliographic Details
Main Authors Wright, John T, Kushner, Kristine Ing
Format Patent
LanguageEnglish
Published 15.02.2022
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:Disclosed are approaches for computationally-efficient data promulgation among devices in a network. Structured databases may comprise standardized and immutable bytes, each byte linked to a unique data field, a mutable state element, and a mutable activation element. The state element may indicate that there has been a mutation as well as a recency of the mutation. The activation element may indicate whether data pushes and/or data pulls are enabled. The state elements are configured to automatically mutate if there is a mutation in a corresponding unique data field. Each device in the network may transmit API calls as state-element requests to other entity devices in a network. The API call includes at least one byte, without any values in corresponding data fields. State elements are promulgated among devices, without sharing the data fields themselves. An optional central system maintains a record of state elements without storing data field values.
Bibliography:Application Number: US202016794059