01:06:47 | c0rw1n: | c0rw1n is now known as c0rw|zZz |

01:11:06 | maaku: | jgarzik: did you request an official bip number, as per bip 1? |

01:13:25 | warren: | jgarzik: how long are you in SF? |

02:50:58 | bramc: | Hey everybody |

02:53:22 | merlincorey: | hai doctor bramcnick |

03:08:34 | kanzure: | merlincorey: not sure others will recognize that |

03:15:43 | bramc: | merlincorey, I don't get the reference |

03:21:25 | kanzure: | i'm also not sure it applies here, heh |

03:22:11 | merlincorey: | bramc: it's a simpson's reference |

03:22:27 | merlincorey: | kanzure: the simpsons (and futurama) writers are composed in large part of actual mathematicians |

03:22:39 | merlincorey: | kanzure: so in an oblique way, it does |

03:22:44 | kanzure: | yeah but i don't think bram has any malpractice insurance issues |

03:22:58 | merlincorey: | let's hope not |

03:23:03 | merlincorey: | but we don't have any way of knowing :P |

03:23:35 | bramc: | Of course not. I always make sure to perform surgery with sharp knives. |

04:08:48 | jgarzik: | warren, all week |

04:11:10 | warren: | jgarzik: when do you depart? I arrive June 22nd |

04:11:29 | jgarzik: | warren, June 27 |

04:12:29 | warren: | i'm in SF June 23rd - 25th, want to meet up? |

04:12:58 | bramc: | I'm in SF all the time |

04:14:48 | jgarzik: | warren, Possibly :) My week is full of meetings - Tentatively yes, but I have to prioritize NASA folks etc. |

04:16:03 | kanzure: | what has nasa ever done for us |

04:19:13 | warren: | NASA? |

04:19:25 | warren: | Bitcoin to the moon ... literally |

04:19:35 | warren: | really bad block propagation latency |

04:26:20 | jgarzik: | warren, Low Earth Orbit :) |

04:26:43 | jgarzik: | ...unless you know some customers who want to get to the moon... |

04:27:40 | PRab_: | PRab_ is now known as PRab |

04:29:26 | warren: | jgarzik: a 2 way peg sidechain might be better for mooncoin ... |

04:29:48 | jgarzik: | too much settlement latency |

04:29:59 | warren: | atomic swaps |

05:38:24 | bramc: | warren, Maybe we'll get those block propagation times long before then with a hard fork of the block size |

05:46:44 | CodeShark: | has anyone build zk-SNARKS over LWE or some other quantum-resistant scheme (not based in pair-based crypto)? |

05:53:09 | CodeShark: | nobody?!?! seriously? I'm disappointed |

05:53:55 | gmaxwell: | I think noise buildup problems would be a serious concern there, as the depth of the computation for pratical issues are quite deep. |

05:54:45 | gmaxwell: | other kinds of ZKP based on fiat shamir and linear codes should be quantum strong; but no really feasable ones have been constructed yet. |

05:55:43 | CodeShark: | couldn't the noise issues be handled at the cost of space or time complexity? |

05:58:18 | CodeShark: | doesn't fully homomorphic crypto imply zkp? |

05:58:38 | gmaxwell: | ZKP requires much less than ZKP. |

05:58:51 | CodeShark: | zkp does not require fully homomorphic crypto |

05:59:05 | gmaxwell: | er right. |

05:59:15 | gmaxwell: | I wasn't saying it couldn't be done, just that it may not be anywhere near as efficient as even the linear code based schemes. |

05:59:38 | gmaxwell: | Anyways, perhaps email Craig Gentry; since he's worked on all of these things. |

06:00:24 | CodeShark: | google search turns up a baseball player :p |

06:00:44 | CodeShark: | ok, I think I found the right guy now |

06:00:49 | CodeShark: | stanford? |

06:01:28 | CodeShark: | oh, no...berkeley |

06:02:20 | CodeShark: | will P != NP be proven in our lifetimes? and what the hell is wrong with our axioms? |

06:02:52 | gmaxwell: | (in particular, the SNARK stuff is based on his work, as was the breakthrough of slightly feasble FHE based on LWE.) |

