| BTCmsg Protocol v1 (2011-09-18) | |
| =============================== | |
| Each message is represented by multiple payment which is calculated by | |
| the following algorithm: | |
| 1. Two first chars for message type ('01' for md5, '02' for ascii). | |
| 2. Then the message in hex (python binascii.hexlify). | |
| 3. Split the long string to groups of 4 hex digits. | |
| 4. Each group of 4 hex (e.g. 2 ascii letters from the message) is | |
| represented by a payment in satoshi (maximum 0xffff=65535). |
| #include <zmq.hpp> | |
| #include <string.h> | |
| #include <stdio.h> | |
| #include <unistd.h> | |
| int main (void) | |
| { | |
| zmq::context_t context(1); | |
| const char * protocol = | |
| "tcp://localhost:5555"; |
| /* For sockaddr_in */ | |
| #include <netinet/in.h> | |
| /* For socket functions */ | |
| #include <sys/socket.h> | |
| /* For fcntl */ | |
| #include <fcntl.h> | |
| #include <event2/event.h> | |
| #include <arpa/inet.h> |
| #ifndef __FINK_ENDIANDEV_PKG_ENDIAN_H__ | |
| #define __FINK_ENDIANDEV_PKG_ENDIAN_H__ 1 | |
| /** compatibility header for endian.h | |
| * This is a simple compatibility shim to convert | |
| * BSD/Linux endian macros to the Mac OS X equivalents. | |
| * It is public domain. | |
| * */ | |
| #ifndef __APPLE__ |
| #!/usr/bin/env python | |
| """ | |
| Very simple HTTP server in python (Updated for Python 3.7) | |
| Usage: | |
| ./dummy-web-server.py -h | |
| ./dummy-web-server.py -l localhost -p 8000 | |
| Send a GET request: |
Inspired by this article. Neat tricks for speeding up integer computations.
Note: cin.sync_with_stdio(false); disables synchronous IO and gives you a performance boost.
If used, you should only use cin for reading input
(don't use both cin and scanf when sync is disabled, for example)
or you will get unexpected results.
x = x << 1; // x = x * 2
| # | |
| # NB : this is not secure | |
| # from http://code.activestate.com/recipes/266586-simple-xor-keyword-encryption/ | |
| # added base64 encoding for simple querystring :) | |
| # | |
| def xor_crypt_string(data, key='awesomepassword', encode=False, decode=False): | |
| from itertools import izip, cycle | |
| import base64 | |
| if decode: |
| """ Theano CRBM implementation. | |
| For details, see: | |
| Taylor GW, Hinton GE, Roweis ST. Modeling Human Motion Using Binary Latent Variables. | |
| In: Advances in Neural Information Processing Systems 19. MIT Press; 2007. pp. 1345–1352. | |
| Sample data: | |
| https://uoguelphca-my.sharepoint.com/:u:/g/personal/gwtaylor_uoguelph_ca/EfJARkZuiX1JmwMKQxQqKJMBaMBUNOcF83FW_n9gk7OIbg?e=fnCjet | |
| @author Graham Taylor""" | |
| import numpy |
| Latency Comparison Numbers (~2012) | |
| ---------------------------------- | |
| L1 cache reference 0.5 ns | |
| Branch mispredict 5 ns | |
| L2 cache reference 7 ns 14x L1 cache | |
| Mutex lock/unlock 25 ns | |
| Main memory reference 100 ns 20x L2 cache, 200x L1 cache | |
| Compress 1K bytes with Zippy 3,000 ns 3 us | |
| Send 1K bytes over 1 Gbps network 10,000 ns 10 us | |
| Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD |
| /***************************************************************************** | |
| * QuantCup 1: Price-Time Matching Engine | |
| * | |
| * Submitted by: voyager | |
| * | |
| * Design Overview: | |
| * In this implementation, the limit order book is represented using | |
| * a flat linear array (pricePoints), indexed by the numeric price value. | |
| * Each entry in this array corresponds to a specific price point and holds | |
| * an instance of struct pricePoint. This data structure maintains a list |
