Groups > sci.physics > #896394 > unrolled thread

The Wuhan Virus that destroyed Python [ggml Manifesto]

Started by	Mild Shock <janburse@fastmail.fm>
First post	2026-07-22 21:01 +0200
Last post	2026-08-02 23:39 +0200
Articles	20 on this page of 81 — 5 participants

Back to article view | Back to sci.physics

  The Wuhan Virus that destroyed Python [ggml Manifesto] Mild Shock <janburse@fastmail.fm> - 2026-07-22 21:01 +0200
    Deadlock Exorcism: Switch from Push to Pull [A pi-calculus Specification of Prolog] (Re: The Wuhan Virus that destroyed Python [ggml Manifesto]) Mild Shock <janburse@fastmail.fm> - 2026-07-23 00:25 +0200
      Why do you even need a mpmc queue? [Thunder Kittens] (Re: Deadlock Exorcism: Switch from Push to Pull) Mild Shock <janburse@fastmail.fm> - 2026-07-23 08:45 +0200
        Trivial balancing example for (int i=0; i<global_id; i++) (Re: Why do you even need a mpmc queue? [Thunder Kittens]) Mild Shock <janburse@fastmail.fm> - 2026-07-23 08:55 +0200
          The Pixel Phone AI Experiment Song (Enqueue/dequeue need not be fast and can spinn ["fairness" questions]) Mild Shock <janburse@fastmail.fm> - 2026-07-23 09:19 +0200
            Enqueue/dequeue need not be fast and can spinn ["fairness" questions] (Re: The Pixel Phone AI Experiment Song (Enqueue/dequeue need not be fast and can spinn ["fairness" questions]) Mild Shock <janburse@fastmail.fm> - 2026-07-23 09:23 +0200
        And, where did I talk about rockets? [Hint its about xAI's Grok] (Re: Why do you even need a mpmc queue? [Thunder Kittens]) Mild Shock <janburse@fastmail.fm> - 2026-07-25 01:25 +0200
          Why forget something, that was never on my mind (Re: And, where did I talk about rockets? [Hint its about xAI's Grok]) Mild Shock <janburse@fastmail.fm> - 2026-07-25 09:49 +0200
        Example Mandel Brot rendering [Faster with MIMD] (Was: Why do you even need a mpmc queue? [Thunder Kittens]) Mild Shock <janburse@fastmail.fm> - 2026-07-25 09:56 +0200
    Potential Python Recovery: Free Threading [3.13 release] (Re: The Wuhan Virus that destroyed Python [ggml Manifesto]) Mild Shock <janburse@fastmail.fm> - 2026-07-23 10:21 +0200
    The things XILINX braught to the AMD table (Re: The Wuhan Virus that destroyed Python [ggml Manifesto]) Mild Shock <janburse@fastmail.fm> - 2026-07-23 18:48 +0200
      NVIDIA evacuated its Chinese market [Tau Scaling] (Re: The things XILINX braught to the AMD table) Mild Shock <janburse@fastmail.fm> - 2026-07-23 19:13 +0200
        Micro penis mother sung arias (Re: NVIDIA evacuated its Chinese market [Tau Scaling]) Mild Shock <janburse@fastmail.fm> - 2026-07-24 14:40 +0200
          Micro penis brain is in constant hiatus (Re: Micro penis mother sung arias) Mild Shock <janburse@fastmail.fm> - 2026-07-24 15:27 +0200
            Ignoramus or Ignorabimus: I don't care [(Re: Micro penis brain is in constant hiatus (Re: Micro penis mother sung arias) Mild Shock <janburse@fastmail.fm> - 2026-07-24 15:35 +0200
              You are a moron, brainless putin payed (Re: Ignoramus or Ignorabimus: I don't care) Mild Shock <janburse@fastmail.fm> - 2026-07-24 18:01 +0200
                Yeah keep reading my posts, uninspired fool (Re: You are a moron, brainless putin payed) Mild Shock <janburse@fastmail.fm> - 2026-07-24 19:47 +0200
              Out of the blue accusation span 15 days [Empirical USENET study] (Re: Ignoramus or Ignorabimus: I don't care) Mild Shock <janburse@fastmail.fm> - 2026-07-24 20:27 +0200
              A brain desease of 20 days [Rossy Boy] (Re: Ignoramus or Ignorabimus: I don't care) Mild Shock <janburse@fastmail.fm> - 2026-07-29 18:41 +0200
                I didn't use a Ryzen Halo, whats wrong with you? (Re: A brain desease of 20 days [Rossy Boy]) Mild Shock <janburse@fastmail.fm> - 2026-07-29 23:25 +0200
                Ignoramus / Ignorabimus Barometer: Almost 1 Month (Re: A brain desease of 20 days [Rossy Boy]) Mild Shock <janburse@fastmail.fm> - 2026-08-03 00:07 +0200
        Re: NVIDIA evacuated its Chinese market [Tau Scaling] (Re: The things XILINX braught to the AMD table) Mild Shock <janburse@fastmail.fm> - 2026-07-28 14:17 +0200
        ASML stocks are plunging, bye bye dutchies (Re: NVIDIA evacuated its Chinese market [Tau Scaling]) Mild Shock <janburse@fastmail.fm> - 2026-07-28 14:18 +0200
    Little Data Center on Your Palm [AI Laptops for 500 USD] (Re: The Wuhan Virus that destroyed Python [ggml Manifesto]) Mild Shock <janburse@fastmail.fm> - 2026-07-24 17:59 +0200
      2008: 4 Blades + Tesla S1070 versus 2026: 1 AI Laptop (Re: Little Data Center on Your Palm [AI Laptops for 500 USD]) Mild Shock <janburse@fastmail.fm> - 2026-07-24 18:15 +0200
    Hurry the blue bus doesnt stop indefinitely (Re: The Wuhan Virus that destroyed Python [ggml Manifesto]) Mild Shock <janburse@fastmail.fm> - 2026-07-24 20:37 +0200
      Not SIMD, a MIMD design for NVIDIA Volta (Re: Hurry the blue bus doesnt stop indefinitely) Mild Shock <janburse@fastmail.fm> - 2026-07-24 20:58 +0200
        Could take 3-4 months find machine / browser (Re: Not SIMD, a MIMD design for NVIDIA Volta) Mild Shock <janburse@fastmail.fm> - 2026-07-24 21:16 +0200
        The Koan of pi-WAM queues [FORTRAN-S] (Re: Not SIMD, a MIMD design for NVIDIA Volta) Mild Shock <janburse@fastmail.fm> - 2026-07-26 19:54 +0200
          The turbo capping of AI Laptops (Was: The Koan of pi-WAM queues [FORTRAN-S]) Mild Shock <janburse@fastmail.fm> - 2026-07-26 20:00 +0200
          Re: The Koan of pi-WAM queues [FORTRAN-S] (Re: Not SIMD, a MIMD design for NVIDIA Volta) Mild Shock <janburse@fastmail.fm> - 2026-07-27 09:16 +0200
          Why forget Bulgarians, never on my mind (Re: The Koan of pi-WAM queues [FORTRAN-S]) Mild Shock <janburse@fastmail.fm> - 2026-07-27 09:16 +0200
            miniTriton CUDA is an alternative to torch variants (Re: Why forget Bulgarians, never on my mind) Mild Shock <janburse@fastmail.fm> - 2026-07-27 09:52 +0200
              Andrej Karpathy original gangster of Budget Laptop (Re: miniTriton CUDA is an alternative to torch variants) Mild Shock <janburse@fastmail.fm> - 2026-07-27 09:54 +0200
            The evolution of hardware and GPT-2 training (Re: Why forget Bulgarians, never on my mind) Mild Shock <janburse@fastmail.fm> - 2026-07-27 10:57 +0200
              How speed up π-WAM with vector operations (Re: The evolution of hardware and GPT-2 training) Mild Shock <janburse@fastmail.fm> - 2026-07-27 11:10 +0200
                AI accelerator extend from GPU to CPU [Zero Copying] (Re: How speed up π-WAM with vector operations) Mild Shock <janburse@fastmail.fm> - 2026-07-27 13:21 +0200
                  The invention of vector and matrix registers [NVIDIA Volta] (Re: AI accelerator extend from GPU to CPU [Zero Copying]) Mild Shock <janburse@fastmail.fm> - 2026-07-27 13:22 +0200
                    Re: The invention of vector and matrix registers [NVIDIA Volta] (Re: AI accelerator extend from GPU to CPU [Zero Copying]) Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-07-27 07:34 -0700
                      Maybe they should have named it NVIDIA Einstein [Rossy Boy Toe Sucking] (Was: The invention of vector and matrix registers [NVIDIA Volta]) Mild Shock <janburse@fastmail.fm> - 2026-07-27 17:12 +0200
                      Re: The invention of vector and matrix registers [NVIDIA Volta] (Re: AI accelerator extend from GPU to CPU [Zero Copying]) R Kym Horsell <kym@sdf.com> - 2026-07-27 15:43 +0000
                        Re: The invention of vector and matrix registers [NVIDIA Volta] (Re: AI accelerator extend from GPU to CPU [Zero Copying]) R Kym Horsell <kymhorsell@gmail.com> - 2026-07-27 15:46 +0000
                        π-WAM is not adding decimals, it is removing decimals (Was: The invention of vector and matrix registers [NVIDIA Volta]) Mild Shock <janburse@fastmail.fm> - 2026-07-27 18:34 +0200
                          In Budget Laptops the TOPS come with low energy footprint (Re: π-WAM is not adding decimals, it is removing decimals) Mild Shock <janburse@fastmail.fm> - 2026-07-27 18:45 +0200
      Potato Computer owner impressed by Ukraine Tech [Rossy Boys Brother?] (Was: Hurry the blue bus doesnt stop indefinitely) Mild Shock <janburse@fastmail.fm> - 2026-07-27 16:56 +0200
        Rossy Boy is neither Einstein nor Zweistein (Was: Potato Computer owner impressed by Ukraine Tech) Mild Shock <janburse@fastmail.fm> - 2026-07-27 18:25 +0200
          You are still chewing on SIMD. LoL (Re: Rossy Boy is neither Einstein nor Zweistein) Mild Shock <janburse@fastmail.fm> - 2026-07-29 17:12 +0200
            Hurry Rossy Boy, the blue bus is waiting (Re: You are still chewing on SIMD. LoL) Mild Shock <janburse@fastmail.fm> - 2026-07-29 17:53 +0200
              Look how they advertized CUDA and logical threads (Re: Hurry Rossy Boy, the blue bus is waiting) Mild Shock <janburse@fastmail.fm> - 2026-07-29 17:55 +0200
                Forget any arithmetization of product FSA (Re: Look how they advertized CUDA and logical threads) Mild Shock <janburse@fastmail.fm> - 2026-07-29 17:58 +0200
            Rossy Boys tears could cool a data center [pi-WAM Interleaved Synchronized Emulator] (Re: You are still chewing on SIMD. LoL) Mild Shock <janburse@fastmail.fm> - 2026-07-29 20:06 +0200
              I don't use Rust, you are crazy [Jump off a bridge, idiot] (Re: Rossy Boys tears could cool a data center [pi-WAM Interleaved Synchronized Emulator]) Mild Shock <janburse@fastmail.fm> - 2026-07-29 20:25 +0200
                Hack ecosystem ignorance paired with paranoia [Nand to Tetris] (Re: I don't use Rust, you are crazy) Mild Shock <janburse@fastmail.fm> - 2026-07-29 22:52 +0200
                  A funny Q16.16 experiment with Hack (Re: Hack ecosystem ignorance paired with paranoia [Nand to Tetris]) Mild Shock <janburse@fastmail.fm> - 2026-07-29 23:11 +0200
                    Summer Challenge: libSQL = Prolog+Modes [VDBE versus π-WAM] (Was: A funny Q16.16 experiment with Hack) Mild Shock <janburse@fastmail.fm> - 2026-07-30 11:25 +0200
                  I wrote Hack VM for π-WAM from scratch [4 Months total JavaScript, Python and Java] (Re: Hack ecosystem ignorance paired with paranoia) Mild Shock <janburse@fastmail.fm> - 2026-07-30 19:37 +0200
                    For WebGPU I first had SIMD in mind (Re: I wrote Hack VM for π-WAM from scratch) Mild Shock <janburse@fastmail.fm> - 2026-07-30 19:51 +0200
                      Corr.: 4 Months --> 4 Weeks (Re: For WebGPU I first had SIMD in mind) Mild Shock <janburse@fastmail.fm> - 2026-07-30 20:05 +0200
                    MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch) Mild Shock <janburse@fastmail.fm> - 2026-07-30 22:32 +0200
                      Not declarative with PHI (Φ) nodes (Was: MIPS is a big Huffman mess [But Hack could do it]) Mild Shock <janburse@fastmail.fm> - 2026-07-30 22:38 +0200
                      Not declarative with PHI (Φ) nodes (Re: MIPS is a big Huffman mess [But Hack could do it]) Mild Shock <janburse@fastmail.fm> - 2026-07-30 22:39 +0200
                      Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch) Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-07-31 09:52 -0700
                        Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch) Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-07-31 10:00 -0700
                          Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch) Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-07-31 10:07 -0700
                    Quo Vadis: Extend investigations to WebNN (Was: I wrote Hack VM for π-WAM from scratch [4 Months total JavaScript, Python and Java]) Mild Shock <janburse@fastmail.fm> - 2026-07-31 20:43 +0200
    Got it. Or are you too stupid? [New Usenet Mantra] (Was: The Wuhan Virus that destroyed Python [ggml Manifesto]) Mild Shock <janburse@fastmail.fm> - 2026-07-27 18:59 +0200
    Lamas in a cradle and Lamas on the edge [Red Pyjama] (Re: The Wuhan Virus that destroyed Python [ggml Manifesto]) Mild Shock <janburse@fastmail.fm> - 2026-07-29 13:03 +0200
      AI Accelerators and ISO Prolog multi-threading (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama]) Mild Shock <janburse@fastmail.fm> - 2026-07-29 17:02 +0200
        Actor/Erlang is dead, no Thread and Mailbox conflation [golang channels] (Re: AI Accelerators and ISO Prolog multi-threading) (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama]) Mild Shock <janburse@fastmail.fm> - 2026-07-29 17:04 +0200
          Can library(ironpaw) repurpose FFT hardware [Glimps into Ryzen AI 7 350] (Re: Actor/Erlang is dead, no Thread and Mailbox conflation ) Mild Shock <janburse@fastmail.fm> - 2026-08-01 02:32 +0200
      Tablet and phone UBS-C remote debugging (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama]) Mild Shock <janburse@fastmail.fm> - 2026-08-01 12:19 +0200
        NPUs doing 2d chess comms (Manhattan Distance or L1 Norm) (Re: Tablet and phone UBS-C remote debugging) Mild Shock <janburse@fastmail.fm> - 2026-08-01 14:12 +0200
          NACK retransmission might double Manhattan Distance (Re: NPUs doing 2d chess comms) Mild Shock <janburse@fastmail.fm> - 2026-08-01 14:24 +0200
            I am using WebGPU, and not WebGL (Re: NACK retransmission might double Manhattan Distance) Mild Shock <janburse@fastmail.fm> - 2026-08-02 00:47 +0200
              Texture inside my compute shader makes no sense (Re: I am using WebGPU, and not WebGL) Mild Shock <janburse@fastmail.fm> - 2026-08-02 02:40 +0200
                Prolog inferencing and not canvasing fancy stuff (Re: Texture inside my compute shader makes no sense) Mild Shock <janburse@fastmail.fm> - 2026-08-02 02:42 +0200
        Re: Tablet and phone UBS-C remote debugging (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama]) Taskfreak <taskfreak@gmail.com> - 2026-08-01 13:58 -0500
          Chris M. Thomasson can ask 100 more questions (Was: Tablet and phone UBS-C remote debugging) Mild Shock <janburse@fastmail.fm> - 2026-08-02 02:46 +0200
            npm install webgpu [Google Dawn] (Re: Chris M. Thomasson can ask 100 more questions) Mild Shock <janburse@fastmail.fm> - 2026-08-02 03:03 +0200
              GPU elasticity was already invented in 2008 with CUDA (Re: npm install webgpu [Google Dawn]) Mild Shock <janburse@fastmail.fm> - 2026-08-03 00:01 +0200
    Even send_color and recv_color can block [Cerebras Waver] (Re: The Wuhan Virus that destroyed Python [ggml Manifesto]) Mild Shock <janburse@fastmail.fm> - 2026-08-02 23:39 +0200

Page 4 of 5 — ← Prev page 1 2 3 [4] 5 Next page →

#896530 — Not declarative with PHI (Φ) nodes (Re: MIPS is a big Huffman mess [But Hack could do it])

From	Mild Shock <janburse@fastmail.fm>
Date	2026-07-30 22:39 +0200
Subject	Not declarative with PHI (Φ) nodes (Re: MIPS is a big Huffman mess [But Hack could do it])
Message-ID	<114gcqk$mn2q$2@solani.org>
In reply to	#896528

Hi,

Another choice for naming Hack, would be
to call it an intermediate format. But
this is typically used here:

The intermediate representation, or
IR for short, is an in-memory data
structure that represents executable code.
https://www.llvmpy.org/llvmpy-doc/dev/doc/llvm_concepts.html#ssa-form-and-phi-nodes

So I still like the term abstract machine,
as already used in the past by  David H. D. Warren
for the famous, and in my opinion infamous:

Warren Abstract Machine 1983
https://en.wikipedia.org/wiki/Warren_Abstract_Machine

Maybe you can take the term abstract machine
as a hint that it is more lower level, and
more imperative. Not something highlevel, that

is easily malleable. But abstract also captures
the notion that there is still a level further
down, making it concrete. And you find

many Prolog systems that did just that, they
compile WAM into a further instruction stream,
like x86 or whatever, for binary compiled code,

that is not interpreted WAM.

Bye

Mild Shock schrieb:
 > Hi,
 >
 > There is Prolog compiler which spits out Hack.
 >  From there on your are free to develop
 > and/or use any Hack realization that goes
 >
 > from abstract to concrete. You could
 > replace the CPU backends that realize
 > a Hack VM by MIPS. Shouldn't be difficult.
 >
 > Basically I refused to think in Huffman
 > Coding (*) while designing Hack VM. On the
 > other hand the MIPS architecture looks
 >
 > like a big Huffman mess. Already its
 > initial design has 3 instructions types:
 >
 > Type format (bits)
 > R opcode(6) rs(5) rt(5) rd(5) shamt(5) funct(6)
 > I opcode(6) rs(5) rt(5) imme(16)
 > J opcode(6) addr(26)
 >
 > While my Hack has only 1 instruction
 > type, when binary encoded for Hack VM,
 > the currently used design looks as follows:
 >
 > Type format (bits)
 > AD opcode(4) mode(4) cond(4) imme(10) addr(10)
 >
 > But since its an abstract machine, nothing
 > prevents you from translating Hack code
 > into MIPS before executing it.
 >
 > In has far you have to distinguish Hack,
 > which is specified in Prolog. And Hack VM
 > which is a virtual machine, with the above
 >
 > instruction packing. And which has currently
 > a JavaScript runtime, a Python runtime
 > and a Java runtime.
 >
 > Bye
 >
 > (*)
 > https://en.wikipedia.org/wiki/Huffman_coding
 >