06:03:02 | CodeShark: | computational complexity is at once one of the most useful mathematical theories AND one of the mathematical theories with the least ability to actually prove its main claims |

06:04:48 | CodeShark: | imagine archimedes sitting around and saying "we believe there's an infinite number of primes but we can't prove it" - I guess euclid's parallel postulate is a closer parallel |

06:04:58 | CodeShark: | (pun intended) |

06:05:43 | gmaxwell: | there are many unproven things which seem totally trivial. |

06:09:43 | CodeShark: | in this case it must have something to do with our axioms |

06:10:17 | CodeShark: | i.e. P != NP is independent of diagonalization methods |

06:10:37 | bramc: | CodeShark, There are the relativization, naturalization, and algebrization barriers to showing P!=NP, which combined together exclude almost all classes of approaches to the problem, although there's been some (comically limited, but still extraordinarily impressive) work which has gotten around them. There's a plausible approach which requires merely proving a generalization of a generalization of a generalization of th |

06:10:37 | bramc: | e riemann conjecture |

06:10:55 | CodeShark: | hah |

06:11:02 | CodeShark: | it all seems to come back to the riemann conjecture |

06:11:50 | gmaxwell: | there are zillions of things which imply P!=NP, e.g. existance of one way functions implies P!=NP. |

06:12:06 | bramc: | the riemann conjecture is directly related to the general problem of pseudorandomness, because it's equivalent to a statement about the error term in the formula for the approximate number of primes less than a given value |

06:13:13 | gmaxwell: | proof of any of the zillions of proven NP-complete problems is not in P would also prove P!=NP. |

06:13:26 | bramc: | CodeShark, Your guess that there's a deep issue along the lines of diagonalization not working is essentially correct. You can look up 'relativization computational complexity' and 'naturalization computational complexity' for more info |

06:14:12 | bramc: | gmaxwell, That... doesn't help |

06:14:34 | CodeShark: | so we're missing some basic axioms here...or perhaps the universe allows for a computational model where P = NP |

06:15:02 | gmaxwell: | There actually has been a lot of interesting progress in complexity theory on bounding approximations (which is often more pratically interesting than P/NP in any case) |

06:15:21 | bramc: | Adding axioms is unlikely to help, unless you add an axiom just saying P != NP, which is, uh, not useful. |

06:15:48 | CodeShark: | well, the point is that perhaps like the parallel postulate, we can formulate a fully self-consistent theory where P = NP |

06:16:41 | bramc: | CodeShark, Probably not, P vs. NP doesn't have the same kind of untouchable feel as the sorts of problems where those issues come up. |

06:17:37 | bramc: | Certainly not like the parallel postulate, p != np is either true or false in a much stricter sense than the parallel postulate. |

06:18:02 | CodeShark: | well, sorta - I would argue that to ancient geometers, the parallel postulate also seemed to be pretty strictly true or false |

06:18:35 | CodeShark: | of course, allowing it to be false forced us to change the definition of "straight" |

06:19:18 | bramc: | there's a deep philosophical distinction between 'independent' and 'true but unprovable' |

06:19:35 | CodeShark: | perhaps near black holes or near the big bang, P = NP or something :p |

06:20:45 | CodeShark: | our concepts of time and space fly out the window |

06:20:53 | bramc: | There has been some interesting work done on computational complexity around the surface of a black hole, but it doesn't relate to whether P!=NP, because it's a different computational model |

06:21:32 | bramc: | The more immediate and interesting question is the one of quantum complexity, which has a much more, ahem, complex relationship with classical complexity than popular writings indicate. |

06:22:23 | CodeShark: | but even quantum complexity suggests P != NP...with problems strictly contained in NP and strictly containing P |

06:22:27 | bramc: | In the meantime we have symmetric key primitives which are *probably* just fine, albeit rather inefficient compared with optimal constructions. |

06:22:49 | bramc: | Yeah, quantum computation doesn't speed up all that many things all that much. |

06:23:40 | CodeShark: | there's probably something fundamentally wrong with our notions of time and space as applied to complexity classes |

06:23:56 | CodeShark: | we know that the universe doesn't quite work that way |

06:24:21 | CodeShark: | turing machines and their kin use somewhat contrived notions of them |

