News for hackers. Stuff that matters.

carsonfarmer

Re:Geometric Search Trees on Tuesday September 24, 2024 @07:08PM (#41641958)
Whoah, I totally hadn't taken the thought experiment this far. This is fantastic! I'd like to explore this further, interested in a quick research chat/sync some time? My email is linked from the paper.
Re:Geometric Search Trees on Thursday September 19, 2024 @12:33PM (#41593636)
Pretty cool to see this here. My co-author and I haven't actually officially "released" this yet, so quite neat to see where it is organically showing up! Feedback appreciated y'all!
Re:Geometric Search Trees on Thursday September 19, 2024 @12:29PM (#41593579)
Thanks, that's all due to my co-author. Here's what we used: https://news.ycombinator.com/item?id=41589728 (link is to a post from @msy)
Re:Geometric Search Trees on Thursday September 19, 2024 @12:21PM (#41593485)
You're right, we should delve into a comparison more with respect to prolly trees. We actually have a lot of experience with prolly trees, and have found, in practice, that you need to do a lot of the things that folks like dolt have had to do to make them work nicely. Whereas with G-trees, the basic implementation turns out to be quite nice (and extremely easy to reason about).

One of the biggest benefits of G-trees in my mind, is their ease of implementation. Additionally, we did a lot of work to explore their statistical properties, which doesn't exist for prolly trees (though in hindsight, we have done this, so should probably write it up formally).

Re:Geometric Search Trees on Thursday September 19, 2024 @12:18PM (#41593445)
Yes this exactly. Another really simple way to do this, is to use alternating leading and trailing zero counts in the hash in your nested G-trees. Simple, and pretty effective.
Re:Geometric Search Trees on Thursday September 19, 2024 @12:13PM (#41593379)
Whoah, cool. I'm one of the authors of the geometric search tree paper, and we totally hadn't see that paper, but will for sure dig in! Thanks for mentioning it.
Re:Dumb Pipe on Wednesday December 06, 2023 @03:04PM (#38548794)
Ok, this is quite cool. Also love the name.
Super fun example of the combination of AI and DB. You want to get back exactly what you put in, use a DB! You want something extrapolated from what you put in, AI is pretty great! Also Fireproof is :fire:
That's awesome, dig right in! And don't hesitate to reach out on our slack: slack.textile.io. We're under active development, so if there's something missing, or a feature that's lacking in documentation (there are, but we're working on it!) let us know.
Re:Remote for small teams: Coronavirus work from home tips on Thursday March 12, 2020 @03:04PM (#22560509)
Just a bunch of useful tools and ideas our team has picked up along the way while being remote only for the past few years.
Super excited to see this out the in the wild! Been following this project for a while now - huge fan of the vision, huge fan of the UX. Congrats!
Re:Snap CFO Tim Stone Is Resigning on Tuesday January 15, 2019 @08:25PM (#18917481)
You can email contact@ textile.io for a referral :)
Re:Snap CFO Tim Stone Is Resigning on Tuesday January 15, 2019 @08:22PM (#18917463)
Check out https://textile.photos (full disclosure, I'm on the team)!
Re:Decentralisation: the next big step for the world wide web on Monday September 10, 2018 @02:35PM (#17953949)
Super late to the game here, but we're (https://textile.photos/) seeing pretty great results on mobile running a 'lite' IPFS peer. Battery consumption is not bad compared to other network-driven apps, and with intelligent swam on/off optimizations, mobile peers can share and pin files quite nicely. It helps if you have a network of 'always on' peers to back them up of course :)
A fun one with Python snippets to play around with
These are 'works in progress' so open to comments and suggestions!
This is actually part 2 in a series I started earlier in the week: https://medium.com/textileio/tutorial-setting-up-an-ipfs-pee...

Older »