Pages:
Author

Topic: using Shannon's information to measure proof-of-work - page 2. (Read 3843 times)

legendary
Activity: 2940
Merit: 1090
Okay, how about re-phrasing it by saying that the prior certainty is doubled?

Before the nurse flashed the card, you were 50% certain it was whichever it turned out later to be.

After the nurse flashed the card, you were 2 * 50 = 100 % certain it was whichever it turned out to be.

-MarkM-
legendary
Activity: 3431
Merit: 1233
Quote
“It rained in Oxford every day this week”  or “It rained in the Sahara desert every day this week” - both remove 100% of receiver's prior uncertainty. What do I miss?

No, because the amount of information is not the same for both sentences, as rain in Sahara is much more of an unlikely event as rain in Oxford.
I'm not discussing the amount of information, but if a bit of information is removing 50% or 100% of receiver's uncertainty. If you've learned about the rain in Sahara that doesn't make you less uncertain about the rain in Oxford!

Same confusion goes here:

Quote
He can’t see any details, so a nurse has agreed to hold up a pink card if it is a girl, blue for a boy. How much information is conveyed when, say, the nurse flourishes the pink card to the delighted father? The answer is one bit -- the prior uncertainty is halved.
My answer is different. My answer is one bit -- the prior uncertainty is removed entirely, because pink card means girl. Unless, I don't understand what does 'flourish' mean in this context?
legendary
Activity: 1288
Merit: 1080
I don't suppose you ever read Richard Dawkins' article The Information Challenge, in which he honors Shannon and provides a great layman's explanation of information as an economic commodity and the relevance of redundancy.

I don't understand this conclusion:
Quote
Shannon’s unit of information is the bit, short for “binary digit”. One bit is defined as the amount of information needed to halve the receiver’s prior uncertainty...
Why is bit defined to remove only 50% of receiver's prior uncertainty? A bit should remove 100% of receiver's prior uncertainty! It is either '1' or '0'. There is no 1/2 binary digit?!

In Shannon's meaning, one bit is an amount, it is not '1' or '0'.  It is one bit.  It halves the uncertainty because if you add one bit, you divide the probability by 2, by definition.
 
Quote
“It rained in Oxford every day this week”  or “It rained in the Sahara desert every day this week” - both remove 100% of receiver's prior uncertainty. What do I miss?

No, because the amount of information is not the same for both sentences, as rain in Sahara is much more of an unlikely event as rain in Oxford.
legendary
Activity: 3431
Merit: 1233
I don't suppose you ever read Richard Dawkins' article The Information Challenge, in which he honors Shannon and provides a great layman's explanation of information as an economic commodity and the relevance of redundancy.

I don't understand this conclusion:
Quote
Shannon’s unit of information is the bit, short for “binary digit”. One bit is defined as the amount of information needed to halve the receiver’s prior uncertainty...
Why is bit defined to remove only 50% of receiver's prior uncertainty? A bit should remove 100% of receiver's prior uncertainty! It is either '1' or '0'. There is no 1/2 binary digit?!

“It rained in Oxford every day this week”  or “It rained in the Sahara desert every day this week” - both remove 100% of receiver's prior uncertainty. What do I miss?
newbie
Activity: 34
Merit: 0
Where's the distributed timestamp server in bash?  I want to see that.  And you should add it to the effort of the guys that are doing bitcoin cli tools:

http://forum.bitcoin.org/index.php?topic=2461.0
legendary
Activity: 1288
Merit: 1080
Well done ol' chap. I hope somebody will take note of this. It sounds like an elegant alternative. I don't suppose you ever read Richard Dawkins' article The Information Challenge, in which he honors Shannon and provides a great layman's explanation of information as an economic commodity and the relevance of redundancy. I particularly like the parallels it draws (in my mind at least), with energy and entropy. He comes tantalizingly close to venturing into this realm, but unfortunately forestalls it. Anyhow, I wish you well with this promising refinement and intuitively, I honestly do think you have a good development refinement to offer. Please, keep us informed.

Thanks for this reference.  I am a huge fan of Richard Dawkins and I will read the link you provided.  Your description of the subject makes it extremely relevant to this thread, as I realised that the cryptographic timestamp server I have implemented could be used as a currency.  I'll describe how later.  Anyway this would turn information, or time, into a currency.

Crazy stuff, really.

PS.  I'll put the code here as well, just in case:

