CIPHERHomomorphic encryption that runs in production. Benchmark CKKS, BGV, and TFHE against your actual latency constraints — without ever exposing the plaintext.
Is it fast enough?
Every number below was recorded on an Intel Xeon W-3375 under 128-bit security parameters. No cherry-picking — these are the latencies your production system will see.
Ciphertext Multiplication
The most expensive FHE primitive — determines your circuit depth budget.
Measured with SEAL 4.1 / OpenFHE 1.1.2 · Xeon W-3375 · 32-core · 256 GB RAM
Bootstrapping
Level refresh cost. Determines how deep your computation can go before needing a reset.
CKKS/BGV: full level reset. TFHE: per-gate bootstrap. Amortized over 16K slots.
Key-Switching
Relinearization and rotation key costs. Dominates in SIMD-heavy workloads.
Includes key generation amortization. GaloisKeys precomputed for all rotation steps.
What can you build with it?
Three architectures shipping in production today — each one proves FHE has crossed the threshold from research curiosity to engineering reality.
Private ML Inference
Run a neural network over encrypted patient data. The model sees ciphertexts — never plaintext inputs or outputs. Deployed at two EU healthcare networks.
Encrypted DB Queries
Execute range queries and aggregations over encrypted transaction records. The query processor never decrypts — compliance architects at three Tier-1 banks use this today.
Secure Genomic Analysis
Sequence alignment and variant scoring over encrypted genomes. NIH-funded pipeline — raw FASTQ files never leave the patient's encrypted domain.
Which scheme fits your constraints?
The wrong scheme choice costs you 10–100× in latency. Toggle each scheme to see where it wins — and where it doesn't.
TFHE · CKKS · BGV
Toggle a scheme to highlight its performance profile across critical parameters.
| Parameter | TFHE | CKKS | BGV |
|---|---|---|---|
Supported Operations | Boolean gates, LUT | Approx. arithmetic | Exact arithmetic |
Noise Model | TLWE / TGSW | BFV-style rescaling | Modulus switching |
Bootstrapping Cost | ~12 ms / bit | ~2–8 s (level reset) | ~1–5 s (level reset) |
Multiplication Depth | Unlimited (slow) | L = 20–40 levels | L = 20–40 levels |
Plaintext Space | Single bit / small int | Complex float vectors | Integer polynomial |
Key-Switch Latency | 8–15 ms | 0.3–2 ms | 0.2–1.5 ms |
SIMD Slots | 1 | N/2 (up to 16 384) | N/2 (up to 16 384) |
Error Precision | Exact (up to noise) | ~20–40 bits | Exact (mod p) |
Ideal For | Logic circuits, ML inference | Statistics, ML, genomics | DB queries, voting |
Cipher Toolkit Support | v1.4+ | v1.0+ | v1.2+ |
Data sourced from Cipher v1.4 internal benchmarks · 128-bit security · Intel Xeon W-3375 · Feb 2026
The safe is already
solving from the inside.
Download the Cipher Toolkit and run your first FHE operation in under 10 minutes. CKKS, BGV, and TFHE — all under one API surface.
Linux · macOS · Docker · Apache 2.0 for research use