signorecello

  let hashOfPubKey = std::hash::keccak256(pub_key);
  let mut result : Field = 0;
  let mut v : Field = 1;

  for i in 0..20 {
      let index = (20 - i);
      result += hashOfPubKey[index + 11] as Field * v;
      v *= 256;
  }

RobinLinus

zkCoins

zkCoins is a novel blockchain design with strong privacy and scalability properties. It combines client-side validation with a zero-knowledge proof system. The chain is reduced to a minimum base layer to prevent double spending. Most of the verification complexity is moved off-chain and communicated directly between the individual sender and recipient of a transaction. There are very few global consensus rules, which makes block validation simple. Not even a global UTXO set is required.

In contrast to zk-rollups there is no data availability problem, and no sequencer is required to coordinate a global proof aggregation. The protocol can be implemented as an additional layer contained in Bitcoin's blockchain (similar to RGB[^5] or Taro[^6]) or as a standalone sidechain.

The throughput scales to hundreds of transactions per second without sacrificing decentralization.

Design Principles

The core design principle is to *"use the chain for what the chain is good for, which is an immutable order

devtooligan

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.17;
import "forge-std/Test.sol";

contract TestDeleteMappingInStruct is Test {

    /// @param enabled Whether the token is enabled or not
    /// @param balances Mapping of user address to balance
    struct Token {
        bool enabled;

Validark

-- A cool autocomplete demo
-- @author Validark
-- Strings are stored in a lexigraphically sorted array, which can be binary searched for the first and last element which matches a query

-- Please note the "groupings" functionality is an unvalidated afterthought which may or may not work properly, but overall this code has some nice gems:

-- I was originally thinking that https://github.com/evaera/Cmdr could use this to get O(log n) autocompletes (old algo uses O(n))
-- However, Cmdr is designed in such a way that it creates a new autocomplete function on-demand each time,
-- 	which means we'd have to sort (or at least verify the sortedness) of the most recent data each time (for changing data at least, like a Player list).
-- Sorting at run-time takes O(n*log n) time, making it hard to compete with the old algorithm where the pre-processing step just gets the data in the right format

jms137

/*

Goldbach's conjecture tested by a 47-state Turing machine

Author: Jared Showalter

If "a" and "i" were unbounded, this program would halt iff Goldbach's
conjecture is false.  Furthermore, the program structurally
corresponds to a Turing machine with two symbols, one tape, and a
small number of states.  The array "a" corresponds to the tape (each

jtrefry

• Install Git for Windows
• Install Node
• Install Python 2.7.3
• Install Microsoft Visual Studio 2015 Community
• Open the command prompt as Administrator, run the following commands, then close the command prompt (a new prompt is required before the new environment variables will be available)
  • npm install -g npm
    • (Upgrades to npm v3, which no longer nests dependencies indefinitely. No more "maximum path length exceeded" errors due to the 260 character path limit in Windows, or needing to delete node_modules with rimraf.)
  • setx PYTHON C:\Python27\python.exe /m
    • (May need to change path to your custom install directory.)
• Open a new command prompt and run the following commands. If these install without errors, you have bypasse