$ xz < timestamp |xxd -p
fd377a585a000004e6d6b4460200210116000000742fe5a3e04f3f1c3b5d
00118842463df4186aa667af7a9fe191a5205b670958d0ded39d4a4e825c
dfc1110b577a6d0b1e64741032ccd8aa98ace6d7eb38181b1318f591e6ea
5a1ab8468666c061e0478c4749a12e2c4db3ccabc3ae041f58fb29a5b4fd
d74e5c2b81fca3676770810246e0bd2b2689cbfaef6451234ead354d983f
7ec9db6e65ceb2800a180c3674878c2400cf228bef78d69b8fa5bde53035
34e5756196704025897f202322783025df6b9e072f402fafa4450a19a000
b9acefc04c8747b155c14c8be1a1064f05dfb2d038ac1dd0260a8510079f
19334c3b2c2706f815d0fb4efb212b805450052bf0b620ed1a8fc0dd573b
e50edce9d8ac91c6de527dedc7c36b9f86e21178557c92b2dab4825802f3
c02faa9005df9bb723e26af9f37d4fa158556407071719254d49d552ded1
7b145ccbac33064dff680ac7d6b796e5d0c6aee86b8af81343c95695f2fc
bf5c62329e9dd46921c8688f8efc02a284355d10e63db8094902b934a2db
aa7cce51053101a18c097db99ab39bcf23369a56d1ba8c667e38998515d6
8aca6965923965acee90c72c36b4124fc386bc5c625f564abd850795b838
a690d2e159d580ed0b28cefef42f473f64f55c6156399cd2d7b3eb1bebc1
0105a16de999c2bfe8a7dbb12d690b634130028099fb6c446f6f40dcef3f
4c39006377d5e90a3037fc3dad2bdce5c8e611e5f73d5b56466fc67dbf87
e7fa6ac77785750b6089759803013734105714eeb6a5928fa50bbe77c9fb
69a426d947472d2d4a48efddb6fbf261dfd78c6f2fcdcc2aea3c125f3296
57b05295b2917be2446618d581337509069f332a35255132935b6ff04624
72f718564ee776edd758c791a63bf576ca4001de15e8eda5966bfe5e8c33
9c7ddb7d3e4cb184bcddd66e4520f15c8c8b6d8eb5505c83822aab2593a9
7578f4426a99fa67fadcbe54a0b571eccd6e5888cad97ba749ee6713f4d5
69f4bac4cbc09b2ef68148019e57be2931c052e8c83a4fa69818a4fc59fa
8346a0f33aaa22d20cb8cd2ec0ea400607a705a8ae9565a07f87d06a6d72
d0f21365b9450108394e6569a6772321d8fb3adb18891aaf2facb6fd573c
befc1533931da5ee11563eadf5df3622237e59d67ad2693933492a195195
ed7748fbe4f7dad6ef67b7e637d27348acd09480ff3470383a9ca2582dc8
afd412f6e260c9588f366a7c09acdf322533a75680c6bc37a90a66aa2947
b671191c84b42024bfb2c1dbf323daa46776150394c771c8086733db4e6a
ddeee2eb07a415641b51261cade9670577b71cf7511aea2d314ae9b94c5b
49100c2d636a24ec0e2ed936d258407da45bf4ed563274f366e39dd8adc0
6ad4c68a6f59d5e45fe81d95b94830beaf11785edc663eef77a3e623c44f
6a3e798bcbf090a08752b5e015e622f799002e9915009321c69cd7d10983
e1e4f086d2700235067fbd62ba0aacaeefc65959460ae434dd56b61127b5
09982edd10ac7ce3cefdced1e8bc0776ea996f1dd0fa6a628ccf41dfc32c
0793a6bee1d1a7493e18265b527acfd4a7c4770f3fbb5d98bd26b0610da4
8a4da085309784ef7fadea1ed736df0e79ed28da5019ffda92c49a43227d
df509af8f2487541b40f20f0329cc98a89a679d1de4a93466f7ed4a7ba03
37258524d2b8f787b143266812b226322c35669db56a280f358b15e980da
78e811bd70b9dc50870ad2c53ea7bd98ccd246d2d663f70262a1c8349fbc
ff36afdcf2121eadc8fa9184aa73de3588461d27d4c94cf510486c577ded
e143b3dcdd41c0ab3923a8b41a878f99cf3c0c1706da126f29db44988888
071034d755b596caf3f4e907aee74cb6de818f48b63be457c2518c821913
5eb47ed5c3732da94a8b74971ddf7927dc962c181a293d2611f516d36c14
9fb41c677df2da3055d0e135464a1c91f1adfde8042cba3db4b50048f42c
c7b6e36d5fd3610ba1bb4941b0fdfc546df6ce3727cb2327723c66872795
1475ec7c5a507b3dd24c04ac410f95b6c9bc0929f36d9ddd63f4240f0a8a
9869e33c03d8c15e07552b2331ebcf45f95d1844eea6ba0905e0bc5cad85
b65624f5e8415a94b5a3afbabc67bdd5d50a5daae50d5df789c148352904
13812db9596bec7e7adba703bcdaaa8f8f46cdef880f9142ff728ba65121
cb5e8f50d39a9dda2604f8a7f2b968e5b9e9854f82b752a9b2fcf4bf2087
5e2d5369fe8f19cb75aaa2b7d726b1a56057c428899a231841ad938908de
da79b6966282ce9d1fbad64f65ef2396eda5bc0f26917632b974719a4f59
9701d4864ead06b611e9520d2603b26fb2da3781e2bd910597ae690fb469
9f836284a95958ea7381102359bc4e3a43cd4a075783345c83389579f8df
2b374a3b79748a35cedbfb07d3bd1fc6463e271f11b89b2cd1d3f322ce54
f8d325962f1a26aadac0ea3810b9e59c267ba8355e94aa1efb8a9bd0f4d9
09c96bf350b55e9228fbd48a45ff6a17c613fc77c238abaafca3d7d09baf
5966bb7ace3578ff9d45f14c071e8be0269e2f62faf459520897ea389633
4e17387bae1d84f62a49e98c4896d1bb090db81036e4c55e01cd5f6cff8e
4f0fe201278695868e6f0cc3481fa1508349954dcf913f0be22f154f7147
d5a367cace0f63a4b3718fd7f770cec8625110c2e49603103838075fe0df
d491e32f75d0068384d2abd21424cce7d07d8ccd368b68bd001394cd6f5c
894dd7450d358a65a74bb56664c81a1b4df8897aef8179800bb2d741beb7
55c5d164568fa057f921af1d3f9b49a9aa8e659cf2c7fc110ceebdb85d75
226ddf0a0735037a59ff35ef77214950cdbefafb770b04be3a26f8cf6d2a
bb485a16f0c777c8967f6a3f8e6f42f77bc3545182fb285ba66548d6fc79
f1f49af490b97ebc183c30219b82ebfbbf0876e53b71155db178f2891b32
38147263435c00b4d2b776ef764e7f7154ab15269fb97fdb0e50f2b7a64c
1b90e2d5794f4d6dbcf90df8df5cad6bc36f47ec7b981d148a42faf1e1a0
bf952a62102ad8e4c7885b28bea5beb83c17039bf6356b7fd5cd381f622c
614ac4686e28391e9d07cc85df5e469963539a4a2f7de5352c33cdcaf9e2
06da02694e1acf8358bb530d237612a5c16bd9c46f7cbb7489c351db019d
947aef3c72eb8d60941668a4207a8f70a21e464f411b8f794a6a01e1280d
9cae83e85a2fc70abe9fab70fd9d686c81c3b1faf5693344ee7ca128342a
b18c9498734cced62514918163d85aee35b7b5ec93d7a075742150200d4a
47583b08c771682575a2d987846d6f0df4fa64345b2e01c95b58697939ed
9b3aefcefd343abe568eae2b4af826b40e7bed097028d9e0b8963121244e
b297de941409d1efd7e9cae2b547dc30c52fd7327698f8e0cfe7396c7461
4269d4a5c147ea22fff4a8b904112df7ff90f97e76aa0e66d4b3bba9dacd
be394e8f34405862b4a5416d8f8ddaab626bc405e12d96f89ac77413932e
378f710382613ac39956a4044c2c0b3c9693825d01a5e7e6fac225c8ebff
97e9106d78f735906c026e92907e8d2999b28c5d1a44db853c975238bd2a
29c1f889d2920a1b74279d54260c918c335037282088d1f2f461c2b52470
7a82f32e202ec38040dce45e4effeda07c6970147470046b21e1cbadb4fd
26e41ae4b324880d8ca5f238d33bc9bb9f04fc49dcc6f70eb3fbaa2f54bc
7ac4f5eaa3d24b461c33a339c4f2a4d2abb27fec2a991cc06168aa710044
c153ee090bee3ddf79ad15966d294db3230ebe8e94f631cd2396233c5dfd
af80a9b8a73a30f015acca6ec143397142b1f685092dcff083f37435797c
2092cc70d0dee9c6b5e4a82a9540a1c0f30dbc26a8e177c2cc1d8cdf8898
469a50ce6dcd3258f71b6467827ef58cd1169647e989fbd637d9cc83c0e6
9f22b39922067cda32a4d814e96b7cd65fc91129358e2137c5a9929a6a72
0391c31c9873f62bb3e7253412dab79717a925b0938b8702d160a099ef5e
ae5a9e9d33212233f92c160f59890bf893adf940b9f9713ea1bb82e6ed89
7e27ff36ae4ce4c515b72fa4d62a3fbd947da933edc2d1546c10ccffdf7b
ab3ea366dbcc1906c9677cc6ceee38e7f7f1c52c42ffe2b86da30ca295a2
d787f09203f185e00bcff5decc6872f795e478cd86f12165005921f6424b
797a678a6f0257c84933932108155bcf4c7fa2b6fe34709ce74499e0d632
e71db62b8236d840642f0e864b332a1cbb901661cf55aa8fe6c0b21850a7
0d7790b46f5117529355146bd4e6214c5be45fa02c932e804e2a647bcbc1
3ca3c0946acb0720d006f41c69690f2fdecec8a467f8844bf07853495e3e
2206fc633c74be3bacfd02558f7aa974deb6593acab1a92302fabff1d853
92bca15e18e8a0829b2d85159a0b3e25dcdf818d2f1202202453f48ea1f0
265a593fb9f2020fedbedb2f6de151ca70aaba942ea935208a8d1a508da5
ab7e024e45f5c752c0a603da0d0c6c37f218eed13803bc952e051de6f47f
b21ef70d1ad55e185ab197eaa579bf5ab8f7f2874414da3ed4fedf3438e0
f1c8af49d22d7fa781d9455b2d575e48c4f2c4f8d8fea1f8fbf941bbdcce
00f48041f84cad91bdcca8385ff375ab4b503ac5266327bccccca7066f61
23852517953920df6466e12b2bc39af2ef1f307615df5e8dd089583ec631
2e1484be7d4777662f542b63124600f33ff25ec9d8d8b62ae4e435ca7335
3b03928983ea082494402435aeb86a9243ef258e0b517c4af5612a8abf29
04d840ed08888d6e4fe49fcd034c06fb24b8db17dfbf3f2b24b53bde8189
738318ee1ce48a1669138ed95cc000b701d92b676b62a7c3f1115cb103a9
996292569388621982a96a607d7de04f006fa2ae761e5685c2008955a6af
85cb443b55c1856bbac3bdd6d9b0509902af9ceae4c9d8c5d93bf12420af
cf72e2d5654a48aa90ec032c8c08832dd212949931cafaae66114c62d281
3fd1b1ac5660bbd7bb8c310dda9e10f3597f4b469800b4da7c9e70646285
6558dafddb5083b953578985b34489ca5e1928df8626f249af80ccaa5281
b6eceb7c1fd13aed16698852a31db6ff064f4c7d882d1457e05868b3e880
432d1d1637c2a6325dedcd6a2edba41b66d4786568f5bea20d306ddcd469
20a22271594dbfa3262c547c15fd63455bcfa16f4049cb39aed63d03f31c
efc0afe16c994228896bf7c1eff84f0baba0d122a2b70436172d7198a9fc
dd9dd14769191652da452242ef4d3a30483986d8a9cfdd94577b5656e0b6
6acb5e8b9103815940b3276e816c2a327f2f6b82204a1a18b935eaf7bd33
c01ea381a0a83fb1f71c808a07d993728938e219866611c5ade5d3d63c3c
98f55c0fd995626fc9f4ee980f014065c2f10334cb0879dce0c2da8ddf8f
6c84df4bcd62c8d8db21dd770ea32fa9743bc71852c7443040e932471f9d
1f0772fc9eb2e942e95b423b55cb0b6f09ec292916073cb6aa8869b1573a
fe4da08722fefe536f1c5259ae576cbff0ee0690553c2be9cecfac1ae447
204b6e1f8298ab251ee19af24aa3827a84920d7f50099663c8e376de4825
c3c0ff291cdb34235cb8fd6c39f8c0169c37ae53167b8dad53edc3ce3947
c3aab9ee8b2e2797e9c3b45ffb93e42a04c70b8be0f35073c5e9e1966e0b
6560cf2f327af80958837d434d06a1956bcb1ae1bfec6cc9598dc2dbb610
d47a1658c01ca0c0365599429a2129f32af01a3f57924ff9771fafaa0fcf
3278f0f6afb9cab8bb8fd4f0b6cd7a6ce7b80f3d2329bde53c11513db73a
92e83188c1bb56beca59f515e4adeb446cb9181a2239cd83f5a8258c21f4
c1a54ca2eb40b6cca2ca93f4933323eeb5fd8f723da219b0894a734c261c
8cfe9586d7fa70da71da2a173bde3f9250066ac4318ae6ad4ca2f3c144db
657cf75bf766b162ae54522f0b2fa42813472cd1141868333197406a6c05
6ef25d490405b46578c20471100f2c290c1990845f7c71f264c575b97c63
7b424f42e2fdd984439d097a26c2ea14143ba5acdb908c92077f2c489bb7
4b1782fce1341388f09c37eed61251069553a13194f864c3cb1a6ae876d5
822a0e128f7211ff9965790eea47b0349ea2f2ab11ab712fdf5ebb6f688b
6207e18cba921442e7be6ee534ebda7b9d0d8b8bd68152598c46e9931e23
9ee09fcf4a8e7edf47a4077867e00383ca8bc509397598116c073516642c
28e71e27ae2483f60d186d11cdaffb1adf6d3eb0d035dd190c04082a4c72
168a962dcb09cabac9e080122445b7baf8eb158e3508b9afa4bc3a530afe
82a5be2bb1e81b75cef5c227b72740bae4b4ed30836bf1156e1d0dffefbb
ac66a8dcdb244b356e268aa35cc6671d2dc7d6e3d3db297d458564a1f2fb
b293b9871a8bfccd65e5efa78f8cc171f4e2f96b7197bb9b5f3c8b828d29
396a9f4d3d307c2edf9338ff00f88ad68325d11741b952aabe65f05064f7
c2dd4f1ed1d817c3042c3dd7670cdb652ba45da6e17513a5b56e7d825c36
eb69fb29db23a02892e33f2444885e2393e14fd922f49c149f9db44bdaf0
1bb4d0b8ea37df5b2328b3302af8c684b209debc76021b3ea4cf40d1dbff
4c3adcc87a3a66b2cd6fb975c774f94aa853d8f7b1198dd24762554e5e9e
0470105159c68045fe82b3c8fc0518618e0749bd4b8612debec680f1fd24
6758ac2a8e957067cf9318ce67c94b4d76ac20027793a93162ebf146d8eb
bf7c0788354b70c383a60dcef55841a7ad3cb7a6163656267f64bdd2f6a5
2bfbfd872f0d73ccdc7174fad17c7cc7546a9585c9c8da273fd3ac5ed3b2
81bfcf5f14e6e296991b7d5c74e513fa975e7f99ad31eb7fa0415697ccb5
8da93b5b6a2b5e1a82a7c547e092be6c53b543c75e40b406536d9f3764cd
65244c75135ab3aa74fc5bb81c2f9293bae6ba91694cebea4431d254d10b
971ffba1bd9cc937b396134041ed28becf4d28c261a411f494cb8f9a6eed
e49c701fd88fb86aa3a6fff272e30f5ca60c193e5bc67eb9182de8b33f9c
4be8be929ba1a5e931f68d34188013ed9e6ca1d8ccf73bd5e16d220f1bb4
0364b7ca0a319611ba744c2775509f7d47c0c2f668cb9c591b440a678cb8
37db63b09ed426e0173936c282bff77555a19c9e46df3fa8f5c5a59baf65
f62f762fc269b9f94b3f09e50d5f2ab6d80356cfe17e85aae5ea7e6d0239
80bcf1f7be4f042bf4807b38fc7eb66be9a08dd728f32b0ee50ca8deee15
c927203d3eca2503b478926b48dcd2eba594263d9f730d15f9c18f5526bb
7e50e867aacb5b7a78c0ca75b0f746917d6663b435dcffad3bdb224f6d91
e3595eadc9f3d203414d3d0367e869d2321149813b0b69062ec5c936903f
b280770df06b3991708c477a5a74fe0f4d3566751ddc47c3b953d49d66e3
734662a822946007049df8168161aae3038216060dc7f16caefedde08a38
6d3d415fe9d91c67d576982d5acbb95604039e34a829783ecc49ac165579
d5b54db7b2367e0dd2ef565b3e083d0d5e8a015037eb0d1f905f16cfbc52
400c05dd1569d5ac0ee0d8459a64400ca0fcaea8f863c5ceb01756361824
4069cb98cf0f0a205ab40e9c8281a7f61fa7f28d13b188b462a0d33bbdf8
1259bce98e244d657e040cbdb878852eb81f4ce844c32ddefa4045031f66
2eff367621d1c43e26a26f7e9f371e51504ab4f6075b3684b1c9fdff1626
2a455c2ecff94f15131f26261752197959f8649efda7cd38d705c9af64e8
1de650296aee803a55d59926bec513cd02f8d69496b520e55c7ae3415764
d9cd42960deeffff7be53763f033f3198797580f195dba6075e8e36e3b1c
ec5c86efb88393d7b57aeefa738f584305b97f7aa5222621116c9fc29131
c034412aa590ba5edbb54da0faeac0d5304f54877e42b7c13a5eabaf3a15
51c3313dc658b1d570a1bc20ce3ab5ed7c13e6e2e9f5df83d0435cf437ad
45926821a31768515c1a5903a1e1d4377cf7be063b09a9294a68826dabe8
b168711290a4a8916a6f127b122578e90aeb202a049a7f90b7ad02bbafe9
d8944d2415001c1df70c8050cd0ab8095079975d44faf4487a847367cff7
0741fe9eb1755ac2fde288e6444cb2daed42ebb8f6bc704704da9540cf86
b246e3e3984ac827175448d437ff1d1a0d8c4aa92c4430eb0d8a48f89655
5f600d0fe60794787636b94a5098ca1fc285771832fce40a9df70d151822
9114281c7f3e55623b34bc568210505d7df9e884ab15592977064d65c403
4b2b61ac3da52d8476bd8baa17c618c4b92ddf4e748a2b07d41f47378f80
270e5b2974cd569771c92e9c79e7d2ba0cd13f95a7641d6018a29e90acfd
074e3a9c06ef2eafe36371420a14e10634f0f71be652f145bfbf84af7f30
82a3b6101631d3b6059011fc7790a0b37446f210e8ac8e71f428a3c1b33f
aafee0ebcc01c204260a2d64dafa627f10888ad2da9f554f01f181a407ce
fad0764dd9862731ad407c2d23b051dfa723f9ddd2f6ae42b2f9f9d75dc2
fd45a625d9dd40913563c6440d7cfdf2ac6fdf0e1aea59563eac9b8ce0ed
5df0c16bb43dec9546633c6dbe23e3e90459ffb3a769579574e38cadd362
eeaea905c3944ecc01370ac326d847f6e975cbeb6c36193d846cf3eab610
38f1ab1cd588947583a89f2814302575ad498d80a7a585616a54994cf0ae
6f4feb4075107cb6ec78be6f69cfa1c40806c656a79634ab1af07216080b
0bcb7c7e36502f3dca48987b5bfc51f0a4e458a1866830ade6c609b02fa1
470727628df5c3bdb4eea19c69609032c56484edb7374be3ed1bb3b340b5
7a7f16ff1a3dbeae499961199864c00dfd31036a2cbad77eaaa1dd11ea86
fdf41bc83b0601d88bd18b1d8d9a99799d03efa8e425823d3781eed2bd53
4178e602ba9cf8470f19c729063e76bcbe7b8d3e50333e602743ece0bc44
9c3989f47477e1c9ecb4971003250504e3ca25b54115d63dc66a9bc02c8f
7dc79fe318feb186f3196afb49b8eb303372e8c680292019ca67b2277d1a
6bfdd02cded6c48fb56cac86713c881f77f867f9fb29a51708ac8d08ad66
dcb41e985168ada36fc21260de0804da7d6760f8e3aa5f47a090763e8549
143b4494245add36e70e8c1cf1d7957871fa29104dae1a236e91fd246a82
d0e94d44ef5c045e047ba8b7d4eea1cc2f0b962837a0f39a74dd0aa02293
31aa9e172be6c85b1e12a695c5608ece5e9e1bebcd7753caa6231c7db84a
42e26751d2d12b7eea85a2076b186f4a1ee9d033c355358956ee9c48238a
758504527a8c76ae4180a25bc7b2f84f7215ed5c8e9f84be91c1b68d4426
eafcbe0e8326b0b370d965ca9ede450ddb4f373eca49279bd206e27cd1e1
1c65b9c6dc7d739c68675908a2c55779f05db3909ee4ebce174cd982b735
6ddf3831b5677c337f4499729eaaa15ab1c6874bfdd350c08b9d2cca236a
52c01cdeb564372437317e07d3e275004b5e5687997289a4df5a11377eec
d9c80a37922058d96476754bbcfb840c48bc1b209bd8cc389dc9f65682c7
f87a2c0fe303139c69e4e86b3941fb73a4f414c2baedd90f5e6dd5059764
d4df7c154fd0dd71c03aebdd0e6ef7f4becc7482ca207fb50cc67c90966f
ce3a813acda28f006f2ee28425fd1e6a7469aefef17d15e0835dd616a596
f78acd2fa8c8e70fe893b4d2612bba92697ccaaa676f0de231c5a156ee3d
0c9fd4442f3910e118666ebfd006212844abc19aae622005f273a680aafd
61aae7df7214725d2fbdb35f04b928c9491aca80ffad4a61d2041d07edc9
0750142dc97567f4628b557edcd3d4e92f3be9d8b1ecf88305f1d207b98b
05a9e1dd131c980ea459940625f5827c5d5a14576635b70a054a24462757
d4d361b8f866f09434f239bbaaf6469ca16e99eb3ff9b21540e126ed81fb
3d13f5c1be05e47c97101392be6a79f9948cc297eba11283c17b04585e87
a09f27dcacf7a61b0d3edf0b9db479b970c38ef101ee6e3beb6eece1dd51
ef4166aeed15c42fae09cf60387c2a2d2341cd2627898a63e613b0a57ca8
cc90565ac5e457f7790b033759069a57c0ff9b17e9c29bea36e04d96b7b9
cd09a7b9b68b5e1f71158a4a9bb25a3cb3e40b7fb014b8355ad1cbb91f68
525b7b94d047bbb84f2bbba780e2e592a3aa1a38b5afd18671aefc87b993
54852946f74073b0d2b3496951c2ba9e2957002f90cf250c6580d3c40987
8252b648d4ec8f99c735759a2b2034b62bd9de89e4de41fe27933d380000
cc1997d0b2ba9a120001d738c09e0100b041e4c5b1c467fb020000000004
595a
legendary
Activity: 1288
Merit: 1080
From main.h, here's how a block's work gets calculated:

    CBigNum GetBlockWork() const
    {
        CBigNum bnTarget;
        bnTarget.SetCompact(nBits);
        if (bnTarget <= 0)
            return 0;
        return (CBigNum(1)<<256) / (bnTarget+1);
    }