[toc] | [prev] | [next] | [standalone]

#896535 — Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch)

From	Ross Finlayson <ross.a.finlayson@gmail.com>
Date	2026-07-31 09:52 -0700
Subject	Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch)
Message-ID	<wIednWeVM6MqT_H3nZ2dnZfqn_SdnZ2d@giganews.com>
In reply to	#896528

On 07/30/2026 01:32 PM, Mild Shock wrote:
> Hi,
>
> There is Prolog compiler which spits out Hack.
>  From there on your are free to develop
> and/or use any Hack realization that goes
>
> from abstract to concrete. You could
> replace the CPU backends that realize
> a Hack VM by MIPS. Shouldn't be difficult.
>
> Basically I refused to think in Huffman
> Coding (*) while designing Hack VM. On the
> other hand the MIPS architecture looks
>
> like a big Huffman mess. Already its
> initial design has 3 instructions types:
>
> Type format (bits)
> R opcode(6) rs(5) rt(5) rd(5) shamt(5) funct(6)
> I opcode(6) rs(5) rt(5) imme(16)
> J opcode(6) addr(26)
>
> While my Hack has only 1 instruction
> type, when binary encoded for Hack VM,
> the currently used design looks as follows:
>
> Type format (bits)
> AD opcode(4) mode(4) cond(4) imme(10) addr(10)
>
> But since its an abstract machine, nothing
> prevents you from translating Hack code
> into MIPS before executing it.
>
> In has far you have to distinguish Hack,
> which is specified in Prolog. And Hack VM
> which is a virtual machine, with the above
>
> instruction packing. And which has currently
> a JavaScript runtime, a Python runtime
> and a Java runtime.
>
> Bye
>
> (*)
> https://en.wikipedia.org/wiki/Huffman_coding
>
> Mild Shock schrieb:
>> Hi,
>>
>>  > Just downloading some other person's code
>>
>> I didn't do that, I wrote Hack VM for pi-WAM
>> from scratch, over the last 4 weeks. I came
>> back from holidays on end of June 2026, and now
>>
>> we have end of July 2026. But its only possible
>> because the instruction set is very smal, like
>> ca. 8 functions and ca. 8 modes and ca. 8 conditions,
>>
>> so its ca. 8 x 8 x 8 = 512 opcodes, each has an
>> A parameter and a D parameter simultaneously.
>> It has currently the following CPU backends:
>>
>>   - Now supports interleaved synchronous emulation.
>>   - Now supports warp parallelism via Java platform threads.
>>   - Now supports warp parallelism via Python system threads.
>>   - Now supports warp parallelism via JavaScript worker threads.
>>   - Note: For Python free threads are not yet fully tested.
>>   - Note: For JavaScript web workers are not yet fully tested.
>>
>> https://www.dogelog.ch/typtab/doclet/book/14_install/05_notes22/110_224.html
>>
>>
>> But frankly I came to encounter Hack not from
>> the usual university curriculum web resources,
>> but indirectly through a post about a Prolog
>>
>> emulation of Hack, using constrained horn clauses (CHC):
>>
>> Verifying Nand2Tetris Assembly
>> https://www.philipzucker.com/nand2tetris-chc/
>>
>> The binary encoding is currently that the functions,
>> modes and conditions eat up a nibble (4-bit), in
>> total 12-bit, which I use then 10-bit for A parameter
>>
>> and 10-bit for D parameter. I used AI freemium, Codex
>> by ChatGPT from within IntelliJ to do some fragment
>> code translations automatically from Java to JavaScript
>>
>> or from JavaScript to Python.
>>
>> Have Fun!
>>
>> Bye
>>
>> Mild Shock schrieb:
>>> Hi,
>>>
>>>  > Who exactly is the thief? Does this person
>>>  > have stats in the Rogue class in dungeons
>>>  > and dragons?
>>>
>>> The conspiracy theory of a stealing of Torso VDBE,
>>> by Rossy Boy, is probably a result of complete
>>> ignorance of the Hack ecosystem.
>>>
>>> Hack is a very popular computer science project,
>>> with a couple of subprojects in hardware and
>>> software. It goes also by the name Nand to Tetris,
>>>
>>> and is programming language agnositic. You can do
>>> Hack experiments in any programming language, be
>>> it BASIC, ADA or Rust. Nobody cares.
>>>
>>> The gist are projects like here, first to
>>> educate yourself about Hack:
>>>
>>> https://www.nand2tetris.org/course
>>>
>>> And then to use Hack in different contexts:
>>>
>>> https://www.nand2tetris.org/copy-of-talks
>>>
>>> For didactic purposes, I used Hack for my WebGPU
>>> experiment. I didn't even take a look at Torso
>>> VDBE, why should I? Hack is nicely documented,
>>>
>>> has even a book, and fusing the two 16-bit
>>> instruction types A and D, into a single 32-bit
>>> instruction stream, is nowhere patented.
>>>
>>> Bye
>>>
>>> Mild Shock schrieb:
>>>> Hi,
>>>>
>>>> I don't use Rust, you are crazy. First of
>>>> all the parallel simulator is 100% written
>>>> in Prolog, should also run in ISO Prolog,
>>>>
>>>> enhanced by a library(lists). Second I only
>>>> mentioned that WebGPU / WGSL, the language
>>>> there has a Rust inspired language.
>>>>
>>>> Its not Rust. Whats wrong with you? Why do
>>>> you adress your weariness of life to me.
>>>> I am neither thief, nor can I help you
>>>>
>>>> with your frustration, and histeric outbursts.
>>>> Maybe just be a man and jump off a bridge, idiot.
>>>> Or tame your frustration, usenet is not for
>>>>
>>>> you alone, your stupid asshole.
>>>>
>>>> Bye
>>>>
>>>> Ross Finlayson schrieb:
>>>>  >
>>>> https://www.theregister.com/databases/2026/07/29/after-rewriting-sqlite-in-rust-turso-turns-its-sights-on-postgres/5279835
>>>>
>>>>  > I don't much care about Rust.
>>>>  >
>>>>  > .. gibberish ..
>>>>  >
>>>>  > Thief.
>>>>
>>>> Mild Shock schrieb:
>>>>> Hi,
>>>>>
>>>>> Rossy Boys tears could cool a data center,
>>>>> he thinks there exists no literature about
>>>>> serial algorithms of parallel stuff, and
>>>>>
>>>>> he also thinks normal forms lead to optimizing
>>>>> something. LoL, what a utter bullshit. I did
>>>>> alreay a serial implementation of a parallel
>>>>>
>>>>> simulation of my pi-WAM. Just lookup the literature
>>>>> about pi-calulus. I published it a few days ago,
>>>>> its part of 2.2.4 released already:
>>>>>
>>>>> Parallel π-WAM: An Interleaved Synchronous Emulator
>>>>> https://medium.com/2989/0196089e143a
>>>>>
>>>>> Whats your point, Rossy Boy? Except you post pretend
>>>>> nonsense not knowing what you are doing?
>>>>>
>>>>> Bye
>>>>>
>>>>> Ross Finlayson schrieb:
>>>>>  > No, troll, these are serial algorithms their optimized forms.
>>>>>  >
>>>>>  > Normal sorts of forms, ....
>>>>>  >
>>>>>  >
>>>>>  > Yeah, everybody already figured out "interpreters" and
>>>>>  > "programs" and "spawning".
>>>>>  >
>>>>>  > Go spawn yourself.
>>>>>  >
>>>>>
>>>>>
>>>>> Mild Shock schrieb:
>>>>>> Hi,
>>>>>>
>>>>>> You are still chewing on SIMD. LoL
>>>>>>
>>>>>> Ross Finlayson schrieb:
>>>>>>  > Then the idea is that any of those can be found and matched in
>>>>>>  > one "run", i.e. a stall-less, branch-less, call-less list of
>>>>>> less than
>>>>>>  > a few or less than a few dozens or less than a few hundreds
>>>>>>  > instructions, the results "findings" in data and corresponding
>>>>>>  > "matchings" of expressions, that runs in less than one
>>>>>> microsecond.
>>>>>>
>>>>>> You cannot make the mental translation that if you have:
>>>>>>
>>>>>> Ross Finlayson schrieb:
>>>>>>  > So, the context then is for register state and stack contents,
>>>>>> that
>>>>>>  > the indicators of the above as "positive presence" then is to make
>>>>>>  > for that the adjustments to the offsets and extents and the shifts
>>>>>>  > is according to those, otherwise no-ops. Then the idea is that a
>>>>>>
>>>>>> As independent logical thread state, that automatically MIMD follows?
>>>>>>
>>>>>> Whats the problem to solve then?
>>>>>>
>>>>>> Bye
>>>>>>
>>>>>> Mild Shock schrieb:
>>>>>>> Hi,
>>>>>>>
>>>>>>> Rossy Boy is neither Einstein nor Zweistein.
>>>>>>> He is not Einstein since Einstein is already dead:
>>>>>>>
>>>>>>> Albert Einstein (1879 - 1955)
>>>>>>> https://de.wikipedia.org/wiki/Albert_Einstein
>>>>>>>
>>>>>>> He is also not Zweistein, since he doesn't
>>>>>>> understand concepts such as:
>>>>>>>
>>>>>>> - NVIDIA Volta ff. architecture
>>>>>>>
>>>>>>> Also his hands are small, and his breath stinks,
>>>>>>> and he lives in the basement of his mother.
>>>>>>>
>>>>>>> Bye
>>>>>>>
>>>>>>> Mild Shock schrieb:
>>>>>>>> Hi,
>>>>>>>>
>>>>>>>> Slowly I start understanding numbnuts like
>>>>>>>> Rossy Boy who don't understand tech, although
>>>>>>>> they are from UK and not from a 3rd world
>>>>>>>>
>>>>>>>> country, and also I start understanding morons
>>>>>>>> like Micro Penis, who are behind a curtain,
>>>>>>>> and cannot access a lot of tech.
>>>>>>>>
>>>>>>>> The same holds for SWI Prologs newest campaign
>>>>>>>> that probably adresses some poor indians that
>>>>>>>> have neither 5G nor Macs:
>>>>>>>>
>>>>>>>> 1:38:01 The Kyiv keynote disaster
>>>>>>>> https://www.youtube.com/watch?v=U8goS6B3BbI
>>>>>>>>
>>>>>>>> Woa! Real time download of Scala, Closure,
>>>>>>>> etc.. Whats the magic behind that? Some SWI
>>>>>>>> point of sale, downloading it via its
>>>>>>>>
>>>>>>>> keyboard and some telephathy module ?
>>>>>>>>
>>>>>>>> Bye
>>>>>>>>
>>>>>>>> Mild Shock schrieb:
>>>>>>>>> Hi,
>>>>>>>>>
>>>>>>>>> Ride the snake
>>>>>>>>> He's old and his skin is cold
>>>>>>>>> The west is the best
>>>>>>>>> The west is the best
>>>>>>>>> Get here and we'll do the rest
>>>>>>>>> The blue bus is calling us
>>>>>>>>> The blue bus is calling us
>>>>>>>>> Driver, where you taking us?
>>>>>>>>>
>>>>>>>>> Apocalypse Now intro: The Doors, The End {1979}
>>>>>>>>> https://www.youtube.com/watch?v=CIrvSJwwJUE
>>>>>>>>>
>>>>>>>>> Bye
>>>>>>>>>
>>>>>>>>>  > Hi,
>>>>>>>>>  >
>>>>>>>>>  > Again I posted everything here:
>>>>>>>>>  >
>>>>>>>>>  >> 11.4 Giga Lips with a Budget Laptop
>>>>>>>>>  >> https://github.com/Jean-Luc-Picard-2021/gigabudget
>>>>>>>>>  >
>>>>>>>>>  > The repo says, same time when I posted
>>>>>>>>>  > the link first time:
>>>>>>>>>  >
>>>>>>>>>  >> This repository was archived by the
>>>>>>>>>  >> owner on Jul 9, 2026. It is now read-only.
>>>>>>>>>  >
>>>>>>>>>  > Now a USENET user, who had already entitled
>>>>>>>>>  > himself for a couple of irrational accusations
>>>>>>>>>  >
>>>>>>>>>  > towards my side, is asking this question:
>>>>>>>>>  >
>>>>>>>>>  > Chris M. Thomasson schrieb, Jul 24, 2026
>>>>>>>>>  >> Show an outline of what you
>>>>>>>>>  >> need you compute shader to do?
>>>>>>>>>  >
>>>>>>>>>  > Bravo, thats a delay of a wooping 15 days.
>>>>>>>>>  >
>>>>>>>>>  > Bye
>>>>>>>>>
>>>>>>>>> Mild Shock schrieb:
>>>>>>>>>> Hi,
>>>>>>>>>>
>>>>>>>>>> Remember when first all local AI was Python
>>>>>>>>>> and PyTorch APIs. And then suddently people started
>>>>>>>>>> using bare metal C/C++ Code. Here is the story:
>>>>>>>>>>
>>>>>>>>>> How it started:
>>>>>>>>>>
>>>>>>>>>> GPT-J or GPT-J-6B is an open-source large
>>>>>>>>>> language model (LLM) developed by EleutherAI
>>>>>>>>>> in 2021. As the name suggests, it is a
>>>>>>>>>> generative pre-trained transformer model
>>>>>>>>>> designed to produce human-like text that
>>>>>>>>>> continues from a prompt.
>>>>>>>>>> https://www.eleuther.ai/
>>>>>>>>>>
>>>>>>>>>> How it was going [Georgi Gerganov]:
>>>>>>>>>>
>>>>>>>>>> So a few days later comes out the LLaMA, I do
>>>>>>>>>> some calculations and I figure out “Okay, 65
>>>>>>>>>> billion parameters. You probably need about
>>>>>>>>>> 40 gigs of RAM, with 4-bit quantization. So
>>>>>>>>>> this can run on a MacBook. Why not do it?”
>>>>>>>>>>
>>>>>>>>>> Why I was able to do it so quickly - basically,
>>>>>>>>>> for all that I saw it’s pretty much GPT-J architecture
>>>>>>>>>> with some modifications, like some extra memorization
>>>>>>>>>> layers. It’s minor changes. Basically, again, the
>>>>>>>>>> existing code for the GPT-J, I just simply
>>>>>>>>>> modified it there, it happened pretty quickly.
>>>>>>>>>> https://changelog.com/podcast/532
>>>>>>>>>>
>>>>>>>>>> Georgi Gerganov, Bulgarian, now with Hugging
>>>>>>>>>> Face, ggml-cann also running on Chinese AI chips.
>>>>>>>>>> ggml Manifesto https://github.com/ggml-org/ggml
>>>>>>>>>>
>>>>>>>>>> Bye
>>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>
>>>>>
>>>>
>>>
>>
>


Huffman was a bright lad who it's said came up with Huffman
coding to get past taking a final arduous exam.

One of my grandfather's name is Huffman, he graduated high-school,
somewhere's a picture of him with his high-school graduating
class, in Cleveland, Ohio, more than a hundred years ago.

Three people graduated high-school that year.

Huffman codes are a fantastic thing and ubiquitous, though,
like any other algorithm & data structure, they depend on
the distribution their best/average/worst cases, since everybody
here knows the general outline of asymptotics and Big O, Little o,
and Theta, about time and space and complexity.


Then, "adaptive algorithms" and "adapative data structures",
start with something like "compression" in usual accounts,
which usually is adaptive in the sense of compressing what's
compressible in a window, and making a histogram of the words
in the alphabet interpreted as a sequence of letters, and making
an optimal sort of Huffman-coding for entropy-coding for that,
since Huffman-coding is naturally optimal for a particular distribution,
that like power laws can be found in anything,
that one starts with making histograms after combinatorial enumeration,
and thus resulting an encoding into a language of bit-sequences
with the prefix-property that un-ambiguously makes for compressing
the compressible data.

Then the "adaptive" part of that is
periodically throwing that away and starting another.
One might aver that a more contextually-advised account
studies the entire corpus, for things like CCITT G4, JPEG,
JBIG, Deflate, and any account of entropy-coding or compression,
or Morse code, with of course both Huffman-coding and arithmetic-coding,
since while Huffman-coding is obvious to everybody,
for a while some people thought arithmetic coding had patents,
which now are gone away, leaving all the above mentioned
and MPEG-4 also the "un-encumbered".

The notion of "summary statistics" and "order statistics" though,
in concrete mathematics of course is simple and clear.


Here's an article I read the other day about Huffman-coding,
I found it very insightful and quite enjoyable.

https://fgiesen.wordpress.com/2026/06/21/pivco-huffman-merge-operations/




Shut Up

[toc] | [prev] | [next] | [standalone]

#896536 — Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch)

From	Ross Finlayson <ross.a.finlayson@gmail.com>
Date	2026-07-31 10:00 -0700
Subject	Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch)
Message-ID	<Fuqdna21lJQwSfH3nZ2dnZfqn_hh4p2d@giganews.com>
In reply to	#896535

