frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Block's Dorsey Outlines AI-Powered Vision to Cut Middle Managers

https://www.bloomberg.com/news/articles/2026-03-31/block-s-dorsey-outlines-ai-powered-vision-to-c...
1•doctaj•55s ago•1 comments

Overview Effect

https://en.wikipedia.org/wiki/Overview_effect
1•andyjohnson0•1m ago•0 comments

Unofficial Telegram client 'Nekogram' turned out to be a spyware

https://thebadinteger.github.io/nekogram-phone-exfiltration/
2•mathfailure•3m ago•0 comments

Lightweight IDE to Pair with Claude Code?

1•zupancik•4m ago•0 comments

Writing an LLM from scratch, part 32h – Interventions: full fat float32

https://www.gilesthomas.com/2026/04/llm-from-scratch-32h-interventions-full-fat-float32
1•gpjt•5m ago•0 comments

1400% surge in GitHub commits explains service issues

https://twitter.com/kdaigle/status/2040164759836778878
2•tonymet•6m ago•0 comments

Y Combinator's CEO says he ships 37,000 lines of AI code per day

https://www.fastcompany.com/91520702/y-combinator-garry-tan-agentic-ai-social-media
2•jcbhmr•6m ago•0 comments

Imagination is more than sensory replay: study

https://news.feinberg.northwestern.edu/2026/03/31/imagination-is-more-than-sensory-replay/
2•hhs•7m ago•0 comments

Why Are BART and MUNI always broke(n)?

https://aakash.substack.com/p/why-are-bart-and-muni-always-broken
1•logicx24•9m ago•0 comments

Where do AI-built apps usually break when moving from prototype to production?

https://openbaton.com/
1•kellonedwards•10m ago•1 comments

Third-party Claude harnesses will now draw from extra usage

2•iBelieve•11m ago•0 comments

Resurrecting Supermaven: Trad coding is not dead. Just different

https://github.com/nhlmg93/supertab.nvim
1•nhelmig93•13m ago•1 comments

Show HN: SpeechSDK – free, open-source SDK that unifies all AI voice models

https://www.speechsdk.dev/
3•PiersonMarks•13m ago•0 comments

Compliance at scale and why TAM distracts with Christina Cacioppo of Vanta

https://cheekypint.substack.com/p/compliance-at-scale-and-why-tam-is
1•hhs•13m ago•0 comments

Trump announces 'fraud' crackdown in Democratic states as arrests begin in CA

https://www.theguardian.com/us-news/2026/apr/03/trump-vance-fraud-arrest-crackdown-california
3•mitchbob•14m ago•1 comments

Forest Service Will Close Research Stations That Study Wildfire Risk

https://www.nytimes.com/2026/04/03/climate/forest-service-research-stations.html
2•mitchbob•16m ago•0 comments

Anthropic no longer allowing Claude Code subscriptions to be used with OpenClaw

13•firloop•18m ago•3 comments

Researchers develop new way to detect breakthroughs in science: study

https://www.binghamton.edu/news/story/6153/eureka-scientists-develop-new-way-to-detect-breakthrou...
1•hhs•22m ago•0 comments

Tokenizer That Outperform Tiktoken with O200k_base

https://o200k-tokenizer-70fe25.gitlab.io/
1•nispin•22m ago•0 comments

Tinnitus: At a crossroad between phantom perception and sleep (2022)

https://academic.oup.com/braincomms/article/4/3/fcac089/6563428
3•gnabgib•30m ago•0 comments

AI startup envisions '100M new people' making videogames

https://www.pcgamer.com/software/ai/this-ai-startup-envisions-100-million-new-people-making-video...
3•solomonyardley•32m ago•2 comments

Meta Pauses Work with Mercor After Data Breach Puts AI Industry Secrets at Risk

https://www.wired.com/story/meta-pauses-work-with-mercor-after-data-breach-puts-ai-industry-secre...
5•srameshc•39m ago•1 comments

'Hacks' Star Hannah Einbinder Blasts AI Creators as 'Losers'

https://variety.com/2026/tv/news/hannah-einbinder-ai-creators-losers-1236706302/
2•bogzz•41m ago•1 comments

Show HN: Standalone TurboQuant KV Cache Inference

https://github.com/g023/turboquant
3•g023•42m ago•1 comments

Darkness can "travel" faster than light speed

https://www.nature.com/articles/s41586-026-10209-z
4•Jimmc414•42m ago•2 comments

Soros: The anatomy of an agentic geopolitical simulation engine

https://asksoros.com/insights/soros-anatomy-agentic-geopolitical-simulation
4•muggermuch•43m ago•4 comments

Fake Fans

https://www.wordsfromeliza.com/p/fake-fans
6•performative•47m ago•0 comments

The Subprime AI Crisis Is Here

https://www.wheresyoured.at/the-subprime-ai-crisis-is-here/
13•dmitrygr•48m ago•2 comments

Why Millennials Love Prenups

https://www.newyorker.com/magazine/2025/12/29/why-millennials-love-prenups
5•randycupertino•48m ago•1 comments

Run Linux containers on Android, no root required

https://github.com/ExTV/Podroid
4•politelemon•49m ago•0 comments
Open in hackernews

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

https://github.com/evelance/brainiac
5•0x000xca0xfe•10mo 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•10mo 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•10mo 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•10mo 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.