```
print(f"Complexity is {quantized_numpy_module.fhe_circuit.complexity}\n")
```

I use this code to obtain the complexity of the circuit, and I want to know what determines this complexity? And I want to know if the higher the complexity of the circuit, the longer the FHE inference time?

Hello,

Complexity is an estimation of the global circuit cost expressed as the number of basic operations (e.g. like 64bits integer or float addition, multiplication, etc).

So assuming an execution on just 1 thread, and no parallelism, it should be approximately proportional to the inference time. And you can compare different programs global cost.

With parallelism and assuming you compare the same program with different settings (e.g. precisions or p-error constraints), inference time should be a monotonous function of the complexity.