-
The Graphsync spec states:
---
## Other notes
**Cost to the responder.** The graphsync protocol will require a non-zero additional overhead of CPU and memory. This cost must be very clearly a…
-
### Description
Initial chain syncing for a node that is new or far behind the consensus head is very slow: it can take many hours to sync a weeks-old chain. Sync is a bit vague a term, but I here me…
-
As per team call regarding the plan for camera roll sync:
- Added files are _always_ pinned locally, regardless of the schema directive
- Clients (mobile, CLI, etc.) can then "release" a file once it…
-
I'm seeking an understanding of the *motivation* behind proposal #94 (and spec detail #250), to reference messages in blocks by CID in a merkle-tree-like structure. The corresponding issue in go-filec…
-
**Problem**
Right now we don't make the best use of information we have about our historical bitswap interactions with peers when devising a set of peers to ask for blocks.
PR #8 has some importa…
-
The issue is that I want to use BitSwap not only to handle blocks it wants, but also any other sent block. Currently BitSwap checks every received block through WantManager's `IsWanted()` method and j…
-
This document is meant to stimulate discussion and work towards a final proposal for the external interfaces that GraphSync provides that FileCoin will use.
## Go-IPLD-Prime
`go-graphsync` relie…
-
Should demonstrate interface between Go-Graphsync, selectors, and client libraries
-
I'm thinking something like:
```go
type Verifier interface {
// Expects returns the next expected CID and a boolean indicating if we *are* expecting a CID.
Expects() (cid.Cid, bool)
// Recei…
-
I thought I finally have a good understanding of what Graphsync means to @jbenet and @whyrusleeping. But I don't. Hence I open this issue to see if we can clarify things for me once more. Below is my …