On 07/31/2026 09:52 AM, Ross Finlayson wrote:
> On 07/30/2026 01:32 PM, Mild Shock wrote:
>> Hi,
>>
>> There is Prolog compiler which spits out Hack.
>>  From there on your are free to develop
>> and/or use any Hack realization that goes
>>
>> from abstract to concrete. You could
>> replace the CPU backends that realize
>> a Hack VM by MIPS. Shouldn't be difficult.
>>
>> Basically I refused to think in Huffman
>> Coding (*) while designing Hack VM. On the
>> other hand the MIPS architecture looks
>>
>> like a big Huffman mess. Already its
>> initial design has 3 instructions types:
>>
>> Type format (bits)
>> R opcode(6) rs(5) rt(5) rd(5) shamt(5) funct(6)
>> I opcode(6) rs(5) rt(5) imme(16)
>> J opcode(6) addr(26)
>>
>> While my Hack has only 1 instruction
>> type, when binary encoded for Hack VM,
>> the currently used design looks as follows:
>>
>> Type format (bits)
>> AD opcode(4) mode(4) cond(4) imme(10) addr(10)
>>
>> But since its an abstract machine, nothing
>> prevents you from translating Hack code
>> into MIPS before executing it.
>>
>> In has far you have to distinguish Hack,
>> which is specified in Prolog. And Hack VM
>> which is a virtual machine, with the above
>>
>> instruction packing. And which has currently
>> a JavaScript runtime, a Python runtime
>> and a Java runtime.
>>
>> Bye
>>
>> (*)
>> https://en.wikipedia.org/wiki/Huffman_coding
>>
>> Mild Shock schrieb:
>>> Hi,
>>>
>>>  > Just downloading some other person's code
>>>
>>> I didn't do that, I wrote Hack VM for pi-WAM
>>> from scratch, over the last 4 weeks. I came
>>> back from holidays on end of June 2026, and now
>>>
>>> we have end of July 2026. But its only possible
>>> because the instruction set is very smal, like
>>> ca. 8 functions and ca. 8 modes and ca. 8 conditions,
>>>
>>> so its ca. 8 x 8 x 8 = 512 opcodes, each has an
>>> A parameter and a D parameter simultaneously.
>>> It has currently the following CPU backends:
>>>
>>>   - Now supports interleaved synchronous emulation.
>>>   - Now supports warp parallelism via Java platform threads.
>>>   - Now supports warp parallelism via Python system threads.
>>>   - Now supports warp parallelism via JavaScript worker threads.
>>>   - Note: For Python free threads are not yet fully tested.
>>>   - Note: For JavaScript web workers are not yet fully tested.
>>>
>>> https://www.dogelog.ch/typtab/doclet/book/14_install/05_notes22/110_224.html
>>>
>>>
>>>
>>> But frankly I came to encounter Hack not from
>>> the usual university curriculum web resources,
>>> but indirectly through a post about a Prolog
>>>
>>> emulation of Hack, using constrained horn clauses (CHC):
>>>
>>> Verifying Nand2Tetris Assembly
>>> https://www.philipzucker.com/nand2tetris-chc/
>>>
>>> The binary encoding is currently that the functions,
>>> modes and conditions eat up a nibble (4-bit), in
>>> total 12-bit, which I use then 10-bit for A parameter
>>>
>>> and 10-bit for D parameter. I used AI freemium, Codex
>>> by ChatGPT from within IntelliJ to do some fragment
>>> code translations automatically from Java to JavaScript
>>>
>>> or from JavaScript to Python.
>>>
>>> Have Fun!
>>>
>>> Bye
>>>
>>> Mild Shock schrieb:
>>>> Hi,
>>>>
>>>>  > Who exactly is the thief? Does this person
>>>>  > have stats in the Rogue class in dungeons
>>>>  > and dragons?
>>>>
>>>> The conspiracy theory of a stealing of Torso VDBE,
>>>> by Rossy Boy, is probably a result of complete
>>>> ignorance of the Hack ecosystem.
>>>>
>>>> Hack is a very popular computer science project,
>>>> with a couple of subprojects in hardware and
>>>> software. It goes also by the name Nand to Tetris,
>>>>
>>>> and is programming language agnositic. You can do
>>>> Hack experiments in any programming language, be
>>>> it BASIC, ADA or Rust. Nobody cares.
>>>>
>>>> The gist are projects like here, first to
>>>> educate yourself about Hack:
>>>>
>>>> https://www.nand2tetris.org/course
>>>>
>>>> And then to use Hack in different contexts:
>>>>
>>>> https://www.nand2tetris.org/copy-of-talks
>>>>
>>>> For didactic purposes, I used Hack for my WebGPU
>>>> experiment. I didn't even take a look at Torso
>>>> VDBE, why should I? Hack is nicely documented,
>>>>
>>>> has even a book, and fusing the two 16-bit
>>>> instruction types A and D, into a single 32-bit
>>>> instruction stream, is nowhere patented.
>>>>
>>>> Bye
>>>>
>>>> Mild Shock schrieb:
>>>>> Hi,
>>>>>
>>>>> I don't use Rust, you are crazy. First of
>>>>> all the parallel simulator is 100% written
>>>>> in Prolog, should also run in ISO Prolog,
>>>>>
>>>>> enhanced by a library(lists). Second I only
>>>>> mentioned that WebGPU / WGSL, the language
>>>>> there has a Rust inspired language.
>>>>>
>>>>> Its not Rust. Whats wrong with you? Why do
>>>>> you adress your weariness of life to me.
>>>>> I am neither thief, nor can I help you
>>>>>
>>>>> with your frustration, and histeric outbursts.
>>>>> Maybe just be a man and jump off a bridge, idiot.
>>>>> Or tame your frustration, usenet is not for
>>>>>
>>>>> you alone, your stupid asshole.
>>>>>
>>>>> Bye
>>>>>
>>>>> Ross Finlayson schrieb:
>>>>>  >
>>>>> https://www.theregister.com/databases/2026/07/29/after-rewriting-sqlite-in-rust-turso-turns-its-sights-on-postgres/5279835
>>>>>
>>>>>
>>>>>  > I don't much care about Rust.
>>>>>  >
>>>>>  > .. gibberish ..
>>>>>  >
>>>>>  > Thief.
>>>>>
>>>>> Mild Shock schrieb:
>>>>>> Hi,
>>>>>>
>>>>>> Rossy Boys tears could cool a data center,
>>>>>> he thinks there exists no literature about
>>>>>> serial algorithms of parallel stuff, and
>>>>>>
>>>>>> he also thinks normal forms lead to optimizing
>>>>>> something. LoL, what a utter bullshit. I did
>>>>>> alreay a serial implementation of a parallel
>>>>>>
>>>>>> simulation of my pi-WAM. Just lookup the literature
>>>>>> about pi-calulus. I published it a few days ago,
>>>>>> its part of 2.2.4 released already:
>>>>>>
>>>>>> Parallel π-WAM: An Interleaved Synchronous Emulator
>>>>>> https://medium.com/2989/0196089e143a
>>>>>>
>>>>>> Whats your point, Rossy Boy? Except you post pretend
>>>>>> nonsense not knowing what you are doing?
>>>>>>
>>>>>> Bye
>>>>>>
>>>>>> Ross Finlayson schrieb:
>>>>>>  > No, troll, these are serial algorithms their optimized forms.
>>>>>>  >
>>>>>>  > Normal sorts of forms, ....
>>>>>>  >
>>>>>>  >
>>>>>>  > Yeah, everybody already figured out "interpreters" and
>>>>>>  > "programs" and "spawning".
>>>>>>  >
>>>>>>  > Go spawn yourself.
>>>>>>  >
>>>>>>
>>>>>>
>>>>>> Mild Shock schrieb:
>>>>>>> Hi,
>>>>>>>
>>>>>>> You are still chewing on SIMD. LoL
>>>>>>>
>>>>>>> Ross Finlayson schrieb:
>>>>>>>  > Then the idea is that any of those can be found and matched in
>>>>>>>  > one "run", i.e. a stall-less, branch-less, call-less list of
>>>>>>> less than
>>>>>>>  > a few or less than a few dozens or less than a few hundreds
>>>>>>>  > instructions, the results "findings" in data and corresponding
>>>>>>>  > "matchings" of expressions, that runs in less than one
>>>>>>> microsecond.
>>>>>>>
>>>>>>> You cannot make the mental translation that if you have:
>>>>>>>
>>>>>>> Ross Finlayson schrieb:
>>>>>>>  > So, the context then is for register state and stack contents,
>>>>>>> that
>>>>>>>  > the indicators of the above as "positive presence" then is to
>>>>>>> make
>>>>>>>  > for that the adjustments to the offsets and extents and the
>>>>>>> shifts
>>>>>>>  > is according to those, otherwise no-ops. Then the idea is that a
>>>>>>>
>>>>>>> As independent logical thread state, that automatically MIMD
>>>>>>> follows?
>>>>>>>
>>>>>>> Whats the problem to solve then?
>>>>>>>
>>>>>>> Bye
>>>>>>>
>>>>>>> Mild Shock schrieb:
>>>>>>>> Hi,
>>>>>>>>
>>>>>>>> Rossy Boy is neither Einstein nor Zweistein.
>>>>>>>> He is not Einstein since Einstein is already dead:
>>>>>>>>
>>>>>>>> Albert Einstein (1879 - 1955)
>>>>>>>> https://de.wikipedia.org/wiki/Albert_Einstein
>>>>>>>>
>>>>>>>> He is also not Zweistein, since he doesn't
>>>>>>>> understand concepts such as:
>>>>>>>>
>>>>>>>> - NVIDIA Volta ff. architecture
>>>>>>>>
>>>>>>>> Also his hands are small, and his breath stinks,
>>>>>>>> and he lives in the basement of his mother.
>>>>>>>>
>>>>>>>> Bye
>>>>>>>>
>>>>>>>> Mild Shock schrieb:
>>>>>>>>> Hi,
>>>>>>>>>
>>>>>>>>> Slowly I start understanding numbnuts like
>>>>>>>>> Rossy Boy who don't understand tech, although
>>>>>>>>> they are from UK and not from a 3rd world
>>>>>>>>>
>>>>>>>>> country, and also I start understanding morons
>>>>>>>>> like Micro Penis, who are behind a curtain,
>>>>>>>>> and cannot access a lot of tech.
>>>>>>>>>
>>>>>>>>> The same holds for SWI Prologs newest campaign
>>>>>>>>> that probably adresses some poor indians that
>>>>>>>>> have neither 5G nor Macs:
>>>>>>>>>
>>>>>>>>> 1:38:01 The Kyiv keynote disaster
>>>>>>>>> https://www.youtube.com/watch?v=U8goS6B3BbI
>>>>>>>>>
>>>>>>>>> Woa! Real time download of Scala, Closure,
>>>>>>>>> etc.. Whats the magic behind that? Some SWI
>>>>>>>>> point of sale, downloading it via its
>>>>>>>>>
>>>>>>>>> keyboard and some telephathy module ?
>>>>>>>>>
>>>>>>>>> Bye
>>>>>>>>>
>>>>>>>>> Mild Shock schrieb:
>>>>>>>>>> Hi,
>>>>>>>>>>
>>>>>>>>>> Ride the snake
>>>>>>>>>> He's old and his skin is cold
>>>>>>>>>> The west is the best
>>>>>>>>>> The west is the best
>>>>>>>>>> Get here and we'll do the rest
>>>>>>>>>> The blue bus is calling us
>>>>>>>>>> The blue bus is calling us
>>>>>>>>>> Driver, where you taking us?
>>>>>>>>>>
>>>>>>>>>> Apocalypse Now intro: The Doors, The End {1979}
>>>>>>>>>> https://www.youtube.com/watch?v=CIrvSJwwJUE
>>>>>>>>>>
>>>>>>>>>> Bye
>>>>>>>>>>
>>>>>>>>>>  > Hi,
>>>>>>>>>>  >
>>>>>>>>>>  > Again I posted everything here:
>>>>>>>>>>  >
>>>>>>>>>>  >> 11.4 Giga Lips with a Budget Laptop
>>>>>>>>>>  >> https://github.com/Jean-Luc-Picard-2021/gigabudget
>>>>>>>>>>  >
>>>>>>>>>>  > The repo says, same time when I posted
>>>>>>>>>>  > the link first time:
>>>>>>>>>>  >
>>>>>>>>>>  >> This repository was archived by the
>>>>>>>>>>  >> owner on Jul 9, 2026. It is now read-only.
>>>>>>>>>>  >
>>>>>>>>>>  > Now a USENET user, who had already entitled
>>>>>>>>>>  > himself for a couple of irrational accusations
>>>>>>>>>>  >
>>>>>>>>>>  > towards my side, is asking this question:
>>>>>>>>>>  >
>>>>>>>>>>  > Chris M. Thomasson schrieb, Jul 24, 2026
>>>>>>>>>>  >> Show an outline of what you
>>>>>>>>>>  >> need you compute shader to do?
>>>>>>>>>>  >
>>>>>>>>>>  > Bravo, thats a delay of a wooping 15 days.
>>>>>>>>>>  >
>>>>>>>>>>  > Bye
>>>>>>>>>>
>>>>>>>>>> Mild Shock schrieb:
>>>>>>>>>>> Hi,
>>>>>>>>>>>
>>>>>>>>>>> Remember when first all local AI was Python
>>>>>>>>>>> and PyTorch APIs. And then suddently people started
>>>>>>>>>>> using bare metal C/C++ Code. Here is the story:
>>>>>>>>>>>
>>>>>>>>>>> How it started:
>>>>>>>>>>>
>>>>>>>>>>> GPT-J or GPT-J-6B is an open-source large
>>>>>>>>>>> language model (LLM) developed by EleutherAI
>>>>>>>>>>> in 2021. As the name suggests, it is a
>>>>>>>>>>> generative pre-trained transformer model
>>>>>>>>>>> designed to produce human-like text that
>>>>>>>>>>> continues from a prompt.
>>>>>>>>>>> https://www.eleuther.ai/
>>>>>>>>>>>
>>>>>>>>>>> How it was going [Georgi Gerganov]:
>>>>>>>>>>>
>>>>>>>>>>> So a few days later comes out the LLaMA, I do
>>>>>>>>>>> some calculations and I figure out “Okay, 65
>>>>>>>>>>> billion parameters. You probably need about
>>>>>>>>>>> 40 gigs of RAM, with 4-bit quantization. So
>>>>>>>>>>> this can run on a MacBook. Why not do it?”
>>>>>>>>>>>
>>>>>>>>>>> Why I was able to do it so quickly - basically,
>>>>>>>>>>> for all that I saw it’s pretty much GPT-J architecture
>>>>>>>>>>> with some modifications, like some extra memorization
>>>>>>>>>>> layers. It’s minor changes. Basically, again, the
>>>>>>>>>>> existing code for the GPT-J, I just simply
>>>>>>>>>>> modified it there, it happened pretty quickly.
>>>>>>>>>>> https://changelog.com/podcast/532
>>>>>>>>>>>
>>>>>>>>>>> Georgi Gerganov, Bulgarian, now with Hugging
>>>>>>>>>>> Face, ggml-cann also running on Chinese AI chips.
>>>>>>>>>>> ggml Manifesto https://github.com/ggml-org/ggml
>>>>>>>>>>>
>>>>>>>>>>> Bye
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>
>>>>>
>>>>
>>>
>>
>
>
> Huffman was a bright lad who it's said came up with Huffman
> coding to get past taking a final arduous exam.
>
> One of my grandfather's name is Huffman, he graduated high-school,
> somewhere's a picture of him with his high-school graduating
> class, in Cleveland, Ohio, more than a hundred years ago.
>
> Three people graduated high-school that year.
>
> Huffman codes are a fantastic thing and ubiquitous, though,
> like any other algorithm & data structure, they depend on
> the distribution their best/average/worst cases, since everybody
> here knows the general outline of asymptotics and Big O, Little o,
> and Theta, about time and space and complexity.
>
>
> Then, "adaptive algorithms" and "adapative data structures",
> start with something like "compression" in usual accounts,
> which usually is adaptive in the sense of compressing what's
> compressible in a window, and making a histogram of the words
> in the alphabet interpreted as a sequence of letters, and making
> an optimal sort of Huffman-coding for entropy-coding for that,
> since Huffman-coding is naturally optimal for a particular distribution,
> that like power laws can be found in anything,
> that one starts with making histograms after combinatorial enumeration,
> and thus resulting an encoding into a language of bit-sequences
> with the prefix-property that un-ambiguously makes for compressing
> the compressible data.
>
> Then the "adaptive" part of that is
> periodically throwing that away and starting another.
> One might aver that a more contextually-advised account
> studies the entire corpus, for things like CCITT G4, JPEG,
> JBIG, Deflate, and any account of entropy-coding or compression,
> or Morse code, with of course both Huffman-coding and arithmetic-coding,
> since while Huffman-coding is obvious to everybody,
> for a while some people thought arithmetic coding had patents,
> which now are gone away, leaving all the above mentioned
> and MPEG-4 also the "un-encumbered".
>
> The notion of "summary statistics" and "order statistics" though,
> in concrete mathematics of course is simple and clear.
>
>
> Here's an article I read the other day about Huffman-coding,
> I found it very insightful and quite enjoyable.
>
> https://fgiesen.wordpress.com/2026/06/21/pivco-huffman-merge-operations/
>
>
>
>
> Shut Up
>
>

"It easily scales both up and down
with the capabilities of the target machine."

  - https://fgiesen.wordpress.com/2026/06/21/pivco-huffman-merge-operations/

[toc] | [prev] | [next] | [standalone]

#896537 — Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch)

From	Ross Finlayson <ross.a.finlayson@gmail.com>
Date	2026-07-31 10:07 -0700
Subject	Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch)
Message-ID	<iKacnUe-AZQ3S_H3nZ2dnZfqn_adnZ2d@giganews.com>
In reply to	#896536

