longfellow 0.1.0

data/lib/longfellow.rb

@@ -0,0 +1,162 @@
+# frozen_string_literal: true
+
+require_relative "longfellow/version"
+require_relative "longfellow/errors"
+require_relative "longfellow/c"
+require_relative "longfellow/zk_spec"
+require_relative "longfellow/attribute"
+
+# Ruby bindings for Google's longfellow-zk library
+# (https://github.com/google/longfellow-zk): zero-knowledge proofs over ISO
+# mdoc / mDL verifiable credentials.
+#
+# The typical flow is:
+#
+#   spec    = Longfellow.zk_specs.last                 # pick a ZK specification
+#   circuit = Longfellow.generate_circuit(spec)        # once; cache the result
+#   proof   = Longfellow.prove(circuit:, zk_spec:, ...)   # prover side
+#   Longfellow.verify(circuit:, zk_spec:, proof:, ...)    # verifier side
+module Longfellow
+  # Default mdoc document type ("org.iso.18013.5.1.mDL").
+  DEFAULT_DOC_TYPE = "org.iso.18013.5.1.mDL"
+
+  class << self
+    # All ZK specifications hardcoded into the native library.
+    # @return [Array<Longfellow::ZkSpec>]
+    def zk_specs
+      @zk_specs ||= C.zk_specs.map { |s| ZkSpec.new(s) }.freeze
+    end
+
+    # Look up a ZK specification by system name and circuit hash.
+    # @return [Longfellow::ZkSpec, nil]
+    def find_zk_spec(system_name, circuit_hash)
+      ptr = C.find_zk_spec(system_name, circuit_hash)
+      return nil if ptr.null?
+
+      ZkSpec.new(C::ZkSpecStruct.new(ptr))
+    end
+
+    # Produce the compressed circuit bytes for the given specification. This is
+    # deterministic and can be cached and reused by provers and verifiers.
+    # @param zk_spec [Longfellow::ZkSpec]
+    # @return [String] binary circuit bytes
+    def generate_circuit(zk_spec)
+      cb = FFI::MemoryPointer.new(:pointer)
+      clen = FFI::MemoryPointer.new(:size_t)
+      code = C.generate_circuit(zk_spec.to_ptr, cb, clen)
+      Errors.check_circuit!(code)
+      read_and_free(cb, clen)
+    end
+
+    # Compute the 32-byte identifier (SHA-256 over the two sub-circuit ids) of a
+    # compressed circuit bundle.
+    # @param circuit [String] compressed circuit bytes
+    # @param zk_spec [Longfellow::ZkSpec]
+    # @return [String] 32 binary bytes
+    def circuit_id(circuit, zk_spec)
+      out = FFI::MemoryPointer.new(:uint8, C::CIRCUIT_ID_SIZE)
+      data = byte_pointer(circuit)
+      rc = C.circuit_id(out, data, circuit.bytesize, zk_spec.to_ptr)
+      raise Error, "circuit_id failed (circuit could not be parsed)" if rc != 1
+
+      out.read_bytes(C::CIRCUIT_ID_SIZE)
+    end
+
+    # Generate a zero-knowledge proof opening the requested attributes of an
+    # mdoc. Raises {ProverError} on failure (e.g. invalid mdoc, time outside the
+    # validity window, attribute not present).
+    #
+    # @param circuit [String] compressed circuit bytes (see {#generate_circuit})
+    # @param mdoc [String] the full mdoc/mDL bytes
+    # @param public_key_x [String] issuer public key X coordinate (string rep)
+    # @param public_key_y [String] issuer public key Y coordinate (string rep)
+    # @param transcript [String] session transcript bytes
+    # @param attributes [Array<Longfellow::Attribute, Hash>] claims to open
+    # @param now [String] current time, e.g. "2023-11-02T09:00:00Z"
+    # @param zk_spec [Longfellow::ZkSpec]
+    # @return [String] binary proof bytes
+    def prove(circuit:, mdoc:, public_key_x:, public_key_y:, transcript:,
+              attributes:, now:, zk_spec:)
+      attrs_ptr, count = build_attributes(attributes)
+      prf = FFI::MemoryPointer.new(:pointer)
+      plen = FFI::MemoryPointer.new(:size_t)
+
+      code = C.run_mdoc_prover(
+        byte_pointer(circuit), circuit.bytesize,
+        byte_pointer(mdoc), mdoc.bytesize,
+        public_key_x.to_s, public_key_y.to_s,
+        byte_pointer(transcript), transcript.bytesize,
+        attrs_ptr, count,
+        now.to_s,
+        prf, plen, zk_spec.to_ptr
+      )
+      Errors.check_prover!(code)
+      read_and_free(prf, plen)
+    end
+
+    # Verify a zero-knowledge proof against the requested attributes. Returns
+    # true on success, raises {VerifierError} otherwise.
+    #
+    # @param doc_type [String] mdoc document type (defaults to {DEFAULT_DOC_TYPE})
+    # @return [true]
+    def verify(circuit:, public_key_x:, public_key_y:, transcript:, attributes:,
+               now:, proof:, zk_spec:, doc_type: DEFAULT_DOC_TYPE)
+      attrs_ptr, count = build_attributes(attributes)
+
+      code = C.run_mdoc_verifier(
+        byte_pointer(circuit), circuit.bytesize,
+        public_key_x.to_s, public_key_y.to_s,
+        byte_pointer(transcript), transcript.bytesize,
+        attrs_ptr, count,
+        now.to_s,
+        byte_pointer(proof), proof.bytesize,
+        doc_type.to_s, zk_spec.to_ptr
+      )
+      Errors.check_verifier!(code)
+      true
+    end
+
+    private
+
+    # Copy a Ruby string into a native buffer. Returns a NULL pointer for empty
+    # input so callers can pass through optional byte fields.
+    def byte_pointer(str)
+      bytes = String(str).b
+      return FFI::Pointer::NULL if bytes.empty?
+
+      ptr = FFI::MemoryPointer.new(:uint8, bytes.bytesize)
+      ptr.put_bytes(0, bytes)
+      ptr
+    end
+
+    # Build a contiguous C array of RequestedAttribute. Returns
+    # [pointer, count]; an empty list yields [NULL, 0].
+    def build_attributes(attributes)
+      attrs = Array(attributes).map { |a| Attribute.coerce(a) }
+      return [FFI::Pointer::NULL, 0] if attrs.empty?
+
+      array = FFI::MemoryPointer.new(C::RequestedAttribute, attrs.size)
+      attrs.each_with_index do |attr, i|
+        struct = C::RequestedAttribute.new(
+          array + (i * C::RequestedAttribute.size)
+        )
+        attr.write_to(struct)
+      end
+      [array, attrs.size]
+    end
+
+    # Read a (uint8_t* out, size_t* len) pair filled by the native side and free
+    # the C-allocated buffer.
+    def read_and_free(out_ptr, len_ptr)
+      buffer = out_ptr.read_pointer
+      length = len_ptr.read(:size_t)
+      return +"" if buffer.null? || length.zero?
+
+      begin
+        buffer.read_bytes(length)
+      ensure
+        C.c_free(buffer)
+      end
+    end
+  end
+end

