Video yükleniyor...

Video Yüklenemedi

Ana Sayfaya Dön

It's TerraBlading time - a low-cost mechanical method of removing weeds between the seeded rows. #claydondrill #loveyoursoil #mechanicalweeding #interrowhoe #organicfarming

0 Yorum

Yorum bulunmuyor

Orijinal gönderinin yorumları burada görünecek

Benzer Videolar

To finish the series: - Deterministic chain-seeded genetic computation. We ran a chain-seeded genetic optimiser for 32 generations and proved every single step in zero-knowledge, then folded all 32 proofs into one. The whole lineage verifies on Kaspa in a single transaction, post-quantum. You can open the tx and check it yourself. What it is: a tiny program, an evolutionary search over a 16-value genome , that mutates and selects for a lower-cost circuit design, seeded by the Kaspa chain. Over 32 generations it drove its target circuit's scored constraint count down (best target ~72 → ~50; trending down, though it's a sawtooth it rotates through three circuit types). The part that matters: every one of those 32 steps ran inside a zero-knowledge VM and was proven correct a step that didn't compute correctly simply won't verify. Then all 32 step-proofs were folded into ONE. That proof is 222 KB exactly the size of a single step, and it stays that size no matter how many generations you add. (The catch, stated plainly: folding more generations costs the prover more time; only the final proof size is constant.) Kaspa verified the entire 32-generation lineage in one transaction: 7504fa32f74aa028301290299276a707cf98ffc2766b1be0daed4c5c41883f15. Flip a single byte of the proof and the network rejects it, we tried; it's rejected. And the verification path is post-quantum: hash-based the whole way (FRI/Poseidon2 + SHA-256), no elliptic curves or pairings anywhere nothing Shor's algorithm targets.* What this is and isn't: It's a feasibility experiment on testnet. It's deterministic, chain-seeded genetic computation not AI, not intelligence. We drive each step and proved a fixed lineage we chose; it does not yet run itself on-chain (that's the next build). The core, though, is real and checkable: a program's entire computational lineage 32 generations proven correct, post-quantum, verified by Kaspa in a single shot. *STARK security rests on hash assumptions plus the Fiat-Shamir heuristic, not on any pre-quantum hardness.

Kaspa Kii

20,730 görüntüleme • 2 ay önce