William Entriken

I have reviewed every smart contract on Ethereum Mainnet starting from Genesis up to Terra Nullius . If you think Terra Nullius in 2015 is an NFT that's cool. But clearly nothing before then is an NFT. The search is over. Complete notes attached. After you have read everything below and verified it, you must agree that the search any NFT before Terra Nullius is done.  Now that the search is over, are you looking for the first ERC-721 NFT? It's here https://tenthousandsu.com, it's barely discovered. The people you are following haven't mentioned it. And my policy is we have ZERO undisclosed promotion. 47205 https://etherscan.io/tx/0x31ded263506ea36e6ea777efc2c39a999e6fba4f4d338c7313af6aac6d9bf3e3 https://etherscan.io/address/0xc669eaad75042be84daaf9b461b0e868b9ac1871 https://api.etherscan.io/api?module=proxy&action=eth_getCode&address=0xc669eaad75042be84daaf9b461b0e868b9ac1871 Empty contract code 48162 https://etherscan.io/tx/0x28dde8260ea71c354b9d3e0cf0c2fcd863

Whitelist and blacklist are very simple words and have an unambiguous meaning. Below is a demonstration. > I ordered a new Tesla but was underwhelmed by their lack of paint options. Their whitelist only had one choice, "Pearl White Multi-Coat". > Gothic clothes are fun, you have a variety of things you can wear mostly black, but their blacklist is expansive and includes "dark black", "off black", "shiny black" and so much more! Historically, there were some other meaning for these words specifically relating goodness and badness with colors. But those have been deprecated.

A multiqueue is to a queue as a multisite is to a set. This generic structure might be useful to some programmer somewhere and I haven't seen it in textbooks, so here is an example in Swift. // This implementation uses O(N) memory, O(1) enqueue and O(N) dequeue. // Other implementations with faster dequeue are possible by either // sacrificing enqueue speed or using more memory. struct MultiQueue < T > {     private var elementsAndQuantities : [(element: T , quantity: Int )] = []     // Quantity must be greater than zero     mutating func enqueue ( _ value: T , quantity: Int ) {         elementsAndQuantities . append ((value, quantity))     }          mutating func dequeue () -> T ? {         guard ! elementsAndQuantities . isEmpty else {             return nil         }         let retval = elementsAndQuantities [ 0 ].element         if elementsAndQuantities [ 0 ].quantity == 1 {             elementsAndQuantities . removeFirst ()        

UPDATE 2021-04-05 : Added some notes and caveats, thanks to a discussion with Russell Thomas You may have already seen them on the road. The Model 3 has been largely successful, everybody and their mother knows these cars run on electricity, not directly making harmful carbon emmisions that pollute our planet and contribute to climate change. Last week, Elon Musk has announced plans to fix that by reducing the Model 3 fuel economy from an EPA rated ∞ MPG down to 22 MPG , the exact rating of the original Ford Model T. How? Bitcoin. Technology made simple Bitcoin is a complicated technology which is misunderstand by many people. Rather than explain it in complete detail, I will here only tell you about the 99% of how it works that you might care about. Every one dollar you spend on Bitcoin directly pays somebody else to emit one dollar’s worth of carbon somewhere else on Earth (most likely China). The primary reasons people purchase Bitcoin is to buy synthetic heroine, evade taxes and s

A new model for tracking permissions using established blockchain standards, and an application for biosample data, is introduced. Written by: William Entriken, Daniel Uribe. The permission problem space Permission is a broad problem space covering any permit , where a permitter will ultimately authorize some property use to a permittee . These permits cover a broad field of authorizations, which may also be called “grants,” “consents,” “licenses,” and “clams.” A practical example is the licensing deals in force to produce FIFA 20 , a football video game [EA-1] [EA-2] [FIFA-1]: In the classical example above, every permit shown is individually negotiated and signed between a permitter and permittee. These agreements are signed, bound under the laws of a specific jurisdiction and made between two legal entities. This paper introduces a new business model where a permitee can accept and use property from a permitter without directly having a contract. In this paper, we use the fol

Will's ZKSNARKS Bibliography Cryptology ePrint Archive: Report 2013/879 - Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture BCTV14 https://eprint.iacr.org/2013/879 Our circuit generator is the first to be universal : it does not need to know the program, but only a bound on its running time. Moreover, the size of the output circuit depends additively (rather than multiplicatively) on program size, allowing verification of larger programs. We evaluated our system for programs with up to 10,000 instructions, running for up to 32,000 machine steps, each of which can arbitrarily access random-access memory; and also demonstrated it executing programs that use just-in-time compilation . Our proofs are 230 bytes long at 80 bits of security, or 288 bytes long at 128 bits of security. Typical verification time is 5 milliseconds, regardless of the original program’s running time. What are zk-SNARKs? / Zcash https://z.cash/technology/zksna