data/sig/longfellow.rbs

@@ -0,0 +1,74 @@
+module Longfellow
+  VERSION: String
+  DEFAULT_DOC_TYPE: String
+
+  def self.zk_specs: () -> Array[ZkSpec]
+  def self.find_zk_spec: (String system_name, String circuit_hash) -> ZkSpec?
+  def self.generate_circuit: (ZkSpec zk_spec) -> String
+  def self.circuit_id: (String circuit, ZkSpec zk_spec) -> String
+
+  def self.prove: (
+    circuit: String,
+    mdoc: String,
+    public_key_x: String,
+    public_key_y: String,
+    transcript: String,
+    attributes: Array[Attribute | Hash[Symbol | String, String]],
+    now: String,
+    zk_spec: ZkSpec
+  ) -> String
+
+  def self.verify: (
+    circuit: String,
+    public_key_x: String,
+    public_key_y: String,
+    transcript: String,
+    attributes: Array[Attribute | Hash[Symbol | String, String]],
+    now: String,
+    proof: String,
+    zk_spec: ZkSpec,
+    ?doc_type: String
+  ) -> bool
+
+  class Error < StandardError
+  end
+
+  class NativeError < Error
+    attr_reader code: Integer
+    attr_reader symbol: Symbol
+    def initialize: (Symbol symbol, Integer code, String context) -> void
+  end
+
+  class ProverError < NativeError
+  end
+
+  class VerifierError < NativeError
+  end
+
+  class CircuitGenerationError < NativeError
+  end
+
+  class ZkSpec
+    attr_reader system: String?
+    attr_reader circuit_hash: String
+    attr_reader num_attributes: Integer
+    attr_reader version: Integer
+    attr_reader block_enc_hash: Integer
+    attr_reader block_enc_sig: Integer
+    def to_ptr: () -> untyped
+  end
+
+  class Attribute
+    MAX_NAMESPACE: Integer
+    MAX_ID: Integer
+    MAX_CBOR_VALUE: Integer
+
+    attr_reader namespace_id: String
+    attr_reader id: String
+    attr_reader cbor_value: String
+
+    def initialize: (namespace_id: String, id: String, cbor_value: String) -> void
+    def self.coerce: (Attribute | Hash[Symbol | String, String] obj) -> Attribute
+    def write_to: (untyped struct) -> untyped
+  end
+end

