User Tools

Site Tools


guides:farming:recomp

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
guides:farming:recomp [2023/04/18 18:51] – error corrected 172.71.94.6guides:farming:recomp [2023/05/05 22:29] (current) – Formatted the table header vleesbanaan
Line 6: Line 6:
   * **proof recomputations**: performing a (partial) proof lookup   * **proof recomputations**: performing a (partial) proof lookup
  
-== notefor simplicity we use k32 and plotfilter 512==+== NoteFor simplicitywe use plot size k32 and plot filter 512==
  
  
 ==== Quality Recomputations ==== ==== Quality Recomputations ====
-For every signage point (9216 per day), a k32 has a 1/512 chance to pass the plotfilter. When passing the filter, a quality string lookup needs to be performed. In the case of compressed plots, this means part of the plot must now be recomputed.  + 
-That means that for every signage point, 1/512 = 0.001953125 expected recomputations per k32.+There are 9216 signage points a day. For every signage point, a k32 plot has a 1/512 chance to pass the plot filter. When passing the filter, a quality string lookup needs to be performed. In the case of compressed plots, parts of the plot must be recomputed to complete the quality lookup.  
 + 
 +Thus, for every signage point, we expect 1/512 = 0.001953125 recomputations per k32.
  
  
 ==== Proof Recomputations ==== ==== Proof Recomputations ====
-When pooling, every k32 is expected to produce 10 point per day on average.  
-[[poolinfo:dashboard:pool-diff|Reiterating]] that at  
-  * difficulty 1, that is 10 (partial) proofs per day of 1 point, 
-  * difficulty 10, that is 1 (partial) proof per day of 10 points, 
-  * difficulty 100, that is 0.1 (partial) proofs per day of 100 points,  
-  * etc. 
  
-That means that with **difficulty 1** for every signage point, 10/9216 = 0.001085069444 expected recomputations per k32.+When pooling, every k32 is expected to produce 10 points per day on average. Let's look at some examples [[poolinfo:dashboard:pool-diff|at various pool difficulties]]. A single k32, at: 
 + 
 +  * pool difficulty 1, is expected to submit 10 (partial) proofs per day, worth 1 point each; 
 +  * pool difficulty 10, is expected to submit 1 (partial) proof per day, worth 10 points; 
 +  * pool difficulty 100, is expected to submit 0.1 (partial) proofs per day, worth 100 points. 
 + 
 +In the case of compressed plots, parts of the plot must be recomputed for a (partial) proof. 
 + 
 +Thus, with pool **difficulty 1**, we expect 10 recomputations per 9216 signage points. That'10/9216 = 0.001085069444 expected recomputations per k32. 
  
 ==== Pool vs Solo ==== ==== Pool vs Solo ====
  
-Putting those together, we see that +Putting quality and proof recomputations together, we see that<sup>1</sup>: 
-  * solo farmer is doing 1/512 recomputations per signage point + 
-  * a poolfarmer with **difficulty 1** is doing 1/512 + 10/9216 recomputations per signage point+  * solo farmer is doing 1/512 recomputations per signage point. 
 +  * A pool farmer at pool **difficulty 1** is doing 1/512 + 10/9216 recomputations per signage point.
  
-That means that the poolfarmer incurs an overhead of ~56% at plotfilter 512. And half of that at plotfilter 216 +That means that the pool farmer is faced with an overhead of ~56% at plot filter 512. And half of that at plot filter 256. This overhead decreases linearly with pool difficulty, so let's have a look at the effect at varying pool difficulties:
-This overhead decreases linearly with pool difficulty, so that+
  
-^  Pool Difficulty  ^  Overhead  ^^ +^  Pool Difficulty ^  Overhead                         ^^ 
-                ^plotfilter 512 ^ plotfilter 256 ^ +                 plot filter 512 ^ plot filter 256 ^ 
-| 1 | 56% | 28% |  +   1 | 56%  | 28%   |  
-| 5 | 11% | 6%  |  +   5 | 11%  | 6%    |  
-|10 | 6%  | 3%  |  +  10 | 6%   | 3%    |  
-|50 | 1%  | 0,5%| +  50 | 1%   | 0.5%  
-|100|0,5% | 0,3%| + 100 | 0.5% | 0.3%  
-|500|0,1% | 0,06%|  + 500 | 0.1% | 0.06% |  
-== *for simplicity we ignore recomputations for actual blocks ==+== [1] For simplicitywe ignore recomputations for actual blocks==
  
 The implication of this is that the computational overhead due to pooling could be said to be directly independent of farm size, although indirectly large farmers generally have a higher pool difficulty.  The implication of this is that the computational overhead due to pooling could be said to be directly independent of farm size, although indirectly large farmers generally have a higher pool difficulty. 
Line 47: Line 52:
 <WRAP center round info 90% em> <WRAP center round info 90% em>
 <color #001e37> <color #001e37>
-TIP: When farming compressed plots in a pool, consider increasing your difficulty a bit. e.g. from 3 minutes per partial, to 6 minutes per partial. See https://xchdata.io/diffcalc to choose your optimal difficulty. +TIP: When farming compressed plots in a pool, consider increasing your difficulty a bit. e.g. from 3 minutes per partial, to 6 minutes per partial (if you manually set a fixed difficulty) or to 8 minutes per partial if you use our pool-side automatic difficulty adjustment. See https://xchdata.io/diffcalc to choose your optimal difficulty. 
 </color> </color>
 </WRAP> </WRAP>
guides/farming/recomp.1681843889.txt.gz · Last modified: 2023/04/18 18:51 by 172.71.94.6

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki