Annnd, that's it for Peergos - think we might be heading for a break soon (I hope so, hah)
-
-
Replying to @yoshuawuyts
I might just stop tweeting - not awake enough to both follow along and summarize all these smart things
1 reply 0 retweets 1 like -
Replying to @yoshuawuyts
The programming model that IPFS brings to the table is authenticated functional data structures. It's the same programming model as Haskell
1 reply 4 retweets 8 likes -
Replying to @yoshuawuyts
Mikola is now presenting on how to create a maps service over IPFS. Touching on the basic blocks of IPFS and maps alike
1 reply 0 retweets 0 likes -
Replying to @yoshuawuyts
Talking now about how to create a maps implementation. Notes in my knowledge repo here:https://github.com/yoshuawuyts/knowledge/commit/8a561bf2d62764b4b2c7c8efa64860014b894c98 …
1 reply 1 retweet 3 likes -
Replying to @yoshuawuyts
"Leaflet isn't geared towards incremental updates of a dataset - they are not engineered for this problem. (...) with IPFS this can work"
1 reply 0 retweets 0 likes -
Replying to @yoshuawuyts
Still going over the basics of maps rendering. Gotta learn how quadtrees work, k-d trees work, binary search trees too. This so good
1 reply 0 retweets 0 likes -
Replying to @yoshuawuyts
Mikola is now going through how k-d trees work. This is going pretty deep haha.
1 reply 0 retweets 0 likes -
Replying to @yoshuawuyts
"So far we've only been talking about basic data structures. This is because IPFS itself is a functional data structure" - making sense here
1 reply 0 retweets 0 likes -
Replying to @yoshuawuyts
Mikola now touching on the route planning aspect. Points out that systems already exist that run on OSM - it's a solved problem
1 reply 0 retweets 0 likes
And now we're talking Dijkstra / A* path finding algorithms. From the person that wrote one of the fastest pathfinding algorithms ever 
-
-
Replying to @yoshuawuyts
"2 hop hub labelling" - hardest word in two days, and we've talked about a lot of complex things lol
1 reply 0 retweets 0 likes -
Replying to @yoshuawuyts
So fast path finding can be done by pairing "2 hop hub labelling" and A* - scales linearly in mem, sub ms query times
1 reply 0 retweets 3 likes - 17 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.