Reputation
757
Top tag
Next privilege 1,000 Rep.
See votes, expandable usercard
Badges
3 14
Newest
 Nice Answer
Impact
~10k people reached

  • 0 posts edited
  • 1 helpful flag
  • 19 votes cast
Dec
9
comment Is there an “additive” proof-of-work?
That's the idea. For example, the High-Value-Hash Highway (bitcointalk.org/index.php?topic=98986.msg1083483#msg1083483) allows one to build a cumulative proof-of-work, over the whole chain, but its size is not bounded by the logarithm of the difficulty, but bounded by the logarithm of the chain length.
Oct
26
comment Is there an “additive” proof-of-work?
It's still progress-free, because each PoW A(i) is progress-free, and each block would need a single proof step (from A(n) to A(n+1)) and not many steps.
Sep
22
awarded  Nice Answer
Jun
5
awarded  Self-Learner
Feb
8
awarded  Popular Question
Nov
21
comment Is there an “additive” proof-of-work?
The proposal has some merits, but fails to satisfy the requeriments in several aspects: the proof size is unbounded, as long as the graph expands. Also the additive propery is lost when a new graph needs to be created, since you need to verify all previous graphs. Last, it would be very hard to set the difficulty increments in such a way that every increment corresponds to a predefined work.
Nov
19
asked Is there an “additive” proof-of-work?
Aug
3
awarded  Yearling
Jul
2
awarded  Curious
Jun
22
awarded  Popular Question
Apr
11
revised Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
deleted 4 characters in body
Apr
11
comment Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
@poncho: If the problem is easy, then my question is meaningless.
Apr
10
revised Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
Previous question was not exactly was I was looking for
Apr
10
asked Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
Apr
8
comment Is there a malleable pubkey digital signature scheme?
Corrected. Are there more trivial solutions?
Apr
8
revised Is there a malleable pubkey digital signature scheme?
added 1 characters in body
Apr
8
revised Is there a malleable pubkey digital signature scheme?
added 1 characters in body
Apr
8
comment Is there a malleable pubkey digital signature scheme?
OK. Now I have cleared my mind and I re-wrote the whole question. At least now I can be told it's impossible.
Apr
8
revised Is there a malleable pubkey digital signature scheme?
added 189 characters in body
Apr
8
comment Is there a malleable pubkey digital signature scheme?
Not seems to be related to multi-signatures. I try to build a signature which has plausible deniability: If I sign a document I can always claim it was signed by another unknown party, but still nobody can sign with my pubkey.