incertia

{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE TypeApplications #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}

incertia

module SyntaxHighlight.Haskell exposing (..)

import Char exposing (isHexDigit, isDigit, isUpper)
import Parser exposing (Parser, succeed, oneOf, getChompedString, end,
                        chompIf, chompWhile, andThen, keyword, token, (|.),
                        problem, backtrackable)
import String exposing (fromChar, concat, all)
import SyntaxHighlight exposing (Source, Line, Token, Type(..))

flip : (a -> b -> c) -> b -> a -> c

incertia

#! /usr/bin/env python

from Crypto.Cipher import AES

import sys

def r16():
    with open("/dev/urandom", "r") as f:
        return f.read(16)

incertia

Keybase proof

I hereby claim:

• I am incertia on github.
• I am incertia (https://keybase.io/incertia) on keybase.
• I have a public key whose fingerprint is 7EBB 37E5 0176 692D 4A9B 2B57 E9AF D3BC AC08 CA92

To claim this, I am signing this object:

incertia

# Maintainer: Levente Polyak <anthraxx[at]archlinux[dot]org>
# Contributor: Chris Andrews <christophersimonandrews [at] gmail [dot] com>
# Contributor: FadeMind <fademind@gmail.com>
# Contributor: Serge Victor <arch@random.re>
# Contributor: Krzysztof Wloch <wloszekk [at] gmail [dot] com>
# Contributor: Luke McCarthy <luke@iogopro.co.uk>
# Contributor: Will Song <incertia@incertia.net>

pkgname=fasm
pkgver=1.71.63

incertia

{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE DeriveFunctor #-}

import Data.Bits    (Bits, zeroBits, xor)
import Data.Group   (Group, invert, Abelian)
import Data.List    (sort)
import Data.Monoid  (mempty, (<>), Sum, getSum, Product, getProduct)

newtype Xor a = Xor { getXor :: a }
  deriving (Eq, Ord, Read, Show, Num, Functor)

incertia

from Crypto.PublicKey import RSA
from Crypto.Cipher import PKCS1_OAEP
import sys

# the following attack is due to Ellen Jochemsz and Alexander May
# see https://www.iacr.org/archive/asiacrypt2006/42840270/42840270.pdf

if len(sys.argv) < 2:
    print "give m"
    sys.exit(0)

incertia

So after obtaining 10 copies of CS:GO gifts, I began debating whether or not it was feasible to write and maintain a completely undetectable cheat for at least 2 years, and I'm going to post some of the results of my basic levels of thinking here. Feel free to provide any evidence if anything I said is proven to be false and I will edit it in when I have the time.

A bit about VAC

• AFAIK, 3 versions of VAC have been released. VAC1 with the 1.4 version of Counter-Strike, VAC2 some time in 2005, and VAC3 sometime recently.
• I'm not sure if all versions of VAC are loaded at the same time, or have been merged into eachother (i.e. VAC3 also performs the same scans as VAC2). If anyone knows the answer to this, it would be greatly appreciated (just dump and analyze all loaded modules in a f2p account).
• VAC bans are permanent. Meaning if I fuck up once, I have one less account to experiment with.

How does VAC work?

In order to bypass VAC, some level of understanding is required. Here are the main points I ha

incertia

Announcements

• The WWW ender chest now publicly performs a trade between 64 nether stars <==> 1 creative tool modifier.
• Server now runs with -Xms4096M -Xmx8192M.
• Updated modpack version to 2.1.2.

Color Codes

• W ==> White
• G ==> Green
• g ==> Gray
• B ==> Blue

incertia

Keybase proof

I hereby claim:

• I am incertia on github.
• I am incertia (https://keybase.io/incertia) on keybase.
• I have a public key whose fingerprint is 585D B6A5 13B0 EEA9 46A0 6910 F2B1 A34F 21A1 71E2

To claim this, I am signing this object: