GistNoesis

8 ms·

31.
by GistNoesis 6mo ago
Isn't it awful ? After 5.5 versions it still can't draw a basic bike frame. How is the front wheel supposed to turn sideways ?
32.
by GistNoesis 6mo ago
Thanks for pointing to the GGUF. I just tried this GGUF with llama.cpp in its UD Q4_K_XL version on my custom agentic oritened task consisiting of wiki exploration and automatic database building ( https://github.com/GistNoe
33.
by GistNoesis 6mo ago
Programming is indeed becoming witchcraft, with LLMs it is of the utmost importance that you chose the right database administrator. For example I'm now relying on Soteria, the greek goddess of safety, salvation and preservation from h
34.
by GistNoesis 6mo ago
Who should get jailed ? Does the company which willingly sells the polymorphic virus editor bear any responsibility, or should the unaware vibe coder be incumbent ?
35.
by GistNoesis 6mo ago
There is also the fact that it's very easy to plant backdoors in LLMs with plausible deniability : - You can just use the same tools you use to train them to make them behave in some specific ways if some specific preconditions are met
36.
by GistNoesis 6mo ago
Shoggoth.db : a self organizing database to experiment with agents without having to let them roam freely. Posted a show hn earlier today that didn't got any traction : https://news.ycombinator.com/item?id=47738516
37.
by GistNoesis 6mo ago
Happy Easter HN This year for my fun Easter project, I decided to revisit my HN first project from 10 years ago (a chatbot based on Wikidata), but with the technology and vibe of the day. So this is in the same vibe as Karpathy's LLM W
38.
Show HN: Shoggoth.db Self Organizing Database(github.com)
1 points by GistNoesis 6mo ago|1 comments
39.
by GistNoesis 7mo ago
The model does call tools successfully giving sensible parameters but it seems to not picking the right ones in the right order. I'll try in a few days. It's great to be able to test it already a few hours after the release. It&#x
40.
by GistNoesis 7mo ago
I just tried with llama.cpp RTX4090 (24GB) GGUF unsloth quant UD_Q4_K_XL You can probably run them all. G4 31B runs at ~5tok/s , G4 26B A4B runs at ~150 tok/s. You can run Q3.5-35B-A3B at ~100 tok/s. I tried G4 26B A4B as a
41.
by GistNoesis 7mo ago
TLDR: It's easy : LLM outputs are untrusted. Agents by virtue of running untrusted inputs are malware. Handle them like the malware they are. >>> "While this web site was obviously made by an LLM" So I am expecting t
42.
by GistNoesis 7mo ago
He even attempts to improve on the paper by replacing the random rotation operation which is O(d^2), by a Subsampled Randomized Hadamard Transform which can be computed in O(d*log d). Hopefully Johnson–Lindenstrauss lemma applies in the sam
43.
by GistNoesis 7mo ago
A little vibecoded experiment I did today. Using local only model with llama.cpp, using Qwen3.5-35B-A3B-UD-Q4_K_XL, copy pasting the full generated html page (no advance editor which do incremental file modification :) ) 30 versions ~200k t
44.
Show HN: Watermolecules(unrealwill.github.io)
1 points by GistNoesis 7mo ago|1 comments
45.
by GistNoesis 7mo ago
I had to check the precise definition for trigonometry while writing my comment, found it interesting so I added a reference. As with many subject that we learn early in school, it's often interesting revisiting them as adult to percei
46.
by GistNoesis 7mo ago
I think it boils down to the alternate view of rotations as two successive reflections. You can then use householder matrix to avoid trigonometry. These geometric math tricks are sometimes useful for efficient computations. For example you
47.
by GistNoesis 8mo ago
Interesting work. It's a nice introduction to usage of holography. We can etch the inside of a photosensitive material by focusing a laser at a specific point, and moving this point of focus. That's what is done in [3] [4]. But he
48.
by GistNoesis 8mo ago
It's even worse than that. The positives outcomes are structurally being closed. The race to the bottom means that you can't even profit from it. Even if you release something that have plenty of positive aspects, it can and is im
49.
by GistNoesis 9mo ago
I like the game up until 7 or 8 notes, but it keeps adding note. I couldn't find a setting to freeze the difficulty where it's comfortable and where the melody can still be construed to make sense. When adding more notes, it break
50.
by GistNoesis 10mo ago
Have you checked his physical keyboard ? My laptop is getting old, and some keys need to be pressed with more insistence and more accurately for them to register properly. It also breaks the flow, and muscle memory for things like passwords
51.
by GistNoesis 10mo ago
Or use lasers : https://www.youtube.com/watch?v=DCQ2CbfGs6g&t=440s
52.
by GistNoesis 10mo ago
Please forgive my outside the box use of word. I used it at the time as a reference to the "PNG aCropalypse" ( https://news.ycombinator.com/item?id=35208721 where I originally shared it in a comment). The algorith
53.
by GistNoesis 10mo ago
And that's just in the non-adversarial simple case. If you don't know the provenance of images you are putting black box on (for example because of a rogue employee intentionally wanting to leak them, or if the image sensor of you
54.
by GistNoesis 10mo ago
If it's not done properly, and you happen at any point in the chain to put black blocks on a compressed image (and PDF do compress internal images), you are leaking some bits of information in the shadow casted by the compression algor
55.
by GistNoesis 10mo ago
The problem of computers is the problem of time : How to obtain a consistent causal chain ! The classical naive way of obtaining a consistent causal chain, is to put the links one after the other following the order defined by the simulatio
56.
by GistNoesis 10mo ago
What they need is not so much memory but memory bandwidth. For training, their models have a certain number of memory needed to store the parameters, and this memory is touched for every example of every iteration. Big models have 10^12 (&g
57.
by GistNoesis 11mo ago
In the video, in the continuous version the game never end and highlight the "loser" strategy. When you are behind the optimal play is to make a gamble, which most likely will make you even worse. From the naive winning side it se
58.
by GistNoesis 11mo ago
The theoretical maximum rate for 1B particle advection (Just doing p[] += v[] dt), is 1000GB/s / 24GB = 42 iteration per second. If you only have 100M you can have 10 times more iteration. But that's without any rendering, an
59.
by GistNoesis 11mo ago
TLDR : 1B particles ~ 3s per iterations For examples like particle simulations, on a single node with a 4090 GPU everything running on GPU without memory transfer to the CPU: -The main bottleneck is memory usage : available 24GB, Storing th
60.
by GistNoesis 11mo ago
There are two types of stops : soft stops, and hard stops. - Soft stops is when the dynamic graph computation overhead is too much, which mean you can still calculate, but if you were to write the function manually or with a better framewor

More ›