Reorgs file structure to reflect RACI verbiage re: projects and program and moves pages to correct directory

This commit is contained in:
Jessie Broke 2022-05-07 06:01:24 -04:00
parent b78c20c1d5
commit e4ea4bd845
183 changed files with 974 additions and 1091 deletions

8
.obsidian/app.json vendored
View File

@ -1,5 +1,11 @@
{
"legacyEditor": false,
"livePreview": true,
"promptDelete": false
"promptDelete": false,
"alwaysUpdateLinks": true,
"spellcheck": true,
"trashOption": "local",
"newFileLocation": "folder",
"newFileFolderPath": "pages",
"attachmentFolderPath": "./assets"
}

View File

@ -1,3 +1,3 @@
{
"baseFontSize": 14
"baseFontSize": 7
}

3
.obsidian/backlink.json vendored Normal file
View File

@ -0,0 +1,3 @@
{
"backlinkInDocument": false
}

35
.obsidian/graph.json vendored
View File

@ -1,22 +1,37 @@
{
"collapse-filter": true,
"collapse-filter": false,
"search": "",
"showTags": false,
"showAttachments": false,
"hideUnresolved": false,
"showOrphans": true,
"collapse-color-groups": false,
"colorGroups": [],
"colorGroups": [
{
"query": "#consensus",
"color": {
"a": 1,
"rgb": 14701138
}
},
{
"query": "#p2p",
"color": {
"a": 1,
"rgb": 14725458
}
}
],
"collapse-display": false,
"showArrow": false,
"textFadeMultiplier": 0,
"nodeSizeMultiplier": 1,
"lineSizeMultiplier": 2.2525,
"textFadeMultiplier": -2,
"nodeSizeMultiplier": 1.47054899175759,
"lineSizeMultiplier": 1.93622140443756,
"collapse-forces": false,
"centerStrength": 0.518713248970312,
"repelStrength": 10,
"centerStrength": 0.41192674371059,
"repelStrength": 20,
"linkStrength": 1,
"linkDistance": 250,
"scale": 0.6346285676930601,
"close": true
"linkDistance": 500,
"scale": 0.17502676168347867,
"close": false
}

34
.obsidian/workspace vendored
View File

@ -4,11 +4,13 @@
"type": "split",
"children": [
{
"id": "90951b51378e39c2",
"id": "3226a81f7aee73f6",
"type": "leaf",
"pinned": true,
"state": {
"type": "graph",
"state": {}
"state": {},
"pinned": true
}
}
],
@ -49,7 +51,7 @@
}
],
"direction": "horizontal",
"width": 277.0028419494629,
"width": 249,
"collapsed": true
},
"right": {
@ -71,8 +73,8 @@
"sortOrder": "alphabetical",
"showSearch": false,
"searchQuery": "",
"backlinkCollapsed": true,
"unlinkedCollapsed": true
"backlinkCollapsed": false,
"unlinkedCollapsed": false
}
}
}
@ -83,17 +85,17 @@
"width": 300,
"collapsed": true
},
"active": "90951b51378e39c2",
"active": "3226a81f7aee73f6",
"lastOpenFiles": [
"Codex.md",
"VAC.md",
"placeholder41.md",
"generalized.md",
"secure.md",
"modular.md",
"waku-connect.md",
"Waku.md",
"research-consensus.md",
"routing.md"
"pages/Codex Research Notes.md",
"pages/Logos Project.md",
"pages/Consensus.md",
"pages/2P-Set.md",
"pages/Pasted image 20220415164934.png",
"pages/Waku Project.md",
"pages/Codex Project.md",
"pages/VAC Project.md",
"pages/README.md",
"pages/3-sided Content Marketplace.md"
]
}

View File

@ -1,53 +0,0 @@
# Codex
Tags: #storage #data #durability #erasure-coding #incentivization #marketplace #DHT #discovery #network #libp2p #devp2p #peers #records #Messaging #zero-knowledge #privacy
What
- P2P decentralized data storage with incentivized durabiliity and bandwidth
Why
- Web3 is about decentralization
- It needs a practical decentralized storage layer
- Centralized solutions:
- Censorship
- Monopolozation
- Current solutions don't address all the challenges
How
- Automated remote auditing of data possession
- Durability through strong redundancy
- thru Erasure-coding
- not replication
- replication is full copy
Discovery
- uses Discovery v5
- uses DevP2P
Durability
- what is the ratio of replication of information to parity information and quantity of replicated information to figure out how "durable" data is.
Erasure Coding
- Relationship between tokenomics incentivizing growth of data nodes such that dispersion keeps growing to accomodate increasing durability (cheaper storage over time which grows to increase redundancy seems related to price of Codex token)
- if small error restoration is expensive, can you purposefully destroy larger sectors to "cheapen" restoration process? (this can be done by a user?)
- how does BitTorrent work on mobile (light nodes) in order to provide parity space or even full data replication?
Proofs of Storage
- Necessary to prove data is still there (availability)
- Data Integrity
- Data Availability
- Data Possession (Most important)
- Retrievability
- Replication
The Complex World of Storage Proofs
- How much smaller is data size are these proofs compared to the actual data requested/storage/etc.? Ratio?
To Learn
- Learn how Erasure Coding works (want a better understanding of how much data replication exists)
- Polynomial committments
- homomorphic encryption
- compact proof
- compress from two-dimensions:
- challenge
- signature

