Skip to content

Instantly share code, notes, and snippets.

View avanpo's full-sized avatar
🐻

alex avanpo

🐻
View GitHub Profile
@avanpo
avanpo / fbptr-20200219.txt
Last active January 29, 2024 00:19
Facebook PTR records
69.63.177.37 testvpn01.tfbnw.net.
69.63.179.36 static-dev.facebook.com.
69.63.183.110 mlb01.01.sea1.tfbnw.net.
66.220.144.7 itoolsfile.facebook.com.
66.220.144.38 corpout1.snc1.tfbnw.net.
66.220.144.40 corpout3.snc1.tfbnw.net.
66.220.144.41 vpn01.snc1.tfbnw.net.
66.220.144.51 secfw01.snc1.tfbnw.net.
66.220.144.128 66-220-144-128.mail-mail.facebook.com.
66.220.144.129 66-220-144-129.mail-mail.facebook.com.
@avanpo
avanpo / TopologicalSortComparison.java
Created October 11, 2017 20:24
Comparing java implementations of a modified DFS to Kahn's algorithm.
import java.util.Arrays;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Random;
import java.util.Set;
# Simple test to verify Ring-LWE exchange, without actually
# adding any error.
from random import randint
def generate_matrix(dimension, modulus):
array = []
upper_limit = modulus * dimension
for i in range(0, dimension):
/* Enumeration of the hexacode over GF(4). The four
* characters of GF(4) are represented as {0,1,2,3}.
*/
char hexacode[64][6] = {
{0, 0, 0, 0, 0, 0}, {0, 0, 1, 1, 1, 1},
{0, 0, 2, 2, 2, 2}, {0, 0, 3, 3, 3, 3},
{1, 1, 0, 0, 1, 1}, {2, 2, 0, 0, 2, 2},
{3, 3, 0, 0, 3, 3}, {1, 1, 1, 1, 0, 0},
{2, 2, 2, 2, 0, 0}, {3, 3, 3, 3, 0, 0},
{1, 1, 2, 2, 3, 3}, {1, 1, 3, 3, 2, 2},

Keybase proof

I hereby claim:

  • I am avanpo on github.
  • I am avanpo (https://keybase.io/avanpo) on keybase.
  • I have a public key ASA3LVMkWm7CxuSMxgggROdUxeTxJ9ny32rxvUPPLLyxKwo

To claim this, I am signing this object: