cosinekitty

#!/usr/bin/env python3
#
#   picrunch.py  -  by Don Cross
#
#   Use Machin's Formula
#   pi = 4*(4*arctan(1/5) - arctan(1/239))
#   to calculate pi to one million places after the decimal.
#
import sys

espadrine

./harmonoise-big-crush 
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
                 Starting BigCrush
                 Version: TestU01 1.2.3
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx


***********************************************************
Test smarsa_SerialOver calling smultin_MultinomialOver

Quard

Python + Redis

API get

Running 30s test @ http://rpi:5000/api/v1/url/aaaa
  12 threads and 400 connections
  Thread Stats   Avg      Stdev     Max   +/- Stdev
    Latency   489.29ms  196.29ms   1.38s    82.02%
    Req/Sec    68.43     31.64   192.00     72.98%

rjhansen

SKS Keyserver Network Under Attack

This work is released under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Terminological Note

"OpenPGP" refers to the OpenPGP protocol, in much the same way that HTML refers to the protocol that specifies how to write a web page. "GnuPG", "SequoiaPGP", "OpenPGP.js", and others are implementations of the OpenPGP protocol in the same way that Mozilla Firefox, Google Chromium, and Microsoft Edge refer to software packages that process HTML data.

Who am I?

gcavalcante8808

import bjoern
import os, signal


from django.core.wsgi import get_wsgi_application

os.environ.setdefault('DJANGO_SETTINGS_MODULE', 'app.settings')
app = get_wsgi_application()

NUM_WORKERS = 8

JBaczuk

#!/bin/bash

echo
echo "Welcome to the Bitcoin address generator!"
echo "input private key (32 bytes, hex format)"
read priv
echo ""
echo "#####################################"
# priv=0C28FCA386C7A227600B2FE50B7CAE11EC86D3BF1FBE471BE89827E19D72AA1D # Testing only

munnellg

#include <math.h>
#include <time.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#ifdef __MACH__
#include <sys/time.h>
#include <mach/clock.h>

iyvinjose

def read_lines_from_file_as_data_chunks(file_name, chunk_size, callback, return_whole_chunk=False):
    """
    read file line by line regardless of its size
    :param file_name: absolute path of file to read
    :param chunk_size: size of data to be read at at time
    :param callback: callback method, prototype ----> def callback(data, eof, file_name)
    :return:
    """

    def read_in_chunks(file_obj, chunk_size=5000):

nadavrot

High-Performance Matrix Multiplication

This is a short post that explains how to write a high-performance matrix multiplication program on modern processors. In this tutorial I will use a single core of the Skylake-client CPU with AVX2, but the principles in this post also apply to other processors with different instruction sets (such as AVX512).

Intro

Matrix multiplication is a mathematical operation that defines the product of

argyleink

:root {
  --ease-in-quad:       cubic-bezier(0.55, 0.085, 0.68, 0.53);
  --ease-in-cubic:      cubic-bezier(0.55, 0.055, 0.675, 0.19);
  --ease-in-quart:      cubic-bezier(0.895, 0.03, 0.685, 0.22);
  --ease-in-quint:      cubic-bezier(0.755, 0.05, 0.855, 0.06);
  --ease-in-expo:       cubic-bezier(0.95, 0.05, 0.795, 0.035);
  --ease-in-circ:       cubic-bezier(0.6, 0.04, 0.98, 0.335);
  --ease-out-quad:      cubic-bezier(0.25, 0.46, 0.45, 0.94);
  --ease-out-cubic:     cubic-bezier(0.215, 0.61, 0.355, 1);
  --ease-out-quart:     cubic-bezier(0.165, 0.84, 0.44, 1);