Patent classifications
G06F16/275
Computing system providing blockchain-facilitated semantic interoperability between multiple disparate systems of record (SORs) and related methods
A system for propagating an identity state change set about shared identities may include a plurality of systems of record (SORs), and a management server cooperating with the plurality of SORs and configured to: detect discrete Create-Retrieve-Update-Delete (CRUD) operations on a given SOR related to at least one shared identity to generate an identity state change set corresponding to a current state of the at least one shared identity; transact the identity state change set, with associated metadata, to a distributed immutable long-term storage as a current transaction; propagate the identity state change set and associated metadata to replicate a current state of the at least one shared identity as of the current transaction to at least one domain cache instance, and; synchronize the current state of the at least one shared identity across the plurality of SORs from the at least one domain cache instance.
Computerized system and method for electronically synchronizing work station sessions over a network
Disclosed are systems and methods for improving file and application management supported by or configured with an installed application program or platform running the client's device or on the cloud (or on a server). The present disclosure describes computer systems and methods for an application that provides a single-touch/input, session management function that allows a user to store all desired information related to open files and programs. The desired information also includes status information related to the open files and programs, whereby a user can “pause” working on the files/programs by closing the files/programs, and when executing the disclosed application, the previous status of the files/programs can be reloaded, enabling the user to continue working seamlessly.
SYSTEMS AND METHODS FOR STREAMING CLASSIFICATION OF DISTRIBUTED LEDGER-BASED ACTIVITIES
Systems and methods for streaming classification of distributed ledger-based activities are disclosed. In one embodiment, a method for streaming classification of distributed ledger-based activities may include: receiving, at a detection computer program executed by a server and from a distributed ledger network, information for a plurality of transactions; receiving, from a database and at the detection computer program, node information that identifies a plurality of nodes as involved in illicit transactions, as being involved in licit transactions, or unknown; applying, by the detection computer program, exponential time sampling to sample labels and associated features; training, by the detection computer program, a classifier; receiving, by the detection computer program, a streaming transaction from the distributed ledger network; predicting, by the detection computer program, a classification for the streaming transaction using the trained classifier; and outputting, by the detection computer program, an alert based on the prediction.
HIGH FREQUENCY SNAPSHOT TECHNIQUE FOR IMPROVING DATA REPLICATION IN DISASTER RECOVERY ENVIRONMENT
A high frequency snapshot technique improves data replication in a disaster recovery (DR) environment. A base snapshot is generated from failover data at a primary site and replicated to a placeholder file at a secondary site. Upon commencement of the base snapshot generation and replication, incremental light weight snapshots (LWSs) of the failover data are captured and replicated to the secondary site. A staging file at the secondary site accumulates the replicated LWSs (“high-frequency snapshots”). The staging file is populated with the LWSs in parallel with the replication of the base snapshot at the placeholder file. At a subsequent predetermined time interval, the accumulated LWSs are synthesized to capture a “checkpoint” snapshot by applying and pruning the accumulated LWSs at the staging file. Once the base snapshot is fully replicated, the pruned LWSs are merged to the base snapshot to synchronize the replicated failover data.
TWO-ROUND BYZANTINE FAULT TOLERANT (BFT) STATE MACHINE REPLICATION (SMR) PROTOCOL WITH LINEAR AUTHENTICATOR COMPLEXITY AND OPTIMISTIC RESPONSIVENESS
The present disclosure is directed to a leader-based partially synchronous BFT SMR protocol that improves upon existing protocols by exhibiting two rounds of communication latency, linear authenticator complexity, and optimistic responsiveness. This is achieved through the novel use of an aggregate signature scheme as part of the protocol's view-change procedure.
TIME ALIGNMENT IN DIRECTOR-BASED DATABASE SYSTEM FOR TRANSACTIONAL CONSISTENCY
Techniques are disclosed relating to a database system includes worker nodes operable to perform transactions and director nodes operable to ensure transactional consistency for the transactions. A worker node may receive a request to perform a transaction involving writing a record. The worker node may then issue, to director nodes of the database system, a request for information that facilitates performance of an operation for the transaction. A director node may determine whether to approve the request based on whether the operation could cause transactional inconsistency in the database system. The worker node may proceed to perform the operation for the transaction in response to receiving approval responses from a majority of the director nodes, with none of the received responses indicating a disapproval of the transaction.
TIME PROPOSALS IN DIRECTOR-BASED DATABASE SYSTEM FOR TRANSACTIONAL CONSISTENCY
Techniques are disclosed relating to a database system includes worker nodes operable to perform transactions and director nodes operable to ensure transactional consistency for the transactions. A worker node may receive a request to perform a transaction involving writing a record. The worker node may then issue, to director nodes of the database system, a request for information that facilitates performance of an operation for the transaction. A director node may determine whether to approve the request based on whether the operation could cause transactional inconsistency in the database system. The worker node may proceed to perform the operation for the transaction in response to receiving approval responses from a majority of the director nodes, with none of the received responses indicating a disapproval of the transaction.
CONFLICT-FREE GRAPHS OF DISTRIBUTED DATA STRUCTURES
A device implementing a system for obtaining a consistent state of data based on data updates made on different devices includes a processor configured to generate, for a first data update, a first data model including first data nodes, each including a first identifier and a first data value corresponding to one of first data objects. The processor is configured to receive from a second device, for a second data update to the data, the second update being independent of the first update, a second data model including second data nodes, each including a second identifier and a second data value corresponding to one of second data objects. A consistent data model is obtained by merging the first and second data values with the same identifier, and then merging the first and second data models, and generating a final update of the data based on the consistent data model.
Systems, methods, and program products for depositing, holding and/or distributing collateral as a token in the form of digital assets on an underlying blockchain
The present invention relates to a method, system, and program product for depositing, holding and/or distributing collateral in the form of a stable value token for a security token, the tokens being on the same underlying blockchain. Furthermore, the present invention relates to methods, systems, and program products for lending digital assets, such as crypto currency and other related products.
High Bandwidth Content Addressable Memory (CAM) Based Hardware Architecture For Datacenter Networking
A communication protocol system is provided for reliable transport of packets. A content addressable memory hardware architecture including a reorder engine and a retransmission engine may be utilized for the reliable transport of the packets. The content addressable memory module includes a primary CAM that may be logically partitioned into a plurality of physical sub-CAMs. One or more processors are in communication with the content addressable memory module. The one or more processors receive a set of data packets. A lookup operation is performed by the one or more processors to access data entries stored in each of the sub-content addressable memories. An update operation is performed by the one or more processors at a selected sub-content addressable memory from the plurality of the sub-content addressable memories.