06:24:36 | CodeShark: | which our theories in physics suggest otherwise |

06:24:55 | bramc: | turing machines and the like are a good representation of any 'reasonable' model of computation. Quantum mechanics is not a reasonable model of computation :-) |

06:25:03 | CodeShark: | lol |

06:25:15 | bramc: | We have no reason to think, for example, that the human brain pulls off any sort of quantum trickery to do its reasoning. |

06:25:24 | CodeShark: | well, some people do |

06:25:43 | CodeShark: | reminds me of conversations with Penrose :p |

06:26:40 | CodeShark: | the superposition principle does seem to apply to our conscious perception in some subtle ways...like our ability to imagine something in many different states at once |

06:27:11 | CodeShark: | our ability to hypothesize...to consider potential outcomes that haven't yet manifested |

06:27:53 | bramc: | *sigh* superposition has nothing to do with consciousness, and penrose's theories of the brain are, sadly, strictly wackadoodle. |

06:28:31 | bramc: | Considering potential outcomes doesn't require quantum anything. Chess programs do it quite well. |

06:29:12 | CodeShark: | the ability to abstract...to remove the concrete...and replace it with variables that can take on entire ranges |

06:29:27 | CodeShark: | the more advanced we get in math, the more we do this |

06:29:41 | bramc: | Again, this is not even vaguely quantum stuff |

06:29:47 | CodeShark: | we make statements that apply to entire infinite sets at once |

06:30:36 | bramc: | If you're really interested in the computer scientist view of quantum mechanics, you can look through the 'quantum computing since democritus' stuff by scott aaronson. |

06:30:40 | CodeShark: | all we need are negative probabilities and we're there :p |

06:31:56 | bramc: | quantum mechanics is basically complex probabilities whose magnitude is less than 1 |

06:32:24 | CodeShark: | well, the interesting thing is how those probabilities interfere |

06:33:10 | CodeShark: | from continuous waves we get discrete events... |

06:35:03 | CodeShark: | "complex probabilities whose magnitude is less than 1" is the kind of phrase you get when one's math formalisms are way far ahead of one's sensory intuition :p |

06:36:57 | CodeShark: | in a sense, the development of the language behind complex numbers is a little unfortunate because opportunities were missed to make it a little more intuitive |

06:37:25 | CodeShark: | i.e. the spinor/rotor language...or geometric algebra |

06:39:24 | CodeShark: | then you end up with things like pauli matrices - which are perfectly legit mathematical formalisms...but bear very little connection to our sensory experience |

06:43:11 | CodeShark: | It's worthwhile to read through Hestenes' reformulations to try to regain some geometric insight |

06:43:31 | bramc: | This conversation has strayed far enough off topic |

06:43:47 | moa: | CodeShark: geometric algebra is the biz |

06:43:56 | CodeShark: | indeed, moa :) |

06:44:09 | moa: | i'll PM you |

06:54:26 | the_last: | wat |

07:05:12 | CodeShark: | (σ1σ2)2 = (σ2σ3)2 = (σ3σ1)2 = (σ1σ2σ3)2 = −1 |

07:11:17 | ggreer: | I really wish there was OCR for math symbols. I'm more likely to recognize a random hanzi than a random math symbol :/ |

07:11:42 | ggreer: | basically I want pleco for math |

08:05:16 | rajaniemi.freenode.net: | topic is: This channel is not about short-term Bitcoin development | http://bitcoin.ninja/ | This channel is logged. | For logs and more information, visit http://bitcoin.ninja |

08:05:16 | rajaniemi.freenode.net: | Users on #bitcoin-wizards: andy-logbot jaekwon dEBRUYNE nullbyte wallet42 adam3us mm_1 grandmaster b_lumenkraft davi mjerr waxwing theymos Xh1pher frankenmint jmcn_ PRab TheSeven Tebbo nessence Dr-G2 epscy face alferz d1ggy moa www1 huseby lnovy richardus ggreer afdudley GreenIsMyPepper espes SwedFTP hearn DougieBot5000 jgarzik arubi superobserver GAit tromp_ sparetire_ go1111111 SubCreative bosma akrmn Quanttek shesek Relos dc17523be3 melvster Tiraspol sparetire |

