Skip to content

Instantly share code, notes, and snippets.

@Samuirai
Samuirai / dump_key.c
Created October 22, 2012 21:01
Extract GW2 Ingame Session Key
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <mach/mach.h>
#include <mach/mach_vm.h>
int main(int argc, char **argv) {
int i,j;

minteye is a captcha system where you try to find the original image out of distorted ones. They also have a feature list on their website but they forgot the view from a computer. I fixed it:

minteye captcha features

There are two ways to crack this captcha easily. I've used the audio challange. There are three different kind of audio messages.

  1. move the slider to the right
  2. move the slider to the left
  3. slider is in the correct position
@Samuirai
Samuirai / captcha.md
Created June 14, 2012 20:59
G-WAN Captcha Decode

G-WAN is a new free web server. They seem to be very proud of it, or at least just want to make a lot of money. Well anyway, in almost every sentence they write, they claim that they are 20% cooler than anything else. It feels a bit arrogant. I have to admit, I don't know a lot about web servers, so I can't speak to how good they are.

However, then I saw their Captcha example. I also don't know much about machine learning algorithms, OCR, and stuff like that, but I do know how to read pixels. I also know how to compare values with python :P

demo

They say the following about their Captcha:

import sys
import datetime
import json
import jinja2
import os
import operator
from flask_googlemaps import GoogleMaps
from flask_googlemaps import Map
lines = []
line = "dumped hex values"
s=""
n = 8
for w in [line[i:i+n] for i in range(0, len(line), n)]:
c = [w[i:i+2] for i in range(0, len(w), 2)]
c.reverse() # endian foo
for a in c:
s+=chr(int(a,16))
print s
@Samuirai
Samuirai / sudoku.py
Created June 21, 2012 23:04
Sudoku
# This code should solve any Sudoku
# 1. The algorithm first tries direct decidable fields (with only one possible value)
# 2. If there are only fields left with multiple possible values, it will make a recursive call with each possible value
# 3. PROFIT!
import copy
# solveable
grid = [[3,0,0, 2,4,0, 0,6,0],
[0,4,0, 0,0,0, 0,5,3],