1//===-- Ops.td ---------------------------------------------*- tablegen -*-===//
3// Part of the LLZK Project, under the Apache License v2.0.
4// See LICENSE.txt for license information.
5// Copyright 2025 Veridise Inc.
6// SPDX-License-Identifier: Apache-2.0
8//===----------------------------------------------------------------------===//
13include "llzk/Dialect/Felt/IR/Dialect.td"
14include "llzk/Dialect/Felt/IR/Types.td"
15include "llzk/Dialect/Felt/IR/Attrs.td"
16include "llzk/Dialect/Function/IR/OpTraits.td"
17include "llzk/Dialect/Shared/OpsBase.td"
18include "llzk/Dialect/Felt/IR/OpInterfaces.td"
20include "mlir/IR/OpAsmInterface.td"
21include "mlir/IR/OpBase.td"
22include "mlir/IR/SymbolInterfaces.td"
23include "mlir/Interfaces/SideEffectInterfaces.td"
25//===------------------------------------------------------------------===//
27//===------------------------------------------------------------------===//
29class FeltDialectOp<string mnemonic, list<Trait> traits = []>
30 : Op<FeltDialect, mnemonic, traits>;
32class FeltDialectBinaryOp<string mnemonic, list<Trait> traits = []>
33 : BinaryOpBase<FeltDialect, mnemonic, LLZK_FeltType,
34 traits#[TypesUnify<"lhs", "rhs">,
35 DeclareOpInterfaceMethods<FeltBinaryOpInterface>,
36 InferTypeOpAdaptorWithIsCompatible]> {
37 // Allow any type to avoid building default felt for the result type, we
38 // employ our own inference below.
39 let results = (outs AnyLLZKType:$result);
42 let extraClassDefinition = [{
43 ::llvm::LogicalResult $cppClass::inferReturnTypes(
44 mlir::MLIRContext *context, std::optional<mlir::Location> loc, Adaptor adaptor,
45 llvm::SmallVectorImpl<mlir::Type> &inferred
48 auto value = adaptor.getLhs();
49 inferred[0] = value ? value.getType() : FeltType::get(context, mlir::StringAttr());
50 return mlir::success();
53 bool $cppClass::isCompatibleReturnTypes(mlir::TypeRange l, mlir::TypeRange r) {
59class FeltDialectUnaryOp<string mnemonic, list<Trait> traits = []>
60 : UnaryOpBase<FeltDialect, mnemonic, LLZK_FeltType,
61 traits#[InferTypeOpAdaptorWithIsCompatible]> {
62 // Allow any type to avoid building default felt for the result type, we
63 // employ our own inference below.
64 let results = (outs AnyLLZKType:$result);
67 let extraClassDefinition = [{
68 ::llvm::LogicalResult $cppClass::inferReturnTypes(
69 mlir::MLIRContext *context, std::optional<mlir::Location> loc, Adaptor adaptor,
70 llvm::SmallVectorImpl<mlir::Type> &inferred
73 auto value = adaptor.getOperand();
74 inferred[0] = value ? value.getType() : FeltType::get(context, mlir::StringAttr());
75 return mlir::success();
78 bool $cppClass::isCompatibleReturnTypes(mlir::TypeRange l, mlir::TypeRange r) {
84//===------------------------------------------------------------------===//
86//===------------------------------------------------------------------===//
88def LLZK_FeltConstantOp
89 : FeltDialectOp<"const", [ConstantLike, Pure,
90 DeclareOpInterfaceMethods<
91 OpAsmOpInterface, ["getAsmResultNames"]>,
92 TypeUnifyWithResult<"value">,
93 InferTypeOpAdaptorWithIsCompatible]> {
94 let summary = "field element constant";
96 This operation produces a constant finite field element.
97 `felt.const N : !felt.type<F>` denotes `N mod p`, where `p` is the prime
98 modulus of field `F`. This meaning does not depend on whether the operation
99 has been canonicalized: raw values congruent modulo `p` denote the same
102 The stored integer need not be in `[0, p)`. Canonicalization replaces it
103 with the unique representative in that range without changing its meaning.
104 When the field is unspecified, reduction is deferred until the field is
105 known, and canonicalization leaves the stored integer unchanged.
107 Some analyses or transformations may supply an explicit prime modulus `q`
108 for their arithmetic, such as interval analysis with its `field` option.
109 The constant retains its declared-field meaning: its value is first
110 interpreted as `N mod p`, then reduced modulo `q`, yielding `(N mod p) mod q`.
111 For example, a literal `8` declared in a field of modulus `7` contributes `1`
112 when analyzed with modulus `5`, both before and after canonicalization.
113 If the constant's field is unspecified, it is reduced directly as `N mod q`.
119 %0 = felt.const 99 <"bn254">
123 let arguments = (ins LLZK_FeltConstAttr:$value);
124 let results = (outs AnyLLZKType:$result);
125 let assemblyFormat = [{ $value attr-dict }];
127 let hasCanonicalizeMethod = 1;
130//===------------------------------------------------------------------===//
132//===------------------------------------------------------------------===//
134def LLZK_AddFeltOp : FeltDialectBinaryOp<"add", [Commutative]> {
135 let summary = "addition operator for field elements";
136 let description = [{}];
139def LLZK_SubFeltOp : FeltDialectBinaryOp<"sub"> {
140 let summary = "subtraction operator for field elements";
141 let description = [{}];
144def LLZK_MulFeltOp : FeltDialectBinaryOp<"mul", [Commutative]> {
145 let summary = "multiplication operator for field elements";
146 let description = [{}];
149def LLZK_PowFeltOp : FeltDialectBinaryOp<"pow", [NotFieldNative]> {
150 let summary = "exponentiation operator for field elements";
153 Raises a field element to the power of an exponent.
156 %result = felt.pow %base, %exponent
162def LLZK_DivFeltOp : FeltDialectBinaryOp<"div"> {
163 let summary = "field-division operator for field elements";
165 Performs finite-field division by multiplying the dividend by the
166 multiplicative inverse of the divisor. For a non-zero divisor `b`,
167 `felt.div %a, %b` computes `%a * inv(%b)` modulo the field prime of the result
170 The divisor must be non-zero.
172 This is not integer division. Use `felt.uintdiv` or `felt.sintdiv` when the
173 operands should be interpreted as integers.
177def LLZK_UnsignedIntDivFeltOp
178 : FeltDialectBinaryOp<"uintdiv", [NotFieldNative]> {
179 let summary = "unsigned integer division operator for field elements";
181 Treats the operands as if they were unsigned integers with bitwidth
182 equal to that of the prime modulus and performs division rounding towards zero.
186def LLZK_SignedIntDivFeltOp : FeltDialectBinaryOp<"sintdiv", [NotFieldNative]> {
187 let summary = "signed integer division operator for field elements";
189 Treats the operands as if they were signed integers with bitwidth
190 equal to that of the prime modulus (no additional sign bit is added)
191 and performs division rounding towards zero.
193 The signed integer representation of felt `f` in prime field with modulus
194 `p` follows the following formula:
196 signed_int(f) = f if 0 <= f < p/2 + 1
197 "p/2" here is unsigned integer division rounding towards 0
198 signed_int(f) = f-p if p/2 + 1 <= f < p
202def LLZK_UnsignedModFeltOp : FeltDialectBinaryOp<"umod", [NotFieldNative]> {
204 "unsigned integer modulus/remainder operator for field elements";
206 Computes the remainder that would result from the division operation performed
211def LLZK_SignedModFeltOp : FeltDialectBinaryOp<"smod", [NotFieldNative]> {
212 let summary = "signed integer modulus/remainder operator for field elements";
214 Computes the remainder that would result from the division operation performed
219def LLZK_NegFeltOp : FeltDialectUnaryOp<"neg"> {
220 let summary = "negation operator for field elements";
221 let description = [{}];
224def LLZK_InvFeltOp : FeltDialectUnaryOp<"inv", [NotFieldNative]> {
225 let summary = "inverse operator for field elements";
226 let description = [{}];
230 : FeltDialectBinaryOp<"bit_and", [NotFieldNative, Commutative]> {
231 let summary = "bitwise AND operator for field elements";
232 let description = [{}];
236 : FeltDialectBinaryOp<"bit_or", [NotFieldNative, Commutative]> {
237 let summary = "bitwise OR operator for field elements";
238 let description = [{}];
242 : FeltDialectBinaryOp<"bit_xor", [NotFieldNative, Commutative]> {
243 let summary = "bitwise XOR operator for field elements";
244 let description = [{}];
247def LLZK_NotFeltOp : FeltDialectUnaryOp<"bit_not", [NotFieldNative]> {
248 let summary = "integer complement (bitwise-not) operator for field elements";
250 Treats the operand as an integer with a bitwidth equal to the bitwidth
251 of the prime field's modulus and compute the one's complement of the integer.
252 The result is converted back to a field element by applying the prime modulus.
256def LLZK_ShlFeltOp : FeltDialectBinaryOp<"shl", [NotFieldNative]> {
257 let summary = "left shift operator for field elements";
259 Treats both operands as unsigned integer representatives of field elements.
260 `felt.shl %a, %b` computes `%a * 2^%b`, then converts the result back to a
261 field element by reducing modulo the field prime.
265def LLZK_ShrFeltOp : FeltDialectBinaryOp<"shr", [NotFieldNative]> {
266 let summary = "right shift operator for field elements";
268 Treats both operands as unsigned integer representatives of field elements.
269 `felt.shr %a, %b` computes `%a / 2^%b` using unsigned integer division
270 rounding towards zero, then converts the result back to a field element.
274#endif // LLZK_FELT_OPS