{"id":102285,"date":"2021-11-15T15:36:38","date_gmt":"2021-11-15T13:36:38","guid":{"rendered":"https:\/\/prohoster.info\/blog\/novosti-interneta\/deczentralizovannoe-hranilishhe-lf-perevedeno-na-otkrytuyu-liczenziyu"},"modified":"2021-11-15T18:26:22","modified_gmt":"2021-11-15T16:26:22","slug":"deczentralizovannoe-hranilishhe-lf-perevedeno-na-otkrytuyu-liczenziyu","status":"publish","type":"post","link":"https:\/\/prohoster.info\/en\/blog\/news\/deczentralizovannoe-hranilishhe-lf-perevedeno-na-otkrytuyu-liczenziyu","title":{"rendered":"The decentralized storage LF has transitioned to an open license","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

The release of LF 1.1.0 is now available, a decentralized replicable key\/value data storage. The project is developed by ZeroTier, which creates a virtual Ethernet switch that enables connecting hosts and virtual machines hosted by different providers into a single virtual local area network where participants exchange data in a P2P manner. The project's code is written in C. The new release is notable for transitioning to the MPL 2.0 (Mozilla Public License).<\/p>\n

Previously, LF code was available under the BSL (Business Source License), which is not open due to discrimination against certain categories of users. The BSL license was proposed by the co-founders of MySQL as an alternative to the Open Core model. The essence of BSL is that the code for extended functionality is initially available for modification, but for a certain period, it may be used for free only under additional conditions, whereby a commercial license must be purchased to circumvent these conditions.<\/p>\n

LF is a fully decentralized system and allows deploying a unified key-value data storage over an arbitrary number of nodes. Data is stored in a synchronized state across all nodes, and all changes are fully replicated among all nodes. All nodes in LF are equal to each other. The absence of separate nodes coordinating the storage operation eliminates a single point of failure, and having a complete copy of the data on each node prevents information loss if individual nodes fail or are disconnected.<\/p>\n

To connect to the network of a new node, separate permissions are not required \u2014 anyone can launch their own node. The data model in LF is based on a directed acyclic graph (DAG), facilitating synchronization and allowing for various conflict resolution and security strategies. Unlike systems based on distributed hash tables (DHT), the IF architecture is originally designed for use in unreliable networks, where constant availability of nodes is not guaranteed. LF is mentioned as a solution for creating highly resilient storage systems that hold relatively small amounts of critically important data that rarely changes. For example, LF is suitable for key storage, certificates, identification parameters, configuration files, hashes, and domain names<\/a>.<\/p>\n

To protect against overload and abuse, a write operation intensity limit is implemented in the shared storage, based on proof of work \u2014 to gain the ability to store data, a participant in the storage network must complete a specific task that is easily verifiable but requires significant computational resources (similarly to extending blockchain-based systems and CRDT). The computed values are also used as indicators in conflict resolution.<\/p>\n

Alternatively, a certification authority can be launched within the network to issue participants cryptographic certificates, granting the right to add entries without proof of work and providing priority in conflict resolution. By default, the storage is available without restrictions for the connection of any participants, but optionally, based on the certificate system, isolated private storages can be created, where participants may only include nodes certified by the network owner.<\/p>\n

Key features of LF:<\/p>\n