Skip to content

Instantly share code, notes, and snippets.

@jeremy5189
Created March 6, 2019 10:18
Show Gist options
  • Save jeremy5189/1bd50f402130f7d0987f98f5f4fa6191 to your computer and use it in GitHub Desktop.
Save jeremy5189/1bd50f402130f7d0987f98f5f4fa6191 to your computer and use it in GitHub Desktop.
Created using remix-ide: Realtime Ethereum Contract Compiler and Runtime. Load this file by pasting this gists URL or ID at https://remix.ethereum.org/#version=soljson-v0.4.24+commit.e67f0147.js&optimize=true&gist=
pragma solidity ^0.4.0;
contract Ballot {
struct Voter {
uint weight;
bool voted;
uint8 vote;
address delegate;
}
struct Proposal {
uint voteCount;
}
address chairperson;
mapping(address => Voter) voters;
Proposal[] proposals;
/// Create a new ballot with $(_numProposals) different proposals.
function Ballot(uint8 _numProposals) public {
chairperson = msg.sender;
voters[chairperson].weight = 1;
proposals.length = _numProposals;
}
/// Give $(toVoter) the right to vote on this ballot.
/// May only be called by $(chairperson).
function giveRightToVote(address toVoter) public {
if (msg.sender != chairperson || voters[toVoter].voted) return;
voters[toVoter].weight = 1;
}
/// Delegate your vote to the voter $(to).
function delegate(address to) public {
Voter storage sender = voters[msg.sender]; // assigns reference
if (sender.voted) return;
while (voters[to].delegate != address(0) && voters[to].delegate != msg.sender)
to = voters[to].delegate;
if (to == msg.sender) return;
sender.voted = true;
sender.delegate = to;
Voter storage delegateTo = voters[to];
if (delegateTo.voted)
proposals[delegateTo.vote].voteCount += sender.weight;
else
delegateTo.weight += sender.weight;
}
/// Give a single vote to proposal $(toProposal).
function vote(uint8 toProposal) public {
Voter storage sender = voters[msg.sender];
if (sender.voted || toProposal >= proposals.length) return;
sender.voted = true;
sender.vote = toProposal;
proposals[toProposal].voteCount += sender.weight;
}
function winningProposal() public constant returns (uint8 _winningProposal) {
uint256 winningVoteCount = 0;
for (uint8 prop = 0; prop < proposals.length; prop++)
if (proposals[prop].voteCount > winningVoteCount) {
winningVoteCount = proposals[prop].voteCount;
_winningProposal = prop;
}
}
}
pragma solidity ^0.4.24;
contract personalWallet {
using BytesLib for bytes;
address public owner;
address public recovery;
uint256 public nonce;
constructor(address _owner, address _recovery) public {
owner = _owner;
recovery = _recovery;
}
function isOwner(address _owner) public view returns(bool) {
return(_owner == owner);
}
function owners() public view returns(address[] memory _owners) {
_owners = new address[](1);
_owners[0] = owner;
}
modifier onlyOwner() {
require(msg.sender == owner);
_;
}
modifier onlyRecovery(){
require(msg.sender == recovery);
_;
}
function setOwner(address _owner) onlyRecovery external {
owner = _owner;
}
function setRecovery(address _recovery) onlyRecovery external {
recovery = _recovery;
}
event Execute(address to, uint256 value, bytes data);
function execute(address _to, uint256 _value, bytes _data) public onlyOwner {
require(_to.call.value(_value)(_data));
emit Execute(_to, _value, _data);
}
function batchExecute(
address[] _to, uint256[] _value,
uint256[] _idx, bytes _data) public onlyOwner {
uint256 start = 0;
for (uint256 i = 0; i < _idx.length; i++) {
require(_to[i].call.value(_value[i])(_data.slice(start, _idx[i])));
emit Execute(_to[i], _value[i], _data.slice(start, _idx[i]));
start += _idx[i];
}
}
function delegateExecute(
address _to, uint256 _value,
bytes _data, uint256 _nonce,
uint8 _v, bytes32 _r, bytes32 _s) public {
require(_nonce == nonce);
bytes memory prefix = "\x19Ethereum Signed Message:\n32";
bytes32 digest = keccak256(abi.encodePacked(_to, _value, _data, _nonce));
bytes32 txHash = keccak256(abi.encodePacked(prefix,digest));
require(ecrecover(txHash, _v, _r, _s) == owner);
require(_to.call.value(_value)(_data));
emit Execute(_to, _value, _data);
nonce = nonce + 1;
}
function batchDelegateExecute(
address[] _to, uint256[] _value,
uint256[] _idx, bytes _data, uint256 _nonce,
uint8 _v, bytes32 _r, bytes32 _s) public {
require(_nonce == nonce);
bytes memory prefix = "\x19Ethereum Signed Message:\n32";
bytes32 digest = keccak256(
abi.encodePacked(_to, _value, _idx, _data, _nonce));
bytes32 txHash = keccak256(abi.encodePacked(prefix, digest));
require(ecrecover(txHash, _v, _r, _s) == owner);
uint256 start = 0;
for (uint256 i = 0; i < _idx.length; i++) {
require(_to[i].call.value(_value[i])(_data.slice(start, _idx[i])));
emit Execute(_to[i], _value[i], _data.slice(start, _idx[i]));
start += _idx[i];
}
nonce = nonce + 1;
}
function () public payable {
}
}
contract personalWalletFactory {
mapping(address => bool) public isWallet;
function create(address _owner, address _recovery) public returns (address wallet) {
wallet = new personalWallet(_owner, _recovery);
isWallet[wallet] = true;
}
}
/*
* @title Solidity Bytes Arrays Utils
* @author Gonçalo Sá <[email protected]>
*
* @dev Bytes tightly packed arrays utility library for ethereum contracts written in Solidity.
* The library lets you concatenate, slice and type cast bytes arrays both in memory and storage.
*/
library BytesLib {
function slice(bytes _bytes, uint _start, uint _length) internal pure returns (bytes) {
require(_bytes.length >= (_start + _length));
bytes memory tempBytes;
assembly {
switch iszero(_length)
case 0 {
// Get a location of some free memory and store it in tempBytes as
// Solidity does for memory variables.
tempBytes := mload(0x40)
// The first word of the slice result is potentially a partial
// word read from the original array. To read it, we calculate
// the length of that partial word and start copying that many
// bytes into the array. The first word we copy will start with
// data we don't care about, but the last `lengthmod` bytes will
// land at the beginning of the contents of the new array. When
// we're done copying, we overwrite the full first word with
// the actual length of the slice.
let lengthmod := and(_length, 31)
// The multiplication in the next line is necessary
// because when slicing multiples of 32 bytes (lengthmod == 0)
// the following copy loop was copying the origin's length
// and then ending prematurely not copying everything it should.
let mc := add(add(tempBytes, lengthmod), mul(0x20, iszero(lengthmod)))
let end := add(mc, _length)
for {
// The multiplication in the next line has the same exact purpose
// as the one above.
let cc := add(add(add(_bytes, lengthmod), mul(0x20, iszero(lengthmod))), _start)
} lt(mc, end) {
mc := add(mc, 0x20)
cc := add(cc, 0x20)
} {
mstore(mc, mload(cc))
}
mstore(tempBytes, _length)
//update free-memory pointer
//allocating the array padded to 32 bytes like the compiler does now
mstore(0x40, and(add(mc, 31), not(31)))
}
//if we want a zero-length slice let's just return a zero-length array
default {
tempBytes := mload(0x40)
mstore(0x40, add(tempBytes, 0x20))
}
}
return tempBytes;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment