惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

P
Proofpoint News Feed
V
V2EX
WordPress大学
WordPress大学
Google DeepMind News
Google DeepMind News
Martin Fowler
Martin Fowler
小众软件
小众软件
Blog — PlanetScale
Blog — PlanetScale
月光博客
月光博客
The Cloudflare Blog
T
Tailwind CSS Blog
H
Help Net Security
腾讯CDC
爱范儿
爱范儿
人人都是产品经理
人人都是产品经理
H
Hackread – Cybersecurity News, Data Breaches, AI and More
The GitHub Blog
The GitHub Blog
Microsoft Security Blog
Microsoft Security Blog
Stack Overflow Blog
Stack Overflow Blog
D
DataBreaches.Net
C
Check Point Blog
量子位
酷 壳 – CoolShell
酷 壳 – CoolShell
美团技术团队
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com

DEV Community

Authentication Security Deep Dive: From Brute Force to Salted Hashing (With Java Examples) Why AI Systems Don’t Fail — They Drift Spilling beans for how i learn for exam😁"Reinforcement Learning Cheat Sheet" I Replaced Chrome with Safari for AI Browser Automation. Here's What Broke (and What Finally Worked) How Python Borrows Other People's Work The $40 Architecture: Processing 1 Billion API Requests with 99.99% Uptime Vibe Coding: A Workflow Guide (From Zero to SaaS) Most webhook security guides protect the wrong side. The scary part is delivery. Headless CMS for TanStack Start: Build a Blog with Cosmic EU Age Verification App "Hacked in 2 Minutes" — What Actually Happened Comfy Cloud’s delete function does not actually remove files Running AI Models on GPU Cloud Servers: A Beginner Guide Event-driven media intelligence with AWS Step Functions and Bedrock I scored 500 AI prompts across 8 quality dimensions — here's what broke How to Call Google Gemini API from Next.js (Free Tier, No Backend Needed) The Portal Protocol: Reclaiming Human Connection in the Age of AI How to Fix Your Team's Scattered Knowledge Problem With a Self-Hosted Forum Intro to tc Cloud Functors: A Graph-First Mental Model for the Modern Cloud Designing Multi-Tenant Backends With Both Ownership and Team Access I Built a Neumorphic CSS Library with 77+ Components — Here's What I Learned PostgreSQL Performance Optimization: Why Connection Pooling Is Critical at Scale Cómo construí un SaaS multi-rubro para gestionar expensas en Argentina con FastAPI + Vue 3 🚀 I Built an Ethical Hacking Scanner Tool – Open Source Project I Replaced /usage and /context in Claude Code With a Single Statusline A Pythonic Way to Handle Emails (IMAP/SMTP) with Auto-Discovery and AI-Ready Design I Collected 8.9 Million Polymarket Price Points — Here's What I Found About How Markets Really Move EcoTrack AI — Carbon Footprint Tracker & Dashboard Everyone's Using AI. No One Agrees How. 5 self-hosted ebook managers worth trying in 2026 Building Your First AI Agent with LangChain: From Chatbot to Autonomous Assistant
I built a programming language from raw assembly — and it...
JAI LALAWAT · 2026-06-05 · via DEV Community

So I had a slightly unreasonable idea two years ago:

What if I built a programming language without depending on C, LLVM, or any existing toolchain?

The result is Jda — a high-performance systems language bootstrapped from raw x86-64 assembly. The compiler now compiles itself. No GC. No runtime. Single static binaries.

And on real benchmarks, it’s doing things I genuinely didn’t expect.

The numbers that made me double-check

I ran a 6-language benchmark suite (C, Rust, Go, Jda, Python, Ruby) on real algorithms — not microbenchmarks.

• Sudoku (500 puzzles): C 62ms, Rust 62ms, Go 66ms, Jda 41ms
• LZ77 (1 MB compress): C 1,830ms, Rust 2,185ms, Go 2,721ms, Jda 277ms

Enter fullscreen mode Exit fullscreen mode

That’s 1.5× faster than C on Sudoku and 6.6× faster than C on LZ77. Running via Rosetta 2, no less — C/Rust/Go were native ARM64, Jda was x86-64 emulated.

How? Source-level optimizations the C compiler can’t easily do: MOD→AND strength reduction, hash-chain hoisting, aggressive DCE.

Compile times are kinda absurd too

33× faster compilation than Rust, 16× faster than Go. Skipping LLVM saves a lot of time.

A taste of the syntax
fn search_file(path: &i8, pattern: &i8) -> i64 {
let fd = file_open(path, 0)
let buf = file_read_all(fd)
let matches = 0
for i in range(str_len(buf)) {
if substr_match(buf, i, pattern) {
matches += 1
}
}
ret matches
}

A real ripgrep-style search tool, ~400 lines total, compiles to a 1 MB static binary with zero dependencies.

What’s in the box

• Self-hosted compiler — byte-identical fixed point reached April 2026
• 117 stdlib packages — HTTP, JSON, crypto, tensors, neural networks
• Built-in concurrency — goroutine-style green threads, no GC
• 388 conformance tests passing
• Native installers for Windows, macOS, Linux

Enter fullscreen mode Exit fullscreen mode

Try it

Repo: https://www.github.com/jdalang/jda-lang

Happy to answer questions about the bootstrap process, the codegen, or why on earth I did this in the comments.