The techniques discussed herein relate to providing a highly available and reliable secret distribution infrastructure. In an implementation, a key master service (KMS) system is disclosed. The KMS system includes one or more computer readable storage media having program instructions stored thereon which, when executed by one or more processing systems, direct the one or more processing systems to identify a hydration event and, responsive to the hydration event, determine if other KMS systems are running in a secret distribution infrastructure. The program instructions, when executed by one or more processing systems, further direct the KMS system to hydrate the KMS system with secret information obtained from the one or more of the other KMS systems when the other KMS systems are running in the secret distribution infrastructure.

A system and process for converting a digital media file into a digital token is disclosed. The embodiments modify a digital media file so that a set of rules are attached to the digital media file creating a digital token, which can be used to persist the digital media file through a network. In an exemplary embodiment, the network is a distributed ledger or blockchain based network that securely tracks distribution of the digital media file. The digital token may have a value added to it or value may intrinsically exist as the digital token is persisted through the network. The value associated with distribution of the digital media file may be used to reward the owner of the digital media file, distributors of the token, or as an incentive program for commercial transactions and non-commercial transactions.

Disclosed is a system and application for digital media that allows users to share a media playlist and synchronize playing for all connected users. The user browses their device for media files to create a playlist, and then hosts the playlist over an existing local area network or creates a Wi-Fi hotspot. The playlist may be encrypted to provide a form of digital rights management. Other users are then prompted to download the playlist and send the host a calculated playback delay. Once all users have completed downloading the playlist the hosting user is prompted to press play, pushing timing information that takes into account the largest delay to all connected users via the active local area network, resulting in all devices playing the media in synchronicity for the duration of the playlist. Additional users may opt in during playback and use the timing information to synchronize their devices' playback.

Disclosed is a system and application for digital media that allows users to share a media playlist and synchronize playing for all connected users. The user browses their device for media files to create a playlist, and then hosts the playlist over an existing local area network or creates a Wi-Fi hotspot. The playlist may be encrypted to provide a form of digital rights management. Other users are then prompted to download the playlist and send the host a calculated playback delay. Once all users have completed downloading the playlist the hosting user is prompted to press play, pushing timing information that takes into account the largest delay to all connected users via the active local area network, resulting in all devices playing the media in synchronicity for the duration of the playlist. Additional users may opt in during playback and use the timing information to synchronize their devices' playback.

Disclosed is a system and application for digital media that allows users to share a media playlist and synchronize playing for all connected users. The user browses their device for media files to create a playlist, and then hosts the playlist over an existing local area network or creates a Wi-Fi hotspot. The playlist may be encrypted to provide a form of digital rights management. Other users are then prompted to download the playlist and send the host a calculated playback delay. Once all users have completed downloading the playlist the hosting user is prompted to press play, pushing timing information that takes into account the largest delay to all connected users via the active local area network, resulting in all devices playing the media in synchronicity for the duration of the playlist. Additional users may opt in during playback and use the timing information to synchronize their devices' playback.

Data are maintained in a distributed computing system that describe a graph. The graph represents relationships among items. The graph has a plurality of vertices that represent the items and a plurality of edges connecting the plurality of vertices. At least one vertex of the plurality of vertices includes a set of label values indicating the at least one vertex's strength of association with a label from a set of labels. The set of labels describe possible characteristics of an item represented by the at least one vertex. At least one edge of the plurality of edges includes a set of label weights for influencing label values that traverse the at least one edge. A label propagation algorithm is executed for a plurality of the vertices in the graph in parallel for a series of synchronized iterations to propagate labels through the graph.

A target hash phrase can be provided to a user on a computer that indicates a target state of the computer. The computer generates a local hash phrase that represents a current state of the computer. The local hash phrase can be used to verify that the computer is at the target state by comparing the local hash phrase with the target hash phrase. The computer may receive corrective input from the user to correct the state of the computer depending on the comparison. The local hash phrase can be generated by computing one or more hash values from data that represent a state of the computer. The one or more hash values correspond to one or more hash words that comprise the hash phrase. Individual letters of each hash word can be selected using segments of a corresponding hash value.

Data are maintained in a distributed computing system that describe a directed graph representing relationships among a set of items. The directed graph models a condition having an associated problem. The directed graph has graph components having associated data fields. The relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified responsive to an operation performed during the analysis. The new value is compared with an existing value of the data field, and the data field is modified. The modification may include inserting the new value into an overflow vector of data, and replacing the existing value in the data field with exception information identifying the location of the new value. An exception flag associated with the data field is set to indicate that the exception information is being used.

Techniques are described for providing a secure digital asset leasing system that enables digital assets to be leased or loaned from owners' computing devices to lessees' computing devices. For example, once a digital asset is leased to a lessee using the secure digital asset leasing system, the original owner of the digital asset may cease to have access to the digital asset until the end of the lease period. The leasing or loaning of a digital asset can broadly refer to a process in which a lessee obtains authorization to use or consume the digital asset (e.g., to display the digital asset on a digital display device) obtained from the owner for a defined duration. During the lease period, a trusted computing device associated with the lessee periodically synchronizes to a synchronization authentication service. A digital asset is accessed or consumed by a lessee using an approved trusted computing device that is securely connected to a display unit.

Data are received at a worker system in a distributed computing system that describe a graph representing relationships among a set of items. The graph models a condition having an associated problem. The graph has graph components having associated data fields. The received data are stored in a backup table, and the relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified and compared with an existing value of the data field, and the data field is modified. The modified data field is stored in a delta table representing a change to the backup table.