must replay it


there’s not enough mad father on my blog

Henry: *is sadistic and violent. shows affection through obedience towards avatar. Makes horrible puns. Yells about how he loves killing 24/7. 

Me: I love him. I miss him. Must replay Awakening. 

Zero: *is sadistic and has a sad backstory. sweet towards the avatar. smooth talker. canon bisexual. tall, tan and handsome*

Me: He’s okay

Brain???….?Why…?do you do this to me??How does the like work?


Day 17 - Favourite antagonist.

As you see, I’m torn between the Sith Triumvirate from Star Wars: KotOR 2 and the Sea of Death from Wadanohara. Both of these sets of villains are fascinating and delightfully twisted, and enjoyable and all I can do is shout out loud: PLAY THOSE GAMES, PEOPLE, SO I DON’T SPOIL YOU ANYTHING!…

…Wait, I think I’ve just spoiled one thing. Or two.
*runs away and hides*
Ultimate Blockchain Compression w/ trust-free lite node

Alan Reiner on 2012-06-19T17:33:31Z:I hope that someone else here would chime in on the issue raised in the thread, about using a tree-structure that has multiple valid configurations for the same set of unspent-TxOuts. If you use any binary tree, you must replay the entire history of insertions and deletions in the correct order to get the tree structure and correct root. Along those lines, using something like a red-black tree, while theoretically well-known, could be subject to implementation errors.One implementation of a red-black tree may do the rebalancing differently, and still work for it’s intended purpose in the majority of applications where it doesn’t matter. One app developer updates their RB tree code which updated the RB-tree optimizations/rebalancing, and now a significant portion of the network can’t agree on the correct root. Not only would that be disruptive, it would be a disaster to track down.If we were to use a raw trie structure, then we’d have all the above issues solved: a trie has the same configuration no matter how elements are inserted or deleted, and accesses to elements in the tree are constant time – O(1). There is no such thing as an unbalanced trie.But overall space-efficiency is an issue.A PATRICIA tree/trie would be ideal, in my mind, as it also has a completely deterministic structure, and is an order-of-magnitude more space-efficient. Insert, delete and query times are still O(1).However, it is not a trivial implementation. I have occasionally looked for implementations, but not found any that were satisfactory.So, I don’t have a good all-around solution, within my own stated constraints. But perhaps I’m being too demanding of this solution.-AlanOn 06/19/2012 12:46 PM, Andrew Miller wrote: Peter Todd wrote: >> My solution was to simply state that vertexes that happened to cause the >> tree to be unbalanced would be discarded, and set the depth of inbalance >> such that this would be extremely unlikely to happen by accident. I’d >> rather see someone come up with something better though. > Here is a simpler solution. (most of this message repeats the content > of my reply to the forum) > > Suppose we were talking about a binary search tree, rather than a > Merkle tree. It’s important to balance a binary search tree, so that > the worst-case maximum length from the root to a leaf is bounded by > O(log N). AVL trees were the original algorithm to do this, Red-Black > trees are also popular, and there are many similar methods. All > involve storing some form of ‘balancing metadata’ at each node. In a > RedBlack tree, this is a single bit (red or black). Every operation on > these trees, including search, inserting, deleting, and rebalancing, > requires a worst-case effort of O(log N). > > Any (acyclic) recursive data structure can be Merkle-ized, simply by > adding a hash of the child node alongside each link/pointer. This way, > you can verify the data for each node very naturally, as you traverse > the structure. > > In fact, as long as a lite-client knows the O(1) root hash, the rest > of the storage burden can be delegated to an untrusted helper server. > Suppose a lite-client wants to insert and rebalance its tree. This > requires accessing at most O(log N) nodes. The client can request only > the data relevant to these nodes, and it knows the hash for each chunk > of data in advance of accessing it. After computing the updated root > hash, the client can even discard the data it processed. > > This technique has been well discussed in the academic literature, > e.g. [1,2], although since I am not aware of any existing > implementation, I made my own, intended as an explanatory aid: > > > > [1] Certificate Revocation and Update > Naor and Nissim. 1998 > > > [2] A General Model for Authenticated Data Structures > Martel, Nuckolls, Devanbu, Michael Gertz, Kwong, Stubblebine. 2004 > > >> Andrew Miller > > —————————————————————————— > Live Security Virtual Conference > Exclusive live event will cover all the ways today’s security and > threat landscape has changed and how IT managers can respond. Discussions > will include endpoint security, mobile security and the latest in malware > threats. > _______________________________________________ > Bitcoin-development mailing list > Bitcoin-development at > via /r/bitcoin_dev


REPOST FROM @actioncamsau:
“Thanks to @shotoverjetnz for such a fun day today. The original and the best. If you’re ever in Queenstown this experience is a must. Footage shot on RePlay XD Prime X #shotoverjet #shotover #queenstown #newzealand #replayxd #primex #actioncamera #jetboat @replayxd”


I cried myself to sleep last night and I woke up this morning w my cheeks and pillow still wet, I must have replayed th scene in my head over and over again even in my sleep. I’ve been lying down in my bed th whole day today, and I just wish that it’ll stop hurting in time. That these tears will stop flowing, that this ache will stop, that my heart will stop breaking. Because it hurts, it hurts and I don’t know how to be okay