Luc Tielen

Extremely educational thread that shows the Achilles Heel of many vibe-coding apps (and how customers churn).

A founder got super excited and was on track to spend ~$100K/yr with the tool ($8,000/mo)

And then… BOOM

Agent deleted prod DB (!!). Gives up!

Churned - for good?

Thanks for putting in all this work! Anything related to futamura projections is supercool. 😁

Great blogpost about partial evaluation / futamura projections applied to WASM: cfallin.org/blog/2024/08...

The LLM-for-software Yo-yo tratt.net/laurie/blog/...

The year is 2025 and I am finally enjoying writing #python.

(This skeet made possible by uv and type hinting.)

Exercise and a weighted blanket helped me a lot. I also try to limit blue light towards the evening.

Hope you figure it out, insomnia is brutal. 🥲

Sorry, I misread that then.

But isn't it really hard to get >50% then? What was it like with biden last time?

(And don't get me wrong, I'm definitely not looking forward to the coming 4 years.)

Forcing people to vote can also have a bad effect on results.

Here in Belgium we have that and there's a far-right party that get lots of votes because people view it as a "fuck you" vote to the current system (which admittedly does have a lot of flaws).

Power usage / cost per answer for latest models like o3 is very high.

Can't find the picture but power usage of LLMs seems to go up exponentially the bigger the model gets. 😅

I have been catching up on AI developments recently and it's wild how far we have come already.

But I'm also wondering how far LLMs etc can be pushed to the limit. At some point, they need to rethink how these models work..

I followed a copy writing course once and it was eye opening to me. It really put emphasis on writing short, simple sentences.

Maybe these journalists should also start doing that 😅

GitHub - typst/typst: A new markup-based typesetting system that is powerful and easy to learn. A new markup-based typesetting system that is powerful and easy to learn. - typst/typst

Typst?

github.com/typst/typst

Oh and if you want all the results that are k steps away from all nodes, you just remove the start node clause in the last rule.

So yes, it does take an iterative approach and we use steps <k to find all intermediate results.

(Technically, you do that too in your approach after every multiply. You just don't look at the intermediate results.)

Datalog inductively reasons about the rules until it finds no other results. So you write down a recursive rule and it automatically expands it recursively. 😄

First rule is the base case, 2nd rule computes all derived results starting from the results of the first.

Ok that is a clever use of math to find the result, need to keep that in mind in the future 😄

Also nice use of rot13 to hide spoilers, i need to start doing that!

It automatically handles transitive edges. And how would you handle it then if you don't increment by 1?

Something to note: Datalogs like Souffle nowadays do a lot of optimizations at compile time. e.g. it will generate a specialized BTree datastructures optimized specifically for relations used in this program. (Even the indices are calculated automatically!)

And that results in very fast programs.

A Datalog code snippet to calculate the set of nodes k hops (k hardcoded to 5) away from a starting node. Below is the full snippet as plain text: ``` // using numbers to identify the nodes in the graph .decl edge(node_a: number, node_b: number) .decl reachable(node_a: number, node_b: number, hops: number) .decl max_hops(x: number) inline .decl start_node(node: number) .decl result(node_a: number, node_b: number) .input edge .input start_node .output result max_hops(5). // hardcoded for now, could be an input also reachable(node_a, node_b, 1) :- edge(node_a, node_b). reachable(node_a, node_b, x + 1) :- // first 2 clauses are optional, otherwise datalog would calculate *all* reachable paths transitively max_hops(y), x < y, reachable(node_a, node_b, x). result(start, end) :- start_node(start), // this filters results down significantly as well reachable(start, end, hops), max_hops(hops). ```

Something like this.. didn't run it or anything so probably contains bugs 😇, but it would give you a rough idea how to tackle it. And there's variations on this depending on the exact problem.

I think this is would be a fairly trivial problem in datalog (e.g. souffle), idk if that's an option for you?

YouTube video by Napalm Records NANOWAR OF STEEL - HelloWorld.java (Source Code Video) | Napalm Records

2024 is nearing to its end, and we finally found a use case for long java class names 🤘:

youtu.be/yup8gIXxWDU?...

Impressive!

GitHub - llaisdy/PrologInfo: Prolog, Datalog, languages, resources, and beyond! Prolog, Datalog, languages, resources, and beyond! - llaisdy/PrologInfo

First draft of a Prolog languages list. Sections on Lambda Prolog, Datalog, and other logic programming languages.
Feedback, PRs, etc., most welcome!

github.com/llaisdy/Prol...

.. or maybe I should just use Lisp 😅

I've been writing a lot of terraform the past week, and I wonder if a similar approach could be used in other languages to structure things.

E.g. what if you have a DSL that takes template vars separately, and spits out code with everything interpolated. Simple alternative to C++ templates?

Just removing the fluff from some books probably achieves more than that 😅

I used to be team ORM, but now I'm all for writing SQL by hand.

Much more control, no more funky DSLs to learn, no limitations.

Can't believe I didn't start doing it sooner..

Good reminder that I should write more Erlang/Elixir code again.

I think a lot of things are going to get more expensive. 😅

I have been stuck debugging the eclair runtime for quite some time now.

Maybe I need to try C reduce to shrink the 22k LLVM IR instructions? 🤔

Based on: bernsteinbear.com/blog/creduce/