On 07/31/2026 10:00 AM, Ross Finlayson wrote:
> On 07/31/2026 09:52 AM, Ross Finlayson wrote:
>> On 07/30/2026 01:32 PM, Mild Shock wrote:
>>> Hi,
>>>
>>> There is Prolog compiler which spits out Hack.
>>>  From there on your are free to develop
>>> and/or use any Hack realization that goes
>>>
>>> from abstract to concrete. You could
>>> replace the CPU backends that realize
>>> a Hack VM by MIPS. Shouldn't be difficult.
>>>
>>> Basically I refused to think in Huffman
>>> Coding (*) while designing Hack VM. On the
>>> other hand the MIPS architecture looks
>>>
>>> like a big Huffman mess. Already its
>>> initial design has 3 instructions types:
>>>
>>> Type format (bits)
>>> R opcode(6) rs(5) rt(5) rd(5) shamt(5) funct(6)
>>> I opcode(6) rs(5) rt(5) imme(16)
>>> J opcode(6) addr(26)
>>>
>>> While my Hack has only 1 instruction
>>> type, when binary encoded for Hack VM,
>>> the currently used design looks as follows:
>>>
>>> Type format (bits)
>>> AD opcode(4) mode(4) cond(4) imme(10) addr(10)
>>>
>>> But since its an abstract machine, nothing
>>> prevents you from translating Hack code
>>> into MIPS before executing it.
>>>
>>> In has far you have to distinguish Hack,
>>> which is specified in Prolog. And Hack VM
>>> which is a virtual machine, with the above
>>>
>>> instruction packing. And which has currently
>>> a JavaScript runtime, a Python runtime
>>> and a Java runtime.
>>>
>>> Bye
>>>
>>> (*)
>>> https://en.wikipedia.org/wiki/Huffman_coding
>>>
>>> Mild Shock schrieb:
>>>> Hi,
>>>>
>>>>  > Just downloading some other person's code
>>>>
>>>> I didn't do that, I wrote Hack VM for pi-WAM
>>>> from scratch, over the last 4 weeks. I came
>>>> back from holidays on end of June 2026, and now
>>>>
>>>> we have end of July 2026. But its only possible
>>>> because the instruction set is very smal, like
>>>> ca. 8 functions and ca. 8 modes and ca. 8 conditions,
>>>>
>>>> so its ca. 8 x 8 x 8 = 512 opcodes, each has an
>>>> A parameter and a D parameter simultaneously.
>>>> It has currently the following CPU backends:
>>>>
>>>>   - Now supports interleaved synchronous emulation.
>>>>   - Now supports warp parallelism via Java platform threads.
>>>>   - Now supports warp parallelism via Python system threads.
>>>>   - Now supports warp parallelism via JavaScript worker threads.
>>>>   - Note: For Python free threads are not yet fully tested.
>>>>   - Note: For JavaScript web workers are not yet fully tested.
>>>>
>>>> https://www.dogelog.ch/typtab/doclet/book/14_install/05_notes22/110_224.html
>>>>
>>>>
>>>>
>>>>
>>>> But frankly I came to encounter Hack not from
>>>> the usual university curriculum web resources,
>>>> but indirectly through a post about a Prolog
>>>>
>>>> emulation of Hack, using constrained horn clauses (CHC):
>>>>
>>>> Verifying Nand2Tetris Assembly
>>>> https://www.philipzucker.com/nand2tetris-chc/
>>>>
>>>> The binary encoding is currently that the functions,
>>>> modes and conditions eat up a nibble (4-bit), in
>>>> total 12-bit, which I use then 10-bit for A parameter
>>>>
>>>> and 10-bit for D parameter. I used AI freemium, Codex
>>>> by ChatGPT from within IntelliJ to do some fragment
>>>> code translations automatically from Java to JavaScript
>>>>
>>>> or from JavaScript to Python.
>>>>
>>>> Have Fun!
>>>>
>>>> Bye
>>>>
>>>> Mild Shock schrieb:
>>>>> Hi,
>>>>>
>>>>>  > Who exactly is the thief? Does this person
>>>>>  > have stats in the Rogue class in dungeons
>>>>>  > and dragons?
>>>>>
>>>>> The conspiracy theory of a stealing of Torso VDBE,
>>>>> by Rossy Boy, is probably a result of complete
>>>>> ignorance of the Hack ecosystem.
>>>>>
>>>>> Hack is a very popular computer science project,
>>>>> with a couple of subprojects in hardware and
>>>>> software. It goes also by the name Nand to Tetris,
>>>>>
>>>>> and is programming language agnositic. You can do
>>>>> Hack experiments in any programming language, be
>>>>> it BASIC, ADA or Rust. Nobody cares.
>>>>>
>>>>> The gist are projects like here, first to
>>>>> educate yourself about Hack:
>>>>>
>>>>> https://www.nand2tetris.org/course
>>>>>
>>>>> And then to use Hack in different contexts:
>>>>>
>>>>> https://www.nand2tetris.org/copy-of-talks
>>>>>
>>>>> For didactic purposes, I used Hack for my WebGPU
>>>>> experiment. I didn't even take a look at Torso
>>>>> VDBE, why should I? Hack is nicely documented,
>>>>>
>>>>> has even a book, and fusing the two 16-bit
>>>>> instruction types A and D, into a single 32-bit
>>>>> instruction stream, is nowhere patented.
>>>>>
>>>>> Bye
>>>>>
>>>>> Mild Shock schrieb:
>>>>>> Hi,
>>>>>>
>>>>>> I don't use Rust, you are crazy. First of
>>>>>> all the parallel simulator is 100% written
>>>>>> in Prolog, should also run in ISO Prolog,
>>>>>>
>>>>>> enhanced by a library(lists). Second I only
>>>>>> mentioned that WebGPU / WGSL, the language
>>>>>> there has a Rust inspired language.
>>>>>>
>>>>>> Its not Rust. Whats wrong with you? Why do
>>>>>> you adress your weariness of life to me.
>>>>>> I am neither thief, nor can I help you
>>>>>>
>>>>>> with your frustration, and histeric outbursts.
>>>>>> Maybe just be a man and jump off a bridge, idiot.
>>>>>> Or tame your frustration, usenet is not for
>>>>>>
>>>>>> you alone, your stupid asshole.
>>>>>>
>>>>>> Bye
>>>>>>
>>>>>> Ross Finlayson schrieb:
>>>>>>  >
>>>>>> https://www.theregister.com/databases/2026/07/29/after-rewriting-sqlite-in-rust-turso-turns-its-sights-on-postgres/5279835
>>>>>>
>>>>>>
>>>>>>
>>>>>>  > I don't much care about Rust.
>>>>>>  >
>>>>>>  > .. gibberish ..
>>>>>>  >
>>>>>>  > Thief.
>>>>>>
>>>>>> Mild Shock schrieb:
>>>>>>> Hi,
>>>>>>>
>>>>>>> Rossy Boys tears could cool a data center,
>>>>>>> he thinks there exists no literature about
>>>>>>> serial algorithms of parallel stuff, and
>>>>>>>
>>>>>>> he also thinks normal forms lead to optimizing
>>>>>>> something. LoL, what a utter bullshit. I did
>>>>>>> alreay a serial implementation of a parallel
>>>>>>>
>>>>>>> simulation of my pi-WAM. Just lookup the literature
>>>>>>> about pi-calulus. I published it a few days ago,
>>>>>>> its part of 2.2.4 released already:
>>>>>>>
>>>>>>> Parallel π-WAM: An Interleaved Synchronous Emulator
>>>>>>> https://medium.com/2989/0196089e143a
>>>>>>>
>>>>>>> Whats your point, Rossy Boy? Except you post pretend
>>>>>>> nonsense not knowing what you are doing?
>>>>>>>
>>>>>>> Bye
>>>>>>>
>>>>>>> Ross Finlayson schrieb:
>>>>>>>  > No, troll, these are serial algorithms their optimized forms.
>>>>>>>  >
>>>>>>>  > Normal sorts of forms, ....
>>>>>>>  >
>>>>>>>  >
>>>>>>>  > Yeah, everybody already figured out "interpreters" and
>>>>>>>  > "programs" and "spawning".
>>>>>>>  >
>>>>>>>  > Go spawn yourself.
>>>>>>>  >
>>>>>>>
>>>>>>>
>>>>>>> Mild Shock schrieb:
>>>>>>>> Hi,
>>>>>>>>
>>>>>>>> You are still chewing on SIMD. LoL
>>>>>>>>
>>>>>>>> Ross Finlayson schrieb:
>>>>>>>>  > Then the idea is that any of those can be found and matched in
>>>>>>>>  > one "run", i.e. a stall-less, branch-less, call-less list of
>>>>>>>> less than
>>>>>>>>  > a few or less than a few dozens or less than a few hundreds
>>>>>>>>  > instructions, the results "findings" in data and corresponding
>>>>>>>>  > "matchings" of expressions, that runs in less than one
>>>>>>>> microsecond.
>>>>>>>>
>>>>>>>> You cannot make the mental translation that if you have:
>>>>>>>>
>>>>>>>> Ross Finlayson schrieb:
>>>>>>>>  > So, the context then is for register state and stack contents,
>>>>>>>> that
>>>>>>>>  > the indicators of the above as "positive presence" then is to
>>>>>>>> make
>>>>>>>>  > for that the adjustments to the offsets and extents and the
>>>>>>>> shifts
>>>>>>>>  > is according to those, otherwise no-ops. Then the idea is that a
>>>>>>>>
>>>>>>>> As independent logical thread state, that automatically MIMD
>>>>>>>> follows?
>>>>>>>>
>>>>>>>> Whats the problem to solve then?
>>>>>>>>
>>>>>>>> Bye
>>>>>>>>
>>>>>>>> Mild Shock schrieb:
>>>>>>>>> Hi,
>>>>>>>>>
>>>>>>>>> Rossy Boy is neither Einstein nor Zweistein.
>>>>>>>>> He is not Einstein since Einstein is already dead:
>>>>>>>>>
>>>>>>>>> Albert Einstein (1879 - 1955)
>>>>>>>>> https://de.wikipedia.org/wiki/Albert_Einstein
>>>>>>>>>
>>>>>>>>> He is also not Zweistein, since he doesn't
>>>>>>>>> understand concepts such as:
>>>>>>>>>
>>>>>>>>> - NVIDIA Volta ff. architecture
>>>>>>>>>
>>>>>>>>> Also his hands are small, and his breath stinks,
>>>>>>>>> and he lives in the basement of his mother.
>>>>>>>>>
>>>>>>>>> Bye
>>>>>>>>>
>>>>>>>>> Mild Shock schrieb:
>>>>>>>>>> Hi,
>>>>>>>>>>
>>>>>>>>>> Slowly I start understanding numbnuts like
>>>>>>>>>> Rossy Boy who don't understand tech, although
>>>>>>>>>> they are from UK and not from a 3rd world
>>>>>>>>>>
>>>>>>>>>> country, and also I start understanding morons
>>>>>>>>>> like Micro Penis, who are behind a curtain,
>>>>>>>>>> and cannot access a lot of tech.
>>>>>>>>>>
>>>>>>>>>> The same holds for SWI Prologs newest campaign
>>>>>>>>>> that probably adresses some poor indians that
>>>>>>>>>> have neither 5G nor Macs:
>>>>>>>>>>
>>>>>>>>>> 1:38:01 The Kyiv keynote disaster
>>>>>>>>>> https://www.youtube.com/watch?v=U8goS6B3BbI
>>>>>>>>>>
>>>>>>>>>> Woa! Real time download of Scala, Closure,
>>>>>>>>>> etc.. Whats the magic behind that? Some SWI
>>>>>>>>>> point of sale, downloading it via its
>>>>>>>>>>
>>>>>>>>>> keyboard and some telephathy module ?
>>>>>>>>>>
>>>>>>>>>> Bye
>>>>>>>>>>
>>>>>>>>>> Mild Shock schrieb:
>>>>>>>>>>> Hi,
>>>>>>>>>>>
>>>>>>>>>>> Ride the snake
>>>>>>>>>>> He's old and his skin is cold
>>>>>>>>>>> The west is the best
>>>>>>>>>>> The west is the best
>>>>>>>>>>> Get here and we'll do the rest
>>>>>>>>>>> The blue bus is calling us
>>>>>>>>>>> The blue bus is calling us
>>>>>>>>>>> Driver, where you taking us?
>>>>>>>>>>>
>>>>>>>>>>> Apocalypse Now intro: The Doors, The End {1979}
>>>>>>>>>>> https://www.youtube.com/watch?v=CIrvSJwwJUE
>>>>>>>>>>>
>>>>>>>>>>> Bye
>>>>>>>>>>>
>>>>>>>>>>>  > Hi,
>>>>>>>>>>>  >
>>>>>>>>>>>  > Again I posted everything here:
>>>>>>>>>>>  >
>>>>>>>>>>>  >> 11.4 Giga Lips with a Budget Laptop
>>>>>>>>>>>  >> https://github.com/Jean-Luc-Picard-2021/gigabudget
>>>>>>>>>>>  >
>>>>>>>>>>>  > The repo says, same time when I posted
>>>>>>>>>>>  > the link first time:
>>>>>>>>>>>  >
>>>>>>>>>>>  >> This repository was archived by the
>>>>>>>>>>>  >> owner on Jul 9, 2026. It is now read-only.
>>>>>>>>>>>  >
>>>>>>>>>>>  > Now a USENET user, who had already entitled
>>>>>>>>>>>  > himself for a couple of irrational accusations
>>>>>>>>>>>  >
>>>>>>>>>>>  > towards my side, is asking this question:
>>>>>>>>>>>  >
>>>>>>>>>>>  > Chris M. Thomasson schrieb, Jul 24, 2026
>>>>>>>>>>>  >> Show an outline of what you
>>>>>>>>>>>  >> need you compute shader to do?
>>>>>>>>>>>  >
>>>>>>>>>>>  > Bravo, thats a delay of a wooping 15 days.
>>>>>>>>>>>  >
>>>>>>>>>>>  > Bye
>>>>>>>>>>>
>>>>>>>>>>> Mild Shock schrieb:
>>>>>>>>>>>> Hi,
>>>>>>>>>>>>
>>>>>>>>>>>> Remember when first all local AI was Python
>>>>>>>>>>>> and PyTorch APIs. And then suddently people started
>>>>>>>>>>>> using bare metal C/C++ Code. Here is the story:
>>>>>>>>>>>>
>>>>>>>>>>>> How it started:
>>>>>>>>>>>>
>>>>>>>>>>>> GPT-J or GPT-J-6B is an open-source large
>>>>>>>>>>>> language model (LLM) developed by EleutherAI
>>>>>>>>>>>> in 2021. As the name suggests, it is a
>>>>>>>>>>>> generative pre-trained transformer model
>>>>>>>>>>>> designed to produce human-like text that
>>>>>>>>>>>> continues from a prompt.
>>>>>>>>>>>> https://www.eleuther.ai/
>>>>>>>>>>>>
>>>>>>>>>>>> How it was going [Georgi Gerganov]:
>>>>>>>>>>>>
>>>>>>>>>>>> So a few days later comes out the LLaMA, I do
>>>>>>>>>>>> some calculations and I figure out “Okay, 65
>>>>>>>>>>>> billion parameters. You probably need about
>>>>>>>>>>>> 40 gigs of RAM, with 4-bit quantization. So
>>>>>>>>>>>> this can run on a MacBook. Why not do it?”
>>>>>>>>>>>>
>>>>>>>>>>>> Why I was able to do it so quickly - basically,
>>>>>>>>>>>> for all that I saw it’s pretty much GPT-J architecture
>>>>>>>>>>>> with some modifications, like some extra memorization
>>>>>>>>>>>> layers. It’s minor changes. Basically, again, the
>>>>>>>>>>>> existing code for the GPT-J, I just simply
>>>>>>>>>>>> modified it there, it happened pretty quickly.
>>>>>>>>>>>> https://changelog.com/podcast/532
>>>>>>>>>>>>
>>>>>>>>>>>> Georgi Gerganov, Bulgarian, now with Hugging
>>>>>>>>>>>> Face, ggml-cann also running on Chinese AI chips.
>>>>>>>>>>>> ggml Manifesto https://github.com/ggml-org/ggml
>>>>>>>>>>>>
>>>>>>>>>>>> Bye
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>
>>>>>
>>>>
>>>
>>
>>
>> Huffman was a bright lad who it's said came up with Huffman
>> coding to get past taking a final arduous exam.
>>
>> One of my grandfather's name is Huffman, he graduated high-school,
>> somewhere's a picture of him with his high-school graduating
>> class, in Cleveland, Ohio, more than a hundred years ago.
>>
>> Three people graduated high-school that year.
>>
>> Huffman codes are a fantastic thing and ubiquitous, though,
>> like any other algorithm & data structure, they depend on
>> the distribution their best/average/worst cases, since everybody
>> here knows the general outline of asymptotics and Big O, Little o,
>> and Theta, about time and space and complexity.
>>
>>
>> Then, "adaptive algorithms" and "adapative data structures",
>> start with something like "compression" in usual accounts,
>> which usually is adaptive in the sense of compressing what's
>> compressible in a window, and making a histogram of the words
>> in the alphabet interpreted as a sequence of letters, and making
>> an optimal sort of Huffman-coding for entropy-coding for that,
>> since Huffman-coding is naturally optimal for a particular distribution,
>> that like power laws can be found in anything,
>> that one starts with making histograms after combinatorial enumeration,
>> and thus resulting an encoding into a language of bit-sequences
>> with the prefix-property that un-ambiguously makes for compressing
>> the compressible data.
>>
>> Then the "adaptive" part of that is
>> periodically throwing that away and starting another.
>> One might aver that a more contextually-advised account
>> studies the entire corpus, for things like CCITT G4, JPEG,
>> JBIG, Deflate, and any account of entropy-coding or compression,
>> or Morse code, with of course both Huffman-coding and arithmetic-coding,
>> since while Huffman-coding is obvious to everybody,
>> for a while some people thought arithmetic coding had patents,
>> which now are gone away, leaving all the above mentioned
>> and MPEG-4 also the "un-encumbered".
>>
>> The notion of "summary statistics" and "order statistics" though,
>> in concrete mathematics of course is simple and clear.
>>
>>
>> Here's an article I read the other day about Huffman-coding,
>> I found it very insightful and quite enjoyable.
>>
>> https://fgiesen.wordpress.com/2026/06/21/pivco-huffman-merge-operations/
>>
>>
>>
>>
>> Shut Up
>>
>>
>
> "It easily scales both up and down
> with the capabilities of the target machine."
>
>   -
> https://fgiesen.wordpress.com/2026/06/21/pivco-huffman-merge-operations/
>
>

"A vulnerability in the Xpdf implementation of JBIG2, re-used in Apple's
iOS phone operating software, was used by the Pegasus spyware to
implement a zero-click attack on iPhones by constructing an emulated
computer architecture inside a JBIG2 stream. Apple fixed this
"FORCEDENTRY" vulnerability in iOS 14.8 in September 2021."

[toc] | [prev] | [next] | [standalone]

#896538 — Quo Vadis: Extend investigations to WebNN (Was: I wrote Hack VM for π-WAM from scratch [4 Months total JavaScript, Python and Java])

From	Mild Shock <janburse@fastmail.fm>
Date	2026-07-31 20:43 +0200
Subject	Quo Vadis: Extend investigations to WebNN (Was: I wrote Hack VM for π-WAM from scratch [4 Months total JavaScript, Python and Java])
Message-ID	<114iqd6$obtb$1@solani.org>
In reply to	#896525

Hi,

Since we have a good flow, and since NPUs
share the same system memory, and possibly a
lot of other traits as well with the GPU in
libary(edge/furryhaze), we just developed.

The idea here is to do first some off Dogelog
experiments and then create a library that
provides npu_exec/2 for pi-WAM code, the analogue
to gpu_exec/2. A name suggestion would be:

- edge/ironpaw.p
   The new Prolog library

The NPU will be clearly underutilized when only
doing scalar, not sure whether this is even
permitted. But in the long run it is planned
that pi-WAM will have vector and matrix traits
anyways. Here is an example goal can be run

with matrix and quantization traits:

?- [X,Y] ins 0..3, Z is X*2+Y*3+4, T is X*3-Y*2-1

These traits will demand some CPU, GPU
and NPU translation. If we keep these traits
simple, we might indeed arrive at concrete
realization from the same abstract machine

LoL, ironpaw the little brother of ironfist.

Bye

