Eventual validity and normalized cost of the chosen parameters #
Fixed block-count cutoffs supply the code rate, packing precision, synthesis precision, and direction/copy margins. A single exponential-growth estimate absorbs the complete seventh-degree runtime overhead after normalization by the input length.
Integral sharp bound used for every shorter resource function.
Equations
- parameters.resourceBound inputs = (parameters.resourcePrecision + 1) * 2 ^ parameters.geometry.suffixWidth inputs / (parameters.resourcePrecision * parameters.geometry.suffixWidth inputs)
Instances For
Exact finite theorem bound at the selected input-length parameters.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Numerical and resource-synthesis premises needed to apply the finite theorem and obtain the target coefficient at one input length.
Absorbs the scheduler's fixed constant and ensures positive field width.
The scheduled batch covers the rational exponent rounded upward.
- resourcesBounded (function : ScalarFunction Bool (parameters.geometry.suffixWidth inputs)) : (LupanovSynthesis.lupanovCircuit (parameters.geometry.suffixWidth inputs) function).cost DeMorgan.standardCost ≤ parameters.resourceBound inputs
Every actual shorter Lupanov circuit meets the selected integral bound.
- costBound : precision * (denominator - numerator) * inputs * parameters.totalCost inputs ≤ (precision + 1) * denominator * 2 ^ inputs
The complete finite cost satisfies the target normalized coefficient.
Instances For
All chosen premises hold eventually, uniformly in the Boolean function and in the number of requested copies.