MurageKibicho

//Full guide : https://leetarxiv.substack.com/p/writing-a-wikipedia-mediawiki-parser
//This code assumes access to Enwik8 and "English.dic" file in https://github.com/kaitz/fxcm/tree/main
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <string.h>
#include <math.h>
#include <sys/mman.h>
#include <stdbool.h>

MurageKibicho

A = -11780958793495227915671392185849473
B =  2967966474637168250591643503811845

T = 22760185083691921160273336139
V = -48454067936694480117959482723

p = 5213619424271520371687014113170182341777563603680354416779

s = 674628418031497608859095525797188659682765178381388426867

MurageKibicho

import random
import cmath

MOD = 1 << 20
samples = 10000
FIXED_LSBS = 3  

# Generate nonces with FIXED_LSBS LSBs = 0
step = 1 << FIXED_LSBS
max_val = MOD // step

MurageKibicho

#CADO Dataset Creator
#Read data file 55 
import csv
import math
import subprocess
start = 0
end   = 0
datasetIndex = 0
cadoFolder = "/home/mint/cado-nfs/build/mint"
cadoScript = "cado-nfs.py"

MurageKibicho

#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <stdbool.h>
#include <time.h>
#include <math.h>
#include <gmp.h>
#include <flint/flint.h>

MurageKibicho

//Convert prime number to eisenstein prime using Cornacchia's algorithm
//Described in https://leetarxiv.substack.com/p/computation-of-discrete-logarithms
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <stdbool.h>
#include <time.h>
#include <math.h>

MurageKibicho

//https://github.com/RasmusFL/EisensteinIntegers/blob/main/EisensteinIntegers/eisenstein_integers.cpp
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <stdbool.h>
#include <time.h>
#include <math.h>
#include <gmp.h>

MurageKibicho

void GaussReduce(fmpz_t x1, fmpz_t y1, fmpz_t x2, fmpz_t y2)
{
	//Shortest solution is stored in x1,y1
	fmpz_t mu, dot12, dot11, tmp,tmp2,tmp3;
	fmpz_init(mu);fmpz_init(tmp2);fmpz_init(tmp3); fmpz_init(dot12); fmpz_init(dot11); fmpz_init(tmp);
	int infiniteLoopCheck = 0;
	while(1)
	{
		//mu = round((v1·v2)/(v1·v1))
		fmpz_mul(dot12, x1, x2);fmpz_mul(tmp, y1, y2);fmpz_add(dot12, dot12, tmp);

MurageKibicho

#Complete walkthrough: https://leetarxiv.substack.com/p/computation-of-discrete-logarithms
import sympy as sp

p = sp.Integer("5213619424271520371687014113170182341777563603680354416779")

# Step 1: find root of -2 mod p
r = sp.sqrt_mod(-2, p, all_roots=False)   # choose one root
if r is None:
    raise ValueError("No solution exists.")

MurageKibicho

import random
import math 

p = 2**256 - 2**32 - 977
def pseudo_mersenne_reduce(x, p):
    # Split into high and low 256-bit parts
    x_low = x & ((1 << 256) - 1)
    x_high = x >> 256

    # First fold: add high * (2^32 + 977)