Mild Shock schrieb:
> Hi,
> 
>  > Just downloading some other person's code
> 
> I didn't do that, I wrote Hack VM for pi-WAM
> from scratch, over the last 4 weeks. I came
> back from holidays on end of June 2026, and now
> 
> we have end of July 2026. But its only possible
> because the instruction set is very smal, like
> ca. 8 functions and ca. 8 modes and ca. 8 conditions,
> 
> so its ca. 8 x 8 x 8 = 512 opcodes, each has an
> A parameter and a D parameter simultaneously.
> It has currently the following CPU backends:
> 
>   - Now supports interleaved synchronous emulation.
>   - Now supports warp parallelism via Java platform threads.
>   - Now supports warp parallelism via Python system threads.
>   - Now supports warp parallelism via JavaScript worker threads.
>   - Note: For Python free threads are not yet fully tested.
>   - Note: For JavaScript web workers are not yet fully tested.
> 
> https://www.dogelog.ch/typtab/doclet/book/14_install/05_notes22/110_224.html 
> 
> 
> But frankly I came to encounter Hack not from
> the usual university curriculum web resources,
> but indirectly through a post about a Prolog
> 
> emulation of Hack, using constrained horn clauses (CHC):
> 
> Verifying Nand2Tetris Assembly
> https://www.philipzucker.com/nand2tetris-chc/
> 
> The binary encoding is currently that the functions,
> modes and conditions eat up a nibble (4-bit), in
> total 12-bit, which I use then 10-bit for A parameter
> 
> and 10-bit for D parameter. I used AI freemium, Codex
> by ChatGPT from within IntelliJ to do some fragment
> code translations automatically from Java to JavaScript
> 
> or from JavaScript to Python.
> 
> Have Fun!
> 
> Bye
> 
> Mild Shock schrieb:
>> Hi,
>>
>>  > Who exactly is the thief? Does this person
>>  > have stats in the Rogue class in dungeons
>>  > and dragons?
>>
>> The conspiracy theory of a stealing of Torso VDBE,
>> by Rossy Boy, is probably a result of complete
>> ignorance of the Hack ecosystem.
>>
>> Hack is a very popular computer science project,
>> with a couple of subprojects in hardware and
>> software. It goes also by the name Nand to Tetris,
>>
>> and is programming language agnositic. You can do
>> Hack experiments in any programming language, be
>> it BASIC, ADA or Rust. Nobody cares.
>>
>> The gist are projects like here, first to
>> educate yourself about Hack:
>>
>> https://www.nand2tetris.org/course
>>
>> And then to use Hack in different contexts:
>>
>> https://www.nand2tetris.org/copy-of-talks
>>
>> For didactic purposes, I used Hack for my WebGPU
>> experiment. I didn't even take a look at Torso
>> VDBE, why should I? Hack is nicely documented,
>>
>> has even a book, and fusing the two 16-bit
>> instruction types A and D, into a single 32-bit
>> instruction stream, is nowhere patented.
>>
>> Bye
>>
>> Mild Shock schrieb:
>>> Hi,
>>>
>>> I don't use Rust, you are crazy. First of
>>> all the parallel simulator is 100% written
>>> in Prolog, should also run in ISO Prolog,
>>>
>>> enhanced by a library(lists). Second I only
>>> mentioned that WebGPU / WGSL, the language
>>> there has a Rust inspired language.
>>>
>>> Its not Rust. Whats wrong with you? Why do
>>> you adress your weariness of life to me.
>>> I am neither thief, nor can I help you
>>>
>>> with your frustration, and histeric outbursts.
>>> Maybe just be a man and jump off a bridge, idiot.
>>> Or tame your frustration, usenet is not for
>>>
>>> you alone, your stupid asshole.
>>>
>>> Bye
>>>
>>> Ross Finlayson schrieb:
>>>  > 
>>> https://www.theregister.com/databases/2026/07/29/after-rewriting-sqlite-in-rust-turso-turns-its-sights-on-postgres/5279835 
>>>
>>>  > I don't much care about Rust.
>>>  >
>>>  > .. gibberish ..
>>>  >
>>>  > Thief.
>>>
>>> Mild Shock schrieb:
>>>> Hi,
>>>>
>>>> Rossy Boys tears could cool a data center,
>>>> he thinks there exists no literature about
>>>> serial algorithms of parallel stuff, and
>>>>
>>>> he also thinks normal forms lead to optimizing
>>>> something. LoL, what a utter bullshit. I did
>>>> alreay a serial implementation of a parallel
>>>>
>>>> simulation of my pi-WAM. Just lookup the literature
>>>> about pi-calulus. I published it a few days ago,
>>>> its part of 2.2.4 released already:
>>>>
>>>> Parallel π-WAM: An Interleaved Synchronous Emulator
>>>> https://medium.com/2989/0196089e143a
>>>>
>>>> Whats your point, Rossy Boy? Except you post pretend
>>>> nonsense not knowing what you are doing?
>>>>
>>>> Bye
>>>>
>>>> Ross Finlayson schrieb:
>>>>  > No, troll, these are serial algorithms their optimized forms.
>>>>  >
>>>>  > Normal sorts of forms, ....
>>>>  >
>>>>  >
>>>>  > Yeah, everybody already figured out "interpreters" and
>>>>  > "programs" and "spawning".
>>>>  >
>>>>  > Go spawn yourself.
>>>>  >
>>>>
>>>>
>>>> Mild Shock schrieb:
>>>>> Hi,
>>>>>
>>>>> You are still chewing on SIMD. LoL
>>>>>
>>>>> Ross Finlayson schrieb:
>>>>>  > Then the idea is that any of those can be found and matched in
>>>>>  > one "run", i.e. a stall-less, branch-less, call-less list of 
>>>>> less than
>>>>>  > a few or less than a few dozens or less than a few hundreds
>>>>>  > instructions, the results "findings" in data and corresponding
>>>>>  > "matchings" of expressions, that runs in less than one microsecond.
>>>>>
>>>>> You cannot make the mental translation that if you have:
>>>>>
>>>>> Ross Finlayson schrieb:
>>>>>  > So, the context then is for register state and stack contents, that
>>>>>  > the indicators of the above as "positive presence" then is to make
>>>>>  > for that the adjustments to the offsets and extents and the shifts
>>>>>  > is according to those, otherwise no-ops. Then the idea is that a
>>>>>
>>>>> As independent logical thread state, that automatically MIMD follows?
>>>>>
>>>>> Whats the problem to solve then?
>>>>>
>>>>> Bye
>>>>>
>>>>> Mild Shock schrieb:
>>>>>> Hi,
>>>>>>
>>>>>> Rossy Boy is neither Einstein nor Zweistein.
>>>>>> He is not Einstein since Einstein is already dead:
>>>>>>
>>>>>> Albert Einstein (1879 - 1955)
>>>>>> https://de.wikipedia.org/wiki/Albert_Einstein
>>>>>>
>>>>>> He is also not Zweistein, since he doesn't
>>>>>> understand concepts such as:
>>>>>>
>>>>>> - NVIDIA Volta ff. architecture
>>>>>>
>>>>>> Also his hands are small, and his breath stinks,
>>>>>> and he lives in the basement of his mother.
>>>>>>
>>>>>> Bye
>>>>>>
>>>>>> Mild Shock schrieb:
>>>>>>> Hi,
>>>>>>>
>>>>>>> Slowly I start understanding numbnuts like
>>>>>>> Rossy Boy who don't understand tech, although
>>>>>>> they are from UK and not from a 3rd world
>>>>>>>
>>>>>>> country, and also I start understanding morons
>>>>>>> like Micro Penis, who are behind a curtain,
>>>>>>> and cannot access a lot of tech.
>>>>>>>
>>>>>>> The same holds for SWI Prologs newest campaign
>>>>>>> that probably adresses some poor indians that
>>>>>>> have neither 5G nor Macs:
>>>>>>>
>>>>>>> 1:38:01 The Kyiv keynote disaster
>>>>>>> https://www.youtube.com/watch?v=U8goS6B3BbI
>>>>>>>
>>>>>>> Woa! Real time download of Scala, Closure,
>>>>>>> etc.. Whats the magic behind that? Some SWI
>>>>>>> point of sale, downloading it via its
>>>>>>>
>>>>>>> keyboard and some telephathy module ?
>>>>>>>
>>>>>>> Bye
>>>>>>>
>>>>>>> Mild Shock schrieb:
>>>>>>>> Hi,
>>>>>>>>
>>>>>>>> Ride the snake
>>>>>>>> He's old and his skin is cold
>>>>>>>> The west is the best
>>>>>>>> The west is the best
>>>>>>>> Get here and we'll do the rest
>>>>>>>> The blue bus is calling us
>>>>>>>> The blue bus is calling us
>>>>>>>> Driver, where you taking us?
>>>>>>>>
>>>>>>>> Apocalypse Now intro: The Doors, The End {1979}
>>>>>>>> https://www.youtube.com/watch?v=CIrvSJwwJUE
>>>>>>>>
>>>>>>>> Bye
>>>>>>>>
>>>>>>>>  > Hi,
>>>>>>>>  >
>>>>>>>>  > Again I posted everything here:
>>>>>>>>  >
>>>>>>>>  >> 11.4 Giga Lips with a Budget Laptop
>>>>>>>>  >> https://github.com/Jean-Luc-Picard-2021/gigabudget
>>>>>>>>  >
>>>>>>>>  > The repo says, same time when I posted
>>>>>>>>  > the link first time:
>>>>>>>>  >
>>>>>>>>  >> This repository was archived by the
>>>>>>>>  >> owner on Jul 9, 2026. It is now read-only.
>>>>>>>>  >
>>>>>>>>  > Now a USENET user, who had already entitled
>>>>>>>>  > himself for a couple of irrational accusations
>>>>>>>>  >
>>>>>>>>  > towards my side, is asking this question:
>>>>>>>>  >
>>>>>>>>  > Chris M. Thomasson schrieb, Jul 24, 2026
>>>>>>>>  >> Show an outline of what you
>>>>>>>>  >> need you compute shader to do?
>>>>>>>>  >
>>>>>>>>  > Bravo, thats a delay of a wooping 15 days.
>>>>>>>>  >
>>>>>>>>  > Bye
>>>>>>>>
>>>>>>>> Mild Shock schrieb:
>>>>>>>>> Hi,
>>>>>>>>>
>>>>>>>>> Remember when first all local AI was Python
>>>>>>>>> and PyTorch APIs. And then suddently people started
>>>>>>>>> using bare metal C/C++ Code. Here is the story:
>>>>>>>>>
>>>>>>>>> How it started:
>>>>>>>>>
>>>>>>>>> GPT-J or GPT-J-6B is an open-source large
>>>>>>>>> language model (LLM) developed by EleutherAI
>>>>>>>>> in 2021. As the name suggests, it is a
>>>>>>>>> generative pre-trained transformer model
>>>>>>>>> designed to produce human-like text that
>>>>>>>>> continues from a prompt.
>>>>>>>>> https://www.eleuther.ai/
>>>>>>>>>
>>>>>>>>> How it was going [Georgi Gerganov]:
>>>>>>>>>
>>>>>>>>> So a few days later comes out the LLaMA, I do
>>>>>>>>> some calculations and I figure out “Okay, 65
>>>>>>>>> billion parameters. You probably need about
>>>>>>>>> 40 gigs of RAM, with 4-bit quantization. So
>>>>>>>>> this can run on a MacBook. Why not do it?”
>>>>>>>>>
>>>>>>>>> Why I was able to do it so quickly - basically,
>>>>>>>>> for all that I saw it’s pretty much GPT-J architecture
>>>>>>>>> with some modifications, like some extra memorization
>>>>>>>>> layers. It’s minor changes. Basically, again, the
>>>>>>>>> existing code for the GPT-J, I just simply
>>>>>>>>> modified it there, it happened pretty quickly.
>>>>>>>>> https://changelog.com/podcast/532
>>>>>>>>>
>>>>>>>>> Georgi Gerganov, Bulgarian, now with Hugging
>>>>>>>>> Face, ggml-cann also running on Chinese AI chips.
>>>>>>>>> ggml Manifesto https://github.com/ggml-org/ggml
>>>>>>>>>
>>>>>>>>> Bye
>>>>>>>>
>>>>>>>
>>>>>>
>>>>>
>>>>
>>>
>>
>

[toc] | [prev] | [next] | [standalone]

#896481 — Got it. Or are you too stupid? [New Usenet Mantra] (Was: The Wuhan Virus that destroyed Python [ggml Manifesto])

From	Mild Shock <janburse@fastmail.fm>
Date	2026-07-27 18:59 +0200
Subject	Got it. Or are you too stupid? [New Usenet Mantra] (Was: The Wuhan Virus that destroyed Python [ggml Manifesto])
Message-ID	<11482ou$h3vk$1@solani.org>
In reply to	#896394

Hi,

Ok, guys lets face it. You are a bunch of
morons. When did I do this post:

11.4 Giga Lips with a Budget Laptop
https://github.com/Jean-Luc-Picard-2021/gigabudget

Yes on Jul 9, 2026, now we have Jul 27, 2026.
Thats a wooping 18 days meanwhile.
And you still don't get the meaning and

implications of the post. Like you even
don't get what "budget" nowdays means in
terms of performance units and energy units?

And what LIPS means, drawn from TOPS,
in terms of applications? Shame on you guys!
You are a bunch of brainless idiots.

Bye

Mild Shock schrieb:
> Hi,
> 
> Remember when first all local AI was Python
> and PyTorch APIs. And then suddently people started
> using bare metal C/C++ Code. Here is the story:
> 
> How it started:
> 
> GPT-J or GPT-J-6B is an open-source large
> language model (LLM) developed by EleutherAI
> in 2021. As the name suggests, it is a
> generative pre-trained transformer model
> designed to produce human-like text that
> continues from a prompt.
> https://www.eleuther.ai/
> 
> How it was going [Georgi Gerganov]:
> 
> So a few days later comes out the LLaMA, I do
> some calculations and I figure out “Okay, 65
> billion parameters. You probably need about
> 40 gigs of RAM, with 4-bit quantization. So
> this can run on a MacBook. Why not do it?”
> 
> Why I was able to do it so quickly - basically,
> for all that I saw it’s pretty much GPT-J architecture
> with some modifications, like some extra memorization
> layers. It’s minor changes. Basically, again, the
> existing code for the GPT-J, I just simply
> modified it there, it happened pretty quickly.
> https://changelog.com/podcast/532
> 
> Georgi Gerganov, Bulgarian, now with Hugging
> Face, ggml-cann also running on Chinese AI chips.
> ggml Manifesto https://github.com/ggml-org/ggml
> 
> Bye

[toc] | [prev] | [next] | [standalone]

#896505 — Lamas in a cradle and Lamas on the edge [Red Pyjama] (Re: The Wuhan Virus that destroyed Python [ggml Manifesto])

From	Mild Shock <janburse@fastmail.fm>
Date	2026-07-29 13:03 +0200
Subject	Lamas in a cradle and Lamas on the edge [Red Pyjama] (Re: The Wuhan Virus that destroyed Python [ggml Manifesto])
Message-ID	<114cmmv$jmhc$2@solani.org>
In reply to	#896394

Hi,

Why does this Lama have a red pyjama.
Oh, its a baby Lama. Its still in the cradle
and needs some training:

RedPajama-Data-v2
https://github.com/togethercomputer/RedPajama-Data

But then Andrej Karpathy recently showed
GPT-2 training on rented GPUs for less
than 100 USD in less then 2 hours.

So where do these grown up Lamas go.
Well Georgi Gerganov prefered C++/C
when he shouted Llama Llama Red Pyjama.

But you also find WebLLM, wrapping the
underlying C++/C GPU interface via the
W3C standard WebGPU / WGSL, with JavaScript:

In-Browser LLM Inference Engine
https://webllm.mlc.ai/

My experience with WebLLM 6 months
ago on an iPad Pro 2024, still a little early
stage performance and robustness.

But hey hardware of AI mobile iGPUs is
still evolving, and AI laptop, AI smartphones
and AI tablets, will soon feature Chinese

hardware such some new Kirin AI in 2027.

Bye

Mild Shock schrieb:
> Hi,
> 
> Remember when first all local AI was Python
> and PyTorch APIs. And then suddently people started
> using bare metal C/C++ Code. Here is the story:
> 
> How it started:
> 
> GPT-J or GPT-J-6B is an open-source large
> language model (LLM) developed by EleutherAI
> in 2021. As the name suggests, it is a
> generative pre-trained transformer model
> designed to produce human-like text that
> continues from a prompt.
> https://www.eleuther.ai/
> 
> How it was going [Georgi Gerganov]:
> 
> So a few days later comes out the LLaMA, I do
> some calculations and I figure out “Okay, 65
> billion parameters. You probably need about
> 40 gigs of RAM, with 4-bit quantization. So
> this can run on a MacBook. Why not do it?”
> 
> Why I was able to do it so quickly - basically,
> for all that I saw it’s pretty much GPT-J architecture
> with some modifications, like some extra memorization
> layers. It’s minor changes. Basically, again, the
> existing code for the GPT-J, I just simply
> modified it there, it happened pretty quickly.
> https://changelog.com/podcast/532
> 
> Georgi Gerganov, Bulgarian, now with Hugging
> Face, ggml-cann also running on Chinese AI chips.
> ggml Manifesto https://github.com/ggml-org/ggml
> 
> Bye

[toc] | [prev] | [next] | [standalone]

#896506 — AI Accelerators and ISO Prolog multi-threading (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])

From	Mild Shock <janburse@fastmail.fm>
Date	2026-07-29 17:02 +0200
Subject	AI Accelerators and ISO Prolog multi-threading (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])
Message-ID	<114d4lt$kfj1$2@solani.org>
In reply to	#896505

Hi,

Usual question:

 > Why implement both pre-emptive threading
AND cooperative tasks/engines?

I had implemented the ISO proposal in formerly Jekejeke
Prolog, you find the ISO proposal here:

ISO/IEC DTR 13211–5:2007
Prolog multi-threading support
https://logtalk.org/plstd/threads.pdf

But the ISO proposal doesn't match modern WebGPU APIs,
where your logical threads can live remotely in a dedicated GPU
in the VRAM there, and where you would have launch

parameters that say: Hey please run 4096 compute
shaders for me, that have independet thread state. Using
cooperative multi-tasking as the orchestrator works well.

Bye