The total work done up to a certain block is the sum of the work of all previous blocks, down to the genesis block

Basically, the "work" the highest possible hash value divided by the maximum acceptable hash value at the block's difficulty.  As Pieter Wuille remarked, this is just the expected number of hashes you'd have to calculate before solving a block.  What you're suggesting calculating is -ln( 1 / "work" ) = ln( "work" ) and adding these up.  Pieter is right to point out that the original definition of total work estimates how much computational power has been invested to date into securing the block chain.  Your definition of total work would be appropriate only if it took a constant amount of calculation to get one an extra bit at the beginning of the hash to be zero.  But it doesn't take a constant amount of work, it takes twice as much work.

Here's a vivid example of what would go wrong.  Say I have 16 block chained together, A1->...->A16, each of which has "work" of 2, and additionally, three blocks X->Y->Z, each of "work" 16.  Under the original definition of aggregate work, the total work in A1->A16 is 32, while the total work in X->Z is 48. These two aggregate works are proportional to the amount of time it would take you to secure each block chain with a constant-speed miner.  Under your definition of work, A1->A16 would have aggregate work 16*ln(2) = 11.1, while X->Y->Z would have aggregate work 8.3, even though X->Y->Z took much longer to secure.

Thanks for your comment.  I'll read that later but it's too late to discourage me, as I have just finished writing a prototype:

