I have been solving Project Euler problems. Many of those problems required a big num library. I created my own and have been using it. But the problem is that, it is rather simple and also performance is not good. So any of you guys happen to know a good big num library?? I already had a look at GMP library, but it quite scared me (Never downloaded it since I'm scared of linux/unix type libraries. Never ever built one.) And plus, I only needed the binaries and couldn't find it.
Geez... why don't they just give the binaries. That would make the life of most of my kind a lot easier.
They do it for the love of it. They don't do it because they want to make life easy for your kind, whatever that is. Writing the code is fun. Banging out a binary for every possible end-user's system is not. It's also less reliable than having the end-user build it on said target machine, where it will be as compatible as can be.
It also provides a barrier to entry that makes their lives easier later when people come back to ask how to use the library.
Maybe only slightly on topic, but how about simply giving some pointers on how to make your own somewhat-efficient BigNum class? I'm also quite interested in the matter (also because of Project Euler, which I used to do some time ago).