Mild Shock schrieb:
> Hi,
> 
> Why does this Lama have a red pyjama.
> Oh, its a baby Lama. Its still in the cradle
> and needs some training:
> 
> RedPajama-Data-v2
> https://github.com/togethercomputer/RedPajama-Data
> 
> But then Andrej Karpathy recently showed
> GPT-2 training on rented GPUs for less
> than 100 USD in less then 2 hours.
> 
> So where do these grown up Lamas go.
> Well Georgi Gerganov prefered C++/C
> when he shouted Llama Llama Red Pyjama.
> 
> But you also find WebLLM, wrapping the
> underlying C++/C GPU interface via the
> W3C standard WebGPU / WGSL, with JavaScript:
> 
> In-Browser LLM Inference Engine
> https://webllm.mlc.ai/
> 
> My experience with WebLLM 6 months
> ago on an iPad Pro 2024, still a little early
> stage performance and robustness.
> 
> But hey hardware of AI mobile iGPUs is
> still evolving, and AI laptop, AI smartphones
> and AI tablets, will soon feature Chinese
> 
> hardware such some new Kirin AI in 2027.
> 
> Bye
> 
> Mild Shock schrieb:
>> Hi,
>>
>> Remember when first all local AI was Python
>> and PyTorch APIs. And then suddently people started
>> using bare metal C/C++ Code. Here is the story:
>>
>> How it started:
>>
>> GPT-J or GPT-J-6B is an open-source large
>> language model (LLM) developed by EleutherAI
>> in 2021. As the name suggests, it is a
>> generative pre-trained transformer model
>> designed to produce human-like text that
>> continues from a prompt.
>> https://www.eleuther.ai/
>>
>> How it was going [Georgi Gerganov]:
>>
>> So a few days later comes out the LLaMA, I do
>> some calculations and I figure out “Okay, 65
>> billion parameters. You probably need about
>> 40 gigs of RAM, with 4-bit quantization. So
>> this can run on a MacBook. Why not do it?”
>>
>> Why I was able to do it so quickly - basically,
>> for all that I saw it’s pretty much GPT-J architecture
>> with some modifications, like some extra memorization
>> layers. It’s minor changes. Basically, again, the
>> existing code for the GPT-J, I just simply
>> modified it there, it happened pretty quickly.
>> https://changelog.com/podcast/532
>>
>> Georgi Gerganov, Bulgarian, now with Hugging
>> Face, ggml-cann also running on Chinese AI chips.
>> ggml Manifesto https://github.com/ggml-org/ggml
>>
>> Bye
>

[toc] | [prev] | [next] | [standalone]

#896507 — Actor/Erlang is dead, no Thread and Mailbox conflation [golang channels] (Re: AI Accelerators and ISO Prolog multi-threading) (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])

From	Mild Shock <janburse@fastmail.fm>
Date	2026-07-29 17:04 +0200
Subject	Actor/Erlang is dead, no Thread and Mailbox conflation [golang channels] (Re: AI Accelerators and ISO Prolog multi-threading) (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])
Message-ID	<114d4p7$kfj1$3@solani.org>
In reply to	#896506

Hi,

Mostlikely for high performance computing à la,
the Actor/Erlang model is dead, they might rely
on MPMC (Multiple Producer, Multiple Consumer)

queue entities separate from the threads. The
ISO Prolog multi-threading support had also such
threads. But besides that was also Actor/Erlang

leaning in practice, like SWI, where threads
have some default queues. So an actor is basically
a Thread and Mailbox conflation. While a MPMC queue

is a kind of separate Mailbox, where multiple
"actors" can read from and write from. A kind of
localized Linda Tuple store.

Which Programming language did adopted the
non-Actor pi-calculus model? Right golang
with its channels.

Bye


Mild Shock schrieb:
> Hi,
> 
> Usual question:
> 
>  > Why implement both pre-emptive threading
> AND cooperative tasks/engines?
> 
> I had implemented the ISO proposal in formerly Jekejeke
> Prolog, you find the ISO proposal here:
> 
> ISO/IEC DTR 13211–5:2007
> Prolog multi-threading support
> https://logtalk.org/plstd/threads.pdf
> 
> But the ISO proposal doesn't match modern WebGPU APIs,
> where your logical threads can live remotely in a dedicated GPU
> in the VRAM there, and where you would have launch
> 
> parameters that say: Hey please run 4096 compute
> shaders for me, that have independet thread state. Using
> cooperative multi-tasking as the orchestrator works well.
> 
> Bye
> 
> Mild Shock schrieb:
>> Hi,
>>
>> Why does this Lama have a red pyjama.
>> Oh, its a baby Lama. Its still in the cradle
>> and needs some training:
>>
>> RedPajama-Data-v2
>> https://github.com/togethercomputer/RedPajama-Data
>>
>> But then Andrej Karpathy recently showed
>> GPT-2 training on rented GPUs for less
>> than 100 USD in less then 2 hours.
>>
>> So where do these grown up Lamas go.
>> Well Georgi Gerganov prefered C++/C
>> when he shouted Llama Llama Red Pyjama.
>>
>> But you also find WebLLM, wrapping the
>> underlying C++/C GPU interface via the
>> W3C standard WebGPU / WGSL, with JavaScript:
>>
>> In-Browser LLM Inference Engine
>> https://webllm.mlc.ai/
>>
>> My experience with WebLLM 6 months
>> ago on an iPad Pro 2024, still a little early
>> stage performance and robustness.
>>
>> But hey hardware of AI mobile iGPUs is
>> still evolving, and AI laptop, AI smartphones
>> and AI tablets, will soon feature Chinese
>>
>> hardware such some new Kirin AI in 2027.
>>
>> Bye
>>
>> Mild Shock schrieb:
>>> Hi,
>>>
>>> Remember when first all local AI was Python
>>> and PyTorch APIs. And then suddently people started
>>> using bare metal C/C++ Code. Here is the story:
>>>
>>> How it started:
>>>
>>> GPT-J or GPT-J-6B is an open-source large
>>> language model (LLM) developed by EleutherAI
>>> in 2021. As the name suggests, it is a
>>> generative pre-trained transformer model
>>> designed to produce human-like text that
>>> continues from a prompt.
>>> https://www.eleuther.ai/
>>>
>>> How it was going [Georgi Gerganov]:
>>>
>>> So a few days later comes out the LLaMA, I do
>>> some calculations and I figure out “Okay, 65
>>> billion parameters. You probably need about
>>> 40 gigs of RAM, with 4-bit quantization. So
>>> this can run on a MacBook. Why not do it?”
>>>
>>> Why I was able to do it so quickly - basically,
>>> for all that I saw it’s pretty much GPT-J architecture
>>> with some modifications, like some extra memorization
>>> layers. It’s minor changes. Basically, again, the
>>> existing code for the GPT-J, I just simply
>>> modified it there, it happened pretty quickly.
>>> https://changelog.com/podcast/532
>>>
>>> Georgi Gerganov, Bulgarian, now with Hugging
>>> Face, ggml-cann also running on Chinese AI chips.
>>> ggml Manifesto https://github.com/ggml-org/ggml
>>>
>>> Bye
>>
>

[toc] | [prev] | [next] | [standalone]

#896540 — Can library(ironpaw) repurpose FFT hardware [Glimps into Ryzen AI 7 350] (Re: Actor/Erlang is dead, no Thread and Mailbox conflation )

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-01 02:32 +0200
Subject	Can library(ironpaw) repurpose FFT hardware [Glimps into Ryzen AI 7 350] (Re: Actor/Erlang is dead, no Thread and Mailbox conflation )
Message-ID	<114jeqf$o8qj$2@solani.org>
In reply to	#896507

Hi,

On could believe the AI boom is a kind of
Charles Darvin Galapagos Island Evolution
Trick of repurposing FFT hardware.

But this is of course not true, HPC, high
performance computing, has already defined
level 3 ops years ago.

But look at this rabit hole of Ryzen AI 7 350
NPU design, which is a stripped down Xilinx,
stripped of exotic FFT features:

Getting peak TOPS on a Ryzen AI 7 350 NPU
https://destevez.net/2026/05/getting-peak-tops-on-a-ryzen-ai-7-350-npu/

But the core feature, very long instruction
word (VLIW) engines, with hardware accelerated
GEMMs, scattered in grids of ASIC tiles,

connected by DMA and NoC, is even not very
specific to AMD, you find it also in Snapdragon /
Qualcomm SoCs for AI Laptops.

Bye

P.S.: My brain playing tricks, why should I
name a library(ironpaw) ? From the same
article above. Maybe WebNN is easier to use?

"mlir-aie contains a Python framework called
IRON that generates LLVM MLIR code representing
a workload that runs on the NPU, including the
code that runs on each compute tile processor

and the configuration of DMAs and other hardware.
Kernels for the compute tile processor can be
written in C++ and compiled either with the
open-source llvm-aie Peano compiler, which is

a fork of LLVM that adds support for the Xilinx
AI engine processors, or with the closed-source
Xilinx CHESS compiler, which is included in Vitis.
In simple cases the kernels can also be directly

written in Python with IRON."

Getting peak TOPS on a Ryzen AI 7 350 NPU
https://destevez.net/2026/05/getting-peak-tops-on-a-ryzen-ai-7-350-npu/

Mild Shock schrieb:
> Hi,
> 
> Mostlikely for high performance computing à la,
> the Actor/Erlang model is dead, they might rely
> on MPMC (Multiple Producer, Multiple Consumer)
> 
> queue entities separate from the threads. The
> ISO Prolog multi-threading support had also such
> threads. But besides that was also Actor/Erlang
> 
> leaning in practice, like SWI, where threads
> have some default queues. So an actor is basically
> a Thread and Mailbox conflation. While a MPMC queue
> 
> is a kind of separate Mailbox, where multiple
> "actors" can read from and write from. A kind of
> localized Linda Tuple store.
> 
> Which Programming language did adopted the
> non-Actor pi-calculus model? Right golang
> with its channels.
> 
> Bye
> 
> 
> Mild Shock schrieb:
>> Hi,
>>
>> Usual question:
>>
>>  > Why implement both pre-emptive threading
>> AND cooperative tasks/engines?
>>
>> I had implemented the ISO proposal in formerly Jekejeke
>> Prolog, you find the ISO proposal here:
>>
>> ISO/IEC DTR 13211–5:2007
>> Prolog multi-threading support
>> https://logtalk.org/plstd/threads.pdf
>>
>> But the ISO proposal doesn't match modern WebGPU APIs,
>> where your logical threads can live remotely in a dedicated GPU
>> in the VRAM there, and where you would have launch
>>
>> parameters that say: Hey please run 4096 compute
>> shaders for me, that have independet thread state. Using
>> cooperative multi-tasking as the orchestrator works well.
>>
>> Bye
>>
>> Mild Shock schrieb:
>>> Hi,
>>>
>>> Why does this Lama have a red pyjama.
>>> Oh, its a baby Lama. Its still in the cradle
>>> and needs some training:
>>>
>>> RedPajama-Data-v2
>>> https://github.com/togethercomputer/RedPajama-Data
>>>
>>> But then Andrej Karpathy recently showed
>>> GPT-2 training on rented GPUs for less
>>> than 100 USD in less then 2 hours.
>>>
>>> So where do these grown up Lamas go.
>>> Well Georgi Gerganov prefered C++/C
>>> when he shouted Llama Llama Red Pyjama.
>>>
>>> But you also find WebLLM, wrapping the
>>> underlying C++/C GPU interface via the
>>> W3C standard WebGPU / WGSL, with JavaScript:
>>>
>>> In-Browser LLM Inference Engine
>>> https://webllm.mlc.ai/
>>>
>>> My experience with WebLLM 6 months
>>> ago on an iPad Pro 2024, still a little early
>>> stage performance and robustness.
>>>
>>> But hey hardware of AI mobile iGPUs is
>>> still evolving, and AI laptop, AI smartphones
>>> and AI tablets, will soon feature Chinese
>>>
>>> hardware such some new Kirin AI in 2027.
>>>
>>> Bye
>>>
>>> Mild Shock schrieb:
>>>> Hi,
>>>>
>>>> Remember when first all local AI was Python
>>>> and PyTorch APIs. And then suddently people started
>>>> using bare metal C/C++ Code. Here is the story:
>>>>
>>>> How it started:
>>>>
>>>> GPT-J or GPT-J-6B is an open-source large
>>>> language model (LLM) developed by EleutherAI
>>>> in 2021. As the name suggests, it is a
>>>> generative pre-trained transformer model
>>>> designed to produce human-like text that
>>>> continues from a prompt.
>>>> https://www.eleuther.ai/
>>>>
>>>> How it was going [Georgi Gerganov]:
>>>>
>>>> So a few days later comes out the LLaMA, I do
>>>> some calculations and I figure out “Okay, 65
>>>> billion parameters. You probably need about
>>>> 40 gigs of RAM, with 4-bit quantization. So
>>>> this can run on a MacBook. Why not do it?”
>>>>
>>>> Why I was able to do it so quickly - basically,
>>>> for all that I saw it’s pretty much GPT-J architecture
>>>> with some modifications, like some extra memorization
>>>> layers. It’s minor changes. Basically, again, the
>>>> existing code for the GPT-J, I just simply
>>>> modified it there, it happened pretty quickly.
>>>> https://changelog.com/podcast/532
>>>>
>>>> Georgi Gerganov, Bulgarian, now with Hugging
>>>> Face, ggml-cann also running on Chinese AI chips.
>>>> ggml Manifesto https://github.com/ggml-org/ggml
>>>>
>>>> Bye
>>>
>>
>

[toc] | [prev] | [next] | [standalone]

#896544 — Tablet and phone UBS-C remote debugging (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-01 12:19 +0200
Subject	Tablet and phone UBS-C remote debugging (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])
Message-ID	<114kh7q$ovdp$5@solani.org>
In reply to	#896505

Hi,

Tablets and phone are more annoying to
use with WebGPU. The usual browsers don't
have a Chrome DevTools panel integrated,

so that one could do JavaScript Debugging
directly on the device. Instead one has to
use a desktop machine, and connect the

device via UBS-C , and start a Chrome
Browser there . And then start a Chrome
DevTools panel alone, that is pair with

the device, via UBS-C cable. So this way
I already see where it crashes on the
tablets and phone:

await output.mapAsync(GPUMapMode.READ)
Unhandled Promise Rejection: OperationError

The above is the error that one can re-produce
already here with this test:

11.4 Giga Lips with a Budget Laptop
https://github.com/Jean-Luc-Picard-2021/gigabudget

Not sure what exactly happens. Maybe
a form of timeout or device lost, that the
primitive HTML / JavaScript doesn't handle

gracefully yet. Maybe redimensioning the
test, so that it consumes less time would
help. Who knows? Will see. For production

use of a GPU integration I have to anyway
provide work slicing it seems.

Bye

Mild Shock schrieb:
> Hi,
> 
> Why does this Lama have a red pyjama.
> Oh, its a baby Lama. Its still in the cradle
> and needs some training:
> 
> RedPajama-Data-v2
> https://github.com/togethercomputer/RedPajama-Data
> 
> But then Andrej Karpathy recently showed
> GPT-2 training on rented GPUs for less
> than 100 USD in less then 2 hours.
> 
> So where do these grown up Lamas go.
> Well Georgi Gerganov prefered C++/C
> when he shouted Llama Llama Red Pyjama.
> 
> But you also find WebLLM, wrapping the
> underlying C++/C GPU interface via the
> W3C standard WebGPU / WGSL, with JavaScript:
> 
> In-Browser LLM Inference Engine
> https://webllm.mlc.ai/
> 
> My experience with WebLLM 6 months
> ago on an iPad Pro 2024, still a little early
> stage performance and robustness.
> 
> But hey hardware of AI mobile iGPUs is
> still evolving, and AI laptop, AI smartphones
> and AI tablets, will soon feature Chinese
> 
> hardware such some new Kirin AI in 2027.
> 
> Bye
> 
> Mild Shock schrieb:
>> Hi,
>>
>> Remember when first all local AI was Python
>> and PyTorch APIs. And then suddently people started
>> using bare metal C/C++ Code. Here is the story:
>>
>> How it started:
>>
>> GPT-J or GPT-J-6B is an open-source large
>> language model (LLM) developed by EleutherAI
>> in 2021. As the name suggests, it is a
>> generative pre-trained transformer model
>> designed to produce human-like text that
>> continues from a prompt.
>> https://www.eleuther.ai/
>>
>> How it was going [Georgi Gerganov]:
>>
>> So a few days later comes out the LLaMA, I do
>> some calculations and I figure out “Okay, 65
>> billion parameters. You probably need about
>> 40 gigs of RAM, with 4-bit quantization. So
>> this can run on a MacBook. Why not do it?”
>>
>> Why I was able to do it so quickly - basically,
>> for all that I saw it’s pretty much GPT-J architecture
>> with some modifications, like some extra memorization
>> layers. It’s minor changes. Basically, again, the
>> existing code for the GPT-J, I just simply
>> modified it there, it happened pretty quickly.
>> https://changelog.com/podcast/532
>>
>> Georgi Gerganov, Bulgarian, now with Hugging
>> Face, ggml-cann also running on Chinese AI chips.
>> ggml Manifesto https://github.com/ggml-org/ggml
>>
>> Bye
>

[toc] | [prev] | [next] | [standalone]

#896545 — NPUs doing 2d chess comms (Manhattan Distance or L1 Norm) (Re: Tablet and phone UBS-C remote debugging)

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-01 14:12 +0200
Subject	NPUs doing 2d chess comms (Manhattan Distance or L1 Norm) (Re: Tablet and phone UBS-C remote debugging)
Message-ID	<114knri$pjus$3@solani.org>
In reply to	#896544

Hi,

Looking at the floor plan of a NPU:

Getting peak TOPS on a Ryzen AI 7 350 NPU
https://destevez.net/2026/05/getting-peak-tops-on-a-ryzen-ai-7-350-npu/

It seems to me comms between tiles takes
at least Manhattan Distance or L1 Norm time,
if there is no comms congestion

But how does a packet travel? This way:

+----E
|
|
S

Or this way, from start S to end E:

    +-E
   +
  +
S

And what does the chip do if there is
traffic congestion? Some papers are
here, possibly an old problem giving

that processor "cubes" are nothing new.
But a "cube" would be 3D and not 2D.
This paper is old from 2007 or so:

Routing Algorithms for 2D NoC Architectures
http://cva.stanford.edu/classes/ee382c/research/2DRouting.pdf

Bye