data/vendor/longfellow-zk/LICENSE

@@ -0,0 +1,203 @@
+Copyright © 2025 Google LLC
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/vendor/longfellow-zk/lib/algebra/blas.h

@@ -0,0 +1,121 @@
+// Copyright 2026 Google LLC.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+#ifndef PRIVACY_PROOFS_ZK_LIB_ALGEBRA_BLAS_H_
+#define PRIVACY_PROOFS_ZK_LIB_ALGEBRA_BLAS_H_
+
+// basic linear algebra subroutines
+#include <stddef.h>
+
+namespace proofs {
+template <class Field>
+class Blas {
+ public:
+  using Elt = typename Field::Elt;
+
+  // SUM_{i} x[i * incx].y[i * incy]
+  static Elt dot(size_t n, const Elt x[/*n:incx*/], size_t incx,
+                 const Elt y[/*n:incy*/], size_t incy, const Field& F) {
+    Elt r = F.zero();
+    for (size_t i = 0; i < n; i++) {
+      F.add(r, F.mulf(x[i * incx], y[i * incy]));
+    }
+    return r;
+  }
+
+  // SUM_{i} x[i * incx], or the dot product x^T * 1
+  static Elt dot1(size_t n, const Elt x[/*n:incx*/], size_t incx,
+                  const Field& F) {
+    Elt r = F.zero();
+    for (size_t i = 0; i < n; ++i) {
+      F.add(r, x[i * incx]);
+    }
+    return r;
+  }
+
+  // y = a*y
+  static void scale(size_t n, Elt y[/*k:incy*/], size_t incy, const Elt a,
+                    const Field& F) {
+    for (size_t i = 0; i < n; i++) {
+      F.mul(y[i * incy], a);
+    }
+  }
+
+  // y = a*x + y.
+  static void axpy(size_t n, Elt y[/*k:incy*/], size_t incy, const Elt a,
+                   const Elt x[/*k:incx*/], size_t incx, const Field& F) {
+    for (size_t i = 0; i < n; i++) {
+      F.add(y[i * incy], F.mulf(x[i * incx], a));
+    }
+  }
+
+  // nonstandard axpy() where A[] is itself an array
+  static void vaxpy(size_t n, Elt y[/*k:incy*/], size_t incy,
+                    const Elt a[/*k:inca*/], size_t inca,
+                    const Elt x[/*k:incx*/], size_t incx, const Field& F) {
+    for (size_t i = 0; i < n; i++) {
+      F.add(y[i * incy], F.mulf(x[i * incx], a[i * inca]));
+    }
+  }
+
+  // y[i] -= a[i] * x[i]
+  static void vymax(size_t n, Elt y[/*k:incy*/], size_t incy,
+                    const Elt a[/*k:inca*/], size_t inca,
+                    const Elt x[/*k:incx*/], size_t incx, const Field& F) {
+    for (size_t i = 0; i < n; i++) {
+      F.sub(y[i * incy], F.mulf(x[i * incx], a[i * inca]));
+    }
+  }
+
+  static bool equal(size_t n, const Elt x[/*n:incx*/], size_t incx,
+                    const Elt y[/*n:incy*/], size_t incy, const Field& F) {
+    for (size_t i = 0; i < n; i++) {
+      if (x[i * incx] != y[i * incy]) return false;
+    }
+    return true;
+  }
+
+  static bool equal0(size_t n, const Elt x[/*n:incx*/], size_t incx,
+                     const Field& F) {
+    for (size_t i = 0; i < n; i++) {
+      if (x[i * incx] != F.zero()) return false;
+    }
+    return true;
+  }
+
+  static void copy(size_t n, Elt dst[/*n:incx*/], size_t incd,
+                   const Elt src[/*n:incy*/], size_t incs) {
+    for (size_t i = 0; i < n; i++) {
+      dst[i * incd] = src[i * incs];
+    }
+  }
+
+  // DST[i] = SRC[IDX[i]].  DST and SRC must not overlap.
+  static void gather(size_t n, Elt dst[/*n*/], const Elt src[],
+                     const size_t idx[/*n*/]) {
+    for (size_t i = 0; i < n; i++) {
+      dst[i] = src[idx[i]];
+    }
+  }
+
+  static void clear(size_t n, Elt dst[/*n:incx*/], size_t incd,
+                    const Field& F) {
+    for (size_t i = 0; i < n; i++) {
+      dst[i * incd] = F.zero();
+    }
+  }
+};
+}  // namespace proofs
+
+#endif  // PRIVACY_PROOFS_ZK_LIB_ALGEBRA_BLAS_H_

