Circulant is a generally non-symmetric matrix given by A[i,j] = 1 + (j-i+n)%n. For example, for n=5, [ 1 2 3 4 5 ] [ 5 1 2 3 4 ] A = [ 4 5 1 2 3 ] [ 3

This file implements types for helping to convert to Fortran testing capabilities. fortran64 is a float64 type that prints as a double precision const

Creation is a singular non-symmetric matrix given by A[i,j] = i, if j == i-1, = 0, otherwise. For example, for n=5, [ . . . . . ] [ 1 . . . . ] A =

Downshift is a non-singular upper Hessenberg matrix given by A[i,j] = 1, if (i-j+n)%n == 1, = 0, otherwise. For example, for n=5, [ . . . . 1 ] [ 1

Fibonacci is an upper Hessenberg matrix with 3 distinct real eigenvalues. For example, for n=5, [ . 1 . . . ] [ 1 1 . . . ] A = [ . 1 1 . . ] [ . . 1

Gear is a singular non-symmetric matrix with real eigenvalues. For example, for n=5, [ . 1 . . 1 ] [ 1 . 1 . . ] A = [ . 1 . 1 . ] [ . . 1 . 1 ] [-1 .

Lesp is a tridiagonal, generally non-symmetric matrix given by A[i,j] = -2*i-5 if i == j, = 1/(i+1) if i == j-1, = j+1 if i == j+1. For exampl

Set represents an explicit anonymity set as a list of public keys.

Clement is a generally non-symmetric matrix given by A[i,j] = i+1, if j == i+1, = n-i, if j == i-1, = 0, otherwise. For example, for n=5, [ . 1 .

Diagonal is a diagonal matrix given by A[i,j] = i+1, if i == j, = 0, otherwise. For example, for n=5, [ 1 . . . . ] [ . 2 . . . ] A = [ . . 3 . .

Zero is a matrix with all elements equal to zero.

Wilk20 is a 20×20 lower Hessenberg matrix. If the parameter is 0, the matrix has 20 distinct real eigenvalues. If the parameter is 1e-10, the matrix h

CumulantKind specifies the behavior for calculating the empirical CDF or Quantile

SigShare encodes a threshold BLS signature share Si = i || v where the 2-byte big-endian value i corresponds to the share's index and v represents the

Protobufs enums are transmitted as unsigned varints; using this type alias is optional but recommended to ensure they get the correct type.

Protocol represents the role of a participant in a clique protocol. A participant is represented as a higher-order function taking a StarContext, whic

Prover represents the prover role in an arbitrary Sigma-protocol. A prover is simply a higher-order function that takes a ProverContext, runs the prot

Message fields declared to have exactly this type will be transmitted as fixed-size 32-bit signed integers.

Message fields declared to have exactly this type will be transmitted as fixed-size 64-bit signed integers.

Message fields declared to have exactly this type will be transmitted as fixed-size 32-bit unsigned integers.

Message fields declared to have exactly this type will be transmitted as fixed-size 64-bit unsigned integers.

Verifier represents the verifier role in an arbitrary Sigma-protocol. A verifier is a higher-order function that takes a VerifierContext, runs the pro

And predicate //////////

test custom type-aliases

Or predicate //////////

A123 is the non-symmetric singular matrix [ 1 2 3 ] A = [ 4 5 6 ] [ 7 8 9 ] It has three distinct real eigenvalues.

AllowsVarTime allows callers to determine if a given kyber.Scalar or kyber.Point supports opting-in to variable time operations. If an object implemen

AntisymRandom is a anti-symmetric random matrix. All its eigenvalues are imaginary with one zero if the order is odd.

Band represents a band matrix using the band storage scheme.

Band represents a band matrix using the band storage scheme.

Band represents a band matrix using the band storage scheme.

Band represents a band matrix using the band storage scheme.

A BandWidther represents a banded matrix and can return the left and right half-bandwidths, k1 and k2.

Basic unoptimized reference implementation of Twisted Edwards curves. This reference implementation is mainly intended for testing, debugging, and ins

Bernoulli represents a random variable whose value is 1 with probability p and value of zero with probability 1-P. The value of P must be between 0 an

Beta implements the Beta distribution, a two-parameter continuous distribution with support between 0 and 1. The beta distribution has density functi

Bhattacharyya is a type for computing the Bhattacharyya distance between probability distributions. The Battachara distance is defined as D_B = -ln(B

BinaryEncoding represents a simple binary encoding suitable for reading and writing fixed-length cryptographic objects. The interface allows reading a

ByteOrder denotes the endianness of the operation.

CC is a type for computing the canonical correlations of a pair of matrices. The results of the canonical correlation analysis are only valid if the c

Categorical is an extension of the Bernouilli distribution where x takes values {0, 1, ..., len(w)-1} where w is the weight vector. Categorical must b

ChiSquared implements the χ² distribution, a one parameter distribution with support on the positive numbers. The density function is given by 1/(2^{

Cholesky is a type for creating and using the Cholesky factorization of a symmetric positive definite matrix. Cholesky methods may only be called on

A Cloner can make a copy of a into the receiver, overwriting the previous value of the receiver. The clone operation does not make any restriction on

A ColViewer can return a Vector reflecting a column that is backed by the matrix data. The Vector returned will have length equal to the number of row

CombinationGenerator generates combinations iteratively. Combinations may be called to generate all combinations collectively.

ComplaintCommits is sent if the secret commitments revealed by a peer are not valid.

CompletePolicy is the default policy requiring that all participants have cosigned to make a collective signature valid.

Complex is a complex matrix constructed from two real matrices.

Complex128 defines the public complex128 LAPACK API supported by gonum/lapack.

Complex128 implements the double precision complex BLAS routines.

Complex128Level1 implements the double precision complex BLAS Level 1 routines.

Complex128Level2 implements the double precision complex BLAS Level 2 routines.

Complex128Level3 implements the double precision complex BLAS Level 3 routines.

Complex64 implements the single precision complex BLAS routines.

Complex64Level1 implements the single precision complex BLAS Level 1 routines.

Complex64Level2 implements the single precision complex BLAS routines Level 2 routines.

Complex64Level3 implements the single precision complex BLAS Level 3 routines.

Condition is the condition number of a matrix. The condition number is defined as ||A|| * ||A^-1||. One important use of Condition is during linear s

Conjugate is a type for performing an implicit matrix conjugate transpose. It implements the Matrix interface, returning values from the conjugate tra

Constructor represents a generic constructor that takes a reflect.Type, typically for an interface type, and constructs some suitable concrete instanc