frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

ZKP's Aren't Age Verification Silver Bullets

https://www.eff.org/deeplinks/2026/08/zkps-arent-age-verification-silver-bullets
1•speckx•2m ago•0 comments

FTC Warns Retailers on Using Private Consumer Data to Raise Prices

https://www.wsj.com/business/ftc-warns-retailers-on-using-private-consumer-data-to-raise-prices-4...
1•impish9208•3m ago•1 comments

A Million and One Random Digits by Douglas Crockford

https://www.amazon.com/Million-Random-Digits-Millionplex-Library/dp/1949815048
1•gregsadetsky•3m ago•0 comments

Thoughts on dance music today informed by the Instagram perspective

http://energyflashbysimonreynolds.blogspot.com/2026/06/had-instagram-for-ages-but-never-got.html
2•mosiuerbarso•5m ago•0 comments

Eraser Diagrams: An open-source headless diagramming framework

https://github.com/eraserlabs/eraser-diagrams
2•jtadmor•6m ago•1 comments

Can you tell which AI-generated text is watermarked?

https://watermark-quiz.krishmatta.net/
2•nathan-barry•9m ago•0 comments

Meteoric origins of Egypt's first ironwork

https://blogs.ucl.ac.uk/museums/2013/09/01/23856/
1•Bluestein•9m ago•0 comments

WTF Are You Loading?

https://x-x.codes/posts/wtf-are-you-loading
1•abnercoimbre•10m ago•0 comments

Send a SAFE

https://www.ycombinator.com/safe
2•Finbarr•10m ago•0 comments

Show HN: Naeos – an engineering system for AI coding agents

https://github.com/NAEOS-foundation/naeos
2•bayu911•12m ago•0 comments

AiFi on AWS

https://www.coinbase.com/fr-fr/developer-platform/discover/launches/agentcore-ga
2•AnhTho_FR•14m ago•0 comments

WikiFM – Encyclopedia Radio

https://apps.apple.com/us/app/wikifm-encyclopedia-radio/id6800855289
2•t4t•16m ago•1 comments

Launch HN: OneCLI (YC S26) – OSS sandboxed agent harness for teams

https://github.com/onecli/onecli
4•guyb3•17m ago•0 comments

Attorney General Rob Bonta speaks after first day of Meta trial [video]

https://www.youtube.com/watch?v=o1gjjESzabg
2•natemurthy•19m ago•1 comments

Show HN: nanoAlphaZero – Train a grandmaster-level chess model in 24h with TPUs

https://github.com/wtedw/nanoAlphaZero
2•tdoubleu•20m ago•0 comments

Extensible Software in the Age of LLMs

https://jeremymorrell.dev/blog/extensible-software-in-the-age-of-llms/
3•coloneltcb•20m ago•0 comments

How Kubernetes Probes Work

https://ngrok.com/blog/probes
3•cyndunlop•21m ago•0 comments

InstrSem: Automatically Inferring Semantics of (Undocumented) CPU Instructions

https://roots.ec/publications/hetterich2026instrsem
2•matt_d•21m ago•0 comments

We've solved many medical mysteries. Where are the cures? [video]

https://www.ted.com/talks/saloni_dattani_we_ve_solved_many_medical_mysteries_where_are_the_cures
1•paulpauper•22m ago•0 comments

Extensibility Is the New Precondition

https://www.ivan.codes/blog/extensibility-is-the-precondition
2•deeshee•24m ago•0 comments

Things I want in a modern relational query language

https://sporks.space/2026/08/19/things-i-want-in-a-modern-relational-query-language/
1•birdculture•25m ago•0 comments

Claude watermark- science behind it

https://www.youtube.com/watch?v=FnAqruxx-QE
1•aymar_99•27m ago•0 comments

Chain-of-Thought Reasoning in the Wild Is Not Always Faithful

https://arxiv.org/abs/2503.08679
6•florianherrengt•27m ago•2 comments

How does wildfire smoke affect the economy?

https://phys.org/news/2026-08-wildfire-affect-economy.html
2•vinni2•29m ago•0 comments

Show HN: I am getting genuine questions

https://github.com/docbrain-ai/docbrain
2•bhanuhai2•30m ago•1 comments

We Stopped Paying for Linear

https://xiaofeidu.com/posts/linear-to-github-issues/
4•xiaofei_•31m ago•0 comments

If this algorithm runs too long, you can compress randomness

https://www.sidhantbansal.com/2026/Entropy-Stops-This-Algorithm/
1•sidhantbansal•36m ago•0 comments

What it felt like to hit the Hacker News front page

https://heyjonny.dev/posts/hitting-the-hacker-news-front-page/
2•heyjonny•36m ago•0 comments

AWS new AZ in eu-west-2 - beware of unexpected results

2•eddie_catflap•37m ago•0 comments

How Much Memory Does Your Agent Actually Need?

https://huggingface.co/blog/ibm-research/altk-evolve-hmm
2•Brajeshwar•37m ago•0 comments
Open in hackernews

Show HN: Brainfuck to RISC-V JIT compiler written in Zig

