The disclosed exemplary embodiments include computer-implemented systems, apparatuses, and processes that manage cryptographically secure exchanges of data using a permissioned distributed ledger. For example, an apparatus may obtain parameter data and additional content associated with a data exchange. The apparatus may generate first data that includes at least a portion of the additional content accessible to a first computing system, and may generate second data that includes at least a portion of the parameter data. The apparatus may provide the first data to a peer computing system, which records encrypted information associated with the first data within an element of a distributed ledger accessible at the first computing system. The apparatus may also provide the second data to a second computing system, which executes the data exchange in accordance with at least the portion of the parameter data.

A computer system associates a given file of a file system with append-only policy that is specified by an owner of given file. The computer system can subsequently intercept file system operations for the file system, including file system operations that specify the given file. The computer system can unconditionally apply the append-only policy to requesting entities, independent of the requesting entities' access level with respect to the file system.

A method of performing a virtual network function (VNF) is disclosed. The method comprises forking a user plane process on a computer by a VNF process that executes on the computer, forking a control plane process on the computer by VNF process, adding blocks to a user plane blockchain by the user plane process that record user plane events, and adding blocks to a control plane blockchain by the control plane process that record control plane events. The method also comprises creating a first information package by the user plane process based on the user plane blockchain, self-terminating by the user plane process while passing the first package of information to the VNF process, creating a second information package by the control plane process based on the control plane blockchain, and self-terminating by the control plane process while passing the second package of information to the VNF process.

A key-value store is provided, implementing multiple-tiered sorted data structures in memory and storage, including concurrent write buffers in memory, and page-level consolidation of updates on storage, where pages are trivially translated in physical-to-virtual address mapping. The key-value store is built on an indexed sorted data structure on storage, occupying much less storage space and incurring much less disk activity in consolidating updates than a conventional log-structured merge tree organized into files. Concurrent write buffers operate concurrently and independently so that data is committed from memory to storage in an efficient manner, while maintaining chronological sequence of delta pages. Trivial mapping allows mappings of a number of physical pages to be omitted, enabling page mapping tables to occupy less storage space, and simplifying processing workload of read operation retrievals from storage.

An example operation may include one or more of receiving a location of an output stored on a data structure of a blockchain, where the location comprises a path of hashes generated by a reduced-step hash instead of a full-step hash of the blockchain, performing an approximate hash verification on the path of hashes based on the reduced-step hash values to verify whether the output is unused, and in response to a determination that the output is unused as a result of the approximate hash verification, approving a use of the output by a client associated with the output.

The current document is directed to methods and systems that efficiently process and store log/event messages generated within distributed computer facilities. Various different types of initial processing steps may be applied to a stream of log/event messages received by a message-collector system or a message-ingestion-and-processing subsystem. The currently disclosed methods and systems employ additional pre-processing steps to identify the types of received log/event messages, monitor event-type-associated log/event-message-usage-delay histories, and employ time-series-analysis-based and/or neural-network-based estimation of event-type-associated log/event-message usage to efficiently store log/event-messages in low-cost and low-latency storage facilities.

Systems and methods are provided for monitoring and logging all activity occurring in a system. The logged activity may include keystroke entries input into the system, user and/or application interactions with the system, access restriction conflicts, and the like. The logged activity may be stored in at least two datastores, at least one of which is an immutable, append-only datastore. Storage of the logged activity in the immutable, append-only datastore is performed using hash algorithms. Attempts at manipulating or at hiding malicious or unauthorized activity can be recognized due to all activity being captured in the immutable, append-only datastore.

An interface receives storage requests for storing data in a software-defined storage network using an append-only storage scheme. The requests include an identifier of a data object to be stored. The requests are agnostic of hardware-specific details of the storage devices. A virtualization layer accesses space allocation data for the storage devices; and policies for prioritizing performance. Based on the data and policies, a physical storage location at the plurality of storage devices is selected for storing the data object. Metadata is generated for the data object indicating that the data object is an append-only object and mapping the physical storage location of the data object to the identifier. The request is translated to instructions for storing the data object at the physical storage location using the append-only storage scheme. The data object is stored at the physical storage location using the append-only storage scheme.

An apparatus is disclosed. The apparatus may be implemented in a database node or a storage node and includes one or more processors and memory storing instructions for causing the processor to perform a number of operations. Responsive to a page write request, the apparatus determines an identifier corresponding to the requested page, sends component blocks corresponding to the page to a storage node for appending to an append-only storage log of the storage node, receives the physical location of the stored component blocks, and associates the physical storage location of the stored component blocks with the logical identifier corresponding to the page.

Provided are a method and a system for a massage apparatus-based user information transaction. According to one embodiment of the disclosure, a method for a massage apparatus-based user information transaction includes the steps of: inquiring whether a user gives prior-consent to provision of user information to the outside; if the user gives prior consent to the provision of user information to the outside, collecting, from the massage apparatus, user information including the user's biometric information, and storing same; providing the stored user information to a third party company server; calculating an amount of money to be paid to the user in accordance with the provision of the user information to the outside; and paying the calculated amount of money to the relevant user's account.