Utocif

We just published Space Fabric. It's our secure compute verification architecture for satellites in low earth orbit, and it's the first infrastructure of its kind. Let’s see if you can explain it 👇

@SpaceComputerIO is building the Space Internet with in-orbit secure compute hardware and software Introducing Space Fabric secure hardware + software architecture for software isolation dual secure elements integrated onto PCBs. We’ve October ride to space. @SpaceNews_Inc @spacereportr 1/

1/ “Just put it in a TEE” sounds convincing, until you ask: where is this actually running? TEE attestations can prove what code is running and on which CPU. They don’t prove where that machine is running. That missing piece is the physical-access gap. 🧵

SpaceComputer to conduct on-orbit test of secure computing infrastructure spacenews.com/spacecomputer-…

Come work with the SpaceComputer team this summer! We're looking for 1-2 university students starting in June 2026 To help build Orbitport, our dev-friendly satellite-to-ground station comms API gateway Deadline to apply: May 7, 2026 How to apply: Check application details👇

Your cryptography can now pull entropy from space! 🛰️ Try it easily: if your Rust code expects an RNG implementing RngCore + CryptoRng, crypto-ctrng can plug in as an additional source of space-based entropy without changing the interface.

Physicist has written a fascinating big beautiful paper.Let’s not be afraid to call it what it is - groundbreaking. For hundreds of years, mathematics had dozens of “basic” functions: sine, cosine, logarithm, square root, exponential. You know these from school. Everyone does. Now it turns out that all of it is one single operator: E(x, y) = exp(x) - ln(y), and the constant 1. Sin, cos, π - everything follows from this neatly , just nest it properly. Nature hid the simplest possible description of reality. And it was just been found. The whole thing is beautiful and remarkable, here the word “groundbreaking” is not a marketing buzzword. For instance, instead of writing π or 3.14, one can now elegantly write E(E(E(1,E(E(1,E(1,E(E(1,E(E(1,E(E(1,E(1,E(E(1,1),1))),1)),E(E(E(E(E(1,E(E(1,E(1,E(E(1,E(E(E(1,E(E(1,E(1,E(E(1,1),1))),1)),E(E(1,E(E(1,E(E(1,E(E(1,1),1)),E(E(E(1,E(E(1,E(1,E(E(1,1),1))),1)),E(1,1)),1))),1)),1)),1)),1))),1)),E(E(E(1,E(E(1,E(1,E(E(1,1),1))),1)),E(E(1,E(E(1,E(1,E(E(1,E(E(1,E(E(1,E(1,E(E(1,1),1))),1)),E(1,1))),1))),1)),1)),1)),1),1),1))),1))),1)),E(E(E(1,E(E(1,E(1,E(E(1,1),1))),1)),E(E(1,E(E(1,E(1,E(E(1,E(E(1,E(E(1,E(1,E(E(1,1),1))),1)),E(1,1))),1))),1)),1)),1)),1) arxiv.org/abs/2603.21852

We are excited to announce we are joining the Nvidia Inception Program! As we scale our compute and security capabilities in orbit, the #NVIDIAInception program will help to accelerate development of our infrastructure. Ad astra! 🚀

Google just put a 2029 deadline on post-quantum cryptography. Their latest research suggests ECC could fall with 20× fewer qubits than last year’s estimates. That has immediate implications for every satellite. 14,904 satellites in LEO. <5% of enterprises have any form of quantum-safe encryption in place. This means most satellites security has an expiration date. PQC is in SpaceComputer's roadmap as a design requirement, aligned with the industry's 2029 timeline. We are building with security as priority from day one, because you can't swap out security after launch. 🚀

And it’s truly fascinating how much there is to explore in orbit Our satellites will be the most physically inaccessible, cryptographically hardened devices orbiting the earth 🌍 Hardware reveal soon™️

re: geopolitics a satellite just told us 𝘪𝘵'𝘴 𝘴𝘰 𝘰𝘷𝘦𝘳. no cap this is real randomness from orbit 🛰️ vibecheck.spacecomputer.io @SpaceComputerIO

It is crazy how fast an ecosystem can move. Just eight months ago I feel like the Space Industry headlines were still dominated by two-three major companies. When Daniel mentioned @SpaceComputerIO we got incredibly excited and had to get onboard. Today, a few months later my timeline is teeming with startups raising for the future in space. It's incredibly exciting. And now with Artemis II even more people will enter this space. How could you not be excited!? And the SpaceComputer team keeps on cooking. Incredibly cracked devs working on building the core infrastructure to become the orbital confidential compute platform. Security is hard from a software and tech perspective. But the team at SpaceComputer keeps pushing the boundaries 🔥

