uppdate preset to 13
This commit is contained in:
jinhojang6
parent
7acc4f6c41
commit
b55293b6de
|
|
@ -0,0 +1,64 @@
|
|||
---
|
||||
title: Description and architecture
|
||||
sidebar_position: 2
|
||||
---
|
||||
|
||||
Codex is building a durable data storage engine that is fully decentralized, yielding the advantages of corruption and censorship resistance. The solution protects network participants by giving hosts plausible deniability over the data they store and clients provable durability guarantees—up to 99.999999999%—while remaining storage- and bandwidth-efficient, and highly performant.
|
||||
|
||||
Four key features combined differentiate Codex from existing projects in the decentralized storage niche:
|
||||
|
||||
- **Erasure coding:** For efficient redundancy, which increases data durability guarantees
|
||||
|
||||
- **ZK-based proof-of-retrievability:** For lightweight data durability assurances
|
||||
|
||||
- **Lazy repair mechanism:** For more efficient data reconstruction
|
||||
|
||||
- **Incentivization:** To encourage rational behavior and widespread network participation and the provision of finite network resources—namely bandwidth and storage space.
|
||||
|
||||
<br />
|
||||
|
||||
### Incentivized decentralization
|
||||
|
||||
Incentivization mechanisms are among the key pieces missing from traditional file-sharing networks. Codex believes that a robust marketplace-based incentive structure will ensure wide participation across the node types detailed below.
|
||||
|
||||
The development of an adequate incentive structure is driven by the following goals:
|
||||
|
||||
- Supply and demand to encourage optimum network resource usage
|
||||
|
||||
- Increase participation by enabling nodes to utilize their competitive advantages to maximize profits
|
||||
|
||||
- Prevent spam and discourage malicious participation
|
||||
|
||||
Although still to be finalized, the Codex incentive structure will involve participants that want to store data and those provisioning storage posting collateral, with the latter bidding on open storage contracts. This structure aims to ensure that participants' incentives align, resulting in Codex functioning as intended.
|
||||
|
||||
<br />
|
||||
|
||||
### Network architecture
|
||||
|
||||
Codex comprises multiple node types, each taking a different role in the network's operation. Similarly, the hardware demands for each node type vary, enabling those operating resource-restricted devices to participate.
|
||||
|
||||
**Storage nodes**
|
||||
|
||||
As Codex's long-term reliable storage providers, storage nodes stake collateral based on the collateral posted on the request side of contracts and the number of slots that a contract has, which is tied to the durability demanded by the user. Failure to provide periodic proof of data possession results in slashing penalties.
|
||||
|
||||
**Caching nodes**
|
||||
|
||||
Anyone can contribute to Codex as an ephemeral—meaning short lasting—node by caching and serving popular content without requiring reliable or abundant storage. These caching nodes act to scale the network during periods of high demand.
|
||||
|
||||
**Regular nodes**
|
||||
|
||||
Also known as client nodes, regular nodes make requests for other nodes to store, find and retrieve data. Most of the Codex network will be regular nodes and these participants can double as caching nodes to offset the cost of the network resources they consume.
|
||||
|
||||
When a node commits to a storage contract and a user uploads data, the network will proactively verify that the storing node is online and that the data is retrievable. Storage nodes then broadcast proofs of data possession over random intervals.
|
||||
|
||||
If the storage node sends invalid proofs or fails to provide them in time, the network evicts the storage node from the slot and the slot will become available for the first node that generates a valid proof for that slot.
|
||||
|
||||
When the contract is reposted, some of the faulty node's collateral pays for the new storage node's bandwidth fees. Erasure coding complements the repair scheme by allowing the reconstruction of the missing chunks from other chunks in other slots within the same storage contract hosted by other storage nodes.
|
||||
|
||||
<br/>
|
||||
|
||||
|
||||
|
||||
<br/>
|
||||
|
||||
[Read the Codex whitepaper](https://codex.storage/docs/codex-whitepaper.pdf)
|
||||
|
|
@ -0,0 +1,45 @@
|
|||
---
|
||||
title: About
|
||||
sidebar_position: 1
|
||||
---
|
||||
|
||||
Codex is a decentralized data storage platform that provides exceptionally strong censorship resistance and durability guarantees. It serves as the storage branch of the [Logos](https://logos.co/) tech stack. Alongside the computational branch, [Nomos](http://nomos.tech), and the communications branch, [Waku](http://waku.org), it is one of the Logos Collective's foundational projects.
|
||||
|
||||
<br/>
|
||||
|
||||
### Motive
|
||||
|
||||
The remote storage landscape is dominated by an increasingly small number of internet powerhouses—Google, Microsoft, Amazon, etc. While these services score highly in terms of user experience and convenience, centralized cloud data storage suffers from the following drawbacks:
|
||||
|
||||
- Censorship
|
||||
|
||||
- Lack of data ownership
|
||||
|
||||
- Breaches and outages
|
||||
|
||||
- High costs
|
||||
|
||||
Centralized cloud storage providers have an established history of censoring data and, as de facto owners of said data, have the power to do so according to their own standards. Furthermore, centralized platforms have fallen victim to major data breaches and service outages on numerous occasions.
|
||||
|
||||
Such incidents have created a gap in the market for a decentralized, censorship-resistant alternative. Existing peer-to-peer storage and file-sharing networks address some of these issues—such as robustness in the face of network disruptions and desirable resistance to censorship. Yet without adequate incentives and strong data durability guarantees, they make for unsuitable foundations upon which to build truly unstoppable applications.
|
||||
|
||||
Existing decentralized storage solutions purport to improve upon early P2P file-sharing platforms like eDonkey and Gnutella. However, the market still lacks a decentralized storage solution that is efficient in terms of storage and bandwidth usage while offering performance and durability guarantees comparable to incumbents.
|
||||
|
||||
<br/>
|
||||
|
||||
### Decentralizing data storage
|
||||
|
||||
Codex arises from this need for a durable, decentralized storage layer for the web3 tech stack. Such a platform's importance to the decentralized web has long been understood.
|
||||
|
||||
Originally, Ethereum was designed to be the execution layer of what is often referred to as the "Holy Trinity of the Decentralized Web." Alongside Ethereum were decentralized messaging and storage layers Whisper and Swarm, respectively.
|
||||
|
||||
Although Swarm still exists today, its development took a different path than that originally proposed, shifting its priorities to a different set of problems. This led to it being dropped as a viable data storage solution for Ethereum.
|
||||
|
||||
<br/>
|
||||
|
||||
### Enter Codex
|
||||
|
||||
The problem of durable, unstoppable data storage remains, prompting the formation of Codex in 2020. The name "Codex" refers to an ancient form of book—an allusion to the data storage engine's extremely robust—99.999999999%—durability guarantees.
|
||||
|
||||
Codex was announced as a core Logos Collective protocol in June 2023.
|
||||
|
||||
|
|
@ -3,17 +3,23 @@ title: Development roadmap
|
|||
sidebar_position: 4
|
||||
---
|
||||
|
||||
Codex is currently in its first proof of concept iteration, codenamed Dagger. Before Katana—the name of the forthcoming MVP main net release, expected by the end of 2023—we aim to deliver two additional PoC clients, Scimitar and Longsword.
|
||||
### Releases
|
||||
|
||||
- **Dagger:** Codex's first PoC and its current version.
|
||||
Codex is currently in its first proof of concept iteration, codenamed Dagger. Before Katana—the name of the forthcoming beta main net release, expected by the end of 2023—we aim to deliver two additional PoC clients, Scimitar and Longsword
|
||||
|
||||
- **Scimitar:** The PoC-2 client will implement fast erasure coding, the marketplace and partial durability guarantees—expected end of Q2 2023.
|
||||
- **Dagger:** Codex's first PoC and current version.
|
||||
|
||||
- **Longsword:** Codex PoC-3 will improve on the SNARK-based proof-of-retrievability mechanism and add bandwidth incentives to the marketplace—expected end of Q3 2023.
|
||||
- **Scimitar:** The PoC-2 client will implement fast erasure coding, the marketplace and partial durability guarantees—expected end of Q3 2023.
|
||||
|
||||
- **Longsword:** Codex PoC-3 will improve on the SNARK-based remote auditing mechanism and add bandwidth incentives to the marketplace—expected end of Q3 2023.
|
||||
|
||||
- **Katana:** Codex v1 brings payment channels to the network, adds the bandwidth-preserving lazy repair scheme and makes further improvements to durability guarantees.
|
||||
|
||||
The Codex team's subgroups are working on the major milestones detailed below to deliver Codex as a truly unstoppable data storage engine for web3.
|
||||
<br/>
|
||||
|
||||
### Milestones
|
||||
|
||||
The Codex team's subgroups are working on the major milestones detailed below to deliver Codex with the qualities described:
|
||||
|
||||
- **Testing:**
|
||||
|
||||
|
|
@ -33,14 +39,14 @@ The Codex team's subgroups are working on the major milestones detailed below to
|
|||
|
||||
- **Research:**
|
||||
- Write the initial ZK proving scheme
|
||||
- Conduct data availability sampling research with the Ethereum Foundation
|
||||
- Conduct Data Availability Sampling research with the Ethereum Foundation
|
||||
|
||||
<br/>
|
||||
|
||||
### Roadmap rationale
|
||||
|
||||
We believe the above roadmap to be the most logical approach to building a data storage engine with stronger durability guarantees and resistance to censorship than currently offered by Codex's centralized or decentralized counterparts while remaining resistant to censorship.
|
||||
We believe the above roadmap to be the most logical approach to building a data storage engine with stronger durability guarantees and resistance to censorship than currently offered by Codex's centralized or decentralized counterparts while providing incredibly strong resistance to censorship.
|
||||
|
||||
First, we must establish a mechanism through which users can initiate a contract with a storage provider to host their data. Then, we can add the data redundancy required for retrievability. Next, the system needs a way to prove the hosts still have data available. Finally, repairs must be incentivized. Naturally, each layer of sophistication requires testing for economic and technical feasibility.
|
||||
First, we must establish a mechanism through which users can initiate a contract with a storage provider to host their data. Then, we can add erasure coding, required for efficient redundancy and auditing. Next, the system needs a way to prove the hosts still have data available. Finally, repairs must be incentivized. Naturally, each layer of sophistication requires testing for economic and technical feasibility.
|
||||
|
||||
[Contribute to Codex](https://github.com/codex-storage)
|
||||
|
|
@ -3,16 +3,18 @@ title: Core contributors
|
|||
sidebar_position: 3
|
||||
---
|
||||
|
||||
Codex is developed by nine highly experienced protocol and software developers, distributed systems experts, and ZK-cryptography researchers with backgrounds in academia and across the mainstream tech and web3 sectors.
|
||||
|
||||
The contributors working on Codex are split into the subgroups below:
|
||||
|
||||
- **Codex general:** Staffed by a project lead and a project manager with vast collective web3 experience.
|
||||
|
||||
- **Codex marketplace:** Staffed by a development lead and two senior distributed systems engineers.
|
||||
|
||||
- **Codex client:** Staffed by a senior protocol and network engineer that draw on experience with mainstream companies like Philips and JP Morgan Chase.
|
||||
- **Codex client:** Staffed by a senior protocol and network engineer that draw on experience with mainstream companies like Philips and others.
|
||||
|
||||
- **Codex research:** Staffed by two senior distributed systems researchers with backgrounds in academia and with the Ethereum Foundation.
|
||||
|
||||
Codex is looking for more contributors to help build the network and currently has multiple openings for software engineers and other positions. As an open-source public goods project Codex also welcomes community contributions.
|
||||
Codex is looking for more contributors to help build the network and currently has multiple openings for protocol engineers and other positions. As an open-source public goods project Codex also welcomes community contributions.
|
||||
|
||||
[Work with us](https://jobs.status.im/)
|
||||
|
|
@ -1,52 +0,0 @@
|
|||
---
|
||||
title: Description and architecture
|
||||
sidebar_position: 2
|
||||
---
|
||||
|
||||
Codex is building a data storage engine that is fully decentralized, yielding the advantages of corruption and censorship resistance. The solution protects network participants by giving hosts plausible deniability over the data they store and clients provable durability guarantees—up to 99.999999999%—while remaining cost-efficient and highly performant.
|
||||
|
||||
Four key features combined differentiate Codex from existing projects in the decentralized storage niche:
|
||||
|
||||
- **Erasure coding:** For efficient data durability guarantees and opportunities for nodes to self-repair
|
||||
|
||||
- **ZK-based proof-of-retrievability:** For lightweight data availability assurances
|
||||
|
||||
- **Lazy repair mechanism:** For more efficient data reconstruction
|
||||
|
||||
- **Incentivization:** To encourage widespread network participation and the provision of finite network resources—namely bandwidth and storage space.
|
||||
|
||||
<br />
|
||||
|
||||
### Incentivized decentralization
|
||||
|
||||
Incentivization mechanisms are among the key pieces missing from traditional file-sharing networks. Codex believes that a robust marketplace-based incentive structure will ensure wide participation across the node types detailed above.
|
||||
|
||||
The development of an adequate incentive structure is driven by the following goals:
|
||||
|
||||
- Supply and demand to encourage optimum network resource usage.
|
||||
|
||||
- Increase participation by enabling nodes to utilize their competitive advantages to maximize profits.
|
||||
|
||||
- Prevent spam and discourage malicious participation.
|
||||
|
||||
Although still to be finalized, the Codex incentive structure will revolve around participants staking collateral to be rewarded for acting in support of the network and penalized for failing to perform the duties described above. Generally, the provision of bandwidth and storage resources must be incentivized as it is difficult to imagine altruistic participation beyond that of the most ideologically driven participants.
|
||||
|
||||
<br />
|
||||
|
||||
### Network architecture
|
||||
|
||||
Codex is made up of multiple node types, each taking a different role in the network's operation. Similarly, the hardware demands for each node type vary, enabling those operating resource-restricted devices to participate.
|
||||
|
||||
**Storage nodes:** Long-term reliable storage providers, storage nodes stake collateral proportional to the amount of data they're willing to store. Failure to provide periodic proof of data possession results in slashing penalties.
|
||||
|
||||
**Validator nodes:** Validator nodes collect, validate and submit proofs to an adjudicator contract. Staked collateral incentivizes validator nodes to only submit valid proofs.
|
||||
|
||||
**Ephemeral nodes:** Anyone can contribute to Codex as an ephemeral—meaning short lasting—node by caching and serving popular content without requiring reliable or abundant storage. These ephemeral nodes act to scale the network during periods of high demand.
|
||||
|
||||
**Regular nodes:** Also known as client nodes, regular nodes request other nodes to store, find and retrieve data. Most of the Codex network will be regular nodes and these participants can double as ephemeral nodes to offset the cost of the network resources they consume.
|
||||
|
||||
When a node commits to a storage contract and a user uploads data, the network will proactively verify that the storing node is online and that the data is retrievable. Storage nodes broadcast proofs of data possession over random intervals.
|
||||
|
||||
If the storage node sends invalid proofs or fails to provide them in time, the network will repost the contract for any other storage node to accept. When the contract is reposted, some of the faulty node's collateral pays for the new storage node's bandwidth fees. Erasure coding complements active verification by allowing the reconstruction of the full set from a subset of the data.
|
||||
|
||||
|
||||
|
|
@ -1,36 +0,0 @@
|
|||
---
|
||||
title: About
|
||||
sidebar_position: 1
|
||||
---
|
||||
|
||||
The remote storage landscape is dominated by an increasingly small number of internet powerhouses—Google, Microsoft, Amazon, etc. While these services score highly in terms of user experience and convenience, centralized cloud data storage suffers from the following drawbacks:
|
||||
|
||||
- Censorship
|
||||
|
||||
- Lack of data ownership
|
||||
|
||||
- Breaches and outages
|
||||
|
||||
- High costs
|
||||
|
||||
Centralized cloud storage providers have an established history of censoring data and, as de facto owners of said data, have the power to do so according to their own standards. Furthermore, centralized platforms have fallen victim to major data breaches and service outages on numerous occasions.
|
||||
|
||||
Such incidents have created a gap in the market for a decentralized, censorship-resistant alternative. Existing peer-to-peer storage and file-sharing networks address some of the above issues—such as robustness in the face of network disruptions and desirable resistance to censorship. Yet without adequate incentives and strong data availability and persistence guarantees, they make for unsuitable foundations upon which to build truly unstoppable applications.
|
||||
|
||||
Existing decentralized storage solutions purport to improve upon early p2p file-sharing platforms like eDonkey and Gnutella. However, the market still lacks a decentralized storage solution that is cost-efficient and offers comparable performance to centralized providers while providing exceptionally high data retrievability guarantees and giving hosts plausible deniability over the data they store.
|
||||
|
||||
<br/>
|
||||
|
||||
### Decentralizing data storage
|
||||
|
||||
Codex arises from this need for a durable, decentralized storage layer for the web3 tech stack. Such a platform's importance to the decentralized web has long been understood.
|
||||
|
||||
Originally, Ethereum was designed to be the logic layer of what is often referred to as the "Holy Trinity of the Decentralized Web." Alongside Ethereum were decentralized messaging and storage layers Whisper and Swarm, respectively.
|
||||
|
||||
Although Swarm still exists today, its development took a different path than that originally proposed, shifting its priorities to a different set of problems. This led to it being dropped as a viable data storage solution for Ethereum.
|
||||
|
||||
<br/>
|
||||
|
||||
### Enter Codex
|
||||
|
||||
Yet, the problem of durable, unstoppable data storage remains, which prompted the formation of Codex in 2020. The name "Codex" refers to an ancient form of book—an allusion to the data storage engine's best-in-class durability guarantees.
|
||||
|
|
@ -5,7 +5,7 @@ require('dotenv').config()
|
|||
/** @type {import('@docusaurus/types').Config} */
|
||||
const config = {
|
||||
title: 'Codex',
|
||||
url: 'https://url',
|
||||
url: 'https://codex.storage/',
|
||||
baseUrl: '/',
|
||||
|
||||
customFields: {
|
||||
|
|
@ -36,19 +36,25 @@ const config = {
|
|||
},
|
||||
},
|
||||
docs: {
|
||||
routeBasePath: '/about',
|
||||
versions: {
|
||||
current: {
|
||||
label: 'current',
|
||||
},
|
||||
},
|
||||
lastVersion: 'current',
|
||||
routeBasePath: '/',
|
||||
path: 'root-pages',
|
||||
},
|
||||
}),
|
||||
],
|
||||
],
|
||||
themes: ['@docusaurus/theme-mermaid'],
|
||||
|
||||
plugins: [
|
||||
[
|
||||
'@docusaurus/plugin-content-docs',
|
||||
{
|
||||
id: 'about',
|
||||
routeBasePath: '/about',
|
||||
path: 'about',
|
||||
},
|
||||
],
|
||||
],
|
||||
|
||||
themeConfig:
|
||||
/** @type {import('@acid-info/logos-docusaurus-preset').ThemeConfig} */
|
||||
({
|
||||
|
|
@ -77,7 +83,7 @@ const config = {
|
|||
{
|
||||
items: [
|
||||
{
|
||||
href: '/',
|
||||
href: 'https://twitter.com/Codex_storage',
|
||||
label: 'Twitter',
|
||||
},
|
||||
{
|
||||
|
|
@ -105,11 +111,7 @@ const config = {
|
|||
label: 'Work with us',
|
||||
},
|
||||
{
|
||||
href: '/',
|
||||
label: 'Privacy policy',
|
||||
},
|
||||
{
|
||||
href: '/',
|
||||
href: '/terms',
|
||||
label: 'Terms & conditions',
|
||||
},
|
||||
],
|
||||
|
|
|
|||
|
|
@ -15,7 +15,7 @@
|
|||
"typecheck": "tsc"
|
||||
},
|
||||
"dependencies": {
|
||||
"@acid-info/logos-docusaurus-preset": "^1.0.0-alpha.7",
|
||||
"@acid-info/logos-docusaurus-preset": "^1.0.0-alpha.13",
|
||||
"@docusaurus/core": "2.4.1",
|
||||
"@docusaurus/preset-classic": "2.4.1",
|
||||
"@docusaurus/theme-mermaid": "^2.4.1",
|
||||
|
|
|
|||
|
|
@ -0,0 +1,67 @@
|
|||
# Terms of Use
|
||||
|
||||
These terms and conditions (“**Website Terms of Use**”) are entered into by you and us, and they govern your access and use of the Website, including any content and functionality contained in the Website.
|
||||
|
||||
It is your responsibility to read the Website Terms of Use carefully before your use of the Website and your use of the Website means you have agreed to be bound and comply with these Website Terms of Use.
|
||||
|
||||
If you do not agree with these Website Terms of Use, you must not access or use the Website.
|
||||
|
||||
### Content provided for informational purposes only
|
||||
|
||||
Content available on the Website is for informational purposes only and is not intended to address the specific circumstances of any particular individual or entity. Such content may not always be entirely accurate, complete, or up to date and may also include inaccuracies or typographical errors. You are solely responsible for verifying their adequacy, completeness and accuracy and any reliance you place on such content is at your own risk.
|
||||
|
||||
None of the content on this Website should be considered by you as legal, tax, investment, financial, professional or any other type of advice. You should always conduct your own research and seek independent professional advice if necessary. You are solely responsible for the decisions or actions you might take in this respect. We are not liable for any loss resulting from your action (or inaction) and decisions based on this content on this Website.
|
||||
|
||||
Additionally, we are not responsible for any information, content, or services contained in any third-party content or on any third-party websites accessible or linked through this website.
|
||||
|
||||
### Intellectual property rights
|
||||
|
||||
The Website and its contents are made available under free and open source licences. This means that anyone can use, share, and modify such content, as long as they follow the terms of the applicable licence.
|
||||
|
||||
### Third party website links
|
||||
|
||||
To the extent the Website provides any links to a third party website, then their terms and conditions, including privacy policies, govern your use of those third party websites. We have no control over such third party websites and will not be liable for your use of or activities on any third party websites accessed through the Website. If you access such third party websites through the Website, it is at your own risk and you are solely responsible for your activities on such third party websites.
|
||||
|
||||
### Disclaimer
|
||||
|
||||
The Website is provided by us on an ‘as is’ basis and you use the Website at your own sole discretion and risk.
|
||||
|
||||
We disclaims all warranties of any kind, express or implied, including without limitation the warranties of merchantability, fitness for a particular purpose, and non-infringement of intellectual property or other violation of rights. We do not warrant or make any representations concerning the completeness, accuracy, legality, utility, reliability, suitability or availability of the use of the Website, the content on this Website or otherwise relating to the Website, such content or on any sites linked to this site.
|
||||
|
||||
We make no claims that the Website or any of its content is accessible, legally compliant or appropriate in your jurisdiction. Your access or use of the Website is at your own sole discretion and you are solely responsible for complying with any applicable local laws. These disclaimers will apply to the maximum extent permitted by applicable law.
|
||||
|
||||
### Limitation of liability
|
||||
|
||||
We will not be held liable to you under any contract, negligence, strict liability, or other legal or equitable theory for any lost profits, cost of procurement for substitute services, or any special, incidental, or consequential damages related to, arising from, or in any way connected with these Website Terms of Use, the Website, the content on the Website, or your use of the Website, even if we have been advised of the possibility of such damages. In any event, our aggregate liability for such claims is limited to EUR 100 (one hundred Euros). This limitation of liability will apply to the maximum extent permitted by applicable law.
|
||||
|
||||
### Indemnity
|
||||
|
||||
You shall indemnify us and hold us harmless from and against any and all claims, damages and expenses, including attorneys’ fees, arising from or related to your use of the Website, the content on the Website, including without limitation your violation of these Website Terms of Use.
|
||||
|
||||
### Modifications
|
||||
|
||||
We may modify or replace any part of this Website Terms of Use at any time and without notice. You are responsible for checking the Website periodically for any changes. The new Website Terms of Use will be effective immediately upon its posting on the Website.
|
||||
|
||||
### Governing law
|
||||
|
||||
Swiss law governs these Website Terms of Use and any disputes between you and us, whether in court or arbitration, without regard to conflict of laws provisions.
|
||||
|
||||
### Disputes
|
||||
|
||||
In these terms, “dispute” has the broadest meaning enforceable by law and includes any claim you make against or controversy you may have in relation to these Website Terms of Use, the Website, the content on the Website, or your use of the Website
|
||||
|
||||
We prefer arbitration over litigation as we believe it meets our principle of resolving disputes in the most effective and cost effective manner. You are bound by the following arbitration clause, which waives your right to litigation and to be heard by a judge. Please note that court review of an arbitration award is limited. You also waive all your rights to a jury trial (if any) in any and all jurisdictions.
|
||||
|
||||
If a (potential) dispute arises, you must first use your reasonable efforts to resolve it amicably with us. If these efforts do not result in a resolution of such dispute, you shall then send us a written notice of dispute setting out (i) the nature of the dispute, and the claim you are making; and (ii) the remedy you are seeking.
|
||||
|
||||
If we and you are unable to further resolve this dispute within sixty (60) calendar days of us receiving this notice of dispute, then any such dispute will be referred to and finally resolved by you and us through an arbitration administered by the Swiss Chambers’ Arbitration Institution in accordance with the Swiss Rules of International Arbitration for the time being in force, which rules are deemed to be incorporated herein by reference. The arbitral decision may be enforced in any court. The arbitration will be held in Zug, Switzerland, and may be conducted via video conference virtual/online methods if possible. The tribunal will consist of one arbitrator, and all proceedings as well as communications between the parties will be kept confidential. The language of the arbitration will be in English. Payment of all relevant fees in respect of the arbitration, including filing, administration and arbitrator fees will be in accordance with the Swiss Rules of International Arbitration.
|
||||
|
||||
Regardless of any applicable statute of limitations, you must bring any claims within one year after the claim arose or the time when you should have reasonably known about the claim. You also waive the right to participate in a class action lawsuit or a classwide arbitration against us.
|
||||
|
||||
### About these Website Terms of Use
|
||||
|
||||
These Website Terms of Use cover the entire agreement between you and us regarding the Website and supersede all prior and contemporaneous understandings, agreements, representations and warranties, both written and oral, with respect to the Website.
|
||||
|
||||
The captions and headings identifying sections and subsections of these Website Terms of Use are for reference only and do not define, modify, expand, limit, or affect the interpretation of any provisions of these Website Terms of Use.
|
||||
|
||||
If any part of these Website Terms of Use is held invalid or unenforceable, that part will be severable from these Website Terms of Use, and the remaining portions will remain in full force and effect. If we fail to enforce any of these Website Terms of Use, that does not mean that we have waived our right to enforce them.
|
||||
|
|
@ -5,40 +5,40 @@ import {
|
|||
HeroActions,
|
||||
HeroAction,
|
||||
CallToActionSection,
|
||||
CallToActionButton,
|
||||
FeatureList,
|
||||
Showcase,
|
||||
HeroModel,
|
||||
HeroInfo,
|
||||
Box,
|
||||
} from '../components/mdx'
|
||||
|
||||
<Hero size="large">
|
||||
<Hero size="medium">
|
||||
<HeroInfo>
|
||||
<HeroTitle>The web3 managing standard</HeroTitle>
|
||||
<HeroTitle>Durable, decentralized data storage</HeroTitle>
|
||||
{/*
|
||||
<HeroDescription>
|
||||
Waku is a decentralized communications network that enables private, censorship-resistant messaging for web3 applications.
|
||||
</HeroDescription>
|
||||
<HeroDescription className={"long"}>
|
||||
Waku is a decentralized communications network that enables private, censorship-resistant messaging for web3
|
||||
applications.
|
||||
</HeroDescription>
|
||||
* */}
|
||||
<HeroDescription>
|
||||
WAKU IS A DECENTRALIZED COMMUNICATIONS NETWORK.
|
||||
<HeroDescription className={'short'}>
|
||||
Codex provides immutable, censorship-resistant data storage via a
|
||||
censorship-resistant, permissionless and incentivized p2p network
|
||||
</HeroDescription>
|
||||
<HeroActions>
|
||||
<HeroAction href="https://docs.waku.org" target="_blank">
|
||||
Build on Waku
|
||||
</HeroAction>
|
||||
<HeroAction variant="filled" href="https://docs.waku.org" target="_blank">
|
||||
Run Waku
|
||||
<HeroAction href="https://twitter.com/Codex_storage" target="_blank">
|
||||
Follow Codex
|
||||
</HeroAction>
|
||||
</HeroActions>
|
||||
</HeroInfo>
|
||||
<HeroModel
|
||||
modelUrl="/hero/bulanding-generic-hand-01.glb"
|
||||
layout="floating"
|
||||
renderer="ascii"
|
||||
initialX={-0.9831336272264352}
|
||||
initialY={-0.14592188008227222}
|
||||
rotateSpeed={0.1}
|
||||
modelId={'architecture05'}
|
||||
mode={'simple'}
|
||||
rotateSpeed={0.04}
|
||||
startY={'top'}
|
||||
asciiConfig={{
|
||||
characters: ' .,:;ox%# ||| ||| waku @',
|
||||
characters: ' + ^ ^%%%0 -a @@@ ###',
|
||||
}}
|
||||
/>
|
||||
</Hero>
|
||||
|
|
@ -47,61 +47,54 @@ import {
|
|||
id="features"
|
||||
features={[
|
||||
{
|
||||
title: 'Private',
|
||||
title: 'Durable',
|
||||
description:
|
||||
'Waku leverages cutting-edge zero-knowledge encryption to ensure all messages and associated metadata benefit from rock-solid privacy guarantees.',
|
||||
'Codex implements advanced erasure coding techniques to ensure data stored is always retrievable without relying on inefficient full replication methods.',
|
||||
},
|
||||
{
|
||||
title: 'Runs anywhere',
|
||||
title: 'Accessible',
|
||||
description:
|
||||
"Waku's modularity enables developers to integrate Waku protocols according to their use case and users' hardware restraints",
|
||||
"Participating in the Codex network is highly accessible thanks to its permissionless nature, and bandwidth usage optimizations like its \"lazy repair\" system and lightweight ZK-based remote auditing system.",
|
||||
},
|
||||
{
|
||||
title: 'Scalable',
|
||||
title: 'Decentralized',
|
||||
description:
|
||||
'Waku aims to scale to support millions of users by dividing the flow of messages into shards—not every node needs to forward every message—while discovery protocols ensure users connect to the nodes serving relevant messages.',
|
||||
'The network\'s native marketplace incentivizes wide participation, ensuring robust resistance to censorship and external attack.',
|
||||
},
|
||||
{
|
||||
title: 'Secure',
|
||||
title: 'Low-cost',
|
||||
description:
|
||||
"Waku's native incentivization mechanisms ensure a wide node distribution, making it highly secure and strengthening its privacy assurances.",
|
||||
"Codex's design slashes the costs associated with traditional cloud storage providers while democratizing opportunities to contribute excess system resources to the network.",
|
||||
},
|
||||
]}
|
||||
/>
|
||||
>
|
||||
</FeatureList>
|
||||
|
||||
<CallToActionSection
|
||||
title="User adoptions"
|
||||
description="Waku has brought private, censorship-resistant communications to several notable web3 DApps, decentralizing their messaging components:"
|
||||
label="Decentralize your DApp"
|
||||
href="/join"
|
||||
/>
|
||||
<Box top={{ xs: 144, lg: 216 }}>
|
||||
<CallToActionSection
|
||||
title="Used by"
|
||||
columns={2}
|
||||
description="Codex is still under development as part of the Logos Collective's tech stack. Logos builds shared public infrastructure to provide trust-minimized, corruption-resistant governing services and social institutions to underserved citizens."
|
||||
/>
|
||||
</Box>
|
||||
|
||||
<Showcase
|
||||
id="showcase"
|
||||
items={[
|
||||
{
|
||||
name: 'XMTP',
|
||||
logo: '/showcase/xmtp-mark-white.svg',
|
||||
description:
|
||||
"Inter-blockchain account messaging protocol XMTP uses Waku's Go implementation to facilitate communication between nodes in its currently permissioned network.",
|
||||
},
|
||||
{
|
||||
name: 'Status',
|
||||
logo: '/showcase/status-mark-white.svg',
|
||||
description:
|
||||
"Waku powers many of the Status super app's features, including its private messaging.",
|
||||
},
|
||||
{
|
||||
name: 'Railgun',
|
||||
logo: '/showcase/railgun-mark-white.svg',
|
||||
description:
|
||||
'The privacy-focused DeFi protocol Railgun anonymizes Ethereum transactions with Waku. ',
|
||||
},
|
||||
]}
|
||||
/>
|
||||
<Box top={{ xs: 144, lg: 216 }}>
|
||||
<CallToActionSection
|
||||
title="Contributors"
|
||||
columns={1}
|
||||
description="The contributors building Codex draw on decades of collective software development experience with household names from within the traditional technology and blockchain sectors."
|
||||
label="Read more"
|
||||
href="/about/team"
|
||||
target="_self"
|
||||
/>
|
||||
</Box>
|
||||
|
||||
<CallToActionSection
|
||||
title="Join the community to discover what Waku can bring to your DApp"
|
||||
label="Decentralize your DApp"
|
||||
href="/join"
|
||||
/>
|
||||
<Box top={{ xs: 144, lg: 216 }}>
|
||||
<CallToActionSection
|
||||
title="Development roadmap"
|
||||
description="Codex currently exists as a proof-of-concept network and aims to release its beta version, codenamed Katana, by the end of Q4, 2023. To get there, the team will deliver a second and third PoC client, each of which will introduce progressively more advanced features."
|
||||
label="Read more"
|
||||
href="/about/roadmap"
|
||||
target="_self"
|
||||
/>
|
||||
</Box>
|
||||
|
|
|
|||
|
|
@ -1 +0,0 @@
|
|||
# hello
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
Before Width: | Height: | Size: 65 KiB After Width: | Height: | Size: 58 KiB |
19
yarn.lock
19
yarn.lock
|
|
@ -2,13 +2,13 @@
|
|||
# yarn lockfile v1
|
||||
|
||||
|
||||
"@acid-info/logos-docusaurus-preset@^1.0.0-alpha.3":
|
||||
version "1.0.0-alpha.3"
|
||||
resolved "https://registry.yarnpkg.com/@acid-info/logos-docusaurus-preset/-/logos-docusaurus-preset-1.0.0-alpha.3.tgz#717f7538227745be17c757706385bba586233c47"
|
||||
integrity sha512-tDX1blQFjej5UbMYYL5sVhVYP6ePLLmpdckR/Lwu8Or1LRiDBmFSMoiOVhSYNYRAnDZEp0IyNlkyr2s+qnV/hg==
|
||||
"@acid-info/logos-docusaurus-preset@^1.0.0-alpha.13":
|
||||
version "1.0.0-alpha.13"
|
||||
resolved "https://registry.yarnpkg.com/@acid-info/logos-docusaurus-preset/-/logos-docusaurus-preset-1.0.0-alpha.13.tgz#da9ef880598a48513b06d66e2b411fe732ef5f05"
|
||||
integrity sha512-pGFblt957C9aYMautNO8oEEQQW7WRQ+7MGbkHbmfJHiSBIaLLrYi5B9Kkj5tud5LoFuZ3qh6Hk2L6WXU7faOCA==
|
||||
dependencies:
|
||||
"@acid-info/logos-docusaurus-search-local" "^1.0.0-alpha.0"
|
||||
"@acid-info/logos-docusaurus-theme" "^1.0.0-alpha.3"
|
||||
"@acid-info/logos-docusaurus-theme" "^1.0.0-alpha.13"
|
||||
"@docusaurus/core" "^2.4.1"
|
||||
"@docusaurus/module-type-aliases" "^2.4.1"
|
||||
"@docusaurus/preset-classic" "^2.4.1"
|
||||
|
|
@ -34,12 +34,11 @@
|
|||
"@easyops-cn/docusaurus-search-local" "^0.33.6"
|
||||
lodash "^4.17.21"
|
||||
|
||||
"@acid-info/logos-docusaurus-theme@^1.0.0-alpha.3":
|
||||
version "1.0.0-alpha.3"
|
||||
resolved "https://registry.yarnpkg.com/@acid-info/logos-docusaurus-theme/-/logos-docusaurus-theme-1.0.0-alpha.3.tgz#bb7ceaa0bb1682a759c6c5ec013a7f20c99dd8f2"
|
||||
integrity sha512-eqfICp8xepgH02QuKakXShZYmQmxoAMEmC6Q8GsqnrJKGVAdmn5hfl6ojlf17/BRRSPJ8QhTUGdpJwWoiYmMBQ==
|
||||
"@acid-info/logos-docusaurus-theme@^1.0.0-alpha.13":
|
||||
version "1.0.0-alpha.13"
|
||||
resolved "https://registry.yarnpkg.com/@acid-info/logos-docusaurus-theme/-/logos-docusaurus-theme-1.0.0-alpha.13.tgz#de118574ee54f1f7569a0ffd3b3db0688e63ee5f"
|
||||
integrity sha512-nqUvJ/0iKyXiu05NJXTLjmpK1XGUBGvWyStfFNXkRnFPzzaIZ/NfKO84+HKdF1B1OFmQjfBQvAaVrQL/8HYrsw==
|
||||
dependencies:
|
||||
"@acid-info/logos-docusaurus-preset" "^1.0.0-alpha.3"
|
||||
"@acid-info/lsd-react" "^0.1.0-alpha.8"
|
||||
"@docusaurus/core" "^2.4.1"
|
||||
"@docusaurus/mdx-loader" "^2.4.1"
|
||||
|
|
|
|||
Loading…
Reference in New Issue