fountain_scheme 1.0.1

Configurable fountain code schemes built on fountain_engine
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

// Copyright (c) 2025 Shenghao Yang. All rights reserved.
// Licensed under the MIT License. See LICENSE-MIT for details.

/// Compute the binomial coefficient C(n, r) in `u128`.
///
/// Uses the multiplicative formula and symmetry (`r = min(r, n-r)`).
pub fn binomial(n: usize, r: usize) -> u128 {
    if r > n {
        return 0;
    }
    let r = r.min(n - r);
    if r == 0 {
        return 1;
    }
    let mut result = 1u128;
    for i in 1..=r {
        let num = (n - r + i) as u128;
        let den = i as u128;
        result = (result * num) / den;
    }
    result
}

/// Compute the middle binomial coefficient C(h, ceil(h/2)).
pub fn middle_binomial(h: usize) -> u128 {
    let r = h.div_ceil(2);
    binomial(h, r)
}

/// Return the smallest prime number greater than or equal to `n`.
pub fn smallest_prime_ge(mut n: usize) -> usize {
    if n <= 2 {
        return 2;
    }
    if n.is_multiple_of(2) {
        n += 1;
    }
    while !is_prime(n) {
        n += 2;
    }
    n
}

/// Primality test for positive integers.
pub fn is_prime(n: usize) -> bool {
    if n < 2 {
        return false;
    }
    if n == 2 {
        return true;
    }
    if n.is_multiple_of(2) {
        return false;
    }
    let mut d = 3usize;
    while d * d <= n {
        if n.is_multiple_of(d) {
            return false;
        }
        d += 2;
    }
    true
}