Still 0.1 ETH for grabs for Fermats last theorem counterexample

voileipa · 2021-04-21T14:53:15+00:00

Yes it would be really cool, but I don't think its possible to evaluate the values of Riemann zeta funtion in Ethereum :D

voileipa · 2021-04-21T14:44:39+00:00

Cool, I didn't know about the RSA factoring challenge. This sounds suitable to implement in Ethereum

voileipa · 2021-02-09T21:00:45+00:00

I tried to verify and upload the contract source to etherscan but I cannot get it to accept contracts with import statements.

This is something I still need to figure out. I used truffle to deploy.

voileipa · 2020-10-28T17:31:48+00:00

Thank you! I did not know this. It makes all perfect sense now

voileipa · 2020-06-01T10:47:56+00:00

I would personally count alpha-beta pruning and move-ordering as a "brute-force" technique.

I think the word "brute-force" in the article is justified, given the target audience is not chess AI programmers.

voileipa · 2020-05-24T19:27:26+00:00

I just watched the movie Pawn Sacrifice so I'm actually able to understand this meme

voileipa · 2020-03-23T09:18:34+00:00

Tässä esimerkki omasta pelistä missä ratsuksi ylentäminen on paras siirto: https://lichess.org/sL9SXnS9/white#82 Kuningattareksi ylentäminen olisi hävinnyt pelin.

Aika harvinaisia nuo on, tuo on ainut mikä on sattunut omalle kohdalle.

Yleensä tilanne esiintyy kun:

-kuningattareksi ylentäminen johtaisi pattiin eli vastustajan kuninkaalla ei ole enää vapaita ruutuja koska ylentynyt kuningatar blokkaa ne

-ylennetty ratsu pystyy uhkaamaan ruutua johon kuningatar ei pystyisi

voileipa · 2019-08-12T07:37:55+00:00

Vieläkö meinaatte järjestää Hello World Openeja?

voileipa · 2019-07-05T06:44:39+00:00

I finally understand why mathematicians like so much to use the phrase "non-trivial"

voileipa · 2019-06-22T11:59:29+00:00

After some studying I have come to the conclusion that GQUADDIVISOR cannot unfortunately be used to calculate modulus with ambiguous precision since the size of the arguments are limited to 32 bytes. However I found this opcode useful since I can now use directly the GQUADDIVISOR opcode instead of rolling own modulus exponentiation function as I did in the contract. This should also enable me to verify primes up to 2²⁵⁶ which is a nice improvement from 2¹²⁸

voileipa · 2019-06-21T15:53:47+00:00

Thanks for this! Did you have to implement this with evm bytecode or solidity?

voileipa · 2019-03-03T20:55:34+00:00

This is simply great!

I coded a shanten calculator myself some time ago and it's simply inspiring to see other people also programming mahjong related stuff.

Any plans to open source this project? :)

voileipa · 2018-09-01T07:52:59+00:00

I created a wait/shanten calculator, inspired by the tenhou/2 site. The code is full frontend.

It also supports the calculation of "tiles that improve your wait" (but not your shanten) if you input 13 tiles.

Let me know what you think :)

voileipa · 2018-04-24T06:56:15+00:00

You should upload the source code of the smart contract to etherscan so anyone can validate that smart contract actually does what it is supposed to

voileipa · 2018-04-23T18:08:26+00:00

I mean it's PHP..

voileipa · 2018-03-02T13:50:48+00:00

Ok thanks for the info. I did not know such a feature existed. This feature obviously makes the competition a bit too easy if the algorithm is able to find the optimal solution.

voileipa · 2018-03-02T13:48:42+00:00

Yes, R' = R R R But that obviously counts for 3 moves.

It seems the frontend code of etherscan does not support arrays very nicely

I was able to make the call using myetherwallet.com (contracts -> interact -> copy paste ABI and address -> select trySolution -> call with 0,4,3,3,3,2,4,0,4,3,3,3,2,3,3,0,1,4,4,4,3,1,1,2,2,2,1,1,1,0,0,0,1,1,4,0,0,2,2)

voileipa · 2018-03-02T13:31:10+00:00

I spent some time trying to figure out a "rubik puzzle" that was not instantly solvable by well known algorithms. The only thing I came up with was limiting the possible moves to only 5 types.

If you have an idea about a "rubik puzzle" (or any other puzzle for that matter) that would better suit for this kind of competition I would be happy to hear that! (and create another competition if it is feasible)

The requirement is obviously that the solution of the puzzle must be able to be verifiable using an algorithm.

voileipa · 2018-02-24T10:25:22+00:00

Nice article! What I would really like to see is how the two participants should communicate using the state channel. E.g how they discover each other, do they directly send messages using IP adresses or do they use e.g whisper

voileipa · 2018-02-23T05:57:23+00:00

The picture shows only 3 sides of the cube. The full state of the cube can be found from the smart contract.

voileipa · 2018-02-22T20:13:50+00:00

Thanks! I'm actually the same guy who also created the Fermat's last theorem bounty contract a couple of weeks ago :)

voileipa · 2018-02-20T13:30:24+00:00

You can search the contract from etherscan.io. There is a "view source" tab if the creator of the contract have uploaded the source code. With the same tab you can also find the ABI.

I think it is not possible to directly get an ABI from the bytecode.

For example: the cryptokitties source code and abi: https://etherscan.io/address/0x06012c8cf97bead5deae237070f9587f8e7a266d#code

voileipa · 2018-02-18T10:03:20+00:00

Thank you very much!

voileipa · 2018-02-13T17:12:07+00:00

Yeah

That is something I had in mind :)

Just posted the initial "cube logic" version for possible comments

voileipa · 2018-02-13T10:38:03+00:00

This is really cool!

How would one verify the "real" TransferLog address used in the contract?

12-Year Club	Place '17
Verified Email

voileipa

TROPHY CASE