http://s0.barwen.ch/~grondilu/cgi-bin/timestamp

Activity: -
Merit: -
From main.h, here's how a block's work gets calculated:

    CBigNum GetBlockWork() const
    {
        CBigNum bnTarget;
        bnTarget.SetCompact(nBits);
        if (bnTarget <= 0)
            return 0;
        return (CBigNum(1)<<256) / (bnTarget+1);
    }


The total work done up to a certain block is the sum of the work of all previous blocks, down to the genesis block

Basically, the "work" the highest possible hash value divided by the maximum acceptable hash value at the block's difficulty.  As Pieter Wuille remarked, this is just the expected number of hashes you'd have to calculate before solving a block.  What you're suggesting calculating is -ln( 1 / "work" ) = ln( "work" ) and adding these up.  Pieter is right to point out that the original definition of total work estimates how much computational power has been invested to date into securing the block chain.  Your definition of total work would be appropriate only if it took a constant amount of calculation to get one an extra bit at the beginning of the hash to be zero.  But it doesn't take a constant amount of work, it takes twice as much work.

Here's a vivid example of what would go wrong.  Say I have 16 block chained together, A1->...->A16, each of which has "work" of 2, and additionally, three blocks X->Y->Z, each of "work" 16.  Under the original definition of aggregate work, the total work in A1->A16 is 32, while the total work in X->Z is 48. These two aggregate works are proportional to the amount of time it would take you to secure each block chain with a constant-speed miner.  Under your definition of work, A1->A16 would have aggregate work 16*ln(2) = 11.1, while X->Y->Z would have aggregate work 8.3, even though X->Y->Z took much longer to secure.
bji
member
Activity: 112
Merit: 10
I was working on my catalaxia project and I was thinking very hard about how I could avoid using Satoshi's compicated algorith for adjusting difficulty.  Somehow I beleived there should be a more elegant, mathematically pure way to do this.

