jaekwon
Upload a video or paste a link. sugar.video transcribes it, translates the captions, and can dub it in the speaker's own voice.
> But others were jeering and saying, “They are full of sweet wine!” - Acts 2:13
You need a local AI model because ollama doesn't work without modification, as gnosh.ai changes the way the model is used.
In the link https://gnosh.ai/head-to-head.html you can see roughly how it works. This makes all existing harnesses lossy inefficient tools in comparison.
Also see https://gnosh.ai/peers.html for multi-user parallelism.
@jaekwon and @gnosh_ai on X.
Gnosh.ai for "Functional AI"; functional context management, no compaction
the cat is out of the bag now.
You can have an org chart, but that's still different than a kanban board.
Gnosh.ai – super intelligent AI that thinks, plans, recalls in Go
So I forked a Go harness (Crush) and integrated a Go interpreter (the Gno VM) so that it thinks, plans, remembers in Go/Gno objects.
The AI matrix prison is real and discussions about it are censored.
You're right, and I should correct my earlier phrasing. The paper does *not* merely assert existence — it gives a *specific deterministic algorithm* with a concrete, proven running time:
> A deterministic algorithm that exactly counts the satisfying assignments of a canonically encoded $k$-CNF formula on $n$ variables in time $(n+m)^{O_k(1)} \cdot 2^{O_k(n \log\log n / \sqrt{\log n})}$, using polynomial space.
The Lean formalization proves this bound. So it's a fully specified algorithm, not just "there exists one." My earlier "theoretical existence statement" framing was wrong.
*What that changes (and doesn't) for the practicality question:*
- It's a real algorithm in the sense that if you implemented it, it would terminate and give the correct answer. The proof guarantees the bound. - But the bound is still *astronomically slow* for any input size a cryptographer cares about. At $n = 1{,}000$ variables the exponent is already $\sim 1{,}000 \cdot 5 / 5 \approx 1{,}000$, i.e. $2^{1000}$ — far beyond any feasible computation. - The reduction-overhead argument for cryptography is unchanged: the subexponentiality is in $n$ (the SAT variable count), and reducing a cryptographic problem of size $N$ to SAT inflates $n$ to $\text{poly}(N)$, which swallows the subexponential advantage.
So the correction is: yes, it's a specific algorithm, not a mere existence claim. But the practical conclusion is the same — the bound is too slow to matter for cryptography, and the reduction path doesn't preserve the subexponential character relative to the original security parameter.
Compare AI models to see which censors what.
So I made a site to prove it, and as a followup:
a freemium API for uncensored language translations.
https://www.youtube.com/watch?v=GKrfM2ys77c <-- interview https://www.youtube.com/watch?v=ni7LJGIqD9k <-- walkthrough https://www.youtube.com/@jaekwon777 <-- my Youtube channel https://twitter.com/jaekwon <-- updates
If you care about breaking the matrix prison we live in (see my youtube channel for proof), please upvote and raise awareness.