vnprc

issues with zcash

- corporation is a single point of failure
  - The feds operated a completely compromised, highly influential cryptography company for years. They can do it again
  https://en.wikipedia.org/wiki/Crypto_AG
- unfair launch
  - I believe it is a mistake to treat a currency like a software startup. Money is not a company. It needs to be a truly
  neutral arbiter with extremely minimal ties to human organizations. In my view, breaking this norm fundamentally compromises
  trust in a currency. Low trust => low adoption => no network effect
  - A founder's reward is anathema to a fair launch. The founder's reward was adjusted in 2020 

vnprc

Keybase proof

I hereby claim:

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

To claim this, I am signing this object:

vnprc

A description of known problems in Satoshi Nakamoto's paper, "Bitcoin: A Peer-to-Peer Electronic Cash System", as well as notes on terminology changes and how Bitcoin's implementation differs from that described in the paper.

Abstract

The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power.

vnprc

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class StringPermutations {

	public List<String> findPermutations(String input) {
		List<Character> charList = new ArrayList<>(input.length());

vnprc

public class FindRightNeighborArrayTree {
	
	final Integer[] tree = new Integer[64];
	
	public void insert(int value) {
		if (tree[1] == null) {
			tree[1] = value;
			return;
		}
		

vnprc

public class FindRightNeighbor {
	
	Node root = null;
	
	public void insert(Node node) {
		if (root == null) {
			root = node;
			return;
		}

vnprc

import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;

public class TopologicalSort {

vnprc

import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Set;
import java.util.Stack;

public class Tree {
	

vnprc

test = [5, -6, 7, 12, -3, 0, -11, -6]

def get_max_contiguous_sum(array):
	results = []
	previous_element = 0
	for element in array:
		previous_element = max(element, previous_element + element)
		results.append(previous_element)

	return max(results)

vnprc

#!/bin/bash
pids="$(pidof gnome-terminal-server)"

if [ -z "$pids" ]
then
    gnome-terminal
else
    focus_window_pid="$(xdotool getwindowfocus getwindowpid)"

    if [[ $pids == *"$focus_window_pid"* ]]