145
Codex.md
View File

@ -1,145 +0,0 @@
# Understanding Codex Efforts
>Title:
>
>Purpose:
>
>
Tags:
---
[Insert Relevant Quote]
---
## **How-To (Get Cookin')**
*Instructions: There are some descriptions below which detail the usage of visual guidance metrics available in the form of "cookbook-like" instructions for how to consume this document:*
| Gauges | Description | Visualization |
| -------- | :-----------: | :----------: |
|Difficulty| 1-10 (Ticks/Pips) | [||||||||||] |
|Time | In Minutes | X Minutes |
|Resources | Article/Video Links w/ Visual Content | Conceptual & Pictoral "Ingredients List" of Links|
See below 'Recipe' and modify accordingly to above in Figma.
![[Pasted image 20220415164934.png]]
---
## **Operating Definitions:**
Prep (*Difficulty*) is defined as the ease of which the concepts can be generally understood. (Future: Make into more fun visual or something more enjoyable than a difficulty bar.)
Cook Time (*Scope*) is in reference to the size of information necessary to learn to gain a decent level of comprehension.
Ingredients (*Resources*) is for links relevant to helping people understand the concepts. Number references and use superscript notation to reference mentions in terminology Recipes descriptions.
Future Work: Adjust difficulty/time ratings, cook time respec. based on feedback from everyone at DXB.
---
## Necessary Terminology
[[storage]]
[[data]]
[[durability]]
[[erasure-coding ]]
[[incentivization ]]
[[marketplace ]]
[[DHT ]]
[[discovery ]]
[[network ]]
[[libp2p ]]
[[devp2p ]]
[[peers ]]
[[records ]]
[[Messaging ]]
[[zero-knowledge ]]
[[privacy ]]
[[placeholder41]]
[[placeholder42]]
[[placeholder43]]
[[placeholder44]]
[[placeholder45]]
[[placeholder46]]
[[placeholder47]]
[[placeholder48]]
[[placeholder49]]
[[placeholder50]]
[[placeholder51]]
[[placeholder52]]
[[placeholder53]]
[[placeholder54]]
[[placeholder55]]
[[placeholder56]]
[[placeholder57]]
[[placeholder58]]
[[placeholder59]]
[[placeholder60]]
[[placeholder61]]
[[placeholder62]]
[[placeholder63]]
[[placeholder64]]
[[placeholder65]]
[[placeholder66]]
[[placeholder67]]
[[placeholder68]]
[[placeholder69]]
[[placeholder70]]
[[placeholder71]]
[[placeholder72]]
[[placeholder73]]
[[placeholder74]]
[[placeholder75]]
[[placeholder76]]
[[placeholder77]]
[[placeholder78]]
[[placeholder79]]
[[placeholder80]]
[[placeholder81]]
[[placeholder82]]
[[placeholder83]]
[[placeholder84]]
[[placeholder85]]
[[placeholder86]]
[[placeholder87]]
[[placeholder88]]
[[placeholder89]]
[[placeholder90]]
[[placeholder91]]
[[placeholder92]]
[[placeholder93]]
[[placeholder94]]
[[placeholder95]]
[[placeholder96]]
[[placeholder97]]
[[placeholder98]]
[[placeholder99]]
[[placeholder100]]
[[placeholder101]]
[[placeholder102]]
[[placeholder103]]
[[placeholder104]]
[[placeholder105]]
[[placeholder106]]
[[placeholder107]]
[[placeholder108]]
[[placeholder109]]
[[placeholder110]]
[[placeholder111]]
[[placeholder112]]
[[placeholder113]]
[[placeholder114]]
[[placeholder115]]
[[placeholder116]]
[[placeholder117]]
[[placeholder118]]
[[placeholder119]]
[[placeholder120]]
[[placeholder121]]
[[placeholder122]]
[[placeholder123]]
[[placeholder124]]
[[placeholder125]]
[[placeholder126]]
[[placeholder127]]
[[placeholder128]]

Binary file not shown.

After

Width:  |  Height:  |  Size: 2.4 MiB

View File

@ -9,16 +9,13 @@
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>
## Current Implementation:
See #PoW and #PoS consensus mechanisms of which can be high-level organized into three academic categories:
1. [[Classical]]
2. [[Nakamoto]]
3. [[DAG-Based Consensus (Avalanche-like)]]
N/A
## The Idea(l):
Talk to Alvaro to fill this in.
## Logos Implementation:
[[Glacier]]
Glacier
## Live Feedback:
Discord Server: Status Discord Server