https://github.com/evelance/brainiac
5•0x000xca0xfe•1y ago
Hi everybody,

this was my project to learn Zig and RISC-V+x86_64 assembly.

Not sure if anybody is actually interested in yet another Brainfuck compiler, so I'll just write up some random things I learned while building it!

- A primitive assembly stitching compiler is 10x faster than the interpreter. Did not expect that.

- The generated x86 code is really bad (e.g. it always uses 6 or 7 byte sized instructions with 32-bit immediates when there are much smaller ones) but it doesn't really matter. Good code generated by GCC and clang for transpiled Brainfuck->C is not much faster as it's bottlenecked by memory accesses anyways.

- Zig is pretty far along actually. You can make serious projects with it!

- But the community seems to like self-punishment. Unused parameters and variables are hard errors and there is no way to disable that even for debug builds. Makes quickly commenting out part of the code a real PITA.

- I've had a miscompilation due to std.mem.span being broken and two source code breaks going from Zig 0.13 to 0.15 (std.mem.page_size got removed and ArrayList.popOrNull as well).

- But arbitrary size integers are fantastic! And well-defined two's complement behaviour!

Here is for example the code that encodes the c.beqz instruction:

  /// Branch if Equal to Zero (compressed): c.beqz rs1', offset -> beq rs1, x0, offset
  pub fn c_beqz(text: *std.ArrayList(u8), rs1: RV_X, offset: i9) !void {
      std.debug.assert(is3BitReg(rs1));
      std.debug.assert(@mod(offset, 2) == 0);
      const imm: u9 = @bitCast(offset);
      const RV_CB = packed struct(u16) {
          op: u2,
          offset5: u1,
          offset1_2: u2,
          offset6_7: u2,
          rsd_rs1_: u3,
          offset3_4: u2,
          offset8: u1,
          funct3: u3,
      };
      const ins = RV_CB {
          .op = 0x1,
          .offset5 = @truncate(imm >> 5),
          .offset1_2 = @truncate(imm >> 1),
          .offset6_7 = @truncate(imm >> 6),
          .rsd_rs1_ = @truncate(@intFromEnum(rs1) - 8),
          .offset3_4 = @truncate(imm >> 3),
          .offset8 = @truncate(imm >> 8),
          .funct3 = 0x6,
      };
      try appendInstruction(text, u16, @bitCast(ins));
  }
This is really nice as all the exotic integer sizes are actually checked, too.

- Zig support for Windows is good. Porting the project to Windows was very easy.

- When the RISC-V registers are carefully chosen, almost all instructions could be compressed in this projects.

- Compressed instructions and good branching code (using the branch instructions directly when the jump range is small enough instead of branching over a larger jump instruction) did not noticeably change performance on real hardware (OrangePi RV2).

- But somehow QEMU got a massive boost from that. Not sure why exactly.

So, that's about it!

I hope at least something was interesting...

Comments

sylware•1y ago
thumbs up for this project (everything RISC-V is usually).

I write rv64 assembly (nearly core only, without memory reservation instructions) and run it on x86_64 with a very small (x86_64 assembly written) interpreter.

And your are right, I have had thoughts about a "RISC-V" x86_64 compiler (but it will probably require some runtime unfortunately).

Hopefully, rv22+ hardware with ultra-performant µ-architecture and with the latest silicon process will happen sooner than we expect. One less PI toxic lock and cleaner, _really standard_ assembly (the end game of much software).

0x000xca0xfe•1y ago
Yeah I can't wait for a performant RISC-V core. Runtime code generation is so easy for RISC-V. I have many ideas or projects where I'd like to use it but it feels kinda pointless when JITed RISC-V machine code on current hardware gets destroyed by any half-decent x86 PC or Mac running naive C code.
sylware•1y ago
Well, here are the tricks: interpreted rv64 assembly will be "slow"... actually "slower" than x86_64 native code... but in many execution contexts, for many pieces of software, here the first trick: the "slow" interpreted rv64 assembly machine code will be... "fast" enough... The 2nd trick: I have control on my rv64 machine interpreter, and I can write native x86_64 acceleration assembly along side of a rv64 reference implementation (I planned to do just that for my CPU renderer in my wayland compositor... actually I have already AVX2 code for some of that, even though the sweet spot is AVX512, but don't have the hardware for this, yet).

And once we have this rv64 shiny hardware, certainly won't be a drop-in, but the distance to code will be minimal.

One important SDK thing: I am careful at using the smallest number of rv64 machine instructions (we tend to forget 'R' in "RISC-V" means 'R'educed...), and I use basic, really basic, C preprocessors instead of the assembler preprocessor in order to decouple the assembly code from a specific assembler preprocessor. I don't even use assembler pseudo-instructions, or ABI register names, neither compressed machine instructions.

On top of that: I don't use ELF, I use a super minimal executable/system interface dynamic shared library format of my own, omega idiotically simple, which I wrap in ELF binaries for transparent support. People have to come to realize, ELF complexity, for a executable/system interface dynamic shared library is utterly and completely obsolete, even a liability once you are looking for binary stability in time (cf games), proven over more than the last decade.