mirror of
https://github.com/luxfhe/torus.git
synced 2026-10-30 17:07:26 +00:00
zeekay
b832ba2c39
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.
290 lines
7.4 KiB
Python
290 lines
7.4 KiB
Python
"""
|
|
Tests of execution of minimum and maximum operations.
|
|
"""
|
|
|
|
import random
|
|
|
|
import numpy as np
|
|
import pytest
|
|
|
|
from torus import fhe
|
|
from torus.fhe.dtypes import Integer
|
|
from torus.fhe.values import ValueDescription
|
|
|
|
cases = [
|
|
[
|
|
# operation
|
|
(
|
|
"minimum_optimized_x",
|
|
lambda x, y: np.minimum(fhe.hint(x, bit_width=5), y), # type: ignore
|
|
),
|
|
# bit widths
|
|
4,
|
|
4,
|
|
# signednesses
|
|
False,
|
|
True,
|
|
# shapes
|
|
(),
|
|
(),
|
|
# strategy
|
|
fhe.MinMaxStrategy.CHUNKED,
|
|
],
|
|
[
|
|
# operation
|
|
(
|
|
"minimum_optimized_x",
|
|
lambda x, y: np.minimum(fhe.hint(x, bit_width=5), y), # type: ignore
|
|
),
|
|
# bit widths
|
|
4,
|
|
4,
|
|
# signednesses
|
|
True,
|
|
False,
|
|
# shapes
|
|
(2,),
|
|
(),
|
|
# strategy
|
|
fhe.MinMaxStrategy.CHUNKED,
|
|
],
|
|
[
|
|
# operation
|
|
(
|
|
"maximum_optimized_y",
|
|
lambda x, y: np.maximum(x, fhe.hint(y, bit_width=4)), # type: ignore
|
|
),
|
|
# bit widths
|
|
4,
|
|
3,
|
|
# signednesses
|
|
True,
|
|
False,
|
|
# shapes
|
|
(),
|
|
(2, 3),
|
|
# strategy
|
|
fhe.MinMaxStrategy.CHUNKED,
|
|
],
|
|
[
|
|
# operation
|
|
(
|
|
"maximum_optimized_y",
|
|
lambda x, y: np.maximum(x, fhe.hint(y, bit_width=4)), # type: ignore
|
|
),
|
|
# bit widths
|
|
4,
|
|
3,
|
|
# signednesses
|
|
False,
|
|
True,
|
|
# shapes
|
|
(),
|
|
(),
|
|
# strategy
|
|
fhe.MinMaxStrategy.CHUNKED,
|
|
],
|
|
]
|
|
cases += [
|
|
[
|
|
# operation
|
|
operation,
|
|
# bit widths
|
|
1,
|
|
1,
|
|
# signednesses
|
|
lhs_is_signed,
|
|
rhs_is_signed,
|
|
# shapes
|
|
(),
|
|
(),
|
|
# strategy
|
|
fhe.MinMaxStrategy.CHUNKED,
|
|
]
|
|
for lhs_is_signed in [False, True]
|
|
for rhs_is_signed in [False, True]
|
|
for operation in [
|
|
(
|
|
"maximum",
|
|
lambda x, y: np.maximum(x, y),
|
|
),
|
|
]
|
|
]
|
|
cases = [
|
|
[
|
|
# operation
|
|
("maximum_increased_bit_widths", lambda x, y: (np.maximum(x, y), x + 100, y + 100)),
|
|
# bit widths
|
|
7,
|
|
7,
|
|
# signednesses
|
|
True,
|
|
False,
|
|
# shapes
|
|
(),
|
|
(),
|
|
# strategy
|
|
fhe.MinMaxStrategy.CHUNKED,
|
|
],
|
|
[
|
|
# operation
|
|
("maximum_increased_bit_widths", lambda x, y: (np.maximum(x, y), x + 100, y + 100)),
|
|
# bit widths
|
|
7,
|
|
7,
|
|
# signednesses
|
|
False,
|
|
True,
|
|
# shapes
|
|
(),
|
|
(),
|
|
# strategy
|
|
fhe.MinMaxStrategy.CHUNKED,
|
|
],
|
|
]
|
|
for lhs_bit_width in range(1, 5):
|
|
for rhs_bit_width in range(1, 5):
|
|
strategies = []
|
|
if lhs_bit_width <= 3 and rhs_bit_width <= 3:
|
|
strategies += [
|
|
fhe.MinMaxStrategy.ONE_TLU_PROMOTED,
|
|
fhe.MinMaxStrategy.THREE_TLU_CASTED,
|
|
]
|
|
else:
|
|
strategies += [
|
|
fhe.MinMaxStrategy.CHUNKED,
|
|
]
|
|
|
|
for lhs_is_signed in [False, True]:
|
|
for rhs_is_signed in [False, True]:
|
|
cases += [
|
|
[
|
|
# operation
|
|
operation,
|
|
# bit widths
|
|
lhs_bit_width,
|
|
rhs_bit_width,
|
|
# signednesses
|
|
lhs_is_signed,
|
|
rhs_is_signed,
|
|
# shapes
|
|
random.choice([(), (2,), (3, 2)]),
|
|
random.choice([(), (2,), (3, 2)]),
|
|
# strategy
|
|
strategy,
|
|
]
|
|
for operation in [
|
|
("minimum", lambda x, y: np.minimum(x, y)),
|
|
("maximum", lambda x, y: np.maximum(x, y)),
|
|
]
|
|
for strategy in strategies
|
|
]
|
|
|
|
# pylint: disable=redefined-outer-name
|
|
|
|
|
|
@pytest.mark.parametrize(
|
|
"operation,"
|
|
"lhs_bit_width,rhs_bit_width,"
|
|
"lhs_is_signed,rhs_is_signed,"
|
|
"lhs_shape,rhs_shape,"
|
|
"strategy",
|
|
cases,
|
|
)
|
|
def test_minimum_maximum(
|
|
operation,
|
|
lhs_bit_width,
|
|
rhs_bit_width,
|
|
lhs_is_signed,
|
|
rhs_is_signed,
|
|
lhs_shape,
|
|
rhs_shape,
|
|
strategy,
|
|
helpers,
|
|
):
|
|
"""
|
|
Test comparison operations between encrypted integers.
|
|
"""
|
|
|
|
name, function = operation
|
|
|
|
lhs_dtype = Integer(is_signed=lhs_is_signed, bit_width=lhs_bit_width)
|
|
rhs_dtype = Integer(is_signed=rhs_is_signed, bit_width=rhs_bit_width)
|
|
|
|
lhs_description = ValueDescription(lhs_dtype, shape=lhs_shape, is_encrypted=True)
|
|
rhs_description = ValueDescription(rhs_dtype, shape=rhs_shape, is_encrypted=True)
|
|
|
|
print()
|
|
print()
|
|
print(
|
|
f"{name}({lhs_description}, {rhs_description})"
|
|
+ (f" {{{strategy}}}" if strategy is not None else "")
|
|
)
|
|
print()
|
|
print()
|
|
|
|
parameter_encryption_statuses = {"x": "encrypted", "y": "encrypted"}
|
|
configuration = helpers.configuration()
|
|
|
|
if strategy is not None:
|
|
configuration = configuration.fork(min_max_strategy_preference=[strategy])
|
|
|
|
compiler = fhe.Compiler(function, parameter_encryption_statuses)
|
|
|
|
inputset = [
|
|
(
|
|
np.random.randint(lhs_dtype.min(), lhs_dtype.max() + 1, size=lhs_shape),
|
|
np.random.randint(rhs_dtype.min(), rhs_dtype.max() + 1, size=rhs_shape),
|
|
)
|
|
for _ in range(100)
|
|
]
|
|
|
|
circuit = compiler.compile(inputset, configuration)
|
|
|
|
samples = [
|
|
[
|
|
np.zeros(lhs_shape, dtype=np.int64),
|
|
np.zeros(rhs_shape, dtype=np.int64),
|
|
],
|
|
[
|
|
np.ones(lhs_shape, dtype=np.int64) * lhs_dtype.min(),
|
|
np.ones(rhs_shape, dtype=np.int64) * rhs_dtype.min(),
|
|
],
|
|
[
|
|
np.ones(lhs_shape, dtype=np.int64) * lhs_dtype.max(),
|
|
np.ones(rhs_shape, dtype=np.int64) * rhs_dtype.min(),
|
|
],
|
|
[
|
|
np.ones(lhs_shape, dtype=np.int64) * lhs_dtype.max(),
|
|
np.ones(rhs_shape, dtype=np.int64) * rhs_dtype.max(),
|
|
],
|
|
[
|
|
np.random.randint(lhs_dtype.min(), lhs_dtype.max() + 1, size=lhs_shape),
|
|
np.random.randint(rhs_dtype.min(), rhs_dtype.max() + 1, size=rhs_shape),
|
|
],
|
|
]
|
|
for sample in samples:
|
|
helpers.check_execution(circuit, function, sample, retries=5)
|
|
|
|
|
|
def test_internal_signed_tlu_padding(helpers):
|
|
"""Test that the signed input LUT is correctly padded in the case of substraction trick."""
|
|
|
|
inputset = [(i, j) for i in [0, 1] for j in [0, 1]]
|
|
|
|
@fhe.compiler({"a": "encrypted", "b": "encrypted"})
|
|
def min2(a, b):
|
|
min_12 = np.minimum(a, b)
|
|
return (min_12, a + 3, b + 3)
|
|
|
|
c = min2.compile(inputset, helpers.configuration())
|
|
min_0_1, _, _ = c.encrypt_run_decrypt(0, 1)
|
|
|
|
assert min_0_1 == 0
|
|
|
|
# Some extra checks to verify that the test is relevant (substraction trick).
|
|
assert c.mlir.count("to_signed") == 2 # check substraction trick is used
|
|
assert c.mlir.count("sub_eint") == 1 # check substraction trick is used
|
|
assert c.mlir.count("<[0, 0, -2, -1, 0, 0, 0, 0]>") == 0 # lut wrongly padded at the end
|
|
assert c.mlir.count("<[0, 0, 0, 0, 0, 0, -2, -1]>") == 1 # lut correctly padded in the middle
|