numinit

Keybase proof

I hereby claim:

• I am numinit on github.
• I am numinit (https://keybase.io/numinit) on keybase.
• I have a public key whose fingerprint is 190B DA97 F616 DE35 6899 ED17 F819 F1AF 2FC1 C1FF

To claim this, I am signing this object:

numinit

Ingress XM Changes (03/12)

Level	New	Old
1	3000	3000
2	4000	4000
3	5000	5000
4	6000	6000
5	7000	7000
6	8000	8000

numinit

// ==UserScript==
// @name         XKCDUniqueRandom
// @namespace    http://numin.it/
// @version      0.1
// @license      MIT
// @description  uniquely samples XKCDs when you press Random
// @author       numinit
// @match        http://xkcd.com/*
// @match        https://xkcd.com/*
// @grant        none

numinit

#!/usr/bin/env ruby
# Usage: ruby memeheap.rb <host> <port>
# This script was created for the 2015 CSAW CTF: https://ctf.isis.poly.edu

require 'base64'
require 'socket'

# Offset of system() in libc.
SYSTEM_OFFSET = 0x00046640

numinit

.class public final Lcom/nianticproject/ingress/shared/rpc/store/PurchasableItem;
.super Ljava/lang/Object;
.source "SourceFile"


# instance fields
.field public assetUrl:Ljava/lang/String;
    .annotation build Lo/oi;
    .end annotation

numinit

//
//  QuadraticFormula.m
//  MathTasksCode
//
//  Created by Eric Li on 7/16/09. Edited by Morgan Jones.
//  Copyright 2009 § Products. All rights reserved.
//

#import "QuadraticFormula.h"
#import "Fractions.h"

numinit

void fr12_lcd::print_wrap(char *msg) {
  // Copy the message string
  size_t len = strlen(msg);
  char *c = (char *)malloc(len);
  strcpy(c, msg);

  // Start tokenizing
  char *p = strtok(c, " ");
  while (p != NULL) {
    size_t p_len = strlen(p), len = p_len + this->x;

numinit

#include <avr/io.h>

.org 0x0000
rjmp run

run:
	; Clear r1
	clr r1
	
	; Load 0x01 into r16 for use later

numinit

require 'cinch'

class ValveARG
  include Cinch::Plugin

  match /!argstatus/, handler: :argstatus
  def argstatus(m)
    m.reply "#{m.user.nick}, we're currently waiting for Valve."
  end
end

numinit

// nice work, #valvearg2
// ... and great job to The_MAZZTer for figuring it out!
// how it works: http://d.pr/i/iDp6
// ruby equivalent: [18, 5, 19, 9, 19, 20, 15, 18].collect{|c| (c + 96).chr}.join

#include <iostream>
using namespace std;

void Q(int val) {
  printf("%c", val + 'a' - 1);