# Tag Info

### What problem would you base your mathcoin on?

I'd choose $R(5,5)$ and other unknown Ramsey numbers, since "Erdős asks us to imagine an alien force, vastly more powerful than us, landing on Earth and demanding the value of $R(5, 5)$ or they ...

### What computational problems would be good proof-of-work problems for cryptocurrency mining?

Have you considered unknotting knots? The problem would be finding a sequence of Reidemeister moves for a random link graph that reduces it to the unknot. In some cases, no such sequence would exist, ...
• 3,271

### What computational problems would be good proof-of-work problems for cryptocurrency mining?

Calculating the permanent of a small matrix is a computationally challenging problem, as discussed here, here, and here. See also the Wikipedia article. Given an $n \times n$ matrix $A$, a naïve ...
• 1,615

### What computational problems would be good proof-of-work problems for cryptocurrency mining?

Finding cycles in graphs is a standard graph theory problem that lends itself well to proof-of-work. See my Cuckoo Cycle project page at https://github.com/tromp/cuckoo which has tons of details, as ...
• 1,519

### What computational problems would be good proof-of-work problems for cryptocurrency mining?

I find this to be an excellent suggestion, though not sure all requirements can be satisfied. More specifically, 3 and 5 - if we randomly generate instances, then why would they have any intrinsic ...
• 17.6k
Accepted

### What computational problems would be good proof-of-work problems for cryptocurrency mining?

Here is a recent paper, which has been received positively in the cryptocurrency community. I will expand on this paper here. While conventional hash functions do not allow one to construct very ...
• 24.6k

### What problem would you base your mathcoin on?

In Conways game of life, there is a the concept of an orphan pattern. Basically, an orphan is a finite pattern such that each configuration containing that pattern is a Garden of Eden (a pattern that ...

### What problem would you base your mathcoin on?

Homotopy groups of spheres. We know far too little about them! It can be made computationally feasible by choosing finite simplicial complexes and allowing subdivision. Maps of simplicial complexes ...

### What problem would you base your mathcoin on?

Maybe finding good error-correcting codes. For instance, given $q, n, M$, search for a set of $M$ strings, each of length $n$ from a $q$-sized alphabet, with largest $d$, where $d =$ minimum pairwise ...

### What computational problems would be good proof-of-work problems for cryptocurrency mining?

Discussion of the prospect of a cryptocurrency based on cellular automata prompted me to start developing the Catagolue project in the summer of 2014. The proof-of-work system was deliberately chosen ...
• 11.8k

### What problem would you base your mathcoin on?

Apologies if this answer is nitpicky and diverges slightly from the questions intent, but this particular soft question appears to warrant a soft answer. Implicit in your term "mathcoin" are ...

### What computational problems would be good proof-of-work problems for cryptocurrency mining?

Let me have another go, because I really love this question. Essentially it's like a SETI@home project - without going into details, let's just consider the theoretical model that some signals arrive ...
• 17.6k

### What computational problems would be good proof-of-work problems for cryptocurrency mining?

I don't see how you will have a problem which is progress free but still in NP(requirement 7); or any kind of problem that is suitable for your purpose for that matter. To see why this seems unlikely ...
• 179