Zero X One · Dubai · est. |0⟩
We flip
the state.
We invent software that does not exist yet, at the layer where it still looks impossible. Assembly and binary. Neural networks. Cryptography and security. Quantum circuits. No templates, no agency.
01 · Quantum computing
A qubit is a question, not a bit.
A bit answers. A qubit holds every answer until you ask. We design circuits where superposition, entanglement and interference do the work. Build one here: this simulator runs the real linear algebra in your browser.
Drag gates onto the wires. Click a gate to select it, Delete removes it. Controlled gates link two wires.
Copy circuit exports JSON as { "qubits": n, "gates": [ { type, target, control?, theta? } ] } with θ in radians — the exact shape /api/recruit/verify accepts. Load "W state (target)" to see the goal, or build your own and reach fidelity ≥ 0.99.
- |000⟩50.0%
- |001⟩0.0%
- |010⟩0.0%
- |011⟩0.0%
- |100⟩0.0%
- |101⟩0.0%
- |110⟩0.0%
- |111⟩50.0%
Bar length is the probability of each basis state |b⟩. The dial shows the complex phase φ = atan2(Im, Re).
Each sphere is one qubit's reduced state. When |r| < 1 the qubit is entangled with the others — the vector shrinks toward the center.
Sample an outcome from the current distribution.
- |000⟩50.0%
- |001⟩0.0%
- |010⟩0.0%
- |011⟩0.0%
- |100⟩0.0%
- |101⟩0.0%
- |110⟩0.0%
- |111⟩50.0%
- n qubits hold 2ⁿ amplitudes. Three hundred qubits exceed the atoms in the universe.
- Shor factors in polynomial time. RSA-2048 falls to a few thousand logical qubits.
- Error correction spends thousands of physical qubits per logical one. That is the real frontier.
02 · Binary & assembly
The abstraction lies. The metal does not.
Every framework ends in instructions. We read binaries the way others read prose, and when the abstraction gets in the way we write the instructions ourselves. This is ZX1, a machine we built for this page: eight registers, 64 KiB, thirty-two opcodes. Step through it.
Assemble a source to see the disassembly.
Applied when you Assemble or Reset.
No output yet — assemble and run.Instruction set›
| op | mnemonic | operands |
|---|---|---|
| 0x00 | nop | — |
| 0x01 | hlt | — |
| 0x10 | mov | rd, imm32 |
| 0x11 | mov | rd, rs |
| 0x12 | ldb | rd, [rs] |
| 0x13 | stb | [rd], rs |
| 0x20 | add | rd, rs |
| 0x21 | sub | rd, rs |
| 0x22 | xor | rd, rs |
| 0x23 | and | rd, rs |
| 0x24 | or | rd, rs |
| 0x25 | shl | rd, imm8 |
| 0x26 | shr | rd, imm8 |
| 0x27 | rol | rd, imm8 |
| 0x28 | ror | rd, imm8 |
| 0x29 | mul | rd, rs |
| 0x2A | add | rd, imm32 |
| 0x2B | xor | rd, imm32 |
| 0x2C | and | rd, imm32 |
| 0x2D | sub | rd, imm32 |
| 0x30 | cmp | rd, rs |
| 0x31 | cmp | rd, imm32 |
| 0x40 | jmp | addr |
| 0x41 | jz | addr |
| 0x42 | jnz | addr |
| 0x43 | jc | addr |
| 0x50 | out | rd |
| 0x51 | in | rd |
| 0x60 | push | rd |
| 0x61 | pop | rd |
| 0x62 | call | addr |
| 0x63 | ret | — |
- A byte is eight decisions. A 32-bit register is four billion states, and one of them is right.
- Compilers are excellent. They are also predictable. Predictable is what an attacker needs.
- The ISA above is the same one that runs metal.bin on the recruiting page.
03 · Neural networks & machine learning
Linear algebra that learned to doubt.
A network is weights and a loss. Everything else is the story we tell about it. Draw two classes of points and watch a small network train live, in a worker thread, until its decision boundary blooms around your data.
Click to add points. Hold Shift for class 1. Drag to paint.
Epoch
0
Accuracy
0%
Loss
0.000
Layers: 2 · 8 · 2
- Backpropagation is the chain rule, applied with discipline.
- A model that is 99% accurate can be 100% wrong on the input you craft. That is the adversarial frontier, and it is where we work.
- The playground above trains in a Web Worker. The page never stutters.
04 · Cryptography
The adversary is part of the specification.
Cryptography is the only engineering that assumes a genius is trying to break the design. Type below. Every keystroke recomputes SHA-256 and about half of its 256 bits flip: the avalanche, live.
- message bytes
- 10
- blocks
- 1 × 512 bit
Shor breaks RSA and elliptic curves. Lattice problems, so far, resist quantum computers. ML-KEM hides a secret in noise that only the right basis removes.
Drag the target, or tap anywhere in the square. Arrow keys move it too.
- 01Same points, two descriptions. The good basis is short and nearly orthogonal; the bad one is long and nearly parallel.
- 02Decoding means writing the target in your basis and rounding the coordinates. Only the good basis lands on the true closest point.
- 03The good basis is the private key. Noise hides the message near a lattice point; without the key, near is not enough.
- A hash is a one-way street with 2²⁵⁶ lanes.
- Nonce means number used once. Most real breaks happen when it was used twice.
- We implement, audit and break protocols. Sometimes in that order.
05 · Cyber security
What remains after every assumption is attacked.
Security is not a product. It is the residue of every attack you already survived. This terminal is real: a shell we wrote, with a file system we chose. Look around. Some of what you find is meant to be found.
A real shell running in your browser. `submit` and `vault` reach the live backend; everything else stays on this page. Type `help` to begin.
- The perimeter is gone. Identity is the perimeter.
- We hire people who read the response headers.
- Offense informs defense. We do both, on paper first.
Measurement · Work with us
The last gate is a measurement.
Solve a challenge, skip the interview queue.