08:05:16 | rajaniemi.freenode.net: | Users on #bitcoin-wizards: _biO_ spinza bliljerk_ dgenr8 pollux-bts isis kinlo nephyrin EasyAt phantomcircuit tromp hashtag_ badmofo Cory elastoma gmaxwell LeMiner cryptowest_ helo hulkhogan_ MrTratta triazo lmatteis mengine the_last koshii goregrind _whitelogger mkarrer heath dasource grubles kyuupichan Logicwax catlasshrugged_ Starduster_ Adlai yoleaux [d__d] ebfull luny stqism ThinThread jouke cluckj Emcy Madars sl01 jrayhawk OneFixt c0rw|zZz tucenaber sneak |

08:05:16 | rajaniemi.freenode.net: | Users on #bitcoin-wizards: sadoshi andytoshi MoALTz maaku jcorgan sundance bsm117532 CodeShark copumpkin K1773R ttttemp gwillen lclc STRML akstunt600 kanzure midnightmagic @Luke-Jr Iriez fenn gnusha bedeho wizkid057 mariorz mikolalysenko Meeh Krellan ajweiss so cornusammonis s1w poggy HM dansmith_btc catcow btcdrak Xzibit17 prosodyContext vonzipper adams__ yrashk CryptoGoon mappum artifexd Muis runeks kumavis platinuum jbenet yorick amiller fluffypony livegnik |

08:05:16 | rajaniemi.freenode.net: | Users on #bitcoin-wizards: mountaingoat a5m0 Apocalyptic wiz wumpus Alanius iddo forrestv Taek null_radix smooth thrasher` otoburb Keefe weex pigeons sturles rasengan berndj harrow qawap davout jessepollak veox comboy stevenroose gavinandresen nickler harrigan scoria brand0 larraboj nsh jonasschnelli leakypat cfields coryfields azariah warptangent TD-Linux crescend1 Zouppen binaryatrocity BananaLotus optimator Eliel mr_burdell throughnothing_ Fistful_of_Coins Jaamg |

08:05:16 | rajaniemi.freenode.net: | Users on #bitcoin-wizards: xabbix dignork petertodd guruvan nanotube warren sdaftuar eric roasbeef morcos merlincorey [ace] jaromil Graet indolering ryan-c gribble d9b4bef9 starsoccer BrainOverfl0w @ChanServ AdrianG Anduck BlueMatt |

09:02:06 | the_last: | http://www.reddit.com/r/Bitcoin/comments/3agk61/ultimate_bitcoin_stress_test_monday_june_22nd/ |

09:02:07 | the_last: | UH OH |

09:06:52 | phantomcircuit: | the_last, https://www.reddit.com/r/Bitcoin/comments/3ahl43/i_believe_we_have_our_first_scammer_organizing_a/ |

09:07:11 | phantomcircuit: | the_last, all the more reason not to increase the blocksize |

09:08:00 | the_last: | phantomcircuit: wow, that's interesting, pretty clever |

09:08:26 | phantomcircuit: | also i can add to that |

09:08:33 | phantomcircuit: | it's totally 100% a scam |

09:09:20 | the_last: | i wonder if lots of other people will short |

09:09:25 | the_last: | because of the hype around this event |

09:09:32 | the_last: | and cause the market to drop anyway |

09:10:52 | gmaxwell: | it's a little goofy though, esp in that this has nothing to do with blocksize. regardless of the blocksize anyone can generate transactions and fill up whatever and delay transactions that aren't paying more. |

09:11:55 | the_last: | yeah, but the hivemind is easily persuaded and manipulated when it comes to things surrounding the block size |

09:16:21 | phantomcircuit: | the_last, it appears to be much less the hive mind and much more a series of paid shills |

09:16:54 | the_last: | paid by who? |

09:17:14 | phantomcircuit: | an excellent question |

09:18:42 | gmaxwell: | there has been some funded attack on bitcoin lately, e.g. that full page ad that had a thread on reddit recently. |

09:19:41 | the_last: | full page ad? I must have missed that |

09:21:14 | gmaxwell: | reddit thread: http://www.reddit.com/r/Bitcoin/comments/39qx01/negative_full_page_bitcoin_ad_in_large_swedish/ |

