Forked from upstream concrete (BSD-3-Clause-Clear, © 2024 ZAMA) at HEAD
ecb729bb. Modifications copyright © 2026 Lux Industries Inc.
Rebranding scope:
- Python module concrete → torus (across frontends/torus-python)
- Rust module concrete-* → torus-* (across frontends/torus-rust)
- MLIR dialect concretelang → toruslang (across compilers/torus-compiler)
- Compiler optimizer concrete-optimizer → torus-optimizer
- Backend concrete-cpu / concrete-cuda → torus-cpu / torus-cuda
- Wire protocol concrete-protocol → torus-protocol
- Parameter-curves concrete-security-curves-* → torus-security-curves-*
- Public symbols concretelib → toruslib, ConcreteLang → TorusLang
- URLs github.com/zama-ai/concrete → github.com/luxfhe/torus
- URLs docs.zama.ai/concrete → docs.luxfhe.com/torus
Legal compliance:
- LICENSE.txt retains original Copyright © 2024 ZAMA verbatim (§1-§2)
- LICENSE.txt adds modifications copyright © 2026 Lux Industries Inc.
- §3 endorsement clause: Torus is marketed exclusively as a Lux product;
no Zama name used in README, docs, or marketing
- NOTICE file provides factual attribution per legal best practice
(not endorsement; required by upstream BSD-3-Clause-Clear)
README + NOTICE rewritten from scratch with Lux brand:
- Quick-start in Python (torus.fhe)
- Architecture diagram showing the gen-1 vtbl integration path
(luxcpp/gpu → lux-private/gpu-kernels for CUDA/Metal/WebGPU)
- Scheme coverage table: TFHE (luxfi/fhe), CKKS/BGV/BFV (luxfi/lattice)
- Lux FHE family table: Torus / TorusVM / TorusEVM / TorusML / TorusNet
Known limitations (phase-2A scope):
- PyPI package torus-fhe not yet published; the torus Python module
is renamed structurally but pip-installable distribution is a
follow-up (Phase 2A.1)
- MLIR dialect rename is text-level; the compiler-internal LLVM
rebuild (concrete-compiler-internal-llvm-project submodule) is
structural and works; tablegen files renamed concrete→torus but the
generated .inc files in the source tree will regenerate at build
time
- backends/torus-cuda/implementation/ is an upstream submodule
pointer to the tfhe-rs source (not fetched in the staging clone);
the CUDA backend body is delivered out-of-tree
- ~100 test-fixture variable names like concrete_encoded_sample
retain "concrete" as a math term (vs symbolic); these are inside
tests/, not the public API; cleanup is a follow-up commit
- 295 Python `from concrete import ...` residuals in luxfhe/ml-sdk
consumer remain; that repo's import update is Phase 2B
This commit is the seed for the luxfhe/torus repo. Push as the first
commit to a fresh GitHub repo; do not re-import upstream Zama git
history.
5.6 KiB
Non-linear operations
This document introduces the usages and optimization strategies of non-linear operations in Torus, focusing on comparisons, min/max operations, bitwise operations, and shifts. For a more in-depth explanation on advanced options, refer to the Table Lookup advanced documentation.
Overview of non-linear operations
In Torus, there are two types of operations:
- Linear operations: These include additions, subtractions, and multiplications by an integer. They are computationally fast.
- Non-linear operations: These require Table Lookups (TLUs) to maintain the semantic integrity of the user's program. The performance of TLUs is slower and vary depending on the bit width of the inputs.
Changing bit width in the MLIR or dynamically with a TLU
Binary operations often require operands to have matching bit widths. This adjustment can be achieved in two ways: either directly within the MLIR or dynamically at execution time using a TLU. Each method has its own advantages and trade-offs, so Torus provides multiple configuration options for non-linear functions.
MLIR adjustment: This method doesn't require an expensive TLU. However, it may affect other parts of your program if the adjusted operand is used elsewhere, potentially causing more changes.
Dynamic adjustment with TLU: This method is more localized and won’t impact other parts of your program, but it’s more expensive due to the cost of using a TLU.
General guidelines
In the following non-linear operations, we propose a certain number of configurations, using the two methods on the different operands. It’s not always clear which option will be the fastest, so we recommend trying out different configurations to see what works best for your circuit.
Note that you have the option to set show_mlir=True to view how the MLIR handles TLUs and bit width changes. However, it's not essential to understand these details. So we recommend just testing the configurations and pick the one that performs best for your case.
Comparisons
For comparison, there are 7 available methods. Here's the general principle:
import numpy as np
from torus import fhe
configuration = fhe.Configuration(
comparison_strategy_preference=config,
)
def f(x, y):
return x < y
inputset = [
(np.random.randint(0, 2**4), np.random.randint(0, 2**4))
for _ in range(100)
]
compiler = fhe.Compiler(f, {"x": "encrypted", "y": "encrypted"})
circuit = compiler.compile(inputset, configuration, show_mlir=True)
The config can be one of the following:
fhe.ComparisonStrategy.CHUNKEDfhe.ComparisonStrategy.ONE_TLU_PROMOTEDfhe.ComparisonStrategy.THREE_TLU_CASTEDfhe.ComparisonStrategy.TWO_TLU_BIGGER_PROMOTED_SMALLER_CASTEDfhe.ComparisonStrategy.TWO_TLU_BIGGER_CASTED_SMALLER_PROMOTEDfhe.ComparisonStrategy.THREE_TLU_BIGGER_CLIPPED_SMALLER_CASTEDfhe.ComparisonStrategy.TWO_TLU_BIGGER_CLIPPED_SMALLER_PROMOTED
Min / Max operations
For min / max operations, there are 3 available methods. Here's the general principle:
import numpy as np
from torus import fhe
configuration = fhe.Configuration(
min_max_strategy_preference=config,
)
def f(x, y):
return np.minimum(x, y)
inputset = [
(np.random.randint(0, 2**4), np.random.randint(0, 2**2))
for _ in range(100)
]
compiler = fhe.Compiler(f, {"x": "encrypted", "y": "encrypted"})
circuit = compiler.compile(inputset, configuration, show_mlir=True)
The config can be one of the following:
fhe.MinMaxStrategy.CHUNKED(default)fhe.MinMaxStrategy.ONE_TLU_PROMOTEDfhe.MinMaxStrategy.THREE_TLU_CASTED
Bitwise operations
For bit wise operations (typically, AND, OR, XOR), there are 5 available methods. Here's the general principle:
import numpy as np
from torus import fhe
configuration = fhe.Configuration(
bitwise_strategy_preference=config,
)
def f(x, y):
return x & y
inputset = [
(np.random.randint(0, 2**4), np.random.randint(0, 2**4))
for _ in range(100)
]
compiler = fhe.Compiler(f, {"x": "encrypted", "y": "encrypted"})
circuit = compiler.compile(inputset, configuration, show_mlir=True)
The config can be one of the following:
fhe.BitwiseStrategy.CHUNKEDfhe.BitwiseStrategy.ONE_TLU_PROMOTEDfhe.BitwiseStrategy.THREE_TLU_CASTEDfhe.BitwiseStrategy.TWO_TLU_BIGGER_PROMOTED_SMALLER_CASTEDfhe.BitwiseStrategy.TWO_TLU_BIGGER_CASTED_SMALLER_PROMOTED
Shift operations
For shift operations, there are 2 available methods. Here's the general principle:
import numpy as np
from torus import fhe
configuration = fhe.Configuration(
shifts_with_promotion=shifts_with_promotion,
)
def f(x, y):
return x << y
inputset = [
(np.random.randint(0, 2**3), np.random.randint(0, 2**2))
for _ in range(100)
]
compiler = fhe.Compiler(f, {"x": "encrypted", "y": "encrypted"})
circuit = compiler.compile(inputset, configuration, show_mlir=True)
The shifts_with_promotion is either True or False.
Relation with fhe.multivariate
All binary operations described in this document can also be implemented with the fhe.multivariate function which is described in fhe.multivariate function documentation. Here's an example:
import numpy as np
from torus import fhe
def f(x, y):
return fhe.multivariate(lambda x, y: x << y)(x, y)
inputset = [(np.random.randint(0, 2**3), np.random.randint(0, 2**2)) for _ in range(100)]
compiler = fhe.Compiler(f, {"x": "encrypted", "y": "encrypted"})
circuit = compiler.compile(inputset, show_mlir=True)