I didn't read deeply enough to understand every aspect of Satoshi's algorithm, but I thought the basic idea was to average the block generation time for the previous two weeks and then compute a difficulty which, given the same expected computational power, would have resulted in the target 10 minute average interval.  Basically, adjust the difficulty so that if it had been the difficulty over the prior two weeks, then everything else being equal, a block would have been produced on average once every 10 minutes.

It seems pretty straightforward and "elegant" to me already ...

Quote
I was troubled by the idea of mesuring the "strengh" of a block chain, and I must confess I never managed to understand exactly how Satoshi does it.  I wanted something much more simple.

I don't understand why you think the block difficulty measures the "strength" of the block chain, or even what "strength" means in this context.   Unless I am wrong (and I often am!), the only measure is how many blocks were produced over the past two weeks.  Individual blocks are not considered.  If it took 1 minute to generate 2015 blocks and then the next 1 block took 20159 minutes, there would be no adjustment to difficulty over the next two week period because exactly 2016 blocks had been generated in exactly 20160 minutes, which gives the perfect 10 minute average interval.  The contents of the blocks and the actual time taken to produce the hash for any given block don't matter, so from the difficulty adjustment algorithm's point of view, all blocks are the same, the only metric is the average over 2016 blocks of the time taken to generate the hash.