Mild Shock schrieb:
> Hi,
> 
> Tablets and phone are more annoying to
> use with WebGPU. The usual browsers don't
> have a Chrome DevTools panel integrated,
> 
> so that one could do JavaScript Debugging
> directly on the device. Instead one has to
> use a desktop machine, and connect the
> 
> device via UBS-C , and start a Chrome
> Browser there . And then start a Chrome
> DevTools panel alone, that is pair with
> 
> the device, via UBS-C cable. So this way
> I already see where it crashes on the
> tablets and phone:
> 
> await output.mapAsync(GPUMapMode.READ)
> Unhandled Promise Rejection: OperationError
> 
> The above is the error that one can re-produce
> already here with this test:
> 
> 11.4 Giga Lips with a Budget Laptop
> https://github.com/Jean-Luc-Picard-2021/gigabudget
> 
> Not sure what exactly happens. Maybe
> a form of timeout or device lost, that the
> primitive HTML / JavaScript doesn't handle
> 
> gracefully yet. Maybe redimensioning the
> test, so that it consumes less time would
> help. Who knows? Will see. For production
> 
> use of a GPU integration I have to anyway
> provide work slicing it seems.
> 
> Bye
> 
> Mild Shock schrieb:
>> Hi,
>>
>> Why does this Lama have a red pyjama.
>> Oh, its a baby Lama. Its still in the cradle
>> and needs some training:
>>
>> RedPajama-Data-v2
>> https://github.com/togethercomputer/RedPajama-Data
>>
>> But then Andrej Karpathy recently showed
>> GPT-2 training on rented GPUs for less
>> than 100 USD in less then 2 hours.
>>
>> So where do these grown up Lamas go.
>> Well Georgi Gerganov prefered C++/C
>> when he shouted Llama Llama Red Pyjama.
>>
>> But you also find WebLLM, wrapping the
>> underlying C++/C GPU interface via the
>> W3C standard WebGPU / WGSL, with JavaScript:
>>
>> In-Browser LLM Inference Engine
>> https://webllm.mlc.ai/
>>
>> My experience with WebLLM 6 months
>> ago on an iPad Pro 2024, still a little early
>> stage performance and robustness.
>>
>> But hey hardware of AI mobile iGPUs is
>> still evolving, and AI laptop, AI smartphones
>> and AI tablets, will soon feature Chinese
>>
>> hardware such some new Kirin AI in 2027.
>>
>> Bye
>>
>> Mild Shock schrieb:
>>> Hi,
>>>
>>> Remember when first all local AI was Python
>>> and PyTorch APIs. And then suddently people started
>>> using bare metal C/C++ Code. Here is the story:
>>>
>>> How it started:
>>>
>>> GPT-J or GPT-J-6B is an open-source large
>>> language model (LLM) developed by EleutherAI
>>> in 2021. As the name suggests, it is a
>>> generative pre-trained transformer model
>>> designed to produce human-like text that
>>> continues from a prompt.
>>> https://www.eleuther.ai/
>>>
>>> How it was going [Georgi Gerganov]:
>>>
>>> So a few days later comes out the LLaMA, I do
>>> some calculations and I figure out “Okay, 65
>>> billion parameters. You probably need about
>>> 40 gigs of RAM, with 4-bit quantization. So
>>> this can run on a MacBook. Why not do it?”
>>>
>>> Why I was able to do it so quickly - basically,
>>> for all that I saw it’s pretty much GPT-J architecture
>>> with some modifications, like some extra memorization
>>> layers. It’s minor changes. Basically, again, the
>>> existing code for the GPT-J, I just simply
>>> modified it there, it happened pretty quickly.
>>> https://changelog.com/podcast/532
>>>
>>> Georgi Gerganov, Bulgarian, now with Hugging
>>> Face, ggml-cann also running on Chinese AI chips.
>>> ggml Manifesto https://github.com/ggml-org/ggml
>>>
>>> Bye
>>
>

[toc] | [prev] | [next] | [standalone]

#896546 — NACK retransmission might double Manhattan Distance (Re: NPUs doing 2d chess comms)

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-01 14:24 +0200
Subject	NACK retransmission might double Manhattan Distance (Re: NPUs doing 2d chess comms)
Message-ID	<114kohb$pkdq$3@solani.org>
In reply to	#896545

Hi,

As easy as queues and FIFO objects might
sound. They don't like congestion. NACK for
retransmission might double the Manhattan Distance:

You have not only start
S to end E communication:

+----E
|
|
S

You might also have ACK or NACK
from E or midpoints back to S:

    S'
   +
  +
E'

Ok, I made that up, I have no idea what a flit is,
when the author wrote this here:

"Packet flits are held in the FIFO which can
be used to determine back pressure. Dropping flits
in a NoC may not be possible since these
architectures may not provide an end-to-end
protocol for retransmission."

Routing Algorithms for 2D NoC Architectures
http://cva.stanford.edu/classes/ee382c/research/2DRouting.pdf

Bye

Mild Shock schrieb:
> Hi,
> 
> Looking at the floor plan of a NPU:
> 
> Getting peak TOPS on a Ryzen AI 7 350 NPU
> https://destevez.net/2026/05/getting-peak-tops-on-a-ryzen-ai-7-350-npu/
> 
> It seems to me comms between tiles takes
> at least Manhattan Distance or L1 Norm time,
> if there is no comms congestion
> 
> But how does a packet travel? This way:
> 
> +----E
> |
> |
> S
> 
> Or this way, from start S to end E:
> 
>     +-E
>    +
>   +
> S
> 
> And what does the chip do if there is
> traffic congestion? Some papers are
> here, possibly an old problem giving
> 
> that processor "cubes" are nothing new.
> But a "cube" would be 3D and not 2D.
> This paper is old from 2007 or so:
> 
> Routing Algorithms for 2D NoC Architectures
> http://cva.stanford.edu/classes/ee382c/research/2DRouting.pdf
> 
> Bye

[toc] | [prev] | [next] | [standalone]

#896550 — I am using WebGPU, and not WebGL (Re: NACK retransmission might double Manhattan Distance)

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-02 00:47 +0200
Subject	I am using WebGPU, and not WebGL (Re: NACK retransmission might double Manhattan Distance)
Message-ID	<114lt1j$qdjc$2@solani.org>
In reply to	#896546

Hi,

WebGPU and WebGL are two different things. I explained
that towards you already like 3-5 times.

 > Of course we can make a special texture to handle it.

You still don't understand that I am using WebGPU,
and not WebGL. WebGPU has three improvements,
that from your talking are missing in WebGL?

- It has compute shaders
- It has arrays
- It has structs
- What else?

I didn't use structs in my example, although Gemini
nearly forced me to use structs. But you could
use a struct with fields and some of these arrays

to represent a queue. But here in this example
that is open source, I only used flat arrays. I
nowhere needed to abuse textures to store something:

11.4 Giga Lips with a Budget Laptop
https://github.com/Jean-Luc-Picard-2021/gigabudget

You can study the source code, the arrays have
CUDA inspired binding annotations but are not
CUDA but rather WGSL:

Hack VM as a Compute Shader in WGSL
@group(0) @binding(0) var<storage, read> code: array<i32>;
@group(0) @binding(1) var<storage, read_write> state: array<i32>;
https://github.com/Jean-Luc-Picard-2021/gigabudget/blob/main/course/example63/boot.mjs

You can say whether a buffer is read, or read_write.
Buffers can be transfered from CPU to GPU, before
running commands, and transfered back from GPU to

CPU after running commands. The use case that
you find on GitHub uses both. Namely also fetching
results via a buffer, to then show them in

the HTML page. Shouldn't be much a problem to
run the example at home locally, all you need is
a HTTPS server. But the example is not yet queues,

but it already shows the foundation, which is WebGPU
with its language WGSL and not WebGL with its language
GLSL. These are two different things.

I explained that towards you already like 3-5 times.

Bye

Chris M. Thomasson schrieb:
 > On 8/1/2026 5:22 AM, Mild Shock wrote:
 >> Hi,
 >>
 >> As easy as queues and FIFO objects might
 >> sound. They don't like congestion. NACK for
 >> retransmission might double the Manhattan Distance:
 > [...]
 >
 > You are going to need a place to allocate nodes in the compute 
shader. Of course we can make a special texture to handle it. But, we 
need to strive to avoid a wait condition. I don't want a compute shader 
to spin. Yes, CAS can be used, but, try to make it be used as a "state 
machine", where the transitions from states are atomic. Try to avoid it 
making a loop, where we loop on failure.


Mild Shock schrieb:
> Hi,
> 
> As easy as queues and FIFO objects might
> sound. They don't like congestion. NACK for
> retransmission might double the Manhattan Distance:
> 
> You have not only start
> S to end E communication:
> 
> +----E
> |
> |
> S
> 
> You might also have ACK or NACK
> from E or midpoints back to S:
> 
>     S'
>    +
>   +
> E'
> 
> Ok, I made that up, I have no idea what a flit is,
> when the author wrote this here:
> 
> "Packet flits are held in the FIFO which can
> be used to determine back pressure. Dropping flits
> in a NoC may not be possible since these
> architectures may not provide an end-to-end
> protocol for retransmission."
> 
> Routing Algorithms for 2D NoC Architectures
> http://cva.stanford.edu/classes/ee382c/research/2DRouting.pdf
> 
> Bye
> 
> Mild Shock schrieb:
>> Hi,
>>
>> Looking at the floor plan of a NPU:
>>
>> Getting peak TOPS on a Ryzen AI 7 350 NPU
>> https://destevez.net/2026/05/getting-peak-tops-on-a-ryzen-ai-7-350-npu/
>>
>> It seems to me comms between tiles takes
>> at least Manhattan Distance or L1 Norm time,
>> if there is no comms congestion
>>
>> But how does a packet travel? This way:
>>
>> +----E
>> |
>> |
>> S
>>
>> Or this way, from start S to end E:
>>
>>     +-E
>>    +
>>   +
>> S
>>
>> And what does the chip do if there is
>> traffic congestion? Some papers are
>> here, possibly an old problem giving
>>
>> that processor "cubes" are nothing new.
>> But a "cube" would be 3D and not 2D.
>> This paper is old from 2007 or so:
>>
>> Routing Algorithms for 2D NoC Architectures
>> http://cva.stanford.edu/classes/ee382c/research/2DRouting.pdf
>>
>> Bye

[toc] | [prev] | [next] | [standalone]

#896554 — Texture inside my compute shader makes no sense (Re: I am using WebGPU, and not WebGL)

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-02 02:40 +0200
Subject	Texture inside my compute shader makes no sense (Re: I am using WebGPU, and not WebGL)
Message-ID	<114m3mh$qh7p$3@solani.org>
In reply to	#896550

Hi,

 > It has textures to work with in the pipeline.

Hi,

Why would I use text inside my compute shader.
Could you tell me. The Hack VM doesn't do
textures. You are confused. There is nothing

about textures here:

11.4 Giga Lips with a Budget Laptop
https://github.com/Jean-Luc-Picard-2021/gigabudget

You can read the text , it says nowhere
consume or produce textures. Its not a rendering
application. I use the compute shader to run Prolog:

"At the end of 2025 we acquired a couple of
AI Laptops , that were still cheap, since
RAM prices had not yet rocketed. The intend
was to tap into the Copilot+ certified hardware,
and shave off some of the TOPS to do Prolog
inferencing. Amazingly our π-WAM can
churn 11.4 GIGA LIPS.

GPUs have evolved form lock-step to independent
thread scheduling. This made it possible to
port the Hack VM variant, that forms the basis
for our π-WAM, to WebGPU computer shaders.
Using NUM_SHADERS = 4096 we could produce
11.4 Giga Lips on a Ryzen AI 7 350 w/ Radeon 860M."

Bye

Mild Shock schrieb:
> Hi,
> 
> WebGPU and WebGL are two different things. I explained
> that towards you already like 3-5 times.
> 
>  > Of course we can make a special texture to handle it.
> 
> You still don't understand that I am using WebGPU,
> and not WebGL. WebGPU has three improvements,
> that from your talking are missing in WebGL?
> 
> - It has compute shaders
> - It has arrays
> - It has structs
> - What else?
> 
> I didn't use structs in my example, although Gemini
> nearly forced me to use structs. But you could
> use a struct with fields and some of these arrays
> 
> to represent a queue. But here in this example
> that is open source, I only used flat arrays. I
> nowhere needed to abuse textures to store something:
> 
> 11.4 Giga Lips with a Budget Laptop
> https://github.com/Jean-Luc-Picard-2021/gigabudget
> 
> You can study the source code, the arrays have
> CUDA inspired binding annotations but are not
> CUDA but rather WGSL:
> 
> Hack VM as a Compute Shader in WGSL
> @group(0) @binding(0) var<storage, read> code: array<i32>;
> @group(0) @binding(1) var<storage, read_write> state: array<i32>;
> https://github.com/Jean-Luc-Picard-2021/gigabudget/blob/main/course/example63/boot.mjs 
> 
> 
> You can say whether a buffer is read, or read_write.
> Buffers can be transfered from CPU to GPU, before
> running commands, and transfered back from GPU to
> 
> CPU after running commands. The use case that
> you find on GitHub uses both. Namely also fetching
> results via a buffer, to then show them in
> 
> the HTML page. Shouldn't be much a problem to
> run the example at home locally, all you need is
> a HTTPS server. But the example is not yet queues,
> 
> but it already shows the foundation, which is WebGPU
> with its language WGSL and not WebGL with its language
> GLSL. These are two different things.
> 
> I explained that towards you already like 3-5 times.
> 
> Bye
> 
> Chris M. Thomasson schrieb:
>  > On 8/1/2026 5:22 AM, Mild Shock wrote:
>  >> Hi,
>  >>
>  >> As easy as queues and FIFO objects might
>  >> sound. They don't like congestion. NACK for
>  >> retransmission might double the Manhattan Distance:
>  > [...]
>  >
>  > You are going to need a place to allocate nodes in the compute 
> shader. Of course we can make a special texture to handle it. But, we 
> need to strive to avoid a wait condition. I don't want a compute shader 
> to spin. Yes, CAS can be used, but, try to make it be used as a "state 
> machine", where the transitions from states are atomic. Try to avoid it 
> making a loop, where we loop on failure.
> 
> 
> Mild Shock schrieb:
>> Hi,
>>
>> As easy as queues and FIFO objects might
>> sound. They don't like congestion. NACK for
>> retransmission might double the Manhattan Distance:
>>
>> You have not only start
>> S to end E communication:
>>
>> +----E
>> |
>> |
>> S
>>
>> You might also have ACK or NACK
>> from E or midpoints back to S:
>>
>>     S'
>>    +
>>   +
>> E'
>>
>> Ok, I made that up, I have no idea what a flit is,
>> when the author wrote this here:
>>
>> "Packet flits are held in the FIFO which can
>> be used to determine back pressure. Dropping flits
>> in a NoC may not be possible since these
>> architectures may not provide an end-to-end
>> protocol for retransmission."
>>
>> Routing Algorithms for 2D NoC Architectures
>> http://cva.stanford.edu/classes/ee382c/research/2DRouting.pdf
>>
>> Bye
>>
>> Mild Shock schrieb:
>>> Hi,
>>>
>>> Looking at the floor plan of a NPU:
>>>
>>> Getting peak TOPS on a Ryzen AI 7 350 NPU
>>> https://destevez.net/2026/05/getting-peak-tops-on-a-ryzen-ai-7-350-npu/
>>>
>>> It seems to me comms between tiles takes
>>> at least Manhattan Distance or L1 Norm time,
>>> if there is no comms congestion
>>>
>>> But how does a packet travel? This way:
>>>
>>> +----E
>>> |
>>> |
>>> S
>>>
>>> Or this way, from start S to end E:
>>>
>>>     +-E
>>>    +
>>>   +
>>> S
>>>
>>> And what does the chip do if there is
>>> traffic congestion? Some papers are
>>> here, possibly an old problem giving
>>>
>>> that processor "cubes" are nothing new.
>>> But a "cube" would be 3D and not 2D.
>>> This paper is old from 2007 or so:
>>>
>>> Routing Algorithms for 2D NoC Architectures
>>> http://cva.stanford.edu/classes/ee382c/research/2DRouting.pdf
>>>
>>> Bye
>

[toc] | [prev] | [next] | [standalone]

#896555 — Prolog inferencing and not canvasing fancy stuff (Re: Texture inside my compute shader makes no sense)

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-02 02:42 +0200
Subject	Prolog inferencing and not canvasing fancy stuff (Re: Texture inside my compute shader makes no sense)
Message-ID	<114m3q3$qhf7$1@solani.org>
In reply to	#896554

Hi,

 > But, I still don't know what you main goal is?

It explicity says "Prolog inferencing" in
this phrase:

 > shave off some of the TOPS to do Prolog inferencing

It nowhere says draw some fancy stuff into
a Web canvas.

Bye

