yosh

I might just stop tweeting - not awake enough to both follow along and summarize all these smart things

The programming model that IPFS brings to the table is authenticated functional data structures. It's the same programming model as Haskell

Mikola is now presenting on how to create a maps service over IPFS. Touching on the basic blocks of IPFS and maps alike

"Leaflet isn't geared towards incremental updates of a dataset - they are not engineered for this problem. (...) with IPFS this can work"

Still going over the basics of maps rendering. Gotta learn how quadtrees work, k-d trees work, binary search trees too. This so good

Mikola is now going through how k-d trees work. This is going pretty deep haha.

"So far we've only been talking about basic data structures. This is because IPFS itself is a functional data structure" - making sense here