AND, OR, XOR, NOT — on data that is never decrypted. Every gate operates on ciphertext. The server processes logic without seeing values, identities, or inputs.
Every encrypted decision breaks down to gates. AND, OR, XOR, NOT — these are the atoms. H33-TFHE evaluates these gates directly on LWE ciphertexts.
No polynomial arithmetic. No floating point. No approximation. Exact Boolean logic on encrypted bits.
This is what runs underneath every comparison, every threshold check, every encrypted decision.
Seven gates. The building blocks of every encrypted circuit.
Gates are primitives. Circuits are products.
All numbers measured on AWS Graviton4 (ARM). No GPU. Sustained throughput.
| Gate | Cost | Throughput (96ch) |
|---|---|---|
| AND | 1 bootstrap | 11,526/sec |
| OR | 1 bootstrap | 11,526/sec |
| NAND | 1 bootstrap | 11,526/sec |
| NOR | 1 bootstrap | 11,526/sec |
| XOR | Free | No limit |
| XNOR | Free | No limit |
| NOT | Free | No limit |
Measured on AWS Graviton4 (ARM). No GPU. Sustained throughput. Free gates (XOR, XNOR, NOT) require no bootstrapping — they operate on ciphertext noise-free.
H33 runs five FHE engines. Each one solves a different problem. FHE-IQ routes between them automatically.
FHE-IQ routes automatically between them. You send data. The system selects the engine.
Fixed circuit depth. You design the circuit, noise budget is set by parameters.
Fast for shallow circuits. Predictable cost per gate.
11,526 bootstrapped gates/sec. Free XOR/NOT operations.
Every gate resets noise via programmable bootstrapping. No depth limit.
More expensive per gate, but no circuit planning required.
768 TPS for 8-bit comparisons. Unlimited composition.
Use TFHE when your circuit is bounded. Use TFHE Bootstrap when it is not.
TFHE is based on lattice cryptography — the Learning With Errors (LWE) hardness assumption. The same class of mathematical problem that underpins all NIST post-quantum standards.
Every gate result can be attested via H33-74 — 74 bytes, distilled from three independent hardness assumptions: MLWE lattices, NTRU lattices, and hash-based signatures.
Not just encrypted. Provable.