Abstract: The invention relates to a sharded network of peer-to-peer computers (also called nodes) which process incoming transactions to update a local copy of the state data in a dynamically sharded distributed ledger. Dynamic sharding allows the transaction throughput and storage capacity of the network to increase proportional to the number of nodes in the distributed ledger. The invention describes a method by which the number of nodes in the network are automatically increased or decreased to accommodate the actual usage of the network in terms of transaction throughput and storage capacity.

Abstract: A system and method for dynamic state sharding in a distributed ledger are introduced. This approach involves organizing interconnected nodes within a network to efficiently manage data by dividing the address space into equal partitions and forming a ring-based structure. Nodes are assigned to store and manage data in primary partitions and additional adjacent partitions, enabling their participation in consensus for various accounts across these partitions. The system provides consensus when nodes join or leave the network, maintaining consistent performance during changes within the partitions. This method enhances data storage and consensus processing, offering improved scalability and fault tolerance.

Abstract: According to an aspect of the present invention, there is provided a sharded distributed ledger system that employs a network of peer-to-peer replicated state machines. These machines process incoming transactions to update a local copy of the data, ensuring that all participating computers maintain a synchronized copy of said data. The disclosed method enables transactions to be processed independently, without the need for batching or electing a leader to determine transaction processing order. This consensus algorithm is particularly advantageous in networks where data is sharded among computers. Consequently, the consensus mechanism ensures that all computers within a specific shard group maintain a synchronized copy of the corresponding partial data.

Abstract: A system and method for securely streaming media. The system includes a gateway server that receives requests for access to a secured data resource from an end users. The request include an authorization ticket and a referring website. The gateway server validates the authorization ticket using a secret key shared with the referring website, and validates the referring website by verifying that referring website is on a white-list for the secured data resource. The gateway server selects a data server to service the request, and formats a data server access request containing the data server location and data server request parameter data and transmits the data server access request to the end users. When end users transmit the data server access requests to a data server, the data server validates the request and transmits it to the end user.

Abstract: We present a time keeping system for turn-based games which accepts time controls used in fast games but allows the game to be played in a correspondence manner similar to slow games. This gives players the enjoyment of playing fast games with time pressure but at a pace that is convenient for their busy schedule.

Abstract: A system and method for securely streaming media. The system includes a gateway server that receives requests for access to a secured data resource from an end users. The request include an authorization ticket and a referring website. The gateway server validates the authorization ticket using a secret key shared with the referring website, and validates the referring website by verifying that referring website is on a white-list for the secured data resource. The gateway server selects a data server to service the request, and formats a data server access request containing the data server location and data server request parameter data and transmits the data server access request to the end users. When end users transmit the data server access requests to a data server, the data server validates the request and transmits it to the end user.

Abstract: A system and method for the delivery of a portion of a library of data to an end user. The system includes a plurality of data servers and at least one gateway server operatively connected to the end user. When the gateway server receives request from the end user for delivery of at least a portion of the library of data, the gateway server selects one of the plurality of data servers using a stateless addressing method and transmits instructions to the end user which enable the end user to issue a second request to the selected data servers for delivery the data to the end user. When the selected data server receives the second request, the server transmits the requested data to the end user.

Abstract: The present disclosure describes caching systems and methods for managing the storage of data file in different caching levels. Each caching level represents a faster, but more expensive, storage device or location, with the lowest level, or order, of a cache being the fastest, but also most expensive, and the highest being the slowest cache. Even slower than the various system cache levels are external file storage systems referred to as filers, such as database servers. The caching algorithm used by the system is designed so that more frequently requested items migrate to the faster cache areas. The algorithm immediately brings any requested file that is not in the cache into the fastest possible cache area if space is available or else into the next fastest if space is available there. If all cache areas are full, then the file is cached to the highest ‘order’ number cache area.

Abstract: A method of managing sensitive information exchanges between users of a matching service includes receiving sensitive information from a first user and receiving a viewing option from said first user concerning the first user's sensitive information. A first user indication of interest is received from the first user, identifying a second user in whom the first user is interested. The second user is notified of the first user identification of interest, wherein a response is received from the second user concerning the first user identification of interest, the second user response one of interested or disinterested. The second user sensitive information is received from the second user if the second user response is interested, and the second user has not previously provided their sensitive information. The first user is notified of the second user response.