2023-09-06 | #consensus #cryptography #distributed-systems
Sassafras is a novel consensus protocol designed to address the recurring fork-related challenges encountered in other lottery-based protocols, such as Babe. Sassafras aims to establish a unique association between each epoch’s slots and the validators, ensuring that there will be one and only one validator per slot.
2023-07-23 | #codes
Codes Introduction Given a finite alphabet X a code for X is a function c: X → {0,1}* We can extend the code to arbitrary strings with symbols in X as
2023-07-22 | #codes #cryptography #entropy #information-theory
Entropy is the basic measure to quantify the information yielded by some source. The measure has been mostly introduced and studied by Shannon (~1948) as part of the broader area of information theory, which represents the foundation of modern correction, compression and cryptographic codes.
2023-03-29 | #cryptography #probability
The birthday paradox is a surprising statistical phenomenon that shows how even in a small group, it’s very likely that two people share the same birthday. In this blog post, we’ll explore the math behind the paradox and its practical applications in computer science and cryptography.
2023-03-29 | #cryptography #number-theory
Discrete logarithm is a fundamental concept in modern cryptography, with numerous applications in key exchange, digital signatures, and other cryptographic protocols. This post explores the basics of discrete logarithm and some of the most important cryptographic protocols derived from it.
2023-01-16 | #cryptography #number-theory
Generating random primes and testing their primality is essential for many cryptographic algorithms. In this post, we’ll explore methods for generating and testing prime numbers. Last modification: 2023-08-01 What is this about We want to develop an algorithm that generates a prime in the range [2^(k-1), 2^k - 1], with k the number of bits required to represent the prime.
2022-12-18 | #system #tooling
Discovering the right tools can significantly improve your productivity and user experience on any operating system. In this post, I’ll share some of my go-to tools that I personally use on my workstation to enhance my workflow.
2022-04-23 | #cryptography #security
Variance Recap The variance of an aleatory variable X is a statistical measure of the spread (or dispersion) of a set of values of a random variable. It is defined as the squared deviations of the values from the mean μ.
2022-02-02 | #btrfs #system
RAID1 is a data replication technique that stores two copies of data on two different disks, providing fault tolerance and high availability in case one of the disks fails. With btrfs, you can create a RAID1 array by combining two or more devices.
2021-06-04 | #mathematics #number-theory
Primes Factorization Euclid’s Theorem. Primes are infinite. Proof. Let’s assume that the set of primes P = {p₁, ..., pₙ} is finite and let k = ∏ pᵢ. If the factorization of k+1 contains one prime pᵢ ∈ P then pᵢ|k+1.
