Skip to content

README.md

Latest commit

 

History

History
213 lines (175 loc) · 4.92 KB

README.md

File metadata and controls

213 lines (175 loc) · 4.92 KB
Raw

Prefix

Prefix is a programming language focused on explicit, readable code.

! LCG cracker.
! Recovers the modulus m, multiplier a, and constant c of a linear
! congruential generator from a short run of consecutive outputs, then
! predicts the next value.

! ---------- modular inverse via the extended Euclidean algorithm ----------
FUNC INT modinv(INT a, INT m){
    a = MOD(a, m)
    IF(LT(a, 0d0)){ a = +(a, m) }
    INT r0 = m
    INT r1 = a
    INT t0 = 0d0
    INT t1 = 0d1
    WHILE(NEQ(r1, 0d0)){
        INT q = /(r0, r1)
        INT nr = -(r0, *(q, r1))
        INT nt = -(t0, *(q, t1))
        r0 = r1
        r1 = nr
        t0 = t1
        t1 = nt
    }
    IF(NEQ(r0, 0d1)){
        THROW("modinv: arguments not coprime")
    }
    INT inv = MOD(t0, m)
    IF(LT(inv, 0d0)){ inv = +(inv, m) }
    RETURN(inv)
}

! ---------- the hidden LCG (the secret being cracked) ----------
! x_{n+1} = (a * x_n + c) mod m
! The modulus is kept below 2^31 so that products of two consecutive
! differences (each < m) never overflow Prefix's signed 64-bit INT.
INT m = 0x186A1
INT a = 0d16807
INT c = 0d12345
INT seed = 0d48271

FUNC INT step(INT s){
    RETURN(MOD(+( *(a, s), c), m))
}

! ---------- collect observed outputs (all the attacker sees) ----------
MAP obs
INT s = seed
FOR(i, 0d8){
    obs<i> = s
    s = step(s)
}
DEL("seed")
DEL("s")

! ---------- recover the modulus m ----------
! t_i = x_{i+1} - x_i  follows  t_{i+1} = a * t_i (mod m), so each
! u_k = t_{k+1} * t_{k-1} - t_k^2 is a multiple of m.  GCD of several
! |u_k| yields m.
MAP d
FOR(i, 0d7){
    d<i> = -(obs<+(i, 0d1)>, obs<i>)
}

INT mrec = 0d0
INT k = 0d2
WHILE(LTE(k, 0d6)){
    INT lo = -(k, 0d1)
    INT hi = +(k, 0d1)
    INT tk = d<k>
    mrec = GCD(mrec, ABS(-( *(d<hi>, d<lo>), *(tk, tk) )))
    k = +(k, 0d1)
}
DEL("d")
DEL("k")

! ---------- recover a and c ----------
! a = (x2 - x1) * (x1 - x0)^{-1}  (mod m)
! c = x1 - a * x0                  (mod m)
INT x0 = obs<0d1>
INT x1 = obs<0d2>
INT x2 = obs<0d3>
INT arec = MOD(*( -(x2, x1), modinv(-(x1, x0), mrec) ), mrec)
INT crec = MOD(-(x1, *(arec, x0)), mrec)
IF(LT(arec, 0d0)){ arec = +(arec, mrec) }
IF(LT(crec, 0d0)){ crec = +(crec, mrec) }
DEL("r0")
DEL("r1")
DEL("t0")
DEL("t1")
DEL("q")
DEL("nr")
DEL("nt")
DEL("inv")
DEL("x2")
DEL("x1")
DEL("modinv")

! ---------- verify by regenerating the whole sequence ----------
INT ok = 0d1
INT v = x0
FOR(i, 0d8){
    IF(NEQ(v, obs<i>)){
        ok = 0d0
    }
    v = MOD(+( *(arec, v), crec), mrec)
}
DEL("x0")
DEL("v")

! ---------- report ----------
PRINT("hidden : m=", m, " a=", a, " c=", c)
PRINT("cracked: m=", mrec, " a=", arec, " c=", crec)
PRINT("sequence reproduced: ", ok)

! ---------- predict the next output ----------
INT next_pred = MOD(+( *(arec, obs<0d8>), crec), mrec)
INT next_true = step(obs<0d8>)
DEL("obs")
DEL("step")
PRINT("next output predicted: ", next_pred)
PRINT("next output actual  : ", next_true)

ASSERT(EQ(ok, 0d1))
ASSERT(EQ(mrec, m))
ASSERT(EQ(arec, a))
ASSERT(EQ(crec, c))
ASSERT(EQ(next_pred, next_true))

Overview

This repository contains the reference implementation of the Prefix programming language, written in ISO C17 and targeting Clang on baseline x64. The codebase includes the lexer, parser, interpreter/runtime, standard library bindings, and supporting tools used by the reference implementation.

Supported platforms:

  • Windows Vista or newer.
  • Ubuntu 22.04 or newer (x86_64).

Project layout

  • .github/workflows/: GH Actions CI configuration.
  • docs/: Documentation for Prefix, builds GH Pages site.
  • ext/
  • lib/
  • src/: Source code and headers for the interpreter.
  • tests/: Automated test suite.
  • .gitignore: Git ignore file.
  • build.ps1: Build script for the interpreter and tests.
  • README.md: This file.

Requirements

  • LLVM/Clang toolchain with C17 support.
  • LLD linker (installed with LLVM on most platforms; lld package on Linux).
  • PowerShell (pwsh) to run the included build and test scripts.

On Ubuntu 22.04+:

sudo apt-get install clang lld powershell

On Windows: install LLVM/Clang and PowerShell (or use the built-in Windows PowerShell).

Building

To build the interpreter run:

pwsh ./build.ps1

The build.ps1 script invokes Clang and produces the interpreter, standard library, and test binaries. Ensure your Clang installation is on PATH before running the script.

Testing

Automated tests live under the top-level tests/ directory. You can run the test harness with PowerShell:

pwsh ./tests/test.ps1

Documentation

The docs are located in docs/.

License

Prefix is distributed under the Unlicense.

Versioning

Prefix follows SemVer 2.0, treating the specification as the public API.