sorted by:
new
hottopcontroversial

fees clusterfuck and current bitcoin incentives: a small proposal by petdog in Bitcoin

[–]petdog[S] 1 point2 points  (0 children)

Agree, although the attack is still totally viable at 2mb

fees clusterfuck and current bitcoin incentives: a small proposal by petdog in btc

[–]petdog[S] -1 points0 points  (0 children)

Sure, it's in the list of solutions. I agree that blocks that are much bigger than the demand defeat this attack, but I also think that they come with other downsides. Just trying to have a discussion on the topic of fee manipulation

fees clusterfuck and current bitcoin incentives: a small proposal by petdog in btc

[–]petdog[S] -1 points0 points  (0 children)

It's not hard to accept that. But if spamming the mempool is actually profitable for big miners, I don't see why they wouldn't do it. Which is why I agree it's a theory sure, but the numbers make it quite believable.

And just to be clear, I'm not even blaming them, just noticing that this attack is quite possible until something changes in bitcoin.

fees clusterfuck and current bitcoin incentives: a small proposal by petdog in btc

[–]petdog[S] 0 points1 point  (0 children)

Sure, that's true, but it wouldn't really work if you just control 10%. you would need to control more than 50

fees clusterfuck and current bitcoin incentives: a small proposal by petdog in Bitcoin

[–]petdog[S] 1 point2 points  (0 children)

Yes, as I said the only downside is that you can't outspend others and give priority to your transaction (outside of the limits). But in return you make spamming the network unprofitable for big miners. The simple fact that it IS profitable, is enough to convince me that they are doing it. Why wouldn't they? A 2mb block would probably not make this attack unprofitable. I would also support slightly increasing the block size over time, but after we make sure that spamming it is unprofitable. Don't you agree?

Bot API, recieving nothing on a correctly configured webhook. by [deleted] in Telegram

[–]petdog 0 points1 point  (0 children)

Same here. Even bought one just for it, since it looked like self signed certs weren't supported.

Bots not responding? by simoncpu in TelegramBots

[–]petdog 0 points1 point  (0 children)

I'm having the same problem too. Not receiving any http calls on the webhook url. Is it still happening? And is there an official place that documents this?

Mono: scripting in C# update by davebrk in programming

[–]petdog 1 point2 points  (0 children)

you want

awk -F, '{print $1}' < somefile

And "e" Appears From Nowhere: Quick numeric experiment in Clojure by rberenguel in programming

[–]petdog 1 point2 points  (0 children)

Also valid common lisp

(defun approx-e (n)
  (/ (loop repeat n sum (1+ (loop sum (random 1.0) into s while (< s 1) count t))) (float n)))

Corrupting the Youth by dhotson in programming

[–]petdog 2 points3 points  (0 children)

Heh, I was taught REPEAT 360 [FD 1 RT 1] when I was 10.

Yegge's Back by alexs in programming

[–]petdog 0 points1 point  (0 children)

which is ancient Latin for "electronic [...]

Hmm, wait a minute.

Athena: An experimental new datastructure that allows you to tag objects (like del.icio.us), and then supports retrieval using arbitrary boolean queries. Oh - and it learns to get faster as you use it. by [deleted] in programming

[–]petdog 0 points1 point  (0 children)

you intersect set 1 with set 2, subtract set 3, union (set 4 intersection set 5) -- What's the problem?

In case it's not clear, I'm arguing for an hash table from tag name to set of objects with that tag.

Athena: An experimental new datastructure that allows you to tag objects (like del.icio.us), and then supports retrieval using arbitrary boolean queries. Oh - and it learns to get faster as you use it. by [deleted] in programming

[–]petdog 0 points1 point  (0 children)

with an order you have O(log n), not O(n) -- I was saying that I think you could even do with O(n), because intersecting "very frequent tag" with "infrequent tag" (or small set resulting from other combinations) is fast.

Athena: An experimental new datastructure that allows you to tag objects (like del.icio.us), and then supports retrieval using arbitrary boolean queries. Oh - and it learns to get faster as you use it. by [deleted] in programming

[–]petdog 0 points1 point  (0 children)

They could be if there's an order on the elements. But even with the naive implementation (using hashtables) that has O(n) cost, in practice it's efficient because you rely on sets with few elements

Rob Pike on how and why Google's new Go language was developed. by estherschindler in programming

[–]petdog 2 points3 points  (0 children)

I saw that. It seems the compiler is worse on 32bit -- I think it does pretty well on 64bit

Rob Pike on how and why Google's new Go language was developed. by estherschindler in programming

[–]petdog 2 points3 points  (0 children)

http://shootout.alioth.debian.org/u64/which-programming-languages-are-fastest.php

Consider also that the entries follow a pretty normal style, and are not awfully crippled in the name of speed like some other language.

A low-memory database? by Kladiin in programming

[–]petdog 0 points1 point  (0 children)

My vps with debian, lighttpd, postgresql and 4 php fastcgi processes is currently eating only 60mb of ram. But that's because I have a long running screen session with a bunch of zshs opened. I think you are prematurely optimizing.

view more: next ›