Hey @alari . That's really cool. Just two questions: 1. to make it clear, it's gonna be possible to fetch the whole IPLD tree with the webassembly code to index it just with the hash of the root of the tree ? 2. When will it be possible to start writing the working on that feature and play with Fluence :D
Really exciting to start working with fluence anyhow :)
And also: thanks a lot for the update.
@osarrouy , for point 1: probably yes. depends on the size of the tree, and on ipld hashing logic -- you'll need to implement the same hashing to get addresses from the webassembly; and for 2: I hope, we will have something to play with in September or October -- yet you'll need to launch your own Fluence nodes to do it
I read the last comments in the channel, will fluence "only" support building indices or will it take care of data storage and replication as well?
About "only" building indices. Fluence builds, store, and replicate data in a small cluster
If you could describe us the problems you think Fluence is a good fit for, it would be very helpful :)
About status of the project, it's under active research and development, first demos should arrive soon, and we're aiming to release an alpha in Q1 2019 or maybe earlier
What happens if the index gets too huge?
So that the nodes can't store them anymore.
We are considering some kind of sharding but yet haven't found a way to guarantee performance in this case. So the memory limit is going to have a hard upper bound for now. The app developer should find a way to split the index into several parts according to application logic
anybody here ?