60
pages/Codex Project.md Normal file
View File

@ -0,0 +1,60 @@
---
title: Understanding Codex Efforts
author: Broke
date: 2022-05-07
---
# Understanding Codex Efforts
---
**Purpose**
[Insert Purpose]
>**"_I like working on fundamental problems."**
Dmitriy Ryajov
---
## **How-To (Get Cookin')**
*Instructions: There are some descriptions below which detail the usage of visual guidance metrics available in the form of "cookbook-like" instructions for how to consume this document:*
| Gauges | Description | Visualization |
| -------- | :-----------: | :----------: |
|Difficulty| 1-10 (Ticks/Pips) | [&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;] |
|Time | In Minutes | X Minutes |
|Resources | Article/Video Links w/ Visual Content | Conceptual & Pictoral "Ingredients List" of Links|
See below 'Recipe' and modify accordingly to above in Figma.
![[Pasted image 20220415164934.png]]
---
## **Operating Definitions:**
Prep (*Difficulty*) is defined as the ease of which the concepts can be generally understood. (Future: Make into more fun visual or something more enjoyable than a difficulty bar.)
Cook Time (*Scope*) is in reference to the size of information necessary to learn to gain a decent level of comprehension.
Ingredients (*Resources*) is for links relevant to helping people understand the concepts. Number references and use superscript notation to reference mentions in terminology Recipes descriptions.
Future Work: Adjust difficulty/time ratings, cook time respec. based on feedback from everyone at DXB.
---
## Necessary Terminology
[[storage]]
[[data]]
[[durability]]
[[erasure-coding]]
[[incentivization]]
[[marketplace]]
[[DHT]]
[[discovery]]
[[network]]
[[libp2p]]
[[devp2p]]
[[peers]]
[[records]]
[[Messaging]]
[[zero-knowledge]]
[[privacy]]

View File

@ -11,7 +11,7 @@
## The Idea(l):
## Logos Implementation:
[Ikingut (Reputation Algorithm)](Ikingut%20(Reputation%20Algorithm).md)
Ikingut (Reputation Algorithm)
## Live Feedback

255
pages/Consensus.md Normal file
View File