Mild Shock schrieb:
> Hi,
> 
>  > It has textures to work with in the pipeline.
> 
> Hi,
> 
> Why would I use text inside my compute shader.
> Could you tell me. The Hack VM doesn't do
> textures. You are confused. There is nothing
> 
> about textures here:
> 
> 11.4 Giga Lips with a Budget Laptop
> https://github.com/Jean-Luc-Picard-2021/gigabudget
> 
> You can read the text , it says nowhere
> consume or produce textures. Its not a rendering
> application. I use the compute shader to run Prolog:
> 
> "At the end of 2025 we acquired a couple of
> AI Laptops , that were still cheap, since
> RAM prices had not yet rocketed. The intend
> was to tap into the Copilot+ certified hardware,
> and shave off some of the TOPS to do Prolog
> inferencing. Amazingly our π-WAM can
> churn 11.4 GIGA LIPS.
> 
> GPUs have evolved form lock-step to independent
> thread scheduling. This made it possible to
> port the Hack VM variant, that forms the basis
> for our π-WAM, to WebGPU computer shaders.
> Using NUM_SHADERS = 4096 we could produce
> 11.4 Giga Lips on a Ryzen AI 7 350 w/ Radeon 860M."
> 
> Bye
> 
> Mild Shock schrieb:
>> Hi,
>>
>> WebGPU and WebGL are two different things. I explained
>> that towards you already like 3-5 times.
>>
>>  > Of course we can make a special texture to handle it.
>>
>> You still don't understand that I am using WebGPU,
>> and not WebGL. WebGPU has three improvements,
>> that from your talking are missing in WebGL?
>>
>> - It has compute shaders
>> - It has arrays
>> - It has structs
>> - What else?
>>
>> I didn't use structs in my example, although Gemini
>> nearly forced me to use structs. But you could
>> use a struct with fields and some of these arrays
>>
>> to represent a queue. But here in this example
>> that is open source, I only used flat arrays. I
>> nowhere needed to abuse textures to store something:
>>
>> 11.4 Giga Lips with a Budget Laptop
>> https://github.com/Jean-Luc-Picard-2021/gigabudget
>>
>> You can study the source code, the arrays have
>> CUDA inspired binding annotations but are not
>> CUDA but rather WGSL:
>>
>> Hack VM as a Compute Shader in WGSL
>> @group(0) @binding(0) var<storage, read> code: array<i32>;
>> @group(0) @binding(1) var<storage, read_write> state: array<i32>;
>> https://github.com/Jean-Luc-Picard-2021/gigabudget/blob/main/course/example63/boot.mjs 
>>
>>
>> You can say whether a buffer is read, or read_write.
>> Buffers can be transfered from CPU to GPU, before
>> running commands, and transfered back from GPU to
>>
>> CPU after running commands. The use case that
>> you find on GitHub uses both. Namely also fetching
>> results via a buffer, to then show them in
>>
>> the HTML page. Shouldn't be much a problem to
>> run the example at home locally, all you need is
>> a HTTPS server. But the example is not yet queues,
>>
>> but it already shows the foundation, which is WebGPU
>> with its language WGSL and not WebGL with its language
>> GLSL. These are two different things.
>>
>> I explained that towards you already like 3-5 times.
>>
>> Bye
>>
>> Chris M. Thomasson schrieb:
>>  > On 8/1/2026 5:22 AM, Mild Shock wrote:
>>  >> Hi,
>>  >>
>>  >> As easy as queues and FIFO objects might
>>  >> sound. They don't like congestion. NACK for
>>  >> retransmission might double the Manhattan Distance:
>>  > [...]
>>  >
>>  > You are going to need a place to allocate nodes in the compute 
>> shader. Of course we can make a special texture to handle it. But, we 
>> need to strive to avoid a wait condition. I don't want a compute 
>> shader to spin. Yes, CAS can be used, but, try to make it be used as a 
>> "state machine", where the transitions from states are atomic. Try to 
>> avoid it making a loop, where we loop on failure.
>>
>>
>> Mild Shock schrieb:
>>> Hi,
>>>
>>> As easy as queues and FIFO objects might
>>> sound. They don't like congestion. NACK for
>>> retransmission might double the Manhattan Distance:
>>>
>>> You have not only start
>>> S to end E communication:
>>>
>>> +----E
>>> |
>>> |
>>> S
>>>
>>> You might also have ACK or NACK
>>> from E or midpoints back to S:
>>>
>>>     S'
>>>    +
>>>   +
>>> E'
>>>
>>> Ok, I made that up, I have no idea what a flit is,
>>> when the author wrote this here:
>>>
>>> "Packet flits are held in the FIFO which can
>>> be used to determine back pressure. Dropping flits
>>> in a NoC may not be possible since these
>>> architectures may not provide an end-to-end
>>> protocol for retransmission."
>>>
>>> Routing Algorithms for 2D NoC Architectures
>>> http://cva.stanford.edu/classes/ee382c/research/2DRouting.pdf
>>>
>>> Bye
>>>
>>> Mild Shock schrieb:
>>>> Hi,
>>>>
>>>> Looking at the floor plan of a NPU:
>>>>
>>>> Getting peak TOPS on a Ryzen AI 7 350 NPU
>>>> https://destevez.net/2026/05/getting-peak-tops-on-a-ryzen-ai-7-350-npu/
>>>>
>>>> It seems to me comms between tiles takes
>>>> at least Manhattan Distance or L1 Norm time,
>>>> if there is no comms congestion
>>>>
>>>> But how does a packet travel? This way:
>>>>
>>>> +----E
>>>> |
>>>> |
>>>> S
>>>>
>>>> Or this way, from start S to end E:
>>>>
>>>>     +-E
>>>>    +
>>>>   +
>>>> S
>>>>
>>>> And what does the chip do if there is
>>>> traffic congestion? Some papers are
>>>> here, possibly an old problem giving
>>>>
>>>> that processor "cubes" are nothing new.
>>>> But a "cube" would be 3D and not 2D.
>>>> This paper is old from 2007 or so:
>>>>
>>>> Routing Algorithms for 2D NoC Architectures
>>>> http://cva.stanford.edu/classes/ee382c/research/2DRouting.pdf
>>>>
>>>> Bye
>>
>

[toc] | [prev] | [next] | [standalone]

#896547 — Re: Tablet and phone UBS-C remote debugging (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])

From	Taskfreak <taskfreak@gmail.com>
Date	2026-08-01 13:58 -0500
Subject	Re: Tablet and phone UBS-C remote debugging (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])
Message-ID	<114lfkf$plpm$1@solani.org>
In reply to	#896544

On 8/1/26 05:19, Mild Shock wrote:
> Hi,
> 
> Tablets and phone are more annoying to
> use with WebGPU. The usual browsers don't
> have a Chrome DevTools panel integrated,
> 
> so that one could do JavaScript Debugging
> directly on the device. Instead one has to
> use a desktop machine, and connect the
> 
> device via UBS-C , and start a Chrome
> Browser there . And then start a Chrome
> DevTools panel alone, that is pair with
> 
> the device, via UBS-C cable. So this way
> I already see where it crashes on the
> tablets and phone:
> 
> await output.mapAsync(GPUMapMode.READ)
> Unhandled Promise Rejection: OperationError
> 
> The above is the error that one can re-produce
> already here with this test:
> 
> 11.4 Giga Lips with a Budget Laptop
> https://github.com/Jean-Luc-Picard-2021/gigabudget
> 
> Not sure what exactly happens. Maybe
> a form of timeout or device lost, that the
> primitive HTML / JavaScript doesn't handle
> 
> gracefully yet. Maybe redimensioning the
> test, so that it consumes less time would
> help. Who knows? Will see. For production
> 
> use of a GPU integration I have to anyway
> provide work slicing it seems.
> 
> Bye
> 

I know that you are Hanson and I know that you are a cocksucker.

My question is, though, do you know, do, vomit, defecate, smell, 
evaporate, sweat, ooze in, ooze out, fart, see, hear, sense, taste, and 
GESTATE anything other than programming?

Programming is just a tool, you know. It is nothing by itself worth even 
mentioning.

[toc] | [prev] | [next] | [standalone]

#896556 — Chris M. Thomasson can ask 100 more questions (Was: Tablet and phone UBS-C remote debugging)

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-02 02:46 +0200
Subject	Chris M. Thomasson can ask 100 more questions (Was: Tablet and phone UBS-C remote debugging)
Message-ID	<114m40m$qhhl$1@solani.org>
In reply to	#896547

Hi,

Chris M. Thomasson can ask 100 more questions.
I will happily answer them. But maybe I should
make a Wiki to explain the ever same things:

 > But, I still don't know what you main goal is?
The goal is "Prolog inferencing"

 > It has textures to work with in the pipeline.
I don't need textures for "Prolog inferencing"

98 more questions to go, don't give up!

Bye

Taskfreak schrieb:
> On 8/1/26 05:19, Mild Shock wrote:
>> Hi,
>>
>> Tablets and phone are more annoying to
>> use with WebGPU. The usual browsers don't
>> have a Chrome DevTools panel integrated,
>>
>> so that one could do JavaScript Debugging
>> directly on the device. Instead one has to
>> use a desktop machine, and connect the
>>
>> device via UBS-C , and start a Chrome
>> Browser there . And then start a Chrome
>> DevTools panel alone, that is pair with
>>
>> the device, via UBS-C cable. So this way
>> I already see where it crashes on the
>> tablets and phone:
>>
>> await output.mapAsync(GPUMapMode.READ)
>> Unhandled Promise Rejection: OperationError
>>
>> The above is the error that one can re-produce
>> already here with this test:
>>
>> 11.4 Giga Lips with a Budget Laptop
>> https://github.com/Jean-Luc-Picard-2021/gigabudget
>>
>> Not sure what exactly happens. Maybe
>> a form of timeout or device lost, that the
>> primitive HTML / JavaScript doesn't handle
>>
>> gracefully yet. Maybe redimensioning the
>> test, so that it consumes less time would
>> help. Who knows? Will see. For production
>>
>> use of a GPU integration I have to anyway
>> provide work slicing it seems.
>>
>> Bye
>>
> 
> I know that you are Hanson and I know that you are a cocksucker.
> 
> My question is, though, do you know, do, vomit, defecate, smell, 
> evaporate, sweat, ooze in, ooze out, fart, see, hear, sense, taste, and 
> GESTATE anything other than programming?
> 
> Programming is just a tool, you know. It is nothing by itself worth even 
> mentioning.
> 
>

[toc] | [prev] | [next] | [standalone]

#896557 — npm install webgpu [Google Dawn] (Re: Chris M. Thomasson can ask 100 more questions)

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-02 03:03 +0200
Subject	npm install webgpu [Google Dawn] (Re: Chris M. Thomasson can ask 100 more questions)
Message-ID	<114m50h$qi3v$2@solani.org>
In reply to	#896556

Hi,

Ok, following the instructions here:

npm install webgpu
https://github.com/dawn-gpu/node-webgpu

I can now run webgpu also from CLI:

 >node.exe dogelog.mjs
Dogelog Spieler 2.2.5, Node, JavaScript 26.4.0
(c) 1985-2026, XLOG Technologies AG, Schweiz

?- ensure_loaded(library(edge/furryhaze)).
true.

?- between(1,3,_), time(expedite((between(1,100,_),
between(1,100,_), between(1,100,_)), [size(4096)])), fail.
% Zeit 1037.994 ms, GC 0.000 ms, Lips 111 k
% Zeit 1091.131 ms, GC 0.000 ms, Lips 106 k
% Zeit 1045.274 ms, GC 0.000 ms, Lips 110 k
fail.

Same benchmark result as in the browser.
Now I can rent a bigger GPU by the hour
and do some easy CLI testing.

LoL

Bye

Mild Shock schrieb:
> Hi,
> 
> Chris M. Thomasson can ask 100 more questions.
> I will happily answer them. But maybe I should
> make a Wiki to explain the ever same things:
> 
>  > But, I still don't know what you main goal is?
> The goal is "Prolog inferencing"
> 
>  > It has textures to work with in the pipeline.
> I don't need textures for "Prolog inferencing"
> 
> 98 more questions to go, don't give up!
> 
> Bye
> 
> Taskfreak schrieb:
>> On 8/1/26 05:19, Mild Shock wrote:
>>> Hi,
>>>
>>> Tablets and phone are more annoying to
>>> use with WebGPU. The usual browsers don't
>>> have a Chrome DevTools panel integrated,
>>>
>>> so that one could do JavaScript Debugging
>>> directly on the device. Instead one has to
>>> use a desktop machine, and connect the
>>>
>>> device via UBS-C , and start a Chrome
>>> Browser there . And then start a Chrome
>>> DevTools panel alone, that is pair with
>>>
>>> the device, via UBS-C cable. So this way
>>> I already see where it crashes on the
>>> tablets and phone:
>>>
>>> await output.mapAsync(GPUMapMode.READ)
>>> Unhandled Promise Rejection: OperationError
>>>
>>> The above is the error that one can re-produce
>>> already here with this test:
>>>
>>> 11.4 Giga Lips with a Budget Laptop
>>> https://github.com/Jean-Luc-Picard-2021/gigabudget
>>>
>>> Not sure what exactly happens. Maybe
>>> a form of timeout or device lost, that the
>>> primitive HTML / JavaScript doesn't handle
>>>
>>> gracefully yet. Maybe redimensioning the
>>> test, so that it consumes less time would
>>> help. Who knows? Will see. For production
>>>
>>> use of a GPU integration I have to anyway
>>> provide work slicing it seems.
>>>
>>> Bye
>>>
>>
>> I know that you are Hanson and I know that you are a cocksucker.
>>
>> My question is, though, do you know, do, vomit, defecate, smell, 
>> evaporate, sweat, ooze in, ooze out, fart, see, hear, sense, taste, 
>> and GESTATE anything other than programming?
>>
>> Programming is just a tool, you know. It is nothing by itself worth 
>> even mentioning.
>>
>>
>

[toc] | [prev] | [next] | [standalone]

#896562 — GPU elasticity was already invented in 2008 with CUDA (Re: npm install webgpu [Google Dawn])

From	Mild Shock <janburse@fastmail.fm>
Date	2026-08-03 00:01 +0200
Subject	GPU elasticity was already invented in 2008 with CUDA (Re: npm install webgpu [Google Dawn])
Message-ID	<114oen0$rlg9$4@solani.org>
In reply to	#896557

Hi,

Chris M. Thomasson schrieb:

 > Strive to never make a compute shader wait
 > on something, like an empty condition of a queue, stack.

You are such a moron. GPU elasticity was
already invented in 2008 with CUDA. I posted
this quote already:

"CUDA™ TEChNOLOGY UNLOCkS ThE
POWER OF TESLA MANY-CORE PROCESSORS

The CUDA C compiler simplifies many-core
programming by enabling code development
in a high-level language and optimizing code
to run on systems without knowledge of how

many cores are in the hardware. CUDA
applications automatically take advantage of
more cores or fewer cores in a system, so
they can scale from entry-level notebook

GPUs to high end GPUs in technical workstations
and further into racks of GPUs in data centers.
This allows developers to “code once” and
deploy on a range of systems, as well as scale

forward in time as future GPUs deliver more
performance per watt and more cores per
processor. The benefit for software users is
the opportunity to boost computing performance

simply by adding GPUs or using their existing GPUs in new ways"
https://www.nvidia.com/docs/IO/43395/NV_DS_Tesla_S1070_US_Jun08_NV_LR_Final.pdf

Today elasticity is on logical thread aka task level,
not only on "core" level or something. Don't know
exactly what CUDA did back them, maybe only

a submit elasticity, like a time sharing system. Today
you have quite some run elasticity on modern machines,
for your logical threads. Even in budget laptops

like a Ryzen AI 7 350 /w Radeon 850M.

Bye

Mild Shock schrieb:
> Hi,
> 
> Ok, following the instructions here:
> 
> npm install webgpu
> https://github.com/dawn-gpu/node-webgpu
> 
> I can now run webgpu also from CLI:
> 
>  >node.exe dogelog.mjs
> Dogelog Spieler 2.2.5, Node, JavaScript 26.4.0
> (c) 1985-2026, XLOG Technologies AG, Schweiz
> 
> ?- ensure_loaded(library(edge/furryhaze)).
> true.
> 
> ?- between(1,3,_), time(expedite((between(1,100,_),
> between(1,100,_), between(1,100,_)), [size(4096)])), fail.
> % Zeit 1037.994 ms, GC 0.000 ms, Lips 111 k
> % Zeit 1091.131 ms, GC 0.000 ms, Lips 106 k
> % Zeit 1045.274 ms, GC 0.000 ms, Lips 110 k
> fail.
> 
> Same benchmark result as in the browser.
> Now I can rent a bigger GPU by the hour
> and do some easy CLI testing.
> 
> LoL
> 
> Bye
> 
> Mild Shock schrieb:
>> Hi,
>>
>> Chris M. Thomasson can ask 100 more questions.
>> I will happily answer them. But maybe I should
>> make a Wiki to explain the ever same things:
>>
>>  > But, I still don't know what you main goal is?
>> The goal is "Prolog inferencing"
>>
>>  > It has textures to work with in the pipeline.
>> I don't need textures for "Prolog inferencing"
>>
>> 98 more questions to go, don't give up!
>>
>> Bye
>>
>> Taskfreak schrieb:
>>> On 8/1/26 05:19, Mild Shock wrote:
>>>> Hi,
>>>>
>>>> Tablets and phone are more annoying to
>>>> use with WebGPU. The usual browsers don't
>>>> have a Chrome DevTools panel integrated,
>>>>
>>>> so that one could do JavaScript Debugging
>>>> directly on the device. Instead one has to
>>>> use a desktop machine, and connect the
>>>>
>>>> device via UBS-C , and start a Chrome
>>>> Browser there . And then start a Chrome
>>>> DevTools panel alone, that is pair with
>>>>
>>>> the device, via UBS-C cable. So this way
>>>> I already see where it crashes on the
>>>> tablets and phone:
>>>>
>>>> await output.mapAsync(GPUMapMode.READ)
>>>> Unhandled Promise Rejection: OperationError
>>>>
>>>> The above is the error that one can re-produce
>>>> already here with this test:
>>>>
>>>> 11.4 Giga Lips with a Budget Laptop
>>>> https://github.com/Jean-Luc-Picard-2021/gigabudget
>>>>
>>>> Not sure what exactly happens. Maybe
>>>> a form of timeout or device lost, that the
>>>> primitive HTML / JavaScript doesn't handle
>>>>
>>>> gracefully yet. Maybe redimensioning the
>>>> test, so that it consumes less time would
>>>> help. Who knows? Will see. For production
>>>>
>>>> use of a GPU integration I have to anyway
>>>> provide work slicing it seems.
>>>>
>>>> Bye
>>>>
>>>
>>> I know that you are Hanson and I know that you are a cocksucker.
>>>
>>> My question is, though, do you know, do, vomit, defecate, smell, 
>>> evaporate, sweat, ooze in, ooze out, fart, see, hear, sense, taste, 
>>> and GESTATE anything other than programming?
>>>
>>> Programming is just a tool, you know. It is nothing by itself worth 
>>> even mentioning.
>>>
>>>
>>
>

[toc] | [prev] | [next] | [standalone]

Page 4 of 5 — ← Prev page 1 2 3 [4] 5 Next page →

csiph-web

The Wuhan Virus that destroyed Python [ggml Manifesto]

Contents

#896530 — Not declarative with PHI (Φ) nodes (Re: MIPS is a big Huffman mess [But Hack could do it])

#896535 — Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch)

#896536 — Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch)

#896537 — Re: MIPS is a big Huffman mess [But Hack could do it] (Re: I wrote Hack VM for π-WAM from scratch)

#896538 — Quo Vadis: Extend investigations to WebNN (Was: I wrote Hack VM for π-WAM from scratch [4 Months total JavaScript, Python and Java])

#896481 — Got it. Or are you too stupid? [New Usenet Mantra] (Was: The Wuhan Virus that destroyed Python [ggml Manifesto])

#896505 — Lamas in a cradle and Lamas on the edge [Red Pyjama] (Re: The Wuhan Virus that destroyed Python [ggml Manifesto])

#896506 — AI Accelerators and ISO Prolog multi-threading (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])

#896507 — Actor/Erlang is dead, no Thread and Mailbox conflation [golang channels] (Re: AI Accelerators and ISO Prolog multi-threading) (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])

#896540 — Can library(ironpaw) repurpose FFT hardware [Glimps into Ryzen AI 7 350] (Re: Actor/Erlang is dead, no Thread and Mailbox conflation )

#896544 — Tablet and phone UBS-C remote debugging (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])

#896545 — NPUs doing 2d chess comms (Manhattan Distance or L1 Norm) (Re: Tablet and phone UBS-C remote debugging)

#896546 — NACK retransmission might double Manhattan Distance (Re: NPUs doing 2d chess comms)

#896550 — I am using WebGPU, and not WebGL (Re: NACK retransmission might double Manhattan Distance)

#896554 — Texture inside my compute shader makes no sense (Re: I am using WebGPU, and not WebGL)

#896555 — Prolog inferencing and not canvasing fancy stuff (Re: Texture inside my compute shader makes no sense)

#896547 — Re: Tablet and phone UBS-C remote debugging (Re: Lamas in a cradle and Lamas on the edge [Red Pyjama])

#896556 — Chris M. Thomasson can ask 100 more questions (Was: Tablet and phone UBS-C remote debugging)

#896557 — npm install webgpu [Google Dawn] (Re: Chris M. Thomasson can ask 100 more questions)

#896562 — GPU elasticity was already invented in 2008 with CUDA (Re: npm install webgpu [Google Dawn])