86 Commits

Author SHA1 Message Date
Balazs Komuves
570666d110
Merkle tree doc: fix some typos and other mistakes 2023-12-20 23:23:58 +01:00
Balazs Komuves
796b4937c8
Merkle trees and hashes: add a final proposal, plus other minor improvements 2023-12-20 20:54:39 +01:00
Balazs Komuves
415bb6db8c initial Merkle tree doc draft 2023-11-06 23:23:17 +01:00
xiaolou86
f0c0d5bb38 docs: fix typos 2023-10-24 09:51:26 +02:00
Mark Spanbroek
a880c0e753 Fix names of request states to match the smart contract
See also: 14e453ac31/contracts/Requests.sol (L41)
2023-10-24 09:38:32 +02:00
Mark Spanbroek
f1891bf981 Add cost of hashing merkle paths
Co-Authored-By: Balazs Komuves <bkomuves@gmail.com>
2023-10-16 10:35:30 +02:00
Mark Spanbroek
c8ffbfb620 Update spreadsheet: snark size as outcome, not as input 2023-10-16 10:35:30 +02:00
Mark Spanbroek
020181aa1d Add size of merkle paths to spreadsheet 2023-10-16 10:35:30 +02:00
Mark Spanbroek
faf2d3dd29 Processed review comments.
Co-Authored-By: Leonardo Bautista-Gomez <leobago@gmail.com>
Co-Authored-By: Csaba Kiraly <csaba.kiraly@gmail.com>
2023-10-16 10:35:30 +02:00
Mark Spanbroek
767e4256ea Add description of multi-dimensional schemes 2023-10-16 10:35:30 +02:00
Mark Spanbroek
923ce6e9c1 Update spreadsheet with multi-dimensional scheme 2023-10-16 10:35:30 +02:00
Mark Spanbroek
635fffba6e FastECC decoder is availabe, just not released 2023-10-16 10:35:30 +02:00
Mark Spanbroek
0b23642c86 Differentiate between shards (erasure coding) and blocks (merkle proofs) 2023-10-16 10:35:30 +02:00
Mark Spanbroek
35b704698f Fix typo 2023-10-16 10:35:30 +02:00
Mark Spanbroek
6271a18ae7 erasure coding for storage proofs writeup 2023-10-16 10:35:30 +02:00
Mark Spanbroek
37953497fc erasure coding for storage proofs calculations 2023-10-16 10:35:30 +02:00
Giuliano Mega
1d23b31461
Block discovery simulator and analysis (#175)
* add block discovery simulator

* add analysis document for simpler cases of block discovery
2023-09-27 23:45:58 -06:00
Eric
7ace179f2f
[slot queue] Accomodate existing requests before availabilities added (#168)
Update slot queue design to accomodate storage requested before availabilities were added.
2023-07-25 10:46:04 +10:00
Dmitriy Ryajov
7015f21320
Initial design to reduce metadata overhead (#169)
* Initial design to reduce metadata overhead
2023-07-19 13:09:17 -06:00
Eric Mastro
0cca4cfaf4
Change request queue to slot queue (#167)
* Change request queue to slot queue

The request queue design was overly complicated as there was additional logic required to track one item with multiple slot indices. Instead, each item in the queue could be represented by a slot, and each time a request for storage is received, all slots for the request can be expanded and added to the queue.

* update note about resumption of queue processing
2023-06-28 10:43:22 +10:00
Eric Mastro
cfec0fad1b
Merge pull request #165 from codex-storage/request-queue
Add request queue design
2023-06-08 07:35:29 +10:00
Eric Mastro
19e3ccb410
add consideration for sliding window mechanism 2023-06-07 17:32:41 +10:00
Eric Mastro
c3516a775a
Add repair case, clarification, formatting
1. Add repair case — when a slot is freed in a contract
2. Clarify re-processing of requests
3. Format the document in sectional manner using Title, Heading 1, Heading 2
4. Organise the Request Queue design into sections
2023-06-06 13:28:57 +10:00
Eric Mastro
d0602aa388
add request queue design 2023-06-05 17:20:27 +10:00
Mark Spanbroek
c79280db68 Add write-up about Ethereum account abstraction 2023-05-31 13:56:59 +02:00
Mark Spanbroek
33cd86af4d typo, wording
Co-authored-by: Eric Mastro <eric.mastro@gmail.com>
2023-05-11 16:05:16 +02:00
Mark Spanbroek
adb0158fb8 Update reservations design
Incorporates review comments from
dryajov, emizzle and AuHau.
2023-05-11 16:05:16 +02:00
Mark Spanbroek
f36eff730f Storage space reservations for the sales process
Documents in more detail how storage space reservations
are handled by the sales module, and how they are stored
on disk and on chain.
2023-05-11 16:05:16 +02:00
Adam Uhlíř
7db5e654cb
fix: align terminology with code (#160)
Co-authored-by: markspanbroek <mark@spanbroek.net>
2023-03-09 11:55:52 +01:00
Mark Spanbroek
ad41558900 Add design for interactions between Sales and Repo 2022-11-30 11:08:12 +01:00
Frederico Teixeira
4e32d43787 Dagger renamed to Codex; 2022-11-30 11:07:38 +01:00
markspanbroek
17bd2ded7e
Update bogota2022.md 2022-10-08 17:46:07 +02:00
markspanbroek
bb37439942
Update bogota2022.md 2022-09-29 16:18:42 +02:00
Eric Mastro
3960cac0a7
Update bogota2022.md 2022-09-29 23:26:42 +10:00
Eric Mastro
e6d0db7b71
Update bogota2022.md 2022-09-26 21:45:41 +10:00
markspanbroek
a90fc1e7cf
Draft agenda for Bogota meetup 2022-09-26 10:29:21 +02:00
Mark Spanbroek
87bddba53c Added evaluation of Sui 2022-09-26 10:10:56 +02:00
jessiebroke
28b26f0f4b modify file format 2022-09-22 11:03:00 -04:00
jessiebroke
aa97c64df4 add token valuation analysis script 2022-09-22 10:54:06 -04:00
Mark Spanbroek
8ad08f9b55 Fixed repair reward 2022-09-07 10:59:45 +02:00
Mark Spanbroek
d636511777 Add label to diagram 2022-09-07 10:59:45 +02:00
Mark Spanbroek
b07c12c56e Clarifications on the dispersal mechanism 2022-09-07 10:59:45 +02:00
Mark Spanbroek
4d5949eaa6 Payouts are released at end of contract 2022-09-07 10:59:45 +02:00
Mark Spanbroek
dda7516678 Improve slot diagram 2022-09-07 10:59:45 +02:00
Mark Spanbroek
c1c6f432ac Illustrate Kademlia distance 2022-09-07 10:59:45 +02:00
Mark Spanbroek
0f5bd75221 Add dispersal mechanism 2022-09-07 10:59:45 +02:00
Mark Spanbroek
14a311f25c Repair incentive not longer grows over time
Use the collateral instead of missed payouts
as incentive for repairs.
2022-09-07 10:59:45 +02:00
Mark Spanbroek
423def9fbb Proposal for a new design for marketplace 2022-09-07 10:59:45 +02:00
Csaba Kiraly
fa6901f79d
initial version of durability analysis (#77)
Adding initial version of durability analysis with probabilistic sampling
based lazy repair.

This notebook is still WIP, expect it to change in the future.

Signed-off-by: Csaba Kiraly <csaba.kiraly@gmail.com>
2022-06-30 10:38:26 +02:00
Csaba Kiraly
a6a23acb32
adding initial version of PoR test analysis (#76)
This is to add an initial version of PoR test analysis accounting for more realistic
erasure coding assumptions than the typical large block code assumption with large N.

Calculation in the notebook are still WIP, so expect this to change
2022-06-30 10:36:23 +02:00