data/vendor/longfellow-zk/lib/algebra/bogorng.h

@@ -0,0 +1,68 @@
+// Copyright 2026 Google LLC.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+#ifndef PRIVACY_PROOFS_ZK_LIB_ALGEBRA_BOGORNG_H_
+#define PRIVACY_PROOFS_ZK_LIB_ALGEBRA_BOGORNG_H_
+
+#include <cstdint>
+namespace proofs {
+// Totally bogus "random" number generator, used only for testing.
+// The public and internal functions of this class all take a const Field&
+// parameter to produce random elements in the Field. It is the caller's
+// responsibility to ensure the object remains valid during execution.
+//
+// We are testing mostly with prime fields. Following Knuth, we pick a simple
+// multiplier a, with reasonable Hamming weight, and good spectral scores.
+// The smallest prime we care about is ~23 bits, so we tune "a" for that.
+// For GF2_128, we use the same a*x generator, and have a unit test to ensure
+// there are no short loops.
+//
+// Rank 3: a = 7300988
+// Binary: 0b11011110110011101111100
+// 2D Spectral Score: 2737.21 (Max theoretical is ~3109)
+// 3D Spectral Score: 184.24 (Max theoretical is ~228)
+//
+// 3d: 184.24
+// 3d: 7300988.00 // for > 128-bit field
+template <class Field>
+class Bogorng {
+  using Elt = typename Field::Elt;
+
+ public:
+  explicit Bogorng(const Field* F, uint64_t seed = 1234569u,
+                   uint64_t mul = 7300988u)
+      : f_(F), next_(F->of_scalar_field(seed)), mul_(F->of_scalar_field(mul)) {}
+
+  Elt next() {
+    // really old-school
+    f_->mul(next_, mul_);
+    return next_;
+  }
+
+  Elt nonzero() {
+    Elt x;
+    do {
+      x = next();
+    } while (x == f_->zero());
+    return x;
+  }
+
+ private:
+  const Field* f_;
+  Elt next_;
+  Elt mul_;
+};
+}  // namespace proofs
+
+#endif  // PRIVACY_PROOFS_ZK_LIB_ALGEBRA_BOGORNG_H_

data/vendor/longfellow-zk/lib/algebra/compare.h

@@ -0,0 +1,40 @@
+// Copyright 2026 Google LLC.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+#ifndef PRIVACY_PROOFS_ZK_LIB_ALGEBRA_COMPARE_H_
+#define PRIVACY_PROOFS_ZK_LIB_ALGEBRA_COMPARE_H_
+
+#include <cstddef>
+#include <cstdint>
+
+namespace proofs {
+
+// canonical a < b operation, defined as lexicographic comparison of
+// the Elt's serialization
+template <class Field>
+bool elt_less_than(const typename Field::Elt& a, const typename Field::Elt& b,
+                   const Field& F) {
+  uint8_t ua[Field::kBytes], ub[Field::kBytes];
+  F.to_bytes_field(ua, a);
+  F.to_bytes_field(ub, b);
+  for (size_t j = 0; j < Field::kBytes; ++j) {
+    if (ua[j] < ub[j]) return true;
+    if (ua[j] > ub[j]) return false;
+  }
+  return false;  // equal
+}
+
+}  // namespace proofs
+
+#endif  // PRIVACY_PROOFS_ZK_LIB_ALGEBRA_COMPARE_H_