Shadders

Nobody

[Shadders @shadders333]

@jadwahab Happens with signed integers twice as fast.

[Shadders @shadders333]

@digitalnaut @TurkeyChop @andyrowe @sinotrinity @iang_fc The first 3 almost certainly know nothing. The last probably does know some stuff the rest of us don't but it's irrelevant to the question.

[Shadders @shadders333]

@Arthur_van_Pelt AVP is Satoshi...

[Shadders @shadders333]

@cregmaxwell @_1BSV Go away...

[Shadders @shadders333]

@_1BSV I think you should go away and leave me in peace. I have no interest in anyone with BSV in their username anymore. If you're still advocating for it you don't understand what happened or why it's forever poisoned.

[Shadders @shadders333]

@is_not_satoshi @deggen @Bitcoin_Beyond @ProjectBabbage @scryptplatform @connolly_dan Lol. The only reasonable answer I can offer is that Cyrille Albrecht is in charge.

[Shadders @shadders333]

@JesterNovares @Gigapik @Rob_GCC Nonsense

[Shadders @shadders333]

There is nothing ok about this.

[non aesthetic things @PicturesFoIder]

TikTok chefs need to be banned from cooking

[Shadders @shadders333]

@RunDeathIsNear @timecoiner @scryptplatform @ProjectBabbage Yes this is correct. you not only need every tx in block but the entire utxo set that was valid for the previous block.

[Shadders @shadders333]

It is wrong, blatantly. He's trying to redefine what binary search trees are. Merkle trees are not searchable.

If you stick the nodes of a merkle tree into a key-value database that DB possbily uses a binary search tree internally, if not some other kind of index. But any searching would have to use this externally and it can't provide a proof of existence or non-existence to anyone who doesn't trust the DB.

[Shadders @shadders333]

I have little to say to say with this bunch of morons. Overlays is concept that existed (under different names) long before BSV existed. David Case did more damage to BSV that almost anyone through his utter inability to understand how it works and how to get transactions onto the network. His whingeing and blaming (supported by Kurt) resulted in the replacement of the people that were actually competent with the people who had no fucking clue but used the buzzwords BA wanted to hear. The technical state of BSV right now is entirely the result of this pair of muppets. So you guys make a judgement based on their results.

[Shadders @shadders333]

I have little to say to say with this bunch of morons. Overlays is concept that existed (under different names) long before BSV existed. David Case did more damage to BSV that almost anyone through his utter inability to understand how it works and how to get transactions onto the network. His whingeing and blaming (supported by Kurt) resulted in the replacement of the people that were actually competent with the people who had no fucking clue but used the buzzwords BA wanted to hear. The technical state of BSV right now is entirely the result of this pair of muppets. So you guys make a judgement based on their results.

[Shadders @shadders333]

@bitsko_xt @PeterScottMorg1 @mbs_ctt Jake is an IT guy who was supposed to write the documentation for original Teranode but I ended up having to rewrite half of it myself because he couldn't come to grips with fairly simple architectural concepts. AFAIK the new Teranode team kicked him out...

[Shadders @shadders333]

@AussieDaz81 You're almost as revolting as Craig. Into the dickhead bucket you go...

[Shadders @shadders333]

@AussieDaz81 Why would I need that? It's well known. If you can read what I just said and still defend Craig then you are barely human.

[Shadders @shadders333]

@bitsko_xt @PeterScottMorg1 @mbs_ctt Jake is an IT guy who was supposed to write the documentation for original Teranode but I ended up having to rewrite half of it myself because he couldn't come to grips with fairly simple architectural concepts. AFAIK the new Teranode team kicked him out...

[Shadders @shadders333]

I missed what he said about binary search tree in the trial. But a Merkle tree most certainly isn't one and CTOR has nothing really to do with that.

CTOR makes it a bit harder to scale with Merkle tree, but works very nicely with Merklix trees. Which do in fact behave like binary search tree's. This mean if you take entry you can work out exactly where it SHOULD be in the tree if it exists, and if it doesn't you have a proof of absence (or if you know it was there before a proof of spentness) which can be encoded with pretty much the same efficiency as an SPV proof. This is a powerful feature that Bitcoin does not have, to achieve the same thing with a merkle tree based system you have run a full-node and have the UTXO set. AFAIK @deadalnix has implemented this in eCash, or at least plans to.

[Shadders @shadders333]

@Optilon1 @RunDeathIsNear @elonmusk Not as far as I know. It predates it I think. But even if it does, it's trivial to remove.