Author

Topic: Proof of Individual Work (PoIW) (Read 340 times)

brand new
Activity: 0
Merit: 0
June 18, 2020, 03:01:57 AM
#7
I have checked many students who love to work individually which provides the option of completing the writing work in a good way. Most of the students always check the writing of youressayreviews in Edubirdie reviews platform where students get the good content of writing work reviews.
newbie
Activity: 20
Merit: 1
June 05, 2020, 04:08:51 AM
#6
what about privacy-centric features to guaranty user privacy in a PoIW environment? Is there any mechanism dedicated to avoiding full transparency?
member
Activity: 322
Merit: 54
Consensus is Constitution
May 25, 2020, 08:33:29 PM
#5
Thanks for the input guys.

So the thing is using the merkleroot from a blockchain is actually a good way to generate "entropy" that both the server and client can agree on, then my idea is to use a random nonce from the server and a nonce from the client and then hash all three of those things to generate our "large number".  So I have done the calculations and a 101 digit composite number will take around 1.5 hours to factor on a pretty top of the line ryzen processor.  As processors get even better this time frame will continue to go down of course.  I can also do the calc with a raspberry pi and see, I'm guessing it should complete in a few days.

edit: turns out takes 12.75 days on a raspberry pi 2.  Not horrible but ya.
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
May 25, 2020, 12:23:48 PM
#4
Normal computers cannot factor extremely large prime numbers in a reasonable amount of time.

Factoring extremely large prime numbers is quite trivial.

Factoring extremely large composite numbers on the other hand...

Whoops, yes I meant factoring composite numbers in my above post. It must have slipped through my head. There's almost no work that needs to be done to prime factor an already prime number.
legendary
Activity: 983
Merit: 1091
May 25, 2020, 11:35:05 AM
#3
Normal computers cannot factor extremely large prime numbers in a reasonable amount of time.

Factoring extremely large prime numbers is quite trivial.

Factoring extremely large composite numbers on the other hand...
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
May 25, 2020, 04:11:55 AM
#2
It is a little hard to give a summary, but basically we need to generate a truly random number (which is the hardest part) of sufficient length (over 100 digits so GNFS is used) and allow a person to prime factor it to verify they did work.  The task is easy enough for them to complete on one computer in a reasonable time frame.

Normal computers cannot factor extremely large prime numbers in a reasonable amount of time. If your goal is to make another kind of consensus algorithm then it needs to be feasible to perform on all the nodes.
member
Activity: 322
Merit: 54
Consensus is Constitution
May 24, 2020, 09:21:17 PM
#1
Proof of individual work is proving you did computational work to an external party.  Currently right now in Bitcoin only one person can prove his work at a time.  Proof of Individual work would allow all computers to prove their own work in a reasonable timeframe.  Here is a way to do that while also blocking gpu/asic/fpga speed up for the most part:

https://web.archive.org/web/20200525010535/https://www.naturehacker.org/2020/05/proof-of-individual-work-poiw.html

It is a little hard to give a summary, but basically we need to generate a truly random number (which is the hardest part) of sufficient length (over 100 digits so GNFS is used) and allow a person to prime factor it to verify they did work.  The task is easy enough for them to complete on one computer in a reasonable time frame.

It is basically a CAPTCHA alternative but uses machine work instead of human work.  So ya... Don't like captcha's? maybe this will replace them for many uses Wink.

Let me know what you think, I think the use cases are huge and will be world changing.
Jump to: