kassane

#include "tb_client.hpp"

int main() {
  tb::Client client("localhost", 8080);

  tb::Account account({0, 0, {0}, 1, 1, TB_ACCOUNT_LINKED, 0, 0, 0, 0, 0});
  tb::create_account_result result = client.create_account(account);
  if (result != TB_CREATE_ACCOUNT_OK) {
    // Handle error
  }

mrbluecoat

• Amnezia VPN (OpenVPN & WireGuard protocols) - Windows, MacOS, iOS, Android, Linux (no ARM support)
• boringproxy (in-house developed "NameDrop" protocol) - Windows, MacOS, Linux, FreeBSD, OpenBSD
• boringtun (WireGuard protocol) - MacOS, Linux (mobile clients not open source)
• Brook (in-house developed "Brook" protocol as well as WebSocket Secure, SOCKS5, and QUIC protocols) - Windows, MacOS, Linux, OpenWrt (mobile clients not open source)
• Chisel (SSH protocol) - Windows, MacOS, Linux
• cjdns (in-house developed "CryptoAuth" protocol) - Windows, MacOS, Linux, FreeBSD, NetBSD
• Cloak (OpenVPN & Shadowsocks protocols) - Windows, MacOS

t-bast

Phoenix in a splicing future (a.k.a death to all swaps)

Phoenix implements trusted swaps for users' convenience (to allow easy onboarding and offboarding). But it's not a satisfying solution for the following reasons:

• It uses two on-chain transactions for swap-in where one should be sufficient (one transaction from the user to Acinq followed by a channel open)
• Swap-out feerates are unpredictable (because we may fund the swap-out with unconfirmed previous outputs) which is frustrating for users
• It forces Acinq to use its own utxos, which doesn't scale well and is an operational burden
• If Acinq doesn't have any utxos available and the mempool is completely full, swaps are stuck which is also frustrating for users

revskill10

CREATE TABLE accounts(
	id serial PRIMARY KEY,
	name VARCHAR(256) NOT NULL,
	parent_id INTEGER REFERENCES section,
    	parent_path LTREE
);

CREATE INDEX account_parent_path_idx ON accounts USING GIST (parent_path);
CREATE INDEX account_parent_id_idx ON accounts (parent_id);

esneider

Non-custodial lightning escrow for HodlHodl

phase 1: bitcoin funding

1. seller generates secret A
2. seller asks hodlhodl to generate a hold invoice with payment hash = hash(A), notice that hodlhodl doesn’t have the preimage A
3. seller sends a lightning payment to settle the invoice
4. once hodlhodl receives the payment, it remains on hold since it doesn’t have the preimage A to settle it
5. hodlhodl lets the seller know it received the payment, so that it can proceed

phase 2: fiat payment

anselmobattisti

Capture and send video 

gst-launch-1.0  v4l2src device=/dev/video0 \
    ! decodebin \
    ! x264enc \
    ! rtph264pay \
    ! udpsink port=5000

Show the video
gst-launch-1.0 \

jsakhil

@echo off
::::::::::::::::::::::::::::
set "params=Problem_with_elevating_UAC_for_Administrator_Privileges"&if exist "%temp%\getadmin.vbs" del "%temp%\getadmin.vbs"
fsutil dirty query %systemdrive%  >nul 2>&1 && goto :GotPrivileges
::    The following test is to avoid infinite looping if elevating UAC for Administrator Privileges failed
If "%1"=="%params%" (echo Elevating UAC for Administrator Privileges failed&echo Right click on the script and select 'Run as administrator'&echo Press any key to exit...&pause>nul 2>&1&exit)
cmd /u /c echo Set UAC = CreateObject^("Shell.Application"^) : UAC.ShellExecute "%~0", "%params%", "", "runas", 1 > "%temp%\getadmin.vbs"&cscript //nologo "%temp%\getadmin.vbs"&exit
:GotPrivileges
::::::::::::::::::::::::::::
color 1F

aliesbelik

Moved to git repository: https://github.com/aliesbelik/load-testing-toolkit

Benchmarking & load testing

Tools to benchmark & load-test your code or services

http/s

• apachebench (ab) - Standalone apachebench (ab), Apache HTTP server benchmarking tool. C
• httperf - A tool for measuring web server performance. C

fschutte

import sun.security.x509.*
import java.io.File
import java.math.BigInteger
import java.security.*
import java.security.cert.X509Certificate
import java.util.*

/**
 * Simple script for generating keys and certificates as needed to connect to the ING API.

druska

/*****************************************************************************
 *                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