Lakat: Difference between revisions
(Questions and content from the original paper in my own words.) |
(Added to the summary) |
||
| Line 1: | Line 1: | ||
Lakat is a shared key-value database of branches and data buckets together with a peer-to-peer protocol that governs the modification of this database. Branches and buckets are added, merged, and pulled through a combination of the Proof-of-Review, broadcasting, and lignification processes. These contributions/changes (submit, review, token and storage) are made by contributors (content contributors, review contributors, token contributors and storage contributors). | Lakat is a shared key-value database of branches and data buckets together with a peer-to-peer protocol that governs the modification of this database. Branches and buckets are added, merged, and pulled through a combination of the Proof-of-Review, broadcasting, and lignification processes. These contributions/changes (submit, review, token and storage) are made by contributors (content contributors, review contributors, token contributors and storage contributors). | ||
A human, or machine can be a contributor while being resistant to Sybil Attacks via the Proof-of-Review process. | A human, or machine can be a contributor while being resistant to Sybil Attacks via the Proof-of-Review process. The contributors can review, contribute tokens, and store??? | ||
There is a graph homomorphism from graph S (submits) to graph B (branches), but not vice versa and there are no homomorphisms between S and graph D (buckets) or B and D. | New branches will broadcast their creation to attract contributors, | ||
Submit Conflict denoted by 4-tuple by (B, π, s1, s2) where Branch B is a set of three submits π, s1and s2 where π is the parent of both s1and s2and all three are included in B. | |||
There is a graph homomorphism from graph S (submits) to graph B (branches), but not vice versa and there are no homomorphisms between S and graph D (buckets) or B and D. This forms distinct layers. | |||
== Questions == | == Questions == | ||
| Line 16: | Line 20: | ||
What are the principles of Lakat? | What are the principles of Lakat? | ||
Does Lakat have a de-lignification process through review? | |||
How are Sybil attacks prevented? | How are Sybil attacks prevented? | ||
Latest revision as of 11:02, 18 February 2024
Lakat is a shared key-value database of branches and data buckets together with a peer-to-peer protocol that governs the modification of this database. Branches and buckets are added, merged, and pulled through a combination of the Proof-of-Review, broadcasting, and lignification processes. These contributions/changes (submit, review, token and storage) are made by contributors (content contributors, review contributors, token contributors and storage contributors).
A human, or machine can be a contributor while being resistant to Sybil Attacks via the Proof-of-Review process. The contributors can review, contribute tokens, and store???
New branches will broadcast their creation to attract contributors,
Submit Conflict denoted by 4-tuple by (B, π, s1, s2) where Branch B is a set of three submits π, s1and s2 where π is the parent of both s1and s2and all three are included in B.
There is a graph homomorphism from graph S (submits) to graph B (branches), but not vice versa and there are no homomorphisms between S and graph D (buckets) or B and D. This forms distinct layers.
Questions[edit | edit source]
How is Lakat complimentary to DGF?
- How is Proof of Review different than Proof of Staked Work?
What problems does Lakat solve?
How are incentives manged by Lakat?
- Integration with tokens as another layer.
What are the principles of Lakat?
Does Lakat have a de-lignification process through review?
How are Sybil attacks prevented?
- Proof-of-Review...DGF solves the Sybil Attack problem with the validation pool, reputation staking, dissuades bad actors with with retroactive reversals.
What is the relationship between bucket and branch?
- The relation between the elementary bucket object and the higher level branch object is not simply a many-to-one relation. Different branches may share some data buckets. See Figure 3 below.
References[edit | edit source]
- Horstmeyer, L. (2023). Lakat: An open and permissionless architecture for continuous integration academic publishing. arXiv preprint arXiv:2306.09298.