09:22:03 | the_last: | ah yep |

09:22:19 | the_last: | that doesn't surprise me |

10:30:19 | Xh1pher: | sweden... enough said, a land where u pay 80% taxes and woman stand above the law, sure they dont like btc |

10:33:13 | gmaxwell: | gmaxwell has left #bitcoin-wizards |

11:09:22 | bosma: | bosma is now known as bosnia |

11:09:33 | bosnia: | bosnia is now known as bosma |

11:18:08 | leakypat: | It was funny watching the 21inc dude presenting Bitcoin to Goldman Sachs |

11:18:52 | leakypat: | He was like, "there's a patch being worked out there to scale it to billions of transactions" |

11:19:05 | leakypat: | I mean, it's true... |

11:19:22 | leakypat: | They way he said patch though made it sound like it was a one line code change |

11:19:37 | leakypat: | Instead of a whole new network layer |

11:19:57 | leakypat: | I need to learn to talk like that |

11:22:53 | nsh: | -- |

11:22:54 | nsh: | Mr. Burns: Smithers, I've designed a new plane! I call it the Spruce Moose, and it will carry 200 passengers from New York's Idlewild Airport to the Belgian Congo in 17 minutes! |

11:22:54 | nsh: | Smithers: That's quite a nice model, sir. |

11:22:54 | nsh: | Mr. Burns: Model? |

11:22:54 | nsh: | -- |

11:28:35 | leakypat: | nsh: lol |

11:49:03 | bosma: | bosma is now known as bosnia |

11:49:09 | bosnia: | bosnia is now known as bosma |

12:18:17 | kanzure: | bitcoin-development mailing list is moving to bitcoin-dev at https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev |

12:19:59 | nsh: | +1 |

13:57:57 | LeMiner2: | LeMiner2 is now known as LeMiner |

16:29:21 | dgenr8: | ;;seen Relos |

16:29:21 | gribble: | Relos was last seen in #bitcoin-wizards 1 week, 0 days, 22 hours, 28 minutes, and 50 seconds ago: |

16:29:46 | kanzure: | hahaha |

16:30:08 | kanzure: | 09:27 < Relos> and why have I been banned earlier today from #bitcoin-wizards.... I have never even said a word there |

17:14:44 | www1: | www1 is now known as wiwjwy |

18:35:38 | bramc: | An interesting wrinkle to the extension which allows a mutability fix: Once it's adopted there's a fairly trivial DOS of miners who don't support it |

18:36:09 | bramc: | The extension here being one which allows a transaction to refer to an input by the transaction rather than its signature |

18:37:27 | bramc: | You make a transaction of that type, then you connect to all miners directly and start giving them a double-spend of the old transaction every generation. Other miners will recognize it as a double-spend and treat their mining results as invalid |

18:38:45 | kanzure: | they would have treated other miners' results as invalid since the others did not accept the other blocks that were mined with the patch |

18:39:02 | kanzure: | oh, you are probably talking about a different patch/idea, whoops |

18:45:55 | bramc: | kanzure, Not sure what patch you're talking about or which one you think I'm talking about |

18:46:43 | bramc: | I'm referring to one where the malleability fix is opt-in. It unfortunately leads to a situation where older miners are mistaken about which utxos have and have not been spent |

18:47:24 | bramc: | And you can't add that information in because the whole point is that it isn't there. |

18:48:54 | bramc: | This isn't a reason not to add the extension - it's very important functionality - but it's something to keep in mind. |

18:49:43 | kanzure: | yes, i was definitely not talking about that; my bad. |

18:55:07 | Mably_: | Mably_ is now known as Mably |

19:11:11 | bramc: | A thought on inflation: http://krugman.blogs.nytimes.com/2015/06/20/voters-always-want-a-strong-currency/ |

19:24:06 | zooko: | I refuse to read anything by Paul Krugman. |

