-
# Summary
Sending a message to a recipient with a nonstandard proof-of-work requirement allows the sender to determine whether or not the originating address is part of the receiver's address book. T…
-
-
# Motivation
- #93
# Previous work
- #206
- #198
# Background
## Terminology
- Type 1 🥇 is full compatibility [^1] (there should be some more words here, but I don't know what to write)
…
-
As a first step, product will identify a list of dimensions for which we need to define limits (e.g., number of precincts, number of contests, contest title character length, number of candidates in a…
-
Lately I've developed a few strategies to reduce axiom usage, but most of the time they require manual work, which is difficult to scale up. I've used Rumm for quite some time now, and it looks the cl…
-
I'm not sure if this is the right place to bring this up, but in README.md:
> The efficiency of the algorithm declines with the number of blocks the network has to choose from in each round. We may u…
-
Would need a class that uses, perhaps, [jnr-ffi](https://github.com/jnr/jnr-ffi) for calling the local ccurl library, and using it if available.
-
During header sync, we trust the total difficulty given by peers during the handshake to select who to get headers from. This is easy to lie about. We need to identify when a node fails to send us hea…
-
Our proof of work algorithm incorrectly produces a predictable series of nonces, which would allow a dishonest node to modify or replace the chain. See our wiki for more details.
This issue was unc…
-
Let's build out something that will then educate us on how time works.
- How do we use time for ADSR?
- How do we use time to sequence midi nodes?
- Can we have two Keyboard components playing o…