Bitcoin Forum
April 26, 2024, 10:39:45 PM *
News: Latest Bitcoin Core release: 27.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: [1]
  Print  
Author Topic: Branching-hard PoW?  (Read 749 times)
monsterer (OP)
Legendary
*
Offline Offline

Activity: 1008
Merit: 1000


View Profile
January 25, 2016, 11:57:31 AM
 #1

Branches are notoriously slow on GPU, and cost silicon space on ASIC chips, so if there was a PoW which required a lot of branches and which couldn't be simplified by using memory tables and precomputions, this would seem like a good alternative to memory-hard PoW.

Has there been any research into PoW algorithms which are branching-hard?
1714171185
Hero Member
*
Offline Offline

Posts: 1714171185

View Profile Personal Message (Offline)

Ignore
1714171185
Reply with quote  #2

1714171185
Report to moderator
1714171185
Hero Member
*
Offline Offline

Posts: 1714171185

View Profile Personal Message (Offline)

Ignore
1714171185
Reply with quote  #2

1714171185
Report to moderator
1714171185
Hero Member
*
Offline Offline

Posts: 1714171185

View Profile Personal Message (Offline)

Ignore
1714171185
Reply with quote  #2

1714171185
Report to moderator
"With e-currency based on cryptographic proof, without the need to trust a third party middleman, money can be secure and transactions effortless." -- Satoshi
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
2112
Legendary
*
Offline Offline

Activity: 2128
Merit: 1065



View Profile
January 25, 2016, 08:22:53 PM
 #2

Branches [...] cost silicon space on ASIC chips [...]
Now that is one of the weirdest claims I read on this site.

You seem to be unaware of the existence of the whole areas of the https://en.wikipedia.org/wiki/Automata_theory that study things different than the prevailing https://en.wikipedia.org/wiki/Von_Neumann_architecture .

Are there any reputable schools granting Computer Science degrees without requiring the student to understand the fundamentals of digital logic design (e.g. a flip-flop)?

Whole message quoted again for posterity:
Branches are notoriously slow on GPU, and cost silicon space on ASIC chips, so if there was a PoW which required a lot of branches and which couldn't be simplified by using memory tables and precomputions, this would seem like a good alternative to memory-hard PoW.

Has there been any research into PoW algorithms which are branching-hard?

Please comment, critique, criticize or ridicule BIP 2112: https://bitcointalk.org/index.php?topic=54382.0
Long-term mining prognosis: https://bitcointalk.org/index.php?topic=91101.0
monsterer (OP)
Legendary
*
Offline Offline

Activity: 1008
Merit: 1000


View Profile
January 26, 2016, 08:56:05 AM
 #3

Branches [...] cost silicon space on ASIC chips [...]
Now that is one of the weirdest claims I read on this site.

You seem to be unaware of the existence of the whole areas of the https://en.wikipedia.org/wiki/Automata_theory that study things different than the prevailing https://en.wikipedia.org/wiki/Von_Neumann_architecture .

You're suggesting that branches are cost/space free on an ASIC?
2112
Legendary
*
Offline Offline

Activity: 2128
Merit: 1065



View Profile
January 26, 2016, 06:41:18 PM
 #4

You're suggesting that branches are cost/space free on an ASIC?
Yup. This is a trivial result from the classical papers from 1955 and 1956.

https://en.wikipedia.org/wiki/Mealy_machine
https://en.wikipedia.org/wiki/Moore_machine

I just had to consult the Wikipedia to verify that John Von Neumann published his paper earlier, in 1945.

Some schools must be really bad if in the 21th century they don't teach the science from the middle of 20th century.
 

Please comment, critique, criticize or ridicule BIP 2112: https://bitcointalk.org/index.php?topic=54382.0
Long-term mining prognosis: https://bitcointalk.org/index.php?topic=91101.0
Pages: [1]
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!