Video yükleniyor...

Video Yüklenemedi

Ana Sayfaya Dön

upping my (Lean)DOOM i got curious about math proofs and Lean formalization, found out you can do general programming in lean, and i wanted to learn more so i did the obvious thing. (Lean)DOOM is entirely written in lean, and has presently a couple proofs where they make sense

28,485 görüntüleme • 3 gün önce •via X (Twitter)

22 Yorum

alaska profil fotoğrafı
alaska3 gün önce

github repo:

alaska profil fotoğrafı
alaska2 gün önce

also if you are reading this i am looking for work!!

doomslide profil fotoğrafı
doomslide2 gün önce

delete this

alaska profil fotoğrafı
alaska2 gün önce

whatd i do

Rudi Cilibrasi profil fotoğrafı
Rudi Cilibrasi2 gün önce

Nice practice! We are also experimenting with writing an OS in Lean. I feel like it might wind up being more secure.

liz profil fotoğrafı
liz3 gün önce

lmao

alaska profil fotoğrafı
alaska3 gün önce

i <3 wasting tokens

Hensen Juang profil fotoğrafı
Hensen Juang2 gün önce

@doomslide bruh

elaine’s the name, inherent shame’s the game profil fotoğrafı
elaine’s the name, inherent shame’s the game3 gün önce

that’s cool

alaska profil fotoğrafı
alaska3 gün önce

thanks :) it is basically just slop but it was a good way to learn abt the language

d00b profil fotoğrafı
d00b2 gün önce

general programming in lean + actual proofs attached ... this is the timeline i wanted

Someody profil fotoğrafı
Someody2 gün önce

This would actually be a very fun project… if it was done by hand 🙄

alaska profil fotoğrafı
alaska2 gün önce

i will commit my entire life to making your stance on ai irrelevant. my final breath will be spent destroying your preference for human labor.

Suresh Rangarajulu profil fotoğrafı
Suresh Rangarajulu2 gün önce

“Why did you climb Mt. Everest? Because it is there!” This is the Lean equivalent of that. Very nice!

gooby_esq profil fotoğrafı
gooby_esq2 gün önce

Check out bend2

alaska profil fotoğrafı
alaska2 gün önce

i dont find bend to be very compelling personally

EgoXAgony profil fotoğrafı
EgoXAgony2 gün önce

@gooby_esq Hmm why? I’m using it to work on a project along the lines of formal verification for “AI safety” want to know to cut my losses

alaska profil fotoğrafı
alaska2 gün önce

@gooby_esq in the words of david cage, "game overs are a failure of the game designer, not the player"

1223334444555554444333221 profil fotoğrafı
12233344445555544443332212 gün önce

feel free to elaborate on what the proofs are and how/where they make sense :)

alaska profil fotoğrafı
alaska2 gün önce

ok, there are proofs for the autoaim and friction, these are both very simple, given a direction, input, and enemy location, we can prove that the shot will hit, or we can prove a player speed. these are kind of boring proofs but they are there and shown in the video. there are also proofs for fixed-point arithmetic parity and RNG parity with the original DOS DOOM, which are more interesting because they show that leandoom's behavior matches the original despite hardware differences. still, this is pretty simple arithmetic so not super exciting. these are building blocks towards creating a proof for behavioral parity across the entire doom engine, which is not done yet but in progress. cheers.

1223334444555554444333221 profil fotoğrafı
12233344445555544443332212 gün önce

appreciated, thanks!

🇺🇲TradeTexasBig🇮🇳 profil fotoğrafı
🇺🇲TradeTexasBig🇮🇳2 gün önce

You give me an idea too..and i hate u for it in a good way

Benzer Videolar

How do you actually formally verify the code underpinning Ethereum's future? In this episode (the finale of the lean Ethereum miniseries), Nico sits down with Alex Hicks (Alexander Hicks), lead of Protocol Snarkification at the Ethereum Foundation, to break down formal verification from first principles. They cover: – What formal verification actually is and the trust boundaries between proof assistants, SMT solvers, and kernels – The full verification stack for RISC-V ZKVMs: from SAIL specs to constraint extraction to soundness proofs – Why writing constraints directly in Lean makes proofs 10–100x more ergonomic – How AI is now proving hard theorems in hours for $200 — and what that unlocks for the whole pipeline They also explore the boundaries problem, why specs can have bugs too, and the end goal of a full Lean stack that bypasses Rust and LLVM entirely. Listen to the full episode ------------------------------------------------------------ TIMECODES: 09:16 – What is formal verification? Proof assistants vs SMT solvers 18:33 – Formal verification of code: specs, semantics, and trust boundaries 29:30 – Formally verifying the Lean Ethereum stack: RISC-V ZKVMs in focus 33:02 – Extracting ZKVM constraints into Lean and proving soundness 36:35 – Writing constraints directly in Lean: 10–100x better proof ergonomics 44:02 – Proving Polishchuk–Spielman in 8 hours for $200 with AI 51:01 – The end goal: a full Lean stack bypassing Rust and LLVM

Zero Knowledge Podcast

15,276 görüntüleme • 6 ay önce