tontinton

Yeah we all converge to the same workflow, in my ai coding agent I'm working on now, I've added an "index" tool that uses tree-sitter to compress and show the AI a skeleton of a code file.

Here's the implementation for the interested: https://github.com/tontinton/maki/blob/main/maki-code-index%...

Is it similar to rtk? Where the output of tool calls is compressed? Or does it actively compress your history once in a while?

If it's the latter, then users will pay for the entire history of tokens since the change uncached: https://platform.claude.com/docs/en/build-with-claude/prompt...

How is this better?

Very cool, have you taken a look into what TigerBeetle does with VSR (and why they chose it instead of raft)?

Can I select multiple receivers concurrently, similar to a select in Linux?

Learn about the data structures & algorithms that make up modern log search engines like Elasticsearch.

You're right, I'll fix it in the post.

Thanks!

Yeah I might have been wrong, simply went with https://blog.stenmans.org/theBeamBook/#_reductions

Now that I reread that section, it also depends on whether you call a BIF or not, I'll think about how to phrase that better in the blog post.

Thanks!

Thanks a lot! :)

I thought about it, I just wanted people to get hooked with some eye candy, and to want to continue reading ;)

Thanks! :)

Thanks for the feedback, I fixed most issues with the animations.

Oh that is a great example, I'll update the post tomorrow.

Thanks for pointing out the link is bad! I just fixed it.

And yeah this was shocking to me as well.

This is great, maybe I'll try to improve bashdb

no waaay, I have never seen look before, thanks!

Thanks, that's something I didn't know!

I'll fix it later, and change the wording to say that these are properties of a database transaction

One day :)

Oh you're right I'll add that in later.

You're right this was purposefully left out for brevity, in dbeel it is handled.

Thanks :)