{"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\/da\/blog\/news\/deczentralizovannoe-hranilishhe-lf-perevedeno-na-otkrytuyu-liczenziyu","title":{"rendered":"Det decentrale lager LF er blevet overf\u00f8rt til en \u00e5ben licens.","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

Udgaven LF 1.1.0 er tilg\u00e6ngelig, et decentraliseret replikerbart datalager i n\u00f8gle\/v\u00e6rdi-format. Projektet udvikles af ZeroTier, som udvikler en virtuel Ethernet-switch, der muligg\u00f8r sammenkobling af hosts og virtuelle maskiner placeret hos forskellige udbydere i et virtuelt lokalt netv\u00e6rk, hvor deltagerne udveksler data i P2P-tilstand. Koden til projektet er skrevet i C. Den nye udgave er bem\u00e6rkelsesv\u00e6rdig ved overgangen til den \u00e5bne licens MPL 2.0 (Mozilla Public License).<\/p>\n

Tidligere var LF-koden tilg\u00e6ngelig under BSL (Business Source License), som ikke er en \u00e5ben licens p\u00e5 grund af forskelsbehandling af bestemte brugergrupper. BSL-licensen blev foresl\u00e5et af medstifterne af MySQL som et alternativ til Open Core-modellen. Essensen af BSL er, at koden til den udvidede funktionalitet oprindeligt er tilg\u00e6ngelig for \u00e6ndringer, men i en periode kun kan anvendes gratis under overholdelse af yderligere betingelser, for hvilke det kr\u00e6ver k\u00f8b af en kommerciel licens at omg\u00e5.<\/p>\n

LF er et fuldst\u00e6ndig decentraliseret system, der g\u00f8r det muligt at implementere et enkelt datalager i n\u00f8gle-v\u00e6rdi-format over et vilk\u00e5rligt antal noder. P\u00e5 alle noder opbevares data i synkroniseret tilstand, og alle \u00e6ndringer replikeres helt mellem alle noder. Alle noder i LF er lige. Frav\u00e6ret af enkelte noder, der koordinerer lagerets funktionalitet, eliminerer en enkelt fejlpunkt, og det at have en fuld kopi af data p\u00e5 hver node forhindrer datatab ved fejlfunktion eller nedlukning af enkelte noder.<\/p>\n

For connecting to the network of a new node, no separate permissions are required \u2014 anyone can launch their own node. The data model in LF is based on a directed acyclic graph (DAG), which simplifies synchronization and allows for various strategies for conflict resolution and security. Unlike systems based on distributed hash tables (DHT), the IF architecture is originally designed for use in unreliable networks, where the constant availability of nodes cannot be guaranteed. LF is mentioned as suitable for creating maximally resilient storage systems that store relatively small volumes of critically important data that change rarely. For example, LF is suitable for storing keys, certificates, identity parameters, configuration files, hashes, and domenenavne<\/a>.<\/p>\n

To protect against overload and abuse, a limitation on the intensity of write operations to the shared storage is implemented based on proof of work \u2014 to gain the ability to store data, a participant in the storage network must perform a certain task that is easy to verify but requires significant resources to compute (similarly to the organization of expanding systems based on blockchain and CRDT). The computed values are also used as criteria for conflict resolution.<\/p>\n

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

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