arbipher

(* #require "Angstrom";; *)
open Angstrom

type exp = 
  | Int of int
  | Plus of exp * exp

let (let*) = (>>=)

let ws = skip_while (function

arbipher

module Oracle = struct
  (* encoding count as co-binary
     0                 =     t inf_t
     1                 =     f inf_t
     2   .. 3          = b   f inf_t
     4   .. 7          = b^2 f inf_t
     ...
     2^k .. 2^(k+1)-1  = b^k f inf_t

     \bar{b^k f} is the mirror of \bar{f b^k}, in which f is the MSB bit

arbipher

#!/bin/python3

import math
import os
import random
import re
import sys
from collections import deque

arbipher

# EXPECT-WELL-FORMED

tr = true;
fl = false;
one = 1;

f = fun x -> (
  rf = x + one
);

arbipher

#!/usr/bin/env python3

import requests
import re
import sys
from multiprocessing.dummy import Pool, Manager
import concurrent.futures

site = 'http://10.0.0.8'
login_page = site + '/DVWA/login.php'

arbipher

func RandomNumber(max *big.Int) *big.Int {
	n, err := rand.Int(rand.Reader, max)

	if err != nil {
		fmt.Println(err)
		panic("error random number")
	}

	return n
}