Add Topics to Codex
This commit is contained in:
jessiebroke
parent
f322108d63
commit
a9a6174c51
|
|
@ -30,8 +30,8 @@
|
|||
"collapse-forces": false,
|
||||
"centerStrength": 0,
|
||||
"repelStrength": 20,
|
||||
"linkStrength": 0.876960037198729,
|
||||
"linkStrength": 1,
|
||||
"linkDistance": 500,
|
||||
"scale": 0.6783917640070826,
|
||||
"scale": 0.0704632033726672,
|
||||
"close": true
|
||||
}
|
||||
|
|
@ -17,6 +17,27 @@
|
|||
},
|
||||
"pinned": true
|
||||
}
|
||||
},
|
||||
{
|
||||
"id": "98ef832042f753e0",
|
||||
"type": "leaf",
|
||||
"state": {
|
||||
"type": "markdown",
|
||||
"state": {
|
||||
"file": "pages/Decentralized Storage.md",
|
||||
"mode": "source",
|
||||
"backlinks": false,
|
||||
"source": false
|
||||
}
|
||||
}
|
||||
},
|
||||
{
|
||||
"id": "a71780502c9a151c",
|
||||
"type": "leaf",
|
||||
"state": {
|
||||
"type": "empty",
|
||||
"state": {}
|
||||
}
|
||||
}
|
||||
],
|
||||
"direction": "vertical"
|
||||
|
|
@ -73,7 +94,7 @@
|
|||
"state": {
|
||||
"type": "backlink",
|
||||
"state": {
|
||||
"file": "pages/Start Here.md",
|
||||
"file": "pages/Decentralized Storage.md",
|
||||
"collapseAll": false,
|
||||
"extraContext": false,
|
||||
"sortOrder": "alphabetical",
|
||||
|
|
@ -102,17 +123,17 @@
|
|||
"width": 300,
|
||||
"collapsed": true
|
||||
},
|
||||
"active": "8143718c5f145084",
|
||||
"active": "98ef832042f753e0",
|
||||
"lastOpenFiles": [
|
||||
"pages/Start Here.md",
|
||||
"pages/Project Logos.md",
|
||||
"pages/Project Codex.md",
|
||||
"pages/Remote Auditing.md",
|
||||
"pages/Project Waku.md",
|
||||
"pages/Set of Implementations.md",
|
||||
"pages/Network of Nodes.md",
|
||||
"pages/Set of Protocols.md",
|
||||
"pages/Decentralized Storage.md",
|
||||
"pages/Redundancy.md"
|
||||
"pages/Project Codex.md",
|
||||
"pages/durability.md",
|
||||
"pages/Node Reputation.md",
|
||||
"pages/Project Logos.md",
|
||||
"pages/Consensus.md",
|
||||
"pages/Dispersal.md",
|
||||
"pages/Redundancy.md",
|
||||
"pages/Start Here.md",
|
||||
"pages/Untitled.md"
|
||||
]
|
||||
}
|
||||
109
pages/BBA.md
109
pages/BBA.md
|
|
@ -1,109 +0,0 @@
|
|||
---
|
||||
title:
|
||||
author:
|
||||
dateCreated:
|
||||
dateUpdated: 2022-05-23
|
||||
---
|
||||
|
||||
---
|
||||
|
||||
# Topic: Binary Byzantine Agreement (BBA)
|
||||
## Chat: [Places for Live Discussion]
|
||||
|
||||
#### Tags: [[Tags]]
|
||||
|
||||
```
|
||||
ELI5: Process of a distributed network coming to an agreement between two options OR the proposal, decision-making process, and eventual conclusion/convergence of a two-option Byzantine-contexted scenario.
|
||||
```
|
||||
---
|
||||
|
||||
## Overview
|
||||
|
||||
#### Operating Definition:
|
||||
Binary byzantine consensus concerns the problem of getting a set of distinct processes distributed across a network to agree on a single binary value 0 or 1 where processes can fail in arbitrary ways.<sup>1</sup>
|
||||
|
||||
#### Principles
|
||||
[What principle(s) are we trying to protect by innovating on this front? The solution that is aligned with the original Ethereum ethos to which Status is preserving ideological alignment with.]
|
||||
|
||||
#### Implementation
|
||||
- Description and Explanation
|
||||
[Technical Why goes here. Systems that are very similar to us or are the current "best-in-class" that we are trying to improve upon for a given factor (define context-relevant network assumptions per phrase, ideally we'll come up with visual sliding bars to show complex relationships between increasing/decreasing factors and how we go from "research" assumptions to "production" engineering) and why?]
|
||||
- Key Differences:
|
||||
[Easy low-hanging fruit for marketing or communication that makes our implementation clearly different/better.]
|
||||
- Additional Information:
|
||||
[Quickly share unread but potentially valuable resources and comments here to be re-read by someone else who can integrate them.]
|
||||
|
||||
|
||||
---
|
||||
title:
|
||||
author:
|
||||
dateCreated:
|
||||
dateUpdated: @today
|
||||
---
|
||||
|
||||
---
|
||||
|
||||
# Topic: [Insert Topic]
|
||||
## Chat: [Live Discussion]
|
||||
|
||||
#### Tags: [Relevant Tags to Topic/Concept] see [[Tags]]
|
||||
|
||||
```
|
||||
ELI5: Simple explainer.
|
||||
```
|
||||
---
|
||||
|
||||
## Overview
|
||||
|
||||
#### Operating Definition:
|
||||
[Definition here]<sup>1</sup>
|
||||
|
||||
#### Principles
|
||||
[What principle(s) are we trying to protect by innovating on this front? The solution that is aligned with the original Ethereum ethos to which Status is preserving ideological alignment with.] see [[Principles]]
|
||||
|
||||
#### Implementation
|
||||
- Description and Explanation
|
||||
[Technical Why goes here. Systems that are very similar to us or are the current "best-in-class" that we are trying to improve upon for a given factor (define context-relevant network assumptions per phrase, ideally we'll come up with visual sliding bars to show complex relationships between increasing/decreasing factors and how we go from "research" assumptions to "production" engineering) and why?]
|
||||
- Key Differences:
|
||||
[Easy low-hanging fruit for marketing or communication that makes our implementation clearly different/better.]
|
||||
- Additional Information:
|
||||
[Quickly share unread but potentially valuable resources and comments here to be re-read by someone else who can integrate them.]
|
||||
|
||||
---
|
||||
|
||||
FILL IN ABOVE TEMPLATE AND DELETE BELOW -OR- COPY PASTA BELOW AND DELETE ABOVE
|
||||
|
||||
---
|
||||
title:
|
||||
author:
|
||||
dateCreated:
|
||||
dateUpdated: @today
|
||||
---
|
||||
|
||||
---
|
||||
|
||||
# Topic:
|
||||
## Chat:
|
||||
|
||||
#### Tags:
|
||||
|
||||
```
|
||||
ELI5: Simple explainer.
|
||||
```
|
||||
---
|
||||
|
||||
## Overview
|
||||
|
||||
#### Operating Definition:
|
||||
[Definition here]<sup>1</sup>
|
||||
|
||||
#### Principles
|
||||
N/A
|
||||
|
||||
#### Implementation
|
||||
- Description and Explanation
|
||||
N/A
|
||||
- Key Differences:
|
||||
N/A
|
||||
- Additional Information:
|
||||
N/A
|
||||
|
|
@ -0,0 +1,34 @@
|
|||
---
|
||||
title:
|
||||
author:
|
||||
dateCreated:
|
||||
dateUpdated: 2022-05-23
|
||||
---
|
||||
|
||||
---
|
||||
|
||||
# Topic: Binary Byzantine Agreement (BBA)
|
||||
## Chat: [Places for Live Discussion]
|
||||
|
||||
#### Tags: [[Tags]]
|
||||
|
||||
```
|
||||
ELI5: Process of a distributed network coming to an agreement between two options OR the proposal, decision-making process, and eventual conclusion/convergence of a two-option Byzantine-contexted scenario.
|
||||
```
|
||||
---
|
||||
|
||||
## Overview
|
||||
|
||||
#### Operating Definition:
|
||||
Binary byzantine consensus concerns the problem of getting a set of distinct processes distributed across a network to agree on a single binary value 0 or 1 where processes can fail in arbitrary ways.<sup>1</sup>
|
||||
|
||||
#### Principles
|
||||
[What principle(s) are we trying to protect by innovating on this front? The solution that is aligned with the original Ethereum ethos to which Status is preserving ideological alignment with.]
|
||||
|
||||
#### Implementation
|
||||
- Description and Explanation
|
||||
[Technical Why goes here. Systems that are very similar to us or are the current "best-in-class" that we are trying to improve upon for a given factor (define context-relevant network assumptions per phrase, ideally we'll come up with visual sliding bars to show complex relationships between increasing/decreasing factors and how we go from "research" assumptions to "production" engineering) and why?]
|
||||
- Key Differences:
|
||||
[Easy low-hanging fruit for marketing or communication that makes our implementation clearly different/better.]
|
||||
- Additional Information:
|
||||
[Quickly share unread but potentially valuable resources and comments here to be re-read by someone else who can integrate them.]
|
||||
|
|
@ -0,0 +1,73 @@
|
|||
---
|
||||
title:
|
||||
author:
|
||||
dateCreated: 2022-05-30
|
||||
dateUpdated: @today
|
||||
---
|
||||
|
||||
---
|
||||
|
||||
# Topic: Binary Maximum Distance Separable (MDS)
|
||||
## Chat: [Live Discussion]
|
||||
|
||||
#### Tags: [Relevant Tags to Topic/Concept] see [[Tags]]
|
||||
|
||||
```
|
||||
ELI5: Simple explainer.
|
||||
```
|
||||
---
|
||||
|
||||
## Overview
|
||||
|
||||
#### Operating Definition:
|
||||
Binary maximum distance separable<sup>1</sup> array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy but also achieve low computational complexity. They are constructed by encoding k information columns with r parity columns, in which each element in a column is a bit, such that any k out of the k + r columns suffice to recover all information bits.
|
||||
|
||||
#### Principles
|
||||
[What principle(s) are we trying to protect by innovating on this front? The solution that is aligned with the original Ethereum ethos to which Status is preserving ideological alignment with.] see [[Principles]]
|
||||
|
||||
#### Implementation
|
||||
- Description and Explanation
|
||||
[Technical Why goes here. Systems that are very similar to us or are the current "best-in-class" that we are trying to improve upon for a given factor (define context-relevant network assumptions per phrase, ideally we'll come up with visual sliding bars to show complex relationships between increasing/decreasing factors and how we go from "research" assumptions to "production" engineering) and why?]
|
||||
- Key Differences:
|
||||
[Easy low-hanging fruit for marketing or communication that makes our implementation clearly different/better.]
|
||||
- Additional Information:
|
||||
[Quickly share unread but potentially valuable resources and comments here to be re-read by someone else who can integrate them.]
|
||||
|
||||
---
|
||||
|
||||
FILL IN ABOVE TEMPLATE AND DELETE BELOW -OR- COPY PASTA BELOW AND DELETE ABOVE
|
||||
|
||||
---
|
||||
title:
|
||||
author:
|
||||
dateCreated:
|
||||
dateUpdated: @today
|
||||
---
|
||||
|
||||
---
|
||||
|
||||
# Topic:
|
||||
## Chat:
|
||||
|
||||
#### Tags:
|
||||
|
||||
```
|
||||
ELI5: Simple explainer.
|
||||
```
|
||||
---
|
||||
|
||||
## Overview
|
||||
|
||||
#### Operating Definition:
|
||||
[Definition here]<sup>1</sup>
|
||||
|
||||
#### Principles
|
||||
N/A
|
||||
|
||||
#### Implementation
|
||||
- Description and Explanation
|
||||
N/A
|
||||
- Key Differences:
|
||||
N/A
|
||||
- Additional Information:
|
||||
N/A
|
||||
|
|
@ -5,7 +5,7 @@ dateUpdated: 2022-05-24
|
|||
# Consensus
|
||||
A list of [[Recipes]] necessary to develop better intuition and understanding
|
||||
|
||||
- Recipe: [[BBA]]
|
||||
- Recipe: [[Binary Byzantine Agreement]]
|
||||
- Prep: [|| ]
|
||||
- Cook Time: 5 min
|
||||
- Ingredients:
|
||||
|
|
@ -15,13 +15,13 @@ A list of [[Recipes]] necessary to develop better intuition and understanding
|
|||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://ieeexplore.ieee.org/document/9546485
|
||||
- Recipe: [[DAGs]]
|
||||
- Recipe: [[Directed Acyclic Graphs]]
|
||||
- Prep: [| ]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/Directed_acyclic_graph
|
||||
2. https://tokens-economy.gitbook.io/consensus/chain-based-dag/direct-acyclic-graph-tangle-dag
|
||||
- Recipe: [[CIC]]
|
||||
- Recipe: [[Common Interest Community]]
|
||||
- Prep: [| ]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
|
|
|
|||
|
|
@ -5,12 +5,99 @@ dateUpdated: 2022-05-24
|
|||
# Decentralized Storage
|
||||
A list of [[Recipes]] necessary to develop better intuition and understanding
|
||||
|
||||
- Recipe: Topic
|
||||
- Recipe: [[Binary Maximum Distance Separable]]
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. [Insert pictures, videos, article links, research papers, etc.]
|
||||
|
||||
- Recipe: Nash Equilibrium
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. [Insert pictures, videos, article links, research papers, etc.]
|
||||
|
||||
- Recipe: Differential Service Model
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. [Insert pictures, videos, article links, research papers, etc.]
|
||||
|
||||
- Recipe: Rational Participants
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. [Insert pictures, videos, article links, research papers, etc.]
|
||||
|
||||
- Recipe: Game Theory
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. [Insert pictures, videos, article links, research papers, etc.]
|
||||
|
||||
- Recipe: Locally Optimum
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. [Insert pictures, videos, article links, research papers, etc.]
|
||||
|
||||
- Recipe: Gnutella
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/Gnutella
|
||||
|
||||
- Recipe: Google File System (Colossus)
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/Google_File_System
|
||||
|
||||
- Recipe: Bigtable
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/Bigtable
|
||||
|
||||
- Recipe: Spanner
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/Spanner_(database)
|
||||
|
||||
- Recipe: Google's F1
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://research.google/pubs/pub38125/
|
||||
2. https://research.google/pubs/pub41344/
|
||||
|
||||
- Recipe: CAP Theorem
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/CAP_theorem
|
||||
|
||||
- Recipe: Apache HBase
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/Apache_HBase
|
||||
|
||||
- Recipe: Apache Cassandra
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/Apache_Cassandra
|
||||
|
||||
- Recipe: MyRocks
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/MyRocks
|
||||
|
||||
|
||||
|
||||
|
||||
https://github.com/status-im/codex-research/tree/main/evaluations
|
||||
Extract:
|
||||
|
|
@ -21,6 +108,8 @@ Papers:
|
|||
|
||||
1. https://www.zotero.org/groups/4402401/dagger/search/Peer-to-Peer%20Storage%20Systems%3A%20a%20Practical%20Guideline%20to%20be%20Lazy/titleCreatorYear/items/45Y36R55/item-list
|
||||
|
||||
Large scale peer-to-peer systems are foreseen as a way to provide highly reliable at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant fragments and distribute them among the peers. In this paper we study the impact of different data placement strategies on the system performance when using erasure codes redundancy schemes. We compare three policies: two of them local, in which the data are stored in logical neighbors, and the other one global, in which the
|
||||
|
||||
2. https://www.zotero.org/groups/4402401/dagger/search/P2P%20Storage%20Systems%3A%20How%20Much%20Locality%20Can%20They%20Tolerate%3F/titleCreatorYear
|
||||
|
||||
3. https://www.zotero.org/groups/4402401/dagger/search/Compact%20Proofs%20of%20Retrievability/titleCreatorYear/items/QKH5SPND/item-list
|
||||
3. https://www.zotero.org/groups/4402401/dagger/search/Compact%20Proofs%20of%20Retrievability/titleCreatorYear/items/QKH5SPND/item-list
|
||||
|
|
|
|||
|
|
@ -19,6 +19,7 @@ A movement to create a self-sovereign crypto network: a decentralised technology
|
|||
|
||||
|
||||
The world's first crypto-state.
|
||||
|
||||
```
|
||||
|
||||
>**"We build everything on top of consensus."**
|
||||
|
|
|
|||
|
|
@ -23,11 +23,13 @@ Dmitriy Ryajov
|
|||
### The Six (6) High-Level Categories of Codex as a Decentralized Durability Engine
|
||||
|
||||
#### 1. [[Decentralized Storage]] -> system design (from Zotero)
|
||||
#### 2. [[Durability]] -> Erasure Coding and Proof of Storage
|
||||
#### 3. [[Redundancy]] -> Erasure Coding
|
||||
#### 4. [[Dispersal]] -> P2P Networks
|
||||
#### 5. [[Incentives]] -> Incentives
|
||||
#### 6. [[Remote Auditing]] -> Proofs of Storage
|
||||
#### 2. [[Durability]] -> Erasure Coding and Proof of Storage (from Zotero)
|
||||
#### 3. [[Redundancy]] -> Erasure Coding (from Zotero)
|
||||
#### 4. [[Dispersal]] -> P2P Networks (from Zotero)
|
||||
#### 5. [[Incentives]] -> Incentives (from Zotero)
|
||||
#### 6. [[Remote Auditing]] -> Proofs of Storage (from Zotero)
|
||||
|
||||
https://www.zotero.org/groups/4402401/dagger/collections/YXUWAHZ6/items/ZKGLJVW6/item-list
|
||||
|
||||
---
|
||||
|
||||
|
|
|
|||
|
|
@ -5,6 +5,12 @@ dateUpdated: 2022-05-24
|
|||
# Durability
|
||||
A list of [[Recipes]] necessary to develop better intuition and understanding
|
||||
|
||||
- Recipe: Redundant Arrays of Independent Disks (RAID)
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
- Ingredients:
|
||||
1. https://en.wikipedia.org/wiki/RAID
|
||||
|
||||
- Recipe: Topic
|
||||
- Prep: [||||||||||]
|
||||
- Cook Time: X min
|
||||
|
|
@ -12,4 +18,5 @@ A list of [[Recipes]] necessary to develop better intuition and understanding
|
|||
1. [Insert pictures, videos, article links, research papers, etc.]
|
||||
|
||||
|
||||
RAID, replication, bandwidth,
|
||||
replication, bandwidth,
|
||||
|
||||
|
|
|
|||
|
|
@ -24,4 +24,4 @@ containing
|
|||
- Our State
|
||||
- Communication
|
||||
- Differences
|
||||
- Info Share
|
||||
- Info Share
|
||||
Loading…
Reference in New Issue