Back to HomeDeployer Cyrus Adkisson(0xcf684d...ad1bac) Deployment Block 383,700 Deployment Date Oct 14, 2015, 06:08 PM Code Size 11.3 KB Gas at Deploy 3,112,155
Deployed October 14, 2015 (10 years ago)Block 383,700
Etheria v0.7, the fatally bugged proto its author could never reproduce
Frontier EraVerified Source
Context
Frontier era deployment by Cyrus Adkisson, the author of Etheria.
Key Facts
Transactions by Year
201517
2022306
20233
Deployment Transaction: 0x3a2d2a923263d92a...a6be15ea6456b0af
Description
The third public Etheria, deployed 14 October 2015 and abandoned the same week because acceptOffer can be called by anyone on any tile. Cyrus Adkisson published what he believed was its source in cyrusadkisson/etheria_source and noted that he had been unable to get an exact source to bytecode match. Four things separate that file from what actually ran: initializeTiles guards on the row index before its loop, the functions are declared in a different order, Block[20] blocks is declared ahead of the occupado array rather than after it, and there is an address held one slot before creator that the constructor sets to 0x1312fd55346f4ced45e0da98cd5ab0dc50a5459f and nothing else ever reads. With those four changes the published source compiles to the deployed creation and runtime bytecode exactly.
Source Verified
Heuristic Analysis
The following characteristics were detected through bytecode analysis and may not be accurate.
Detected Type: Utility
Frontier Era
The initial release of Ethereum. A bare-bones implementation for technical users.
Block span: 0 — 1,149,999
July 30, 2015 — March 14, 2016
Bytecode Overview
Opcodes11,554
Unique Opcodes202
Jump Instructions947
Storage Operations327
Verified Source Available
Source verified through compiler archaeology and exact bytecode matching.
View Verification ProofShow source code (Solidity)
// Submitted by EthereumHistory (ethereumhistory.com)
contract Etheria {
uint8 mapsize = 17;
Tile[17][17] tiles;
address initializer;
address creator;
struct Tile
{
uint8 elevation;
address owner;
address[] offerers;
uint[] offers;
int8[5][] blocks; //0 = which,1 = blockx,2 = blocky,3 = blockz, 4 = color
uint lastfarm;
}
function getOfferers(uint8 x, uint8 y) constant returns (address[])
{
return tiles[x][y].offerers;
}
function wouldFallOutside(int8 which, int8 x, int8 y) constant returns (bool)
{
int8 occupiesx = 0;
int8 occupiesy = 0;
for(uint8 b = 0; b < 8; b++) // always 8 hexes
{
occupiesx = blocks[uint(which)].occupies[b][0];
occupiesy = blocks[uint(which)].occupies[b][1];
if(y % 2 != 0 && occupiesy%2 != 0) // if y is odd, offset the x by 1
{
occupiesx = occupiesx + 1;
}
if(!blockHexCoordsValid(occupiesx+x, occupiesy+y))
return true;
}
return false;
}
function initBlockDef(uint8 which, int8[3][8] occupies, int8[3][] surroundedby)
{
blocks[which].which = which;
for(uint8 o = 0; o < 8; o++)
{
for(uint8 i = 0; i < 3; i++)
{
blocks[which].occupies[o][i] = occupies[o][i];
}
}
blocks[which].surroundedby.length = surroundedby.length;
for(uint8 oo = 0; oo < surroundedby.length; oo++)
{
for(uint8 ii = 0; ii < 3; ii++)
{
blocks[which].surroundedby[oo][ii] = surroundedby[oo][ii];
}
}
}
function getOwners() constant returns(address[17][17])
{
address[17][17] memory owners;
for(uint8 y = 0; y < mapsize; y++)
{
for(uint8 x = 0; x < mapsize; x++)
{
owners[x][y] = tiles[x][y].owner;
}
}
return owners;
}
function getElevations() constant returns (uint8[17][17])
{
uint8[17][17] memory elevations;
for(uint8 y = 0; y < mapsize; y++)
{
for(uint8 x = 0; x < mapsize; x++)
{
elevations[x][y] = tiles[x][y].elevation;
}
}
return elevations;
}
function Etheria() {
initializer = 0x1312fd55346f4ced45e0da98cd5ab0dc50a5459f;
creator = msg.sender;
}
function acceptOffer(uint8 x, uint8 y, uint8 i) // accepts the offer at index (1-10)
{
tiles[x][y].owner.send(tiles[x][y].offers[i]); // send offer money to oldowner
tiles[x][y].owner = tiles[x][y].offerers[i]; // new owner is the offerer
delete tiles[x][y].offerers; // delete all offerers
delete tiles[x][y].offers; // delete all offers
return;
}
function retractOffer(uint8 x, uint8 y) // retracts the first offer in the array by this user.
{
for(uint8 i = 0; i < tiles[x][y].offerers.length; i++)
{
if(tiles[x][y].offerers[i] == msg.sender) // this user has an offer on file. Remove it.
removeOffer(x,y,i);
}
}
function rejectOffer(uint8 x, uint8 y, uint8 i) // index 0-10
{
if(tiles[x][y].owner != msg.sender) // only the owner can reject offers
return;
removeOffer(x,y,i);
return;
}
function removeOffer(uint8 x, uint8 y, uint8 i) private // index 0-10, can't be odd
{
// return the money
tiles[x][y].offerers[i].send(tiles[x][y].offers[i]);
// delete user and offer and reshape the array
delete tiles[x][y].offerers[i]; // zero out user
delete tiles[x][y].offers[i]; // zero out offer
for(uint8 j = i+1; j < tiles[x][y].offerers.length; j++) // close the arrays after the gap
{
tiles[x][y].offerers[j-1] = tiles[x][y].offerers[j];
tiles[x][y].offers[j-1] = tiles[x][y].offers[j];
}
tiles[x][y].offerers.length--;
tiles[x][y].offers.length--;
return;
}
function getOffers(uint8 x, uint8 y) constant returns (uint[])
{
return tiles[x][y].offers;
}
Block[20] blocks;
struct Block
{
uint8 which;
int8[3][8] occupies; // [x,y,z] 8 times
int8[3][] surroundedby; // [x,y,z]
}
int8[3][][17][17] occupado;
function blockHexCoordsValid(int8 x, int8 y) constant returns (bool)
{
if(-33 <= y && y <= 33)
{
if(y % 2 != 0 ) // odd
{
if(-50 <= x && x <= 49)
return true;
}
else // even
{
if(-49 <= x && x <= 49)
return true;
}
}
else
{
int8 absx;
int8 absy;
absx = x;
if(absx < 0)
absx = absx*-1;
absy = y;
if(absy < 0)
absy = absy*-1;
if((y >= 0 && x >= 0) || (y < 0 && x > 0)) // first or 4th quadrants
{
if(y % 2 != 0 ) // odd
{
if (((absx/3) + (absy/2)) <= 33)
return true;
}
else // even
{
if ((((absx+1)/3) + ((absy-1)/2)) <= 33)
return true;
}
}
else
{
if(y % 2 == 0 ) // even
{
if (((absx/3) + (absy/2)) <= 33)
return true;
}
else // odd
{
if ((((absx+1)/3) + ((absy-1)/2)) <= 33)
return true;
}
}
}
return false;
}
function initializeTiles(uint8 row, uint8[17] _elevations)
{
if(row >= mapsize)
return;
for(uint8 x = 0; x < mapsize; x++)
tiles[x][row].elevation = _elevations[x];
}
function editBlock(uint8 x, uint8 y, uint index, int8[5] block)
{
if(tiles[x][y].owner != msg.sender)
return;
block[0] = tiles[x][y].blocks[index][0]; // can't change the which
tiles[x][y].blocks[index] = block;
return;
}
function getBlocks(uint8 x, uint8 y) constant returns (int8[5][])
{
return tiles[x][y].blocks;
}
// block edit validation
// TODO:
// DONE block texturing
// DONE angle camera
// DONE block edit validation coordinate constraints in JS
// DONE block edit validation must touch, no overlap in JS
// block edit validation coordinate constraints in solidity
// block edit validation must touch, no overlap in solidity
// DONE block lookup caching
// register name for owner
// FULL GAME TODO:
// Fitness vote
// Cast threat
// chat
// messaging
// block trading
// reclamation
// price modifier
function touchesAndAvoidsOverlap(uint8 coordx, uint8 coordy, int8 which, int8 x, int8 y, int8 z) constant returns (bool)
{
int8[3][8] wouldoccupy = blocks[uint(which)].occupies;
for(uint8 b = 0; b < 8; b++) // always 8 hexes
{
wouldoccupy[b][0] = wouldoccupy[b][0]+x;
wouldoccupy[b][1] = wouldoccupy[b][1]+y;
if(y % 2 != 0 && wouldoccupy[b][1]%2 != 0)
wouldoccupy[b][0] = wouldoccupy[b][0]+1; // anchor y and this hex y are both odd, offset by +1
wouldoccupy[b][2] = wouldoccupy[b][2]+z;
}
int8[3][] surroundings = blocks[uint(which)].surroundedby;
for(uint8 bb = 0; bb < surroundings.length; bb++)
{
surroundings[b][0] = surroundings[b][0]+x;
surroundings[b][1] = surroundings[b][1]+y;
if(y % 2 != 0 && surroundings[b][1]%2 != 0)
surroundings[b][0] = surroundings[b][0]+1; // anchor y and this hex y are both odd, offset by +1
surroundings[b][2] = surroundings[b][2]+z;
}
bool touches;
uint numloops = 8;
if(surroundings.length > 8)
numloops = surroundings.length;
for(uint8 l = 0; l < numloops; l++)
{
for(uint o = 0; o < occupado[coordx][coordy].length; o++)
{
if(l < 8 && wouldoccupy[l][0] == occupado[coordx][coordy][o][0] && wouldoccupy[l][1] == occupado[coordx][coordy][o][1] && wouldoccupy[l][2] == occupado[coordx][coordy][o][2]) // are the arrays equal?
return false; // this hex conflicts. The proposed block does not avoid overlap. Return false immediately.
if(touches == false && l < surroundings.length && surroundings[l][0] == occupado[coordx][coordy][o][0] && surroundings[l][1] == occupado[coordx][coordy][o][1] && surroundings[l][2] == occupado[coordx][coordy][o][2]) // are the arrays equal?
touches = true;
}
if(l >= 8 && touches == true)
return true;
}
if(touches == true)
return true;
else
return false;
}
function initOccupado(uint col, uint row)
{
int8 x;
int8 y;
for(y = -66; y <= 66; y++)
{
if(y % 2 != 0 ) // odd
x = -50;
else
x = -49;
if(y >= -33 && y <= 33)
{
for(x; x <= 49; x++)
{
occupado[col][row].length++;// = occupado[col][row].length+1;
occupado[col][row][occupado[col][row].length-1][0] = x;
occupado[col][row][occupado[col][row].length-1][1] = y;
occupado[col][row][occupado[col][row].length-1][2] = -1;
//occupado[col][row][occupado[col][row].length-1] = [x,y,-1]);
}
}
else
{
int8 absx;
int8 absy;
for(x; x <= 49; x++)
{
absx = x;
if(absx < 0)
absx = absx*-1;
absy = y;
if(absy < 0)
absy = absy*-1;
if((y >= 0 && x >= 0) || (y < 0 && x > 0)) // first or 4th quadrants
{
if(y % 2 != 0 ) // odd
{
if (((absx/3) + (absy/2)) <= 33)
{
occupado[col][row].length++;
occupado[col][row][occupado[col][row].length-1][0] = x;
occupado[col][row][occupado[col][row].length-1][1] = y;
occupado[col][row][occupado[col][row].length-1][2] = -1;
// occupado[col][row].push([x,y,-1]);
}
}
else // even
{
if ((((absx+1)/3) + ((absy-1)/2)) <= 33)
{
occupado[col][row].length++;
occupado[col][row][occupado[col][row].length-1][0] = x;
occupado[col][row][occupado[col][row].length-1][1] = y;
occupado[col][row][occupado[col][row].length-1][2] = -1;
//occupado[col][row].push([x,y,-1]);
}
}
}
else
{
if(y % 2 == 0 ) // even
{
if (((absx/3) + (absy/2)) <= 33)
{
occupado[col][row].length++;
occupado[col][row][occupado[col][row].length-1][0] = x;
occupado[col][row][occupado[col][row].length-1][1] = y;
occupado[col][row][occupado[col][row].length-1][2] = -1;
//occupado[col][row].push([x,y,-1]);
}
}
else // odd
{
if ((((absx+1)/3) + ((absy-1)/2)) <= 33)
{
occupado[col][row].length++;
occupado[col][row][occupado[col][row].length-1][0] = x;
occupado[col][row][occupado[col][row].length-1][1] = y;
occupado[col][row][occupado[col][row].length-1][2] = -1;
//occupado[col][row].push([x,y,-1]);
}
}
}
}
}
}
}
// NEEDS NO INFORMATION FROM MAP... COULD BE PLACED IN ANOTHER CONTRACT
function getUint8FromByte32(bytes32 _b32, uint8 byteindex) public constant returns(uint8) {
uint postheadchop;
if(byteindex == 0)
postheadchop = uint(_b32); //for byteindex 0, buint is just the input number. 16^64 is out of uint range, so this exception has to be made.
else
postheadchop = uint(_b32) % (16 ** (64 - (byteindex*2))); // @i=0 _b32=a1b2c3d4... postheadchop=a1b2c3d4, @i=1 postheadchop=b2c3d4, @i=2 postheadchop=c3d4
uint evenedout = postheadchop - (postheadchop % (16 ** (64 - 2 - (byteindex*2)))); // @i=0 evenedout=a1000000, @i=1 remainder=b20000, @i=2 remainder=c300
uint8 b = uint8(evenedout / (16 ** (64 - 2 - (byteindex*2)))); // @i=0 b=a1 (to uint), @i=1 b=b2, @i=2 b=c3
return b;
}
function makeOffer(uint8 x, uint8 y)
{
if(msg.value < 10000000000000000 || msg.value > 1208925819614629174706175) // .01 ether up to (2^80 - 1) wei is the valid range
{
if(!(msg.value == 0))
msg.sender.send(msg.value); // return their money
return;
}
else if(tiles[x][y].elevation >= 125 && tiles[x][y].owner == address(0)) // if unowned and above sea level, accept offer of 1 ETH immediately
{
if(msg.value != 1000000000000000000) // 1 ETH is the starting value. If not enough or too much...
{
msg.sender.send(msg.value); // return their money
return;
}
else
{
creator.send(msg.value); // this was a valid offer, send money to contract owner
tiles[x][y].owner = msg.sender; // set tile owner to the buyer
return;
}
}
else
{
if(tiles[x][y].offerers.length < 10) // this tile can only hold 10 offers at a time
{
for(uint8 i = 0; i < tiles[x][y].offerers.length; i++)
{
if(tiles[x][y].offerers[i] == msg.sender) // user has already made an offer. Update it and return;
{
msg.sender.send(tiles[x][y].offers[i]); // return their previous money
tiles[x][y].offers[i] = msg.value; // set the new offer
return;
}
}
// the user has not yet made an offer
tiles[x][y].offerers.length++; // make room for 1 more
tiles[x][y].offers.length++; // make room for 1 more
tiles[x][y].offerers[tiles[x][y].offerers.length - 1] = msg.sender; // record who is making the offer
tiles[x][y].offers[tiles[x][y].offers.length - 1] = msg.value; // record the offer
}
}
}
function farmTile(uint8 x, uint8 y)
{
if(tiles[x][y].owner != msg.sender)
return;
if((block.number - tiles[x][y].lastfarm) < 4320) // a day's worth of blocks hasn't passed yet. can only farm once a day. (Assumes block times of 20 seconds.)
return;
bytes32 lastblockhash = block.blockhash(block.number - 1);
for(uint8 i = 0; i < 10; i++)
{
tiles[x][y].blocks.length+=5;
tiles[x][y].blocks[tiles[x][y].blocks.length - 1][0] = int8(getUint8FromByte32(lastblockhash,i) % 32); // which, guaranteed 0-31
tiles[x][y].blocks[tiles[x][y].blocks.length - 1][1] = 0; // x
tiles[x][y].blocks[tiles[x][y].blocks.length - 1][2] = 0; // y
tiles[x][y].blocks[tiles[x][y].blocks.length - 1][3] = -1; // z
tiles[x][y].blocks[tiles[x][y].blocks.length - 1][4] = 0; // color
}
tiles[x][y].lastfarm = block.number;
}
// NOTE: In this instance, block[0] is irrelevant. We can't change "which" type of block it is
}External Links
Related contracts
GetBalance
Same deployerCyrus Adkisson experimental getter (Sep 2015) exposing the ether balance of a hardcoded address via getMyBalance(). Verified byte-for-byte with soljson v0.1.1.
0x759ad4...239a87August 26, 2015Contract 0xddcd64...a08e7b
Same deployerThe greeter tutorial contract: it stores a greeting set at deployment and can be shut down by its owner.
0xddcd64...a08e7bAugust 26, 2015basicInfoGetter
Same deployerA tour of the EVM globals, carrying the constructor of the file it was copied from
0xad826c...d33547August 31, 2015Contract 0x3ea0db...b922e0
Same deployerThe basic info getter from the solidity-baby-steps tutorials, a read only window onto the block and message globals.
0x3ea0db...b922e0August 31, 2015Contract 0xba575c...78733f
Same deployerA contract built to probe what the msg globals actually return, endowed with 5 ETH, deployed 1 September 2015.
0xba575c...78733fSeptember 1, 2015Contract 0x8b180c...c084df
Same deployerA third deployment of the msgExaminer that records its own creation message
0x8b180c...c084dfSeptember 1, 2015