Brute force Kolmogorov complexity for The Insane Esolang

bruteforce.js

var gen = (function() {
	var alphabet = "26LHG15DZ83OCTNS9 KIFPVUJEB7W0MAQ4XYR";
	
	function mod(x,y) {
		if (x < 0) return mod(y-x,y);
		if (x >= y) return mod(x-y,y);
		return x;
	}
	
	function Ĭ(value) {
		return mod((value + 4) * 5, 256);
	}
	
	function đ(value) {
		return mod(mod(value - 2, 17) * 3, 256);
	}
	
	return function gen(text) {
		var code = "";
		var value = 45;
		for (var i = 0; i < text.length; i++) {
			var index = alphabet.indexOf(text[i].toUpperCase());
			if (index < 0) continue;
			
			var loop = [];
			var inst = 0;
			
			while (mod(value, 37) != index) {
				value = Ĭ(value);
				code += "Ĭ";
				
				if (loop.includes(value)) {
					loop = [];
					value = đ(value);
					code += "đ";
				}
				loop.push(value);
			}
			
			code += "ǿ";
		}
		
		return code;
	}
})();