© 2024 Orchid Technologies
*All references to “Orchid” are intended to refer to the Orchid platform.
INTRODUCING THE FUTURE
OF DATA STORAGE DESIGN
ORCHID’S NEW OPEN SOURCE INITIATIVE FOR DECENTRALIZED, INCENTIVIZED DATA STORAGE.
CORE CONCEPTS
OF ORCHID’S DECENTRALIZED STORAGE INITIATIVE
ADVANCED ERASURE CODING
Cutting-edge data protection with byte-level repair capabilities, surpassing traditional file-level repairs for enhanced efficiency. Utilizes a Twin Coding scheme for bandwidth efficiency.
RIGOROUS AUDIT MECHANISMS
Ensure data integrity with a comprehensive self-audit system, designed to maintain the highest standards of security while remaining decentralized.
BONDED COMMITMENT
Providers are incentivized to perform self-audits to collect payments through bonded commitments, which utilize KZG to be efficient.
STAKE-WEIGHTED RANDOM SELECTION
Clients choose providers from the available pool utilizing the existing Orchid Directory mechanism, which harnesses OXT staking for incentive alignment.
This comparative analysis offers a detailed examination of how Orchid’s proposed storage solutions measure up against industry benchmarks. It delves into the technical and operational nuances of leading projects, revealing the strengths and potential pitfalls of each.
KEY ELEMENTS
OF STORAGE DESIGN
With Orchid’s storage initiative, clients are able to select a cohort of providers using the Orchid directory mechanism, erasure code their data with twin coding, send data to providers, and perform payments. Through incentive alignment, clients are able to go offline and be assured that their data will be there when they come back. Providers advertise their storage capabilities by locking funds in a staking contract, prove that they are storing data correctly by making bonded commitments and performing self-audits, and help maintain data availability by participating in repairs.
READ ON
ARTICLES EXPLORING THE STORAGE ARCHITECTURE
