Crate blitzar_sys

Structs

• sxt_bls12_381_g1
  encodes an affine element of the bls12-381 G1 group
• sxt_bls12_381_g1_compressed
  encodes an element of the bls12-381 G1 group in compressed form
• sxt_bls12_381_g1_p2
  encodes an affine element of the bls12-381 G1 group in projective form
• sxt_bn254_g1
  encodes an affine element of the bn254 G1 group
• sxt_bn254_g1_p2
  encodes an affine element of the bn254 G1 group in projective form
• sxt_config
  config struct to hold the chosen backend
• sxt_curve25519_scalar
  encodes an element of the finite field for curve25519
• sxt_grumpkin
  encodes an affine element of the grumpkin group
• sxt_grumpkin_p2
  encodes an affine element of the grumpkin group in projective form
• sxt_multiexp_handle
  resources for multiexponentiations with pre-specified generators
• sxt_ristretto255
  encodes an element of the curve25519 group
• sxt_ristretto255_compressed
  encodes an element of the ristretto255 group
• sxt_sequence_descriptor
  describes a sequence of values
• sxt_transcript
  encodes a strobe-based transcript

Constants

• SXT_CPU_BACKEND
• SXT_CURVE_BLS_381
• SXT_CURVE_BN_254
• SXT_CURVE_GRUMPKIN
• SXT_CURVE_RISTRETTO255
• SXT_GPU_BACKEND

Functions

• sxt_bls12_381_g1_compute_pedersen_commitments_with_generators^⚠
  Compute the Pedersen commitments for sequences of values using bls12-381 G1 group elements.
• sxt_bn254_g1_uncompressed_compute_pedersen_commitments_with_generators^⚠
  Compute the Pedersen commitments for sequences of values using bn254 G1 group elements.
• sxt_curve25519_compute_pedersen_commitments^⚠
  Compute the Pedersen commitments for sequences of values that internally generates curve25519 group elements.
• sxt_curve25519_compute_pedersen_commitments_with_generators^⚠
  Compute the Pedersen commitments for sequences of values using curve25519 group elements.
• sxt_curve25519_get_one_commit^⚠
  Gets the n-th Ristretto point.
• sxt_curve25519_prove_inner_product^⚠
  Creates an inner product proof.
• sxt_curve25519_verify_inner_product^⚠
  Verifies an inner product proof.
• sxt_fixed_multiexponentiation^⚠
  Compute a multiexponentiation using a handle to pre-specified generators.
• sxt_fixed_packed_multiexponentiation^⚠
  Compute a multiexponentiation of scalars in packed format using a handle to pre-specified generators.
• sxt_fixed_vlen_multiexponentiation^⚠
  Compute a varying lengthing multiexponentiation of scalars in packed format using a handle to pre-specified generators.
• sxt_grumpkin_uncompressed_compute_pedersen_commitments_with_generators^⚠
  Compute the Pedersen commitments for sequences of values using grumpkin group elements.
• sxt_init^⚠
  Initializes the library.
• sxt_multiexp_handle_free^⚠
  Free resources for a multiexponentiation handle
• sxt_multiexp_handle_new^⚠
  Create a handle for computing multiexponentiations using a fixed sequence of generators.
• sxt_multiexp_handle_new_from_file^⚠
  Use a serialized file to create a handle for computing multiexponentiations using a fixed sequence of generators.
• sxt_multiexp_handle_write_to_file^⚠
  Write a multiexponentiation handle to file.
• sxt_ristretto255_get_generators^⚠
  Gets the pre-specified random generated elements used for the Pedersen commitments in the sxt_curve25519_compute_pedersen_commitments function.