tromp

1103 ms·

3781.
by tromp 13y ago
The Dutch name "eenmaal" means "once" but can also be read as "een maal" meaning "a meal" or in this case, as "één maal" meaning "one meal". Cute worldplay...
3782.
by tromp 13y ago
Basing a concrete definition of Kolmogorov complexity on the lambda calculus rather than Turing machines has many advantages. See https://en.wikipedia.org/wiki/Binary_lambda_calculus for a concrete definition, and a pr
3783.
by tromp 13y ago
Your claimed definition: "The overall Kolmogorov complexity of a string is thus defined as K(x)=|p| where p is the shortest program string for language L such that L(p)=x and we consider all programming languages." is clearly wron
3784.
by tromp 13y ago
Slightly off-topic, but even this month's Ponder This challenge http://domino.research.ibm.com/Comm/wwwr_ponder.nsf/Challeng... is devoted to 2048...
3785.
by tromp 13y ago
Yes, as an algorithm designer myself, I can see the attraction:-) I'd make a bad competitive miner though, as I'd be too eager to publish my optimizations, and get some recognition for that...
3786.
by tromp 13y ago
| ASICs can work with more memory, no problem Up to a point. When you need more memory than fits on a single chip, you have to incur off-chip delays in accessing memory. Basically your ASIC is now just an application specific manycore CPU t
3787.
by tromp 13y ago
Only two downsides: 1) The existing algorithms for finding prime chains or clusters are rather involved, and people may keep superior algorithms private. 2) They're not very botnet-resistant.
3788.
by tromp 13y ago
The way to achieve ASIC,FPGA and even GPU resistance is to require many GB of memory. Better yet, random access to many GB of memory. Then your performance is limited by memory latency. This is what I designed Cuckoo Cycle ( https:/&#x
3789.
by tromp 13y ago
Yes, why not a PoW that's all of ASIC resistant GPU resistant botnet resistant My Cuckoo Cycle PoW ( https://github.com/tromp/cuckoo ) configured to require for instance 7GB of memory, is all of the above. And is ve
3790.
by tromp 13y ago
But Go can still be surprisingly hard on tiny board sizes. There are, for instance, 386,356,909,593 possible 2x2 games. (under the positional superko rule which says you cannot repeat any earlier position.)
3791.
by tromp 13y ago
About 1/4 down the page the author summarizes a sequence of optimizations of the basic ElGamal scheme. I don't quite understand the "Eliminate divisions" step, which transforms B^H(R,M) = A R^S into B^S = R A^H(R,M) How
3792.
by tromp 13y ago
While they haven't yet figured out how to make a proof-of-work do useful work, one can make a relatively low-power one that mostly (95%) substitutes memory latency for computation, as in my https://github.com/tromp&#x2F
3793.
by tromp 13y ago
Ripple, the IOU-oriented crypto currency, also has a scripting language for encoding contracts: https://ripple.com/wiki/Contracts
3794.
by tromp 13y ago
Its memory requirement of 128KB is a compromise between computation-hardness for the prover and verification efficiency for the verifier. You don't want verification of a proof-of-work to take a lot of resources, since every client has
3795.
by tromp 13y ago
You get around it by slowing down the computation with memory latencies. See http://en.wikipedia.org/wiki/Random-access_memory#Memory_wal...
3796.
by tromp 13y ago
From the README of my "Cuckoo Cycle" Proof-of-Work at https://github.com/tromp/cuckoo : Mining is generally considered to be inherently power hungry but it need not be. It’s a consequence of making the proof
3797.
by tromp 13y ago
Cuckoo Cycle ( https://github.com/tromp/cuckooh ) searches for cycles in a random bipartite graph (induced by Cuckoo Hashing). Instead of requiring a lot of computation, it requires a lot of waiting due to latency of ran
3798.
by tromp 13y ago
Cuckoo Cycle at https://github.com/tromp/cuckoo seems like a better proof-of-work system and comes with a full implementation. It has the following features: 1) proofs take the form of a length 42 cycle in the Cuckoo g
3799.
by tromp 13y ago
the naming convention that allows it to be named cuckoo729. the program could be rewritten not to use bit 31 as a flag, and then you could use as many as 2^32-1 nodes, but that's not neatly expressible as MULT*2^SHIFT with few digits.
3800.
by tromp 13y ago
Dagger appears to be inferior to the Cuckoo Cycle proof of work system I recently developed; see https://github.com/tromp/cuckoo Cuckoo Cycle is a new proof of work system with the following features 1) proofs take the
3801.
by tromp 13y ago
Only 200%? That's not good enough for me. I need it 300% secure at a minimum...
3802.
by tromp 13y ago
I stopped reading at "3.5" TFT, 800x480, resistive"
3803.
by tromp 13y ago
I thought dysoco hinted at the brainfuck self-interpreter, as linked to by peterwaller. There acutally is a brainfuck compiler called awib ( http://code.google.com/p/awib/ ), but it's not that small (very artistic though). So I assumed the
3804.
by tromp 13y ago
We are talking about interpreters here, not compilers. Binary Lambda Calculus has both Forth and Brainfuck beat, with a BLC interpreter in BLC of only 206 bits (under 26 bytes).
3805.
by tromp 14y ago
Doesn't Go end when both players pass consecutively:-?