It includes everything including the heavily optimized back-end conversion code. Because buffering has been removed, the new classes will be harder to use casually in a performant manner. Super PI is popular in the overclocking community, both as a benchmark to test the performance of these systems and as a stress test to check that they are still functioning correctly. Credibility concerns Why NumberCruncher Arrow.

It can compute pi and other constants more than a trillion digits. It is the only program that is multi-threaded and accessible to the multi-core system. It is also a stress-testing application for testing the hardware.The competitive nature of achieving the best Super PI calculation times led to fraudulent Super PI results, reporting calculation times faster than normal. Attempts to counter the fraudulent results resulted in a modified version of Super PI, with a checksum to validate the results.

Therefore, wPrime has been developed to support multiple threaded calculations to be run at the same time so one can test stability on multi-core machines. Other multithreaded programs include: Hyper PI, IntelBurnTest, Prime95, Montecarlo superPI, OCCT or y-cruncher. Last but not least, while SuperPi is unable to calculate more than 32 million digits, and Alexander J. Yee & Shigeru Kondo were able to set a record of 10 Trillion 50 Digits of Pi using y-cruncher under a 2 x Intel Xeon X5680 3.33В GHz - (12 physical cores, 24 hyperthreaded) computer on Octo Super PI is much slower than these other programs, and utilizes inferior algorithms to them. Centralize bills of.y-cruncher Program.

New version is out! This one has benchmark validation and anti-cheat protection!!!Wish I had saved all the results posted in this thread. SuperPi requires upwards of 20 minutes.A Core i7 4770K 4.0 GHz can do 1,000,000,000 digits in 206 seconds.The same Core i7 equipped with 32GB ram and 8 hard drives can do 100 billion digits in 23 hours.A dual Xeon E5-2690W 3.5 GHz with 256GB ram and 22 hard drives can do 1 trillion digits in 83 hours.Likewise, y-cruncher is capable of setting world records for the most digits ever computed:Anyways. (as opposed to running the same computation multiple times)Because y-cruncher is multi-threaded and uses up-to-date processor features, it can reach speeds and sizes that are unobtainable with older apps:A stock AMD FX-8350 can do 32M digits in 9.737 seconds using y-cruncher. Backward-compatibility is maintained for older processors.The benchmark is also available for 64-bit Linux.Pi Benchmark Results: Can you do any better?Y-cruncher is (yet another) program that computes Pi to millions of digits.Y-cruncher is multi-threaded and is capable of using multiple cores.Y-cruncher is able to use modern instruction sets such as SSE and AVX.And unlike HyperPi, y-cruncher uses multiple threads to make a single computation faster. () (official thread)Now with support for XOP and AVX2. Y-cruncher: Multi-Threaded Pi-Benchmark for Multi-Core Systems.

But it can only have 2 modes: 1 thread, or threads >= cores (first power of 2 that's >= # of cores).This is because of the way the program uses more threads than selected, so 'extra cores' will skew results. (Yes, let 64-bit rule!!!)Yes I can bring that back. X64) because that would be too much. But I won't split them into different binaries (x86 vs. Should we grab them and re-post?I'll start by listing them all on this thread (on my first post.)I'll keep track of the top few times on each size. Would it be something worth adding you think? The CPD timing would likely only be valid for a set number of digits, but, if people like to test one size (100,000,000 for example) then it could be useful for comparison and tweaking.About half the old posts are still in the Google cache.

So multi-threaded benchmarks will have lower efficiency.The next version, will use less memory. So larger computations will have lower efficiency.Also, the program doesn't quite scale linearly with the # of cores. It's roughly O( n*log(n)^3 ). But keep in mind that it won't scale across different sizes and # of cores.Computing Pi isn't linear.

As mentioned before it doesn't seem to detect that I'm running at 4.2GHz. Post your benchmarks everyone!!!I did some runs at 4.1 (20x205) but I'm messing around now at 21x200 w/ turbo mode. And THAT would be interesting.Anyways. By the looks of it, I 'might' be able to squeeze that down to 46GB - which would make it possible for a fully-loaded 12-slot Gainestown server to do. Which means that it'll be possible for the 'standard' Core i7 with 6GB of ram to bench 1 billion digits.For the 'very large' end, 10 billion digits will require 52.9 GB of ram (in the new version).

(It wasn't there before, because it isn't needed to validate the checksum. The Validation.txt file now has the time as well. I've added the program version # to the validation checksum.3. I've added back single-threaded runs for benchmark mode.2. It used to take ~7360 +/- 30 or so seconds high priority.1. With the new version, I got a 7280s 10b time - with aero, sidebar, and normal priority.

Lastly, I'm doing a ton of stuff in the custom compute mode that don't apply to benchmarking.My friend Enrico's Skulltrail 4GHz, x64 SSE3 binary:Processor(s): Intel(R) Core(TM)2 Extreme CPU X9775 3.20GHzChecksum: e0c2395f9cedb2cd078cc7e1a753a271Checksum: 2a7b61201ec1133f0bf910993d572693Checksum: 5fab3fc8b275752d0ce14e10b88bc617Checksum: ed26d0a3c5620dd5042fbefa92506d3bChecksum: af68ed11dfd79cd01882c8b6765d693aChecksum: c4db0eeb8672859b0943e397d0997215New version looks good so far. But one of the moderators was kind enough show me one of them so that I can try to counter it in y-cruncher.3. I'll be trying to implement counter-measures for the 'slow-motion' cheats that are described here:All the cheats that are on that thread are obviously a very closely guarded secret. I'm trying to find a better and more reliable way to detect clock frequency.2.

Y Cruncher Download