This is not a Monad Tutorial

Not a Monad Tutorial

Sign in Subscribe

Latest — Feb 3, 2023

What is property-based testing? Two examples in Rust

This article will explore property-based tests and demonstrate their use in two of our open-source projects. First, let's explain what a property-based test (PBT) is: If a picture is worth a thousand words, a PBT is worth a thousand unit tests (although this is tunable, as we will see later)

More issues

A walkthrough on the open source Aleo VM implemented with Arkworks and blockchain implemented with Tendermint

Introduction For the last 12 weeks, at LambdaClass, we have been developing an alternative implementation of the Aleo Blockchain. We want to thank Alex Pruden and Howard Wu from Aleo for their support throughout the process. At a high level, the project consists of a Consensus Layer using Tendermint and

Champagne SuperNova, incrementally verifiable computation

Introduction In the lasts posts we've been writing about proving systems and incremental verifiable computation: * Pinocchio Virtual Machine: Nearly Practical Verifiable Computation * Decentralized private computation: ZEXE and VERI-ZEXE * Incrementally verifiable computation: NOVA Incremental proof systems offer some advantages over conventional proving systems: * They do not require static bounds on loop

Proof aggregation schemes: SnarkPack and aPlonk

Introduction zk-SNARKs are powerful cryptographic primitives, allowing one party, known as the prover, to show to a second party, the verifier, that he knows a given secret, without revealing anything about it. This has applications, for example, in decentralized private computations, where we can delegate an expensive computation to an

Climbing the tower: field extensions

Introduction Finite fields are a central piece in every cryptography and zk-SNARKs. The most common finite fields appearing in practice are the fields with prime order $\mathbb F_p$. There are multiple ways of defining them. A usual one is seeing $\mathbb F_p$ as the set $$ \{0, 1, \cdots,

ZPrize: eyes on the prize

Introduction This post contains a summary of different approaches to optimize multiscalar multiplication with CUDA, as presented for ZPrize. This is an important calculation in certain proving systems (zk-SNARKs), where it is necessary to add lots of points over an elliptic curve. These large sums can be broken down into

CUDA've been faster: learning CUDA from scratch

Practical CUDA CUDA is a parallel computing platform and programming model developed by NVIDIA for general computing on graphical processing units. We can use it to accelerate expensive computations, distributing the load over several processors. For example, in some zk-SNARKs, we have to calculate a multiscalar multiplication, which involves summing

Incrementally verifiable computation: NOVA

Introduction One of the current goals is to realize, in an efficient way, incrementally verifiable computation (IVC). This cryptographic primitive allows a given party to show the integrity of a given computer program's execution by providing proof that the result of each step is correct and that all previous ones

Message Authentication Codes

Introduction We discussed previously how to ensure message confidentiality between two parties, Alice and Bob. We saw that we could use a symmetric key cipher, such as AES or ChaCha20, to encrypt messages between Alice and Bob so that only they can read them. However, when Bob gets a message

Symmetric encryption

Introduction Encryption has been the main application of cryptography for a very long time. Its goal is to transform a message into another one and send it through an insecure channel, such that only the intended parties (who know all the elements necessary to reverse the transformation) can read it