Quote
The idea now is to use this as a measure for the "weight" of a block.  Basically all we have to do is to divide 2^256 by the block hash, and take the natural logarithm.  The total information of the block chain is nothing but the sum of each information for each block.

The good news is that we won't have to start the block chain from scratch or whatever, as the longuest block chain currently almost certainly has the highest Shannon's information.

What would you use this "weight" for?  If it's for adjusting difficulty, I don't see how it's useful.

Quote
I think there are many advantages on this, such as simplicity and robustness.  There are also many interesting implications such as the possibility to make the information being a inside secondary currency inside the block chain, which could be used to trade between miners in order to avoid chain forks.  I'll explain later.

Please do, as this paragraph confuses me utterly.
legendary
Activity: 1288
Merit: 1080
I worked hard during two days but I finaly wrote a minimalist distributed timestamp server in bash!!!

Unfortunately I am once again in a cybercafé now so I can't publish it right now.   I'll do it tomorow, I promise.


Stay tuned as I think this is gonna be an MAJOR BREAKTHROUGH in crypto anarchism!
legendary
Activity: 1072
Merit: 1181
Bitcoin counts blocks are 'worth' as much as the statically expected number of hashes that have been performed to generate it. As far as I can see, that's the theoretically best criterion possible.
full member
Activity: 185
Merit: 121
Then I remembered my old lessons in physical statistics and information theory.   Then I thought about entropy and Shannon's information concept.

