mirror of
https://github.com/logos-storage/logos-storage-research.git
synced 2026-01-02 13:33:07 +00:00
chore: fix some typos
Signed-off-by: finaltrip <finaltrip@qq.com>
This commit is contained in:
parent
f72298364e
commit
691c1d56d3
@ -20,13 +20,13 @@ Dagger. It is not meant to be a criticism of IPFS.
|
||||
+ BitSwap protocol for exchanging blocks supports multiple strategies (§3.4.2),
|
||||
so it should be relatively easy to add a micropayment strategy.
|
||||
+ Uses content addressing (§3.5)
|
||||
+ The Merkle DAG is simple, yet allows constucting filesystems,
|
||||
+ The Merkle DAG is simple, yet allows constructing filesystems,
|
||||
key-value stores, databases, messaging system, etc.. (§3.5)
|
||||
|
||||
#### Cons:
|
||||
|
||||
- Kademlia prefers long-lived nodes (§2.1.1), which is not ideal for mobile
|
||||
enviroments (although it's unclear whether there are any better alternatives)
|
||||
environments (although it's unclear whether there are any better alternatives)
|
||||
- The default BitSwap strategy falls just short of introducing a currency with
|
||||
micro payments, necessitating additional work for nodes to find blocks to
|
||||
barter with (§3.4)
|
||||
|
||||
@ -23,14 +23,14 @@ lead to smaller proofs than zkSNARKs can provide.
|
||||
Tooling
|
||||
-------
|
||||
|
||||
[Zokrates][1] is a complete toolbox for specifiying and generating and verifying
|
||||
[Zokrates][1] is a complete toolbox for specifying and generating and verifying
|
||||
zkSNARK proofs. It's written in Rust, has Javascript bindings, and can generate
|
||||
Solidity code for verification. C bindings appear to be absent.
|
||||
|
||||
[libSNARK][2] and [libSTARK][3] are C++ libraries for zkSNARK and zkSTARK
|
||||
proofs. libSNARK can be used as a backend for Zokrates.
|
||||
|
||||
[bellman][4] is a Rust libray for zkSNARK proofs. It can also be used as a
|
||||
[bellman][4] is a Rust library for zkSNARK proofs. It can also be used as a
|
||||
backend for Zokrates.
|
||||
|
||||
Iden3 created a suite of tools ([circom][5], [snarkjs][6], [rapidsnark][7]) for
|
||||
|
||||
@ -31,7 +31,7 @@ Transactions on owned objects require 2 roundtrips to a quorum for byzantine
|
||||
broadcast. Transactions on shared objects require 4-8 round trips to a quorum
|
||||
for byzantine agreement. (Whitepaper §5, "Latency")
|
||||
|
||||
### Parallellism ###
|
||||
### Parallelism ###
|
||||
|
||||
Sui uses the
|
||||
[Move](https://github.com/MystenLabs/sui/blob/main/doc/paper/sui.pdf) language
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user