19:24:39 | akrmn: | Man no one gives me a clear answer on whether subchains can be used for scaling. Sipa didn't answer my last reply on bitcointalk. Jeff Garzik kinda said it can work in the far future (not clear). Peter Todd suggested that tree chains can work but no one still gave a solid proposal and UTXO commitments are already well established. Yes I read about UTXO commitments and P2Pool but I don't think either will help as much as subchains (P2P isn't helping rig |

19:25:27 | akrmn: | And now sipa is writing about hard forks on the mailing list and hiding out on #sidechain-dev (so I won't bother him). Why don't we consider all options first? |

19:26:15 | kinlo: | akrmn: I think I can explain why subchains wont work for scaling |

19:26:47 | akrmn: | For UTXO commitments, what gives incentive to nodes to relay the merkle trees branches? Miners have an incentive to relay blocks because that's how the fees they made are recognized, but no incentive for merkle trees of UTXOs. |

19:26:52 | kinlo: | every client is now fully validating every block, in order to make sure nobody is cheating the system |

19:27:46 | akrmn: | Well the point is that you can validate just the transactions you're interested in and the whole system is still sustainable |

19:28:12 | kinlo: | you will need someone to validate all to ensure the next block is valid |

19:28:33 | kinlo: | if you just look at a few chains, how do you produce new blocks? |

19:28:52 | akrmn: | Well if you haven't read my post: https://bitcointalk.org/index.php?topic=1083345.0 |

19:28:53 | kinlo: | are you going to trust that the other chains are valid too when creating a new block? |

19:29:03 | akrmn: | Its a tree of chains |

19:29:07 | akrmn: | each of 1 MB |

19:29:36 | akrmn: | wallets can generate addresses so that they are constrained to one branch of that tree |

19:30:02 | akrmn: | so you can monitor your wallet fully or someone else's (like your government representative) |

19:30:20 | akrmn: | (be sure of the UTXOs and their coin value) |

19:30:21 | kinlo: | ok but how do you validate the blockchain? |

19:30:42 | kinlo: | you can just look at your chain, but then you can't mine, coz you don't know the entire tree |

19:30:45 | akrmn: | there are multiple blockchains (synchronized) |

19:31:02 | kinlo: | and those all need to be validated |

19:31:27 | kinlo: | the question is, if you mine a new block, do you require all chains to be valid inside that tree? |

19:31:37 | akrmn: | Yes mining is decentralized because each chain requires a unique hashing problem to solve |

19:32:04 | kinlo: | in that case, you're dividing the entire hashing power into multiple chains |

19:32:42 | kinlo: | and the idea is that the blockchain is unbreakable because there is nobody with more computer power then what is used for the blockchain |

19:33:05 | kinlo: | if we divide our hashingpower into 10, 2-3 chains can be stopped being mined to get the power to attack on another subchain |

19:33:28 | akrmn: | Miners will have an incentive to validate the children chains of the chain theyre mining on, since they will commit the hashes of their headers into special transactions that give them outputs that are only valid on the children chains (but the deeper you go with the children the less important it gets) |

19:33:58 | kinlo: | so you are dividing themain blockchain into multiple seperatly mined chains? |

19:34:25 | akrmn: | ok wait that may be one disadvantage that I have to think about |

19:35:30 | kinlo: | it's basically the reason why all alt-coins are not safe, the hashing power is divided and people can quickly switch tree to perform an attack |

19:35:34 | akrmn: | It needs to be done so that mining on a child chain helps the hash power of all parent chains... |

19:35:42 | akrmn: | but not the other way around |

19:35:49 | kinlo: | but that can only happen if you validate all chains |

19:36:17 | kinlo: | which means you're not solving the problem, you're adding an extra layer and the combined blocksize - which needs to be validated - remains the same |

19:36:49 | kinlo: | do you know how merged mining works? |

19:36:58 | akrmn: | Yes I know merged mining |

19:36:59 | kinlo: | that partially solves that problem already |

19:37:08 | kinlo: | however, the 2 chains are completly seperated |

19:37:19 | akrmn: | but I dont want miners on the parent chain to be able to solve blocks on the child chains |

19:37:22 | kinlo: | and the only way it would work is if every miner would be mining every chain at the same time |

19:37:26 | akrmn: | that would result in decentralization |

19:37:30 | akrmn: | centralization |

19:38:06 | kinlo: | akrmn: the whole bitcoin consensus model works on the fact that everyone works on one tree, making it "centralized" in a way |

19:38:52 | kinlo: | akrmn: did that answer your question ? :) |

