code wiki / (root) / nx_fec_gf256_test.nx

nx_fec_gf256_test.nx

buildroot/runtime/nx_fec_gf256_test.nx

2807 B78 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic fec
docsdependenciesstructsconstsfunctions

about

nx_fec_gf256_test.nx -- 1:1 KAT for Reed-Solomon GF(256) erasure coding (nx_fec_gf256.nx). Proves the MDS ceiling: an RS(6,4) code recovers ANY 2 erasures in ANY positions -- verified EXHAUSTIVELY over all 15 two-erasure patterns (data+data, data+parity, parity+parity). Plus GF-field sanity and the honest over-budget (3 erasures) -> failure. expect_exit: 0 license_tier: ORIGINAL

dependencies 1 imports · 0 importers

nx_fec_gf256.nx nx_fec_gf256_test.nx

imports: nx_fec_gf256.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main gf_build gf_mul gf_inv rs_encode rs_cauchy gf_inv ↻ gf_mul ↻ gft_load gft_zero_pkt rs_decode_erasures sys_mmap rs_cauchy ↻ gf_mat_invert sys_mmap ↻ gf_inv ↻ gf_mul ↻ gf_mul ↻

structs

none

consts

12const RK: i64 = 4
13const RR: i64 = 2
14const RS_: i64 = 4

functions

17func gft_load(recv: *u8, data: *u8, parity: *u8) -> i64
called by 1: main
24func gft_zero_pkt(recv: *u8, idx: i64) -> i64
called by 1: main
30func main() -> i64
calls 7: gf_buildgf_mulgf_invrs_encodegft_loadgft_zero_pkt+1