That Del Shannon guy sure was an underrated hero wasn't he?



Quote
Basically shannon's information is a way to measure unlikelyness of an event.  A bit like probability, but with additive properties.

OH! That Shannon. Now we are talking heroes of another order of magnitude (no offence Del, wherever you are  Cheesy)  Here he is:


How many people realize that in 'coining' the term (pardon the pun) 'bitcoin' Satoshi was actually acknowledging (perhaps inadvertantly) the father of information theory? The 'bit' being the unit of information that halves prior uncertainty of an unknown value. It's generally recognized that Shannon essentially defined the 'bit' if he didn't literally coin the term (again, pardon the pun). I don't understand programming all that well nor mathematics either for that matter, but I do love information theory, so Shannon is a legend in my eyes, in that he devised the mens to quantify redundancy. I don't know how Satoshi's algorithm does the weight calculation, but I assume it's some sort of Bayesian approach, heavy on recursive looping too I expect.

Quote
In probabilities, when two events e1 and e2 occurs in the same time, the probability of this to happen is the product of the probability:

P(e1 & e2) = P(e1) * P(e2)

Shannon wanted to have the same thing, but with additive property:

I(e1 & e2) = I(e1) + I(e2)

Obviously the solution was to use the logarithm function, so he came up with this formula:

I(e) = - ln ( P(e) )

