omra

13 年前議論

I don't think it's meant to play chess, it's just to show chess positions (see the example page: http://chessboardjs.com/examples).

It is in a similar vein to this: http://andrewphoy.github.io/chess-replayer/. (Which is more full-featured.)

omra

13 年前議論

Apple Corps v Apple Computer. Wikipedia: http://en.wikipedia.org/wiki/Apple_Corps_v_Apple_Computer

omra

13 年前議論

I expect it will still exist, after all, there is both AskUbuntu.SE and ubuntuforums.com. It might start seeing less activity though.

omra

13 年前議論

Check out the status reports to the Apache Board of Directors (http://stdcxx.apache.org/status/):

(05/11)

      No changes. Stdcxx continues to be dormant. There was a flurry of emails
      on the stdcxx-dev list suggesting continued interest from the same two
      parties (ARM and Sun) but no new work.

---

The Attic is where retired Apache projects go.

(02/2012)

      A vote to move stdcxx to the Attic failed. The majority of stdcxx
      contributors voted in favor of continuing to maintain the project.
      Several inactive committers stepped up to help with the project.

---

I do not think that this was a surprise. Regular status reports stopped completely after February 2012. It's also notable that Chris Bergström was proposed for the new chair position, see http://mail-archives.apache.org/mod_mbox/stdcxx-dev/201306.m...

omra

13 年前議論

https://github.com/joelthelion/autojump

(It's like a smart version of cd.)

omra

13 年前議論

I agree that an off-by-one error is not a huge deal in most cases, but cryptography is one of those places where you cannot get it wrong. The programmers, or a employee well-versed in cryptography, should have ran a Chi-Squared test immediately on the random data to make sure it was random. (That is the first thing I would try, and I only have a working knowledge of statistics and cryptography.)

Cryptography is unforgiving, and when your code could seriously endanger someone else, you have to be constantly vigilant.

omra

13 年前議論

The URL in the location bar seems to update with the steps you've done (here's one showing the first construction: http://www.sciencevsmagic.net/geo/#0A1.1L0.1A0.3L0.3L1). Undo/Redo can then give an animation like appearance.

omra

13 年前議論

No notable mathematician has considered one prime since the early 20th century (of course, I'm oversimplifying, see [1] for more information).

[1]: https://cs.uwaterloo.ca/journals/JIS/VOL15/Caldwell1/cald5.h...

omra

13 年前議論

BBC and Bloomberg also saying the same thing [0][1].

[0] http://www.bbc.co.uk/news/business-23150658 [1] http://www.mikebloomberg.com/index.cfm?objectid=A08875E3-C29...

omra

13 年前議論

Diminishing returns: The amount of mine-able bitcoins decreases overtime, as well as the amount of reward decreasing as the hashing power of the network increases. Assuming the price of Bitcoins does not increase accordingly, the amount of money gained will go down.

Bitcoin Collapse: If Bitcoins collapse, you now have a bunch of worthless miners. Compare this to a quick sell it and done.

God forbid you gain a significant amount of network control, because you have a problem. Miners will probably begin to reject your transactions for the sanity of the network, because you could double-spend, and virtually create infinite bitcoins.

Also, how is setting up a business like this trivial? I imagine that a huge part of it (initial investment, buying power, and maintaining all these devices) could be problematic, although I could be wrong.

omra

13 年前議論

I highly recommend reading the explanation on how this is significant, it goes into more depth about timing attacks:

http://cr.yp.to/antiforgery/cachetiming-20050414.pdf

omra

13 年前議論

And now if you want to depress yourself, tick the "Forecast" checkbox on the right.

omra

13 年前議論

Already posted a few hours ago: https://news.ycombinator.com/item?id=5845541

omra

13 年前議論

Another very interesting part of the article is the call for the decryption of the SMP source code:

http://blog.stephenwolfram.com/2013/06/there-was-a-time-befo...

omra

13 年前議論

Go does not have constant time string comparisons by default. The crypto/subtle package supplies constant time comparisons.

omra

13 年前議論

a) That solution is sometimes implanted. The problem is: its slow, very, very, slow. It is not nearly as fast as regular integer arithmetic. (Also, +, -, /, and * aren't called axioms.) Also, how do you handle things such as powers and exponentiation (especially non-integer arguments)?

b) Search up for "BigInt libraries". The problem is the same with the others, its slow. You still have to allocate memory and the operations aren't as fast. However, BigInt libraries are widely used when necessary.

omra

13 年前議論

[Slash/A](https://github.com/arturadib/slash-a) is specially designed for genetic programming / random generation. No matter how you piece together the instructions, it is still a valid program.

omra

13 年前議論

Sadly, some of the items are no longer available at inventables (e.g., https://www.inventables.com/technologies/magnetic-fluid or https://www.inventables.com/technologies/temperature-sensiti...).

omra

14 年前議論

Assuming the digits of pi are randomly distributed, any finite digit sequence can be found in pi.

The probability any sequence of length d is found in N digits of pi is 1 - 1/exp(N*0.1^d) (Poisson distribution for approximating the binomial). Then the limit as N approaches infinity is 1 for any finite d.

omra

14 年前議論

I hope that ICANN accepts a small amount of these. Isn't this the point of subdomains? Why can't ABC just use foo.abc.com (or foo.abc.go.com) instead of foo.abc? The new TLDs are confusing and I'm sure many people will just type in .com as well.

Then again, ICANN has nothing to lose by encouraging many applicants, they get an awful lot of money from the applications (about 357 million [1]). They may be non-profit, but they still need money to keep running.

  [1] http://www.name.com/blog/general/news-2/2012/06/icann-reveals-the-new-gtlds/

投稿

RFC 6921: Design Considerations for Faster-Than-Light (FTL) Communication

コメント