19:39:57 | akrmn: | Well the child chains are still part of the entire network, so putting hash power into them without putting it directly into the top chain isn't so bad |

19:40:43 | akrmn: | If too little hashpower exists on the main chain, then difficulty will drop and there will be incentive for more miners to mine on it to get the higher fees associated with the top chain |

19:40:56 | akrmn: | so no I see everything still fine |

19:41:51 | kinlo: | it's in the current situation already common for 3-4 pools to have 50+% of the chains |

19:42:11 | kinlo: | if you have 10 chains, you will still have 3-4 pools having 50% of each chain |

19:42:41 | akrmn: | no because in the lower chains, there will be lower difficulty, so you don't need to be so powerful to mine on it |

19:42:54 | akrmn: | the point of pools is to lower the variance |

19:42:55 | kinlo: | I'm talkign about relative power |

19:43:19 | kinlo: | let's say at this moment, the top pool has 25% |

19:43:39 | akrmn: | and also there will be smaller pools and they will have to be different pools. It will be difficult for the miners on the top chain to also mine all the other chains |

19:43:46 | kinlo: | and manages to keep 25% overall when we upgrade to 10 chains |

19:44:23 | kinlo: | and lets say the difficulty of each subchain is equal, as you stated yourself, the network would balance out to that by itself |

19:45:05 | kinlo: | then that particular pool would be able to pauze mining on 9 pools, and would have mining power equal to 10 times 25% of the subchain it is attacking |

19:45:34 | kinlo: | so it would just blow away the competition on that chain and dominate it |

19:45:51 | kinlo: | do you follow? |

19:46:00 | akrmn: | kind of |

19:46:51 | kinlo: | ehm, it would pauze mining on 9 subchains |

19:48:11 | akrmn: | Attacks can always happen still so I don't see how doing it my way would be worse |

19:48:35 | akrmn: | people using the subchains know that security is a little lower on the subchain |

19:51:40 | kinlo: | ok but 10 times 1 mb is not enough for the future. let's say we go to 100 chains or 1000 |

19:51:43 | kinlo: | do the math then |

19:52:05 | kinlo: | then the issues with your logic become more clear (altough theoretically they stay exactly the same) |

19:54:19 | akrmn: | I'm not disregarding your criticisms (some are good points). But scaling is not a problem since you can just keep adding more child chains, and there is an incentive to keep the child chains safe, since miners are getting paid fees by the child chain miners to include their block header hashes in the block. |

19:55:05 | kinlo: | how do you validate the child chains? |

19:56:29 | akrmn: | Well miners can validate the direct children chains of the chain they are working on. They can do more if they want, but the deeper you go the less important. And the child chain miners will take care of validating the grandchildren anyway. |

19:57:17 | kinlo: | I don't understand how a parent is validating their children? |

19:57:43 | akrmn: | By downloading the blocks and making sure the transactions are following the rules |

19:58:05 | kinlo: | but a child chain is only valid when all their child chains are valid, no? |

19:58:21 | akrmn: | Yes, but in case of conflict, the parent decides |

19:58:31 | akrmn: | is the rule I put |

19:58:44 | kinlo: | so the parent needs to evaluate all child and granchildren etc |

19:58:46 | akrmn: | so there can be mistakes, but it becomes less important the deeper you go |

19:59:02 | kinlo: | so you basically end up with one big chain, let's just keep the bitcoin model then |

19:59:10 | akrmn: | just the child is enough since the child will validate the grandchildren |

19:59:32 | kinlo: | how does the child validate the grandchildren? |

19:59:43 | akrmn: | just like the parent validates the children |

19:59:47 | kinlo: | by deciding which block is the tip on that granchild? |

20:00:35 | akrmn: | if the bitcoin model means centralization, I don't want that. I want to try to make things more decentralized that's all. |

20:01:09 | kinlo: | ok but how does a child validates their grandchildren/ |

20:01:28 | akrmn: | just by getting the blocks of the (direct grandchildren) |

20:01:43 | akrmn: | chain of level n validates chains of level n+1 |

20:01:51 | akrmn: | and more if it wants |