@ -0,0 +1,255 @@
# Consensus
### Related:
- [[BBA]]
- Prep: [|| ]
- Cook Time: 5 min
- Ingredients:
1. https://arxiv.org/pdf/2001.07867.pdf
- [[Leaderless ]]
- Prep: [||||| ]
- Cook Time: X min
- Ingredients:
1. https://ieeexplore.ieee.org/document/9546485
- [[DAGs]]
- 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
- [[CIC]]
- Prep: [| ]
- Cook Time: X min
- Ingredients:
1. See 'Consensus' section within Logos Specifications
- [[P2P Messaging]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Peer-to-peer
- [[Message Passing]] (is a general framework, P2P Messaging is a subset of Message Passing)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Gossip Protocol]] (is a subset of P2P Messaging)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Gossip_protocol#:~:text=A%20gossip%20protocol%20or%20epidemic,all%20members%20of%20a%20group.
- [[Permissionless]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://eprint.iacr.org/2021/023.pdf
- [[Scalability]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://eprint.iacr.org/2021/023.pdf
2. https://medium.com/vechain-foundation/what-does-scalability-really-mean-in-blockchain-b8b13b3181c6
3. https://101blockchains.com/blockchain-scalability-challenges/
- [[Decentralization]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Decentralization
2. https://blockworks.co/measuring-decentralization-is-your-crypto-decentralized/
3. https://jods.mitpress.mit.edu/pub/7vxemtm3/release/2
- [[Security]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://arxiv.org/pdf/1802.06993.pdf
- [[Communication Costs]] (wrt message complexity - see how this extends into hardware)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.221.883&rep=rep1&type=pdf#:~:text=message%20complexity%20denotes%20the%20maximum,last%20node%20completes%20the%20algorithm.
- [[Stream or Subgraph]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://thegraph.com/docs/en/developer/define-subgraph-hosted/
2. https://streamingfastio.medium.com/streamingfacts-understanding-the-costs-of-upgrading-a-subgraph-fedf5d61223 (is this related?)
- [[Staking]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://deliverypdf.ssrn.com/delivery.php?ID=112001112005005071028123005115028071053009053038065056030075021066021091100007083094098007039126015013042085120028028079118118027039038017006093067005067006124005093039032030000094104124024001105026027114005123097090090111113068087076002030115100122071&EXT=pdf&INDEX=TRUE
2. https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3609817
3. https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4059460
- [[Sybil Resistance]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Sybil_attack
- [[CFT (Crash Fault Tolerant)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://medium.com/@chamirachid/your-journey-to-consensus-part-1-6a88a6f818f65
2. https://en.wikipedia.org/wiki/Fault_tolerance5
3. https://dl.acm.org/doi/pdf/10.1145/102792.102801
- [[BFT (Byzantine Fault Tolerant)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Byzantine_fault
- [[PBFT (Practical Byzantine Fault Tolerant)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://www.geeksforgeeks.org/practical-byzantine-fault-tolerancepbft/#:~:text=Practical%20Byzantine%20Fault%20Tolerance%20is,optimized%20for%20low%20overhead%20time.
2. https://www.usenix.org/legacy/events/nsdi09/tech/full_papers/clement/clement.pdf
- [[Finality]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://medium.com/mechanism-labs/finality-in-blockchain-consensus-d1f83c120a9a5
- [[Social Applications]] (look up context)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Bootstrapping]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Bootstrapping_node#:~:text=A%20bootstrapping%20node%2C%20also%20known,successfully%20join%20the%20overlay%20network.
- [[Rounds]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Round-less]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Paxos]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[DAG-Based Consensus]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://www.sciencedirect.com/science/article/pii/S2352864819301476
- [[Liveness]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Asynchronous (P2P)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Execution-Layer Decoupling]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Interchangeability]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Liveness]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Extensibility]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Highly-Partitioned Blockchains with Local Views]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Ordering]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Reputation]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Confidence]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Network Congestion]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Topology]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Resilience (Consensus context)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Verifiability]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Non-Repudiation]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Snowball]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Lachesis]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Glacier]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[PoW]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[PoS]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Classical]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Nakmoto]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[DAG-Based Consensus (Avalanche-like)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.

View File

@ -17,7 +17,7 @@
[The research target/goal/PoC implementation currently under testing/experimentation.]
## Live Feedback
[Add a LIVE location where the research and/or development teams can be pinged in a specific text-channel dedicated to this that is within their specific Discord server so that conversation can be bridged between projects and on a program level in order to best plug into resolving better than current understanding on this specific topic. I.e., Vac/Waku/Codex/Logo Discord server and a specific text-channel for this concept like #chefhelp-(insert one of six layers under research).]
[Add a LIVE location where the research and/or development teams can be pinged in a specific text-channel dedicated to this that is within their specific Discord server so that conversation can be bridged between projects and on a program level in order to best plug into resolving better than current understanding on this specific topic. I.e., Vac/Waku/Codex/Logo Discord server and a specific text-channel for this concept like -(insert one of six layers under research).]
## IMPORTANT Differentiators:
[Easy low-hanging marketing or comms fruit that makes Logos implementation clearly different/better.]

View File

@ -0,0 +1,57 @@
# Data Model and Concurrency
### Related:
- Reference Work
- [[eUTXO]] (Direct extension of the basic UTXO model)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- References (Cardano foundational paper)
- [[Validator]]
- [[Datum]]
- [[Redeemer]]
- [[Ledger Description]]
- [[CKB]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Key feature: [[state space ownership]]
- [[Cell description]]
- [[Transaction description]]
- [[Zexe]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Key Feature: Privacy
- Transaction Description
- Record Description
- Approach
- [[Data Model Design]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Challenges
- Concept
- Data Structures and Constraints
- [[Concurrent Execution (Threads)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Execution Patterns]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Useful patterns
- Example of [[EVM execution]] on this model
- Explore and describe
- [[Anti-patterns]]
- High Contention
- Low Affinity

View File

@ -1,18 +1,23 @@
Phrase: Execution Layer Decoupling
# Phrase:
Related:
### Related:
Operating Definition: Concept of a Layer-0 or agreements layer, a network of nodes that come to agreement on arbitrary data and nothing else. From there you can bolt on different execution methods.
## Operating Definition:
Concept of a Layer-0 or agreements layer, a network of nodes that come to agreement on arbitrary data and nothing else. From there you can bolt on different execution methods.
When you think of Nakamoto Consensus, the process of coming to agreement (PoW) is tied inexorably to the type of data you are coming into agreement upon. You have to put together that block with all of the transactions and hash that header with nonces so you are tied to the data you are coming into agreement upon which will give you a fundamental bottleneck on how much data you can process at any given time. This is why you have a block time in PoW.
We would like to separate these two things so any two nodes can come into agreement upon any piece of data which gives us a lot of freedom wrt what type of data we are coming into agreement upon and how much data we can process at any given time.
Current Implementation:
ELI5:
The Idea(l):
## Current "Standard" Implementation:
Logos Implementation:
## The Idea(l):
IMPORTANT Differentiators:
## Logos Implementation:
Trash Heap:
## Live Feedback
## IMPORTANT Differentiators:
## Trash Heap:

View File

@ -1,674 +0,0 @@
# Understanding the Logos Blockchain Whitepaper
>Title: Understanding the Logos Blockchain Whitepaper | A High-Level Conceptual Overview/Review of the Logos Blockchain
>
>Purpose:
>This document reflects an approach of whitepaper review that combines a rough-draft whitepaper review containing comments/reflections/concerns with a further simplification of concepts to make everything more digestible to more people outside of the internal Status infra team for communication purposes. In addition, this review will provide a gauge of difficulty of understanding involved with various different terms/concepts.
>
Tags: #learning #whitepaper #Logos
---
**"We build everything on top of consensus." **
Dr. Corey Petty
---
## **How-To (Get Cookin')**
*Instructions: There are some descriptions below which detail the usage of visual guidance metrics available in the form of "cookbook-like" instructions for how to consume this document:*
| Gauges | Description | Visualization |
| -------- | :-----------: | :----------: |
|Difficulty| 1-10 (Ticks/Pips) | [&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;] |
|Time | In Minutes | X Minutes |
|Resources | Article/Video Links w/ Visual Content | Conceptual & Pictoral "Ingredients List" of Links|
See below 'Recipe' and modify accordingly to above in Figma.
![[Pasted image 20220415164934.png]]
---
## **Operating Definitions:**
Prep (*Difficulty*) is defined as the ease of which the concepts can be generally understood. (Future: Make into more fun visual or something more enjoyable than a difficulty bar.)
Cook Time (*Scope*) is in reference to the size of information necessary to learn to gain a decent level of comprehension.
Ingredients (*Resources*) is for links relevant to helping people understand the concepts. Number references and use superscript notation to reference mentions in terminology Recipes descriptions.
Future Work: Adjust difficulty/time ratings, cook time respec. based on feedback from everyone at DXB.
---
## Necessary Terminology by Layer
---
### The Six (6) Technology Layers of Logos as a Blockchain
tl;dr one to two sentences that group these phrases together
- Terminology Template (Recipe): [[here]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients: [pictures, videos, article links, research papers, etc.]
#### Consensus
- [[BBA]]
- Prep: [|| ]
- Cook Time: X min
- Ingredients:
1. https://arxiv.org/pdf/2001.07867.pdf
- [[Leaderless ]]
- Prep: [||||| ]
- Cook Time: X min
- Ingredients:
1. https://ieeexplore.ieee.org/document/9546485
- [[DAGs]]
- 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
- [[CIC]]
- Prep: [| ]
- Cook Time: X min
- Ingredients:
1. See 'Consensus' section within Logos Specifications
- [[P2P Messaging]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Peer-to-peer
- [[Message Passing]] (is a general framework, P2P Messaging is a subset of Message Passing)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Gossip Protocol]] (is a subset of P2P Messaging)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Gossip_protocol#:~:text=A%20gossip%20protocol%20or%20epidemic,all%20members%20of%20a%20group.
- [[Permissionless]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://eprint.iacr.org/2021/023.pdf
- [[Scalability]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://eprint.iacr.org/2021/023.pdf
2. https://medium.com/vechain-foundation/what-does-scalability-really-mean-in-blockchain-b8b13b3181c6
3. https://101blockchains.com/blockchain-scalability-challenges/
- [[Decentralization]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Decentralization
2. https://blockworks.co/measuring-decentralization-is-your-crypto-decentralized/
3. https://jods.mitpress.mit.edu/pub/7vxemtm3/release/2
- [[Security]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://arxiv.org/pdf/1802.06993.pdf
- [[Communication Costs]] (wrt message complexity - see how this extends into hardware)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.221.883&rep=rep1&type=pdf#:~:text=message%20complexity%20denotes%20the%20maximum,last%20node%20completes%20the%20algorithm.
- [[Stream or Subgraph]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://thegraph.com/docs/en/developer/define-subgraph-hosted/
2. https://streamingfastio.medium.com/streamingfacts-understanding-the-costs-of-upgrading-a-subgraph-fedf5d61223 (is this related?)
- [[Staking]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://deliverypdf.ssrn.com/delivery.php?ID=112001112005005071028123005115028071053009053038065056030075021066021091100007083094098007039126015013042085120028028079118118027039038017006093067005067006124005093039032030000094104124024001105026027114005123097090090111113068087076002030115100122071&EXT=pdf&INDEX=TRUE
2. https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3609817
3. https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4059460
- [[Sybil Resistance]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Sybil_attack
- [[CFT (Crash Fault Tolerant)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://medium.com/@chamirachid/your-journey-to-consensus-part-1-6a88a6f818f65
2. https://en.wikipedia.org/wiki/Fault_tolerance5
3. https://dl.acm.org/doi/pdf/10.1145/102792.102801
- [[BFT (Byzantine Fault Tolerant)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Byzantine_fault
- [[PBFT (Practical Byzantine Fault Tolerant)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://www.geeksforgeeks.org/practical-byzantine-fault-tolerancepbft/#:~:text=Practical%20Byzantine%20Fault%20Tolerance%20is,optimized%20for%20low%20overhead%20time.
2. https://www.usenix.org/legacy/events/nsdi09/tech/full_papers/clement/clement.pdf
- [[Finality]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://medium.com/mechanism-labs/finality-in-blockchain-consensus-d1f83c120a9a5
- [[Social Applications]] (look up context)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Bootstrapping]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://en.wikipedia.org/wiki/Bootstrapping_node#:~:text=A%20bootstrapping%20node%2C%20also%20known,successfully%20join%20the%20overlay%20network.
- [[Rounds]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Round-less]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Paxos]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[DAG-Based Consensus]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1. https://www.sciencedirect.com/science/article/pii/S2352864819301476
- [[Liveness]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Asynchronous (P2P)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Execution-Layer Decoupling]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Interchangeability]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Liveness]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Extensibility]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Highly-Partitioned Blockchains with Local Views]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Ordering]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Reputation]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Confidence]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Network Congestion]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Topology]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Resilience (Consensus context)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Verifiability]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Non-Repudiation]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Snowball]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Lachesis]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Glacier]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
#### Node Reputation
- [[Ikingut (Reputation Algorithm)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Important Conceptual Goals]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Simple
- Lightweight
- Pluggable
- Adaptive
- Dynamic
- Robust
- No Transitive Trust
- Reasonable Bootstrap Time
- [[Reputation Polling]] (Polling Dynamics)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Indirect Request]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Direct Request]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Unirep]] (a pre-existing example)
- [[Qualities Necessary]] (of Direct Request)
- [[Verifiability]]
- [[Non-Repudiation]]
- [[Privacy Preserving]] (preserve origins of score, emit opinions without a way to trace back the origins - MPC)
- [[ Local Heuristic]]
- [[Glacier Algorithm]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
- Each Iteration
1. Voting
2. Agent Action (Post-Consensus Decision Finality)
- Min-Multiplicative Reputation Punishment
- Multiplicative
- Linear
- Experimental Research
- Starting Point
- [[Trust Wisdom per Node]] (requires further elaboration)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Adversary Types and Effects]] (requires further elaboration)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Current Stage of Testing/Challenges
- [[Silent-Omniscient Adversaries]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Punishment Testing]] (Modulating Punishment/No Punishment Impacts to Conditions)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Adding Multiplicative-min Punishment]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Reputation Attacks]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Con-Artist Attack]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[The On-Off Attack]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Punishment Effects on Glacier]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Reputation Limitations]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- No immediate defense against coordinated attacks
- Reputation does not add to security
- Future Work
- [[Circumstantial Impact of Reputation on Consensus]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Long-running Simulation]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Sudden changes in Collective Byzantine Behavior]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Pending Questions
1. Interaction of [[Stake-based]] and [[Reputation-based]] selection
- Stake simulations are necessary for exploring options
- Relevant in the incentives discussion?
2. How much (and if) does reputation really help in a coordinated attack? (Assuming patient con-artist attack)
- Complex interactions here, this model would particularly benefit having a prototype/PoC
- [[Node Challenges]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
1. [[Intermittence Flexibility | Maintain Operation in High-Churn Network]]
2. [[Sudden Changing Behavior]]
3. [[Bootstrapping Quickly]]
4. [[Resilience to Dynamic Unpredictable Network Changes (Can Handle Membership Volatility)]]
- [[Design]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
1. [[Local reputation view]]
2. [[Adaptive and Dynamic]]
3. [[Required Bootstrapping]]
- [[Network View Not Required]]
- [[Individual Node Reputation Not Required]]
- [[Eigentrust]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Transitive Trust]]
- [[Understanding the Math]]
- [[Trust Decay]]
- [[Malicious Clusters]] (describe nuances better, trusted nodes cannot overlap the malicious collective)
- [[Trust for Consensus]]
- [[Separation of Reputation]]
- [[Confidant]]
- [[XRep]]
- [[P-Grid]]
- [[R2Trust]]
- [[Generic Taxonomy]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Dimensions]]
- Single
- Multiple
- [[Time computation]]
- [[Aggregation]]
- Deterministic sum of positive and negative ratings
- Probabilistic
- [[Logic]]
- Local vs gathered data
- Age of data
- Frequency of data
- Weight of multiple dimensions
- [[Value Control]]
- External
- Internal
- [[Data Aging]]
- None
- Decay
- Death of old/selected
- [[Selection]]
- Ranking-based
- Threshold (trusted/untrusted)
- Probabilistic selection
#### Network Layer and Mempool
- [[Node Discovery]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Subnetworks]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Design
- Implementation
- Ideas
- [[Mempool]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Challenges
- Approach
- Mempool Design
#### Staking and Multi-DAG
- [[Factory of DAGs]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Concept
- Algorithm
- [[Sub-DAG]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Cross-DAG]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Bridge (Intermediary) Nodes]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Gravity]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Application-Level User-Driven]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Direct Communication Channel]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Direct Communication VGER]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Challenges
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Probabilistic Finality]] and [[Cross-Network Communication]]
- [[Network Partitioning]] and [[Forks]]
- [[Weak Subjectivity]] - Reputation of nodes matters to clients. Nodes are clients of other networks.
- [[Verifying Weights in Staking]]
- [[Glacier Algorithm Quiesces]]
- [[Approach]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
1. [[Deterministic Finality]]
2. [[Secondary Consensus Protocol]] (form local opinion on external DAG)
3. [[Intermediary DAG]] (Intersection of nodes participating mutually in common structures)
- [[Vertex Sealing]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[XSub]] (Cross-sub-DAG communication)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[XDAG]] (Cross-DAG communication)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[XDAG Fees]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Communication Patterns]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Direct
- User-Coordinated Channel
- Sub-DAG-Coordinated Channel
- [[Stake Sub-DAG]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Totally-Ordered Chain]]
- [[Global Knowledge]]
- [[Alternative Designs]]
- [[2P-Set]]
- [[Per-Node Branch]]
#### Data Model and Concurrency
- Reference Work
- [[eUTXO]] (Direct extension of the basic UTXO model)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- References (Cardano foundational paper)
- [[Validator]]
- [[Datum]]
- [[Redeemer]]
- [[Ledger Description]]
- [[CKB]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Key feature: [[state space ownership]]
- [[Cell description]]
- [[Transaction description]]
- [[Zexe]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Key Feature: Privacy
- Transaction Description
- Record Description
- Approach
- [[Data Model Design]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Challenges
- Concept
- Data Structures and Constraints
- [[Concurrent Execution (Threads)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Execution Patterns]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Useful patterns
- Example of [[EVM execution]] on this model
- Explore and describe
- [[Anti-patterns]]
- High Contention
- Low Affinity
#### Tokenomics
- [[Fees]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Rewards]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Slashing]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[MEV]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
## Relevant Projects
### [[Codex]]
### [[Waku]]
### [[VAC]]

12
pages/Logos Program.md Normal file
View File

@ -0,0 +1,12 @@
---
title: Logos Program
author: Jessie
date: 2022-05-07
---
# Logos Program
## Projects
### [[Logos Project]]
### [[Codex Project]]
### [[Waku Project]]
### [[VAC Project]]

58
pages/Logos Project.md Normal file
View File

@ -0,0 +1,58 @@
---
title: Understanding the Logos Blockchain Whitepaper | A High-Level Conceptual Review of the Logos Blockchain
author: Broke
date: 2022-05-07
---
# Understanding the Logos Blockchain Whitepaper
---
**Purpose**
This document reflects an approach of whitepaper review that combines a rough-draft whitepaper review containing comments/reflections/concerns with a further simplification of concepts to make everything more digestible to more people outside of the internal Status infra team for communication purposes. In addition, this review will provide a gauge of difficulty of understanding involved with various different terms/concepts.
>**"We build everything on top of consensus."**
Dr. Corey Petty
---
## **How-To (Get Cookin')**
*Instructions: There are some descriptions below which detail the usage of visual guidance metrics available in the form of "cookbook-like" instructions for how to consume this document:*
| Gauges | Description | Visualization |
| -------- | :-----------: | :----------: |
|Difficulty| 1-10 (Ticks/Pips) | [&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;&#124;] |
|Time | In Minutes | X Minutes |
|Resources | Article/Video Links w/ Visual Content | Conceptual & Pictoral "Ingredients List" of Links|
### **Operating Definitions:**
Prep (*Difficulty*) is defined as the ease of which the concepts can be generally understood. (Future: Make into more fun visual or something more enjoyable than a difficulty bar.)
Cook Time (*Scope*) is in reference to the size of information necessary to learn to gain a decent level of comprehension.
Ingredients (*Resources*) is for links relevant to helping people understand the concepts. Number references and use superscript notation to reference mentions in terminology Recipes descriptions.
Future Work: Adjust difficulty/time ratings, cook time respec. based on feedback from everyone at DXB.
See Sample below:
- Recipe (Terminology): [template](https://www.notion.so/network-stories-ff98e2e63a8447ddbfe2bf3af8c2a8cb)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients: [pictures, videos, article links, research papers, etc.]
See below 'Recipe' and modify accordingly to above in Figma.
![[Pasted image 20220507054553.png]]
---
## Necessary Terminology by Layer
### The Six (6) Technology Layers of Logos as a Blockchain
#### 1. [[Consensus]]
#### 2. [[Node Reputation]]
#### 3. [[Network Layer and Mempool]]
#### 4. [[Staking and Multi-DAG]]
#### 5. [[Data Model and Concurrency]]
#### 6. [[Tokenomics]]

View File

@ -17,7 +17,7 @@
[The research target/goal/PoC implementation currently under testing/experimentation.]
## Live Feedback
[Add a LIVE location where the research and/or development teams can be pinged in a specific text-channel dedicated to this that is within their specific Discord server so that conversation can be bridged between projects and on a program level in order to best plug into resolving better than current understanding on this specific topic. I.e., Vac/Waku/Codex/Logo Discord server and a specific text-channel for this concept like #chefhelp-(insert one of six layers under research).]
[Add a LIVE location where the research and/or development teams can be pinged in a specific text-channel dedicated to this that is within their specific Discord server so that conversation can be bridged between projects and on a program level in order to best plug into resolving better than current understanding on this specific topic. I.e., Vac/Waku/Codex/Logo Discord server and a specific text-channel for this concept like -(insert one of six layers under research).]
## IMPORTANT Differentiators:
[Easy low-hanging marketing or comms fruit that makes Logos implementation clearly different/better.]

View File

@ -0,0 +1,26 @@
# Network Layer and Mempool
### Related:
- [[Node Discovery]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Subnetworks]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Design
- Implementation
- Ideas
- [[Mempool]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Challenges
- Approach
- Mempool Design

194
pages/Node Reputation.md Normal file
View File

@ -0,0 +1,194 @@
# Node Reputation
### Related:
- [[Ikingut (Reputation Algorithm)]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Important Conceptual Goals]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Simple
- Lightweight
- Pluggable
- Adaptive
- Dynamic
- Robust
- No Transitive Trust
- Reasonable Bootstrap Time
- [[Reputation Polling]] (Polling Dynamics)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Indirect Request]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Direct Request]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Unirep]] (a pre-existing example)
- [[Qualities Necessary]] (of Direct Request)
- Verifiability (see Consensus)
- Non-Repudiation (see Consensus)
- [[Privacy Preserving]] (preserve origins of score, emit opinions without a way to trace back the origins - MPC)
- [[ Local Heuristic]]
- [[Glacier Algorithm]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
- Each Iteration
1. Voting
2. Agent Action (Post-Consensus Decision Finality)
- Min-Multiplicative Reputation Punishment
- Multiplicative
- Linear
- Experimental Research
- Starting Point
- [[Trust Wisdom per Node]] (requires further elaboration)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Adversary Types and Effects]] (requires further elaboration)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Current Stage of Testing/Challenges
- [[Silent-Omniscient Adversaries]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Punishment Testing]] (Modulating Punishment/No Punishment Impacts to Conditions)
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Adding Multiplicative-min Punishment]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Reputation Attacks]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Con-Artist Attack]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[The On-Off Attack]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Punishment Effects on Glacier]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Reputation Limitations]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- No immediate defense against coordinated attacks
- Reputation does not add to security
- Future Work
- [[Circumstantial Impact of Reputation on Consensus]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Long-running Simulation]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Sudden changes in Collective Byzantine Behavior]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- Pending Questions
1. Interaction of [[Stake-based]] and [[Reputation-based]] selection
- Stake simulations are necessary for exploring options
- Relevant in the incentives discussion?
2. How much (and if) does reputation really help in a coordinated attack? (Assuming patient con-artist attack)
- Complex interactions here, this model would particularly benefit having a prototype/PoC
- [[Node Challenges]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
1. [[Intermittence Flexibility | Maintain Operation in High-Churn Network]]
2. [[Sudden Changing Behavior]]
3. [[Bootstrapping Quickly]]
4. [[Resilience to Dynamic Unpredictable Network Changes (Can Handle Membership Volatility)]]
- [[Design]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
1. [[Local reputation view]]
2. [[Adaptive and Dynamic]]
3. [[Required Bootstrapping]]
- [[Network View Not Required]]
- [[Individual Node Reputation Not Required]]
- [[Eigentrust]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Transitive Trust]]
- [[Understanding the Math]]
- [[Trust Decay]]
- [[Malicious Clusters]] (describe nuances better, trusted nodes cannot overlap the malicious collective)
- [[Trust for Consensus]]
- [[Separation of Reputation]]
- [[Confidant]]
- [[XRep]]
- [[P-Grid]]
- [[R2Trust]]
- [[Generic Taxonomy]]
- Prep: [||||||||||]
- Cook Time: X min
- Ingredients:
1.
- [[Dimensions]]
- Single
- Multiple
- [[Time computation]]
- [[Aggregation]]
- Deterministic sum of positive and negative ratings
- Probabilistic
- [[Logic]]
- Local vs gathered data
- Age of data
- Frequency of data
- Weight of multiple dimensions
- [[Value Control]]
- External
- Internal
- [[Data Aging]]
- None
- Decay
- Death of old/selected
- [[Selection]]
- Ranking-based
- Threshold (trusted/untrusted)
- Probabilistic selection

View File

Before

Width:  |  Height:  |  Size: 677 KiB

After

Width:  |  Height:  |  Size: 677 KiB

View File

@ -1,2 +1,3 @@
# network-stories
End User stories of the "Status Network"
from [[Introduction]]

Some files were not shown because too many files have changed in this diff Show More