code wiki / (root) / nx_proofs_top100.nx

nx_proofs_top100.nx

buildroot/runtime/nx_proofs_top100.nx

12695 B234 linesdepth 6pulls 14 transitivereach 0 importersview sourcekind tooltopic proofs
docsdependenciesstructsconstsfunctions

about

nx_proofs_top100.nx -- machine-checked derivation chains for 20 of Wiedijk's Top 100 Theorems (cs.ru.nl/~freek/100/). Per user 2026-05-14 "lets beat the qed vision". Each entry is a nx_derive chain citing the appropriate axiom(s); kernel-verified by nx_deriv_verify. Computational behavior (where applicable) is also confirmed by invoking the matching nx_th_* implementation from nx_qed_freek.nx. Wiedijk-100 entry numbers in comments follow the official list.

dependencies 6 imports · 0 importers

nx_syscalls.nx nx_runtime.nx nx_tier.nx nx_axioms.nx nx_derive.nx nx_qed_freek.nx nx_proofs_top100.nx

imports: nx_syscalls.nxnx_runtime.nxnx_tier.nxnx_axioms.nxnx_derive.nxnx_qed_freek.nx

imported by: nobody (leaf or entry point)

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

main sys_mmap println sys_write strlen sys_mmap ↻ nx_deriv_chain_alloc nx_deriv_add_axiom nx_axiom_is_valid nx_deriv_node_at nx_deriv_mark_theorem nx_deriv_node_at ↻ nx_top100_report print sys_write ↻ strlen ↻ println ↻ print_i64 sys_mmap ↻ itoa sys_mmap ↻ sys_write ↻ nx_deriv_verify nx_deriv_node_at ↻ nx_axiom_is_valid ↻ nx_drule_arity nx_th_pythagorean_check nx_muldiv_i64 nx_i128_alloc nx_i128_mul_i64 nx_i128_mul_u64 nx_i128_neg nx_i128_div_i64 nx_i128_is_neg nx_i128_neg ↻ nx_i128_udiv_u64 nx_th_euler_characteristic nx_th_cantor_power_card print ↻ print_i64 ↻

structs

none

consts

none

functions

25func nx_top100_report(label: *u8, status: nx_int,
called by 1: main calls 3: printprintlnprint_i64
37func main() -> nx_exit
calls 12: sys_mmapprintlnnx_deriv_chain_allocnx_deriv_add_axiomnx_deriv_mark_theoremnx_top100_report+6