poolsar42

Hiya!

Uploading gigantic folders and files to IPFS sometimes could be tricky! But we are going to make it. I tried to write complete instructions on how to do this. But feel free to ask if something isn't going according to plan. 😉

IPFS Desktop

1. First thing we need to do is to install IPFS Desktop client. Follow the link and choose your option.
2. Open your IPFS Desktop and wait a bit until it loads.

0xfoobar

const { expect } = require("chai");

describe("NFTOptions", function () {
    const penguAddr = "0xBd3531dA5CF5857e7CfAA92426877b022e612cf8";
    const penguOwner = "0x2c2c2F6DBe08942280d4F7626b6BAd5C11D20215";
    const ids = ["2036", "4205"];
    const buyer = "0xe5ee2B9d5320f2D1492e16567F36b578372B3d9F";

    const erc721Abi = [
        "function approve(address to, uint256 tokenId)"

amdev9

var Web3 = require('web3');
const EthereumTx = require('ethereumjs-tx');
const ethUtil = require('ethereumjs-util');
const rlp = require('rlp');
var txDecoder = require('ethereum-tx-decoder');

let flag = false;
let buffer;

const API_KEY = 'https://ropsten.infura.io/v3/YOUR_INFURA_KEY';

Auronmatrix

#!/bin/bash

function recursiveCheck() {
    for d in * ; do
        if  [ $d == "node_modules" ] ; then
            #echo "Skipping $PWD"
        else if [ -d "$d" ]; then
                cd "$d"
                #echo "Checking $PWD"
                if [ -f "package.json" ];

DavidBurkett

import math
import ecdsa
import ecdsa.ellipticcurve as EC

#
# Compute the inverse mod p using the extend 
# euclidian algorithm. 
# See O. Forster, Algorithmische Zahlentheorie
#
def inv_mod_p(x, p):

sebmarkbage

let cache = new Map();
let pending = new Map();

function fetchTextSync(url) {
  if (cache.has(url)) {
    return cache.get(url);
  }
  if (pending.has(url)) {
    throw pending.get(url);
  }

lattner

Async/Await for Swift

• Proposal: SE-XXXX
• Authors: Chris Lattner, Joe Groff

Introduction

Modern Cocoa development involves a lot of asynchronous programming using closures and completion handlers, but these APIs are hard to use. This gets particularly problematic when many asynchronous operations are used, error handling is required, or control flow between asynchronous calls gets complicated. This proposal describes a language extension to make this a lot more natural and less error prone.

This paper introduces a first class Coroutine model to Swift. Functions can opt into to being async, allowing the programmer to compose complex logic involving asynchronous operations, leaving the compiler in charge of producing the necessary closures and state machines to implement that logic.

hugsy

abandoned
able
absolute
adorable
adventurous
academic
acceptable
acclaimed
accomplished
accurate

ibrahimlawal

vi /etc/environment

add these lines...

LANG=en_US.utf-8
LC_ALL=en_US.utf-8

holiman

pragma solidity ^0.4.4;
contract X{
    
    string junk;
    function y() returns(string){
        //Uncomment the 'junk' below to make gas-measurements
        //junk="0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF012345