And he called that "the information".  It's measured in bits if you divide by the natural logarithm of two, and it's quite a fascinating concept.

Fascinating indeed. Particularly for it's implications for entropy, but that's another story. BTW, even that explanation helped my mathematics understanding. I can see now, how the cumulative 'surprise value' of each bit, is derived from Shannon's Log function. Thanks for that.
 
Quote
The idea now is to use this as a measure for the "weight" of a block.  Basically all we have to do is to divide 2^256 by the block hash, and take the natural logarithm.  The total information of the block chain is nothing but the sum of each information for each block.

I can't wait till you write a verbose non-mathematical description for us non-mathematical types. It sounds like a very grass roots 'bottom up' approach, to avoid the need to calculate the weight by measuring it directly. But again, I don't know how it's ordinarily done in Satoshi's implementation. 

Quote
The good news is that we won't have to start the block chain from scratch or whatever, as the longuest block chain currently almost certainly has the highest Shannon's information.

I think there are many advantages on this, such as simplicity and robustness.  There are also many interesting implications such as the possibility to make the information being a inside secondary currency inside the block chain, which could be used to trade between miners in order to avoid chain forks.  I'll explain later.

I'll be looking forward to it.  Wink

Quote
There are many things to say about why I think this is a good idea, but right now I just wanted to tell it to you before someone else does, so I can claim the glory of being the first to have dropped it, in case it appears as great an idea as I think it is.

Well done ol' chap. I hope somebody will take note of this. It sounds like an elegant alternative. I don't suppose you ever read Richard Dawkins' article The Information Challenge, in which he honors Shannon and provides a great layman's explanation of information as an economic commodity and the relevance of redundancy. I particularly like the parallels it draws (in my mind at least), with energy and entropy. He comes tantalizingly close to venturing into this realm, but unfortunately forestalls it. Anyhow, I wish you well with this promising refinement and intuitively, I honestly do think you have a good development refinement to offer. Please, keep us informed.

full member
Activity: 126
Merit: 100
I can assure you that satoshi's method is a lot simpler.
legendary
Activity: 1288
Merit: 1080
Guys, I am so excited about this new idea of mine that I can't wait until tomorrow when I get my usal internet access to tell it to you.  So I'm writing this from a cybercafé.  I hope you'll enjoy.

I was working on my catalaxia project and I was thinking very hard about how I could avoid using Satoshi's compicated algorith for adjusting difficulty.  Somehow I beleived there should be a more elegant, mathematically pure way to do this.

I was troubled by the idea of mesuring the "strengh" of a block chain, and I must confess I never managed to understand exactly how Satoshi does it.  I wanted something much more simple.

Then I remembered my old lessons in physical statistics and information theory.   Then I thought about entropy and Shannon's information concept.

Basically shannon's information is a way to measure unlikelyness of an event.  A bit like probability, but with additive properties.

In probabilities, when two events e1 and e2 occurs in the same time, the probability of this to happen is the product of the probability:

P(e1 & e2) = P(e1) * P(e2)

Shannon wanted to have the same thing, but with additive property:

I(e1 & e2) = I(e1) + I(e2)

Obviously the solution was to use the logarithm function, so he came up with this formula:

I(e) = - ln ( P(e) )

And he called that "the information".  It's measured in bits if you divide by the natural logarithm of two, and it's quite a fascinating concept.

Ok, enough for the theory.

The idea now is to use this as a measure for the "weight" of a block.  Basically all we have to do is to divide 2^256 by the block hash, and take the natural logarithm.  The total information of the block chain is nothing but the sum of each information for each block.

The good news is that we won't have to start the block chain from scratch or whatever, as the longuest block chain currently almost certainly has the highest Shannon's information.

I think there are many advantages on this, such as simplicity and robustness.  There are also many interesting implications such as the possibility to make the information being a inside secondary currency inside the block chain, which could be used to trade between miners in order to avoid chain forks.  I'll explain later.

There are many things to say about why I think this is a good idea, but right now I just wanted to tell it to you before someone else does, so I can claim the glory of being the first to have dropped it, in case it appears as great an idea as I think it is.
Pages:
Jump to: