New Unixfs implementations
Nadie ha tomado este issue todavía.
Evaluación
- Dificultad
- 5/5
- Tiempo estimado
- Más de una semana
- Aptitud para principiantes
- 25/100
- Tipo de issue
- Nueva funcionalidad
- Claridad
- Necesita aclaración
- Estado de actividad
- Estancado
- Stack tecnológico
- go
- Área
- backend, data, distributed-systems
Línea de trabajo
Comienza revisando la capa intermedia propuesta blocks.Block y los formatos unixfs.proto y dag-pb.proto; después, sigue cómo se representaría un flujo CAR ordenado basado en io.Reader. El issue enumera varias implementaciones posibles, pero no menciona archivos ni pruebas del repositorio, por lo que hay que acordar el alcance y los criterios de finalización antes de empezar el trabajo.
Escrito por el modelo de indexación a partir del texto del issue.
Descripción
Dedicated unixfs implementations are often much more performant and efficient.
See for example two of mines:
- https://github.com/Jorropo/linux2ipfs (blazingly fast file adder / fastest
ipfs addimplementation that exists) - https://github.com/Jorropo/go-featheripfs (high performance very high efficiency ordered car ->
io.Readerfile with incremental verification and data streaming)
I think it is more sustainable to maintain a handful of dedicated implementations that individually do one job well (something like feather and something that would maintain state to support unordered dags are really different).
Unified middle layer
The way I have been writing my implementations is by jugling bytes unixfs.proto and dag-pb.proto by hand everywhere.
This is kinda meh looking because of all the little details that have to be checked.
I really think we need some efficient middle layer that takes in blocks.Block parse them, do sanity checks and return some representation that looks like internal unixfs (so one node per block, and full support for all schenanigans you would want to do but with error checking):
package unixfs
type Type uint8
const (
_ Type = iota
Directory
File
Metadata
Symlink
HAMTShard
)
type Node struct{
Type Type
Data []byte // for files
Entries []Entry
DagSize uint64
HashType uint64 // for HAMT dirs
Fanout uint64 // for HAMT dirs
}
type Entry struct{
Link
Name string // for directories
}
type Link struct{
Type Type // Indicative, not actually
Cid cid.Cid
FileSize uint64 // for files
DagSize uint64
}
func (*Node) UnmarshalIPFS(blocks.Block) error
func (*Node) MarshalIPFS() (blocks.Block, error)
func (*Node) Encode() (Link, blocks.Block, error)
// File operations
func (*Node) ParseFile(Link, blocks.Block) error
func (*Node) AddFileSegments(Link...) error
func (*Node) FileSize() uint64
// Directory operations
func (*Node) ParseDirectory(Link, blocks.Block) error
func (*Node) AddChildrenNode(Link...) error
// other types ...
This would not includes helper functions for more advanced stuff like HAMT, chunking, ... we will most likely need thoses too but the goal here is to provide a thin wrapper around the protobuf that add the repetitive input validation.
Impls
List of implementations we need:
- Efficient state-light streaming decoder with incremental verification. (I'll probably use feather after refactoring it to use the unified lower layer and adding the missing features)
The goal is to incremental verify ordered.carfiles from saturn on the cheap resource wise. (and other ordered blocks sources)- Capable of streaming the verification of an ordered stream of block (such as a car file red from
io.Reader) incrementally (while streaming the result out). - Interface must implement
io.Readerfor reading from files without any background goroutine (efficiency). - It must support incrementally verifying requests mapping to https://github.com/ipfs/boxo/pull/176 sementics.
- Capable of streaming the verification of an ordered stream of block (such as a car file red from
- Decoder with incremental verification and output stream with random walk BFS input.
- Streaming data in order can have a high cost, however if we are cleaver we can use
.WriteAtto write blocks in any order as long as we receive roots before leaves (or cache leaves but then incremental verification is not possible)
- Streaming data in order can have a high cost, however if we are cleaver we can use
- MFS rewrite.
- Some write opperation helpers (concatenate, chunking, ...)
- ... ?
- Lenguaje dominante
- Go
- Estrellas
- 326
- Forks
- 165
- Métricas de merge de PR
- Sin PR fusionados en 30 d
Preparar el entorno
- Sin Dockerfile ni archivo de Docker Compose
- Tiene una plantilla de pull request
- Sin guía de contribución
Primeros pasos
- Lee el issue completo y luego la guía de contribución del proyecto.
- Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
- Haz un fork del repositorio y trabaja en una rama.
- Abre un pull request que haga referencia al número del issue.
Más de ipfs/boxo
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 70/100
-
Dificultad 4/5 3-5 días Aptitud para principiantes 46/100
-
Dificultad 3/5 1-2 días Aptitud para principiantes 55/100
-
need/triage
Dificultad 5/5 Más de una semana Aptitud para principiantes 38/100
-
dif/medium effort/hours kind/enhancement P3 topic/devexp
Dificultad 5/5 Más de una semana Aptitud para principiantes 35/100
Issues similares
-
area/networking kind/bug
Dificultad 2/5 1-3 horas Aptitud para principiantes 69/100
siderolabs/talos#14972 ·
Los mantenedores suelen responder en 1 día
-
Dificultad 1/5 Menos de una hora Aptitud para principiantes 72/100
Los mantenedores suelen responder en 1 día
-
kubectl wait outputs cryptic "error: unrecognized condition: []" when --for is omittedPosiblemente ocupada @muskan-creates352 la tomó hoy. Abiertokind/bug needs-triage
Dificultad 2/5 1-3 horas Aptitud para principiantes 84/100
kubernetes/kubectl#1910 · 1 comentario ·
-
Add Shiro (Remote) MCP serverAbiertoneeds-triage
Dificultad 2/5 1-3 horas Aptitud para principiantes 66/100
stacklok/toolhive-catalog#1967 ·
Los mantenedores suelen responder en 1 día
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 66/100
unbound-force/gaze#353 ·
Los mantenedores suelen responder en 1 día