Today is a monumentous day for quantum computing and cryptography. Two breakthrough papers just landed (links in next tweet). Both papers improve Shor's algorithm, infamous for cracking RSA and elliptic curve cryptography. The two results compound, optimising separate layers of the quantum stack. The results are shocking. I expect a narrative shift and a further R&D boost toward post-quantum cryptography. The first paper is by Google Quantum AI. They tackle the (logical) Shor algorithm, tailoring it to crack Bitcoin and Ethereum signatures. The algorithm runs on ~1K logical qubits for the 256-bit elliptic curve secp256k1. Due to the low circuit depth, a fast superconducting computer would recover private keys in minutes. I'm grateful to have joined as a late paper co-author, in large part for the chance to interact with experts and the alpha gleaned from internal discussions. The second paper is by a stealthy startup called Oratomic, with ex-Google and prominent Caltech faculty. Their starting point is Google's improvements to the logical quantum circuit. They then apply improvements at the physical layer, with tricks specific to neutral atom quantum computers. The result estimates that 26,000 atomic qubits are sufficient to break 256-bit elliptic curve signatures. This would be roughly a 40x improvement in physical qubit count over previous state-of-the-art. On the flip side, a single Shor run would take ~10 days due to the relatively slow speed of neutral atoms. Below are my key takeaways. As a disclaimer, I am not a quantum expert. Time is needed for the results to be properly vetted. Based on my interactions with the team, I have faith the Google Quantum AI results are conservative. The Oratomic paper is much harder for me to assess, especially because of the use of more exotic qLDPC codes. I will take it with a grain of salt until the dust settles. → q-day: My confidence in q-day by 2032 has shot up significantly. IMO there's at least a 10% chance that by 2032 a quantum computer recovers a secp256k1 ECDSA private key from an exposed public key. While a cryptographically-relevant quantum computer (CRQC) before 2030 still feels unlikely, now is undoubtedly the time to start preparing. → censorship: The Google paper uses a zero-knowledge (ZK) proof to demonstrate the algorithm's existence without leaking actual optimisations. From now on, assume state-of-the-art algorithms will be censored. There may be self-censorship for moral or commercial reasons, or because of government pressure. A blackout in academic publications would be a tell-tale sign. → cracking time: A superconducting quantum computer, the type Google is building, could crack keys in minutes. This is because the optimised quantum circuit is just 100M Toffoli gates, which is surprisingly shallow. (Toffoli gates are hard because they require production of so-called "magic states".) Toffoli gates would consume ~10 microseconds on a superconducting platform, totalling ~1,000 sec of Shor runtime. → latency optimisations: Two latency optimisations bring key cracking time to single-digit minutes. The first parallelises computation across quantum devices. The second involves feeding the pubkey to the quantum computer mid-flight, after a generic setup phase. → fast- and slow-clock: At first approximation there are two families of quantum computers. The fast-clock flavour, which includes superconducting and photonic architectures, runs at roughly 100 kHz. The slow-clock flavour, which includes trapped ion and neutral atom architectures, runs roughly 1,000x slower (~100 Hz, or ~1 week to crack a single key). → qubit count: The size-optimised variant of the algorithm runs on 1,200 logical qubits. On a superconducting computer with surface code error correction that's roughly 500K physical qubits, a 400:1 physical-to-logical ratio. The surface code is conservative, assuming only four-way nearest-neighbour grid connectivity. It was demonstrated last year by Google on a real quantum computer. → future gains: Low-hanging fruit is still being picked, with at least one of the Google optimisations resulting from a surprisingly simple observation. Interestingly, AI was not (yet!) tasked to find optimisations. This was also the first time authors such as Craig Gidney attacked elliptic curves (as opposed to RSA). Shor logical qubit count could plausibly go under 1K soonish. → error correction: The physical-to-logical ratio for superconducting computers could go under 100:1. For superconducting computers that would be mean ~100K physical qubits for a CRQC, two orders of magnitude away from state of the art. Neutral atoms quantum computers are amenable to error correcting codes other than the surface code. While much slower to run, they can bring down the physical to logical qubit ratio closer to 10:1. → Bitcoin PoW: Commercially-viable Bitcoin PoW via Grover's algorithm is not happening any time soon. We're talking decades, possibly centuries away. This observation should help focus the discussion on ECDSA and Schnorr. (Side note: as unofficial Bitcoin security researcher, I still believe Bitcoin PoW is cooked due to the dwindling security budget.) → team quality: The folks at Google Quantum AI are the real deal. Craig Gidney (@CraigGidney) is arguably the world's top quantum circuit optimisooor. Just last year he squeezed 10x out of Shor for RSA, bringing the physical qubit count down from 10M to 1M. Special thanks to the Google team for patiently answering all my newb questions with detailed, fact-based answers. I was expecting some hype, but found none.

Join @rezabfil and @utocif at the main venue for their talk: "From Stars to Bits: Verifying True Randomness from Space." 🗓️ Wednesday April 1st @ 10:00am Watch the livestream here: ethcc.io/live/burton-st…

A few years ago the consensus estimates were $1 Trillion by 2040 then recently more like 1.4-1.8T by 2035… they are all still massively underestimating. Primarily because by then a majority of AI will be powered by Satellites in Space. No one saw this and the only thing the consensus has been consistent with is undervaluing space.

Until now talking to a satellite required ground station contracts, aerospace teams, and six-figure budgets. There was no accessible bridge. Introducing Orbitport as the bridge to orbital infrastructure, accessible via API call. It handles the routing across congested ground stations and variable-latency LEO networks so you don't have to. Orbitport is secured from orbit down. Every data packet is cryptographically signed to verify the originating satellite and authenticate the machine itself. Read the full blog for details 🛰️ blog.spacecomputer.io/orbitport-gate…

"Raise your hand if you've heard of Space Data Centers" 🙋‍♂️ At @buidl_conf Europe, @rezabfil raised this exact question. Projected for orbital compute market to hit $1.77B by 2029, space is open for business like never before. But the problem is a lot of this orbital compute is not secure. That's why we're building SpaceComputer: to provide highly secure confidential compute and security services in orbit. 🛰️

@alexocheema @exolabs How exo is used here @grok ?

this is going viral on chinese social media right now. exo is being used by a school in china to deploy private ai agents locally. they repurposed m1 ultra macs from their film lab, clustered them together with @exolabs, and ingested their entire school corpus including curriculums, reports, handbooks and class schedules. with this, each student and teacher has a personalised ai agent that is free and private, grounded to real school data.