Last daily update:
2024-03-27 16:30:32 UTC
17:12:20 ago
Last incremental update:
2024-03-28 09:34:37 UTC
00:08:15 ago
Server time:
2024-03-28 09:42:52 UTC
Currently online:
1 member
216 guests
User Moor found a 78-digit prime factor of an Cunningham number using ECM. This is the
largest ECM factor found this year,
and the 4th largest for all times
(and the largest found by yoyo@home).
User ccurtis0 found a 73-digit prime factor of an XYYXF number using ECM. This is another entry into the ECMNET top 10 list for this year!
User Favebook found a 77-digit prime factor of an Homogeneous Cunningham number using ECM. This is by far the largest factor found anywhere by ECM this year, and is the 4th largest ever. Very exciting!This was a very lucky find (about a 1 in 28.3 million chance for a single curve).
The next 2 factors were found by the BOINC Pentathlon, a 55 digit factor by JayPi2 of team SETI.Germany anda 58 digit factor by biodoc of team TeAm AnandTech.
The ECM and ECM P2 projects were choosen by the BOINC Pentathlon in the discipline Obstacle Run. Many user are already downloading lot of workunits and some return already. Credits are not yet counted for the Pentathlon, but we already have a noteworthy result, a 65 digit prime was found. This was sent to Paul Zimmermann to fill his list of ecm records.
We have to process some additional workunits. Some returned already.
The M Queens subproject has finished last weekend. No more workunits are distributed. Now we are analyzing the results which are 8 GB of compressed data. Much thanks for your provided work.
Simone Bonzanini found a 67 digits prime factor for the Cuningham number 22222+1. This saves a lot of NFS effort. The found prime is the first for this years ECMNET record list of Paul Zimmermann.
We estimate, that the project will finish in December 2023.
After 8.5 years the project has finished and proven that the previously predicted ruler is optimal. That previously known ruler has the following marks: 0 3 15 41 66 95 97 106 142 152 220 221 225 242 295 330 338 354 382 388 402 415 486 504 523 546 553 585BOINC volunteers computed roughly 25% of the search space.See the full distributed.net statement here.
After 3,174 days, the OGR-28 project has finished and douple checked 99.8% of it's search space. The project will finish in the next days.
The last 30% of our M-Queens workunits were added to the queue. After them the M-Queens project has finished it's first goal.
An update for the progress on each sub project in yoyo@home:OGR-28is 89% completed (https://stats.distributed.net/projects.php?project_id=28).
It will finish around beginning of 2023 (https://stats.distributed.net/project/ogr_status.php?project_id=28).
Siever & ECM
I see currently no end in further demands for sieving and trial factorizations.
There are many many math projects which have needs for sieving and factorizations.
M-Queens
We are currently in the 2. of 3 parts and have there 70% done. So in total we are at 56%.
We started 2 years ago. So it might take another 2 years to finish it.
yoyo
It is now possible to set a resource share of 0 in yoyo@home. This was requested by some user.
We have now a first GPU version for the M Queens project for Windows. It requires an OpenCL 2.0 GPU. The version can be downloaded from github.com. The zip contains an installation instruction, the app and the app_info.xml.
I'm enhancing the ecm search range for B1=43e6 up to 2000 digits. Some test workunits are already send out with the name ecm_es_*test* and a short deadline of 1 day. Together with this the credit formula was changed.
Congratulations to user Crashtest, Henric and nenym. Their found prime numbers are in the ECMNET top 10 for year 2020.
The missing description for Siever and M Queens was added. Now also features like checkpointing an progress indicator are described.
For our ecm P2 memory monster (which require up to 10 GB free RAM) we have now an own application. In the project settings you can choose to run this app or not.
User Peter Baetz found a 67 digit prime with ecm. This number went into the top 10 of the largest found prime factors with ecm for the year 2019.
The 27x27 board is the highest-order board that has been completely
enumerated. In 2016, after more than a year of computation on FPGA,
29,363,495,934,315,694 solutions were enumerated at University of Dresden.
We want ot verify this number and have to run 2.2 million workunits, which
we compute twice. On the progress bar you see 25% of it.
We'll see if we need also a year for this.
With our last run for M=24 we verified the Windows app and the validation against Linux. With our test runs we were able to confirm the amount of solutions for M=21 and M=24. So now we are ready for M=27. Some workunits are already created.
The Windows version of the M Queens app is now available together with some workunits for M=21 to test the windows version and the validation against the Linux version.
We started M Queens as new project in yoyo@home.The M queens puzzle
is the problem of placing M chess queens on an M x M chessboard
so that no two queens threaten each other; thus, a solution requires that no two
queens share the same row, column, or diagonal.
Curently it is a test application only available for Linux64 and we are running some test workunits
for M=24. We did already M=20 and verified the results. As next step we will verfy the number of solutions
for M=27. If everything runs well we might go to find solutions for M=28, which is currently unknown.
Our small server heavily fights with all flushed buffers, especially at the beginning. We did some measures to handle the load.
But if many buffers will be flushed at the same time, the transitioner will need time to handle all.
In the ECM project a 63 digit prime as a factor of a CullenWoodall number was found, which will make it into the
gmp-ecm Top 10 list for this year.
Have fun and take more of the ECM P2 workunits!
yoyo
In our ECM project we are now also trial factoring composites from the Cunningham Project. We already found a factor for the first running composite, which also fully factored this composite.
427 million (81%) of all of the stubs in OGR-28 have been tested once, and more than 140 million have been verified!
We run now also Homogeneous Cunningham Numbers in our ECM projekt.
An article about our Nontrivial Collatz Cycle project, which we finished autumn 2017, was published in the German newspaper for mathematics 'Die Wurzel'.
If a perfect cuboid exists, its body diagonal exceeds 253.
During this batch we were investigating the range of body diagonal from 251 (2'251'799'813'685'248)
to 253 (9'007'199'254'740'992).
17'408 face cuboids,
34'816 imaginary cuboids,
156'672 twilight cuboids,
a total of 208'896 different cuboids
were found with the help of 597'095 workunits.
Thanks to everyone who helped to achieve this Great Result.
Now we put the subproject on hold for public code review.
The 3rd batch is closed to the end and Perfect Cuboid publishes the sources on
https://github.com/renyxadarox/pcuboid. Everyone who is interested to take a part
in the public code review, please join us!
You can comment the code on github, here in the forum or join the Telegram
group https://t.me/joinchat/BrFEbg7IlqMFl4PBRSdEBA for interactive discussion.
If a perfect cuboid exists, its body diagonal exceeds 252.
We finished our 2nd batch of Perfect Cuboid workunits. Result so far: If a perfect cuboid exists, its body diagonal exceeds 251.
In the last days the siever app was updated. With this update we can run now also sr2sieve tasks. A first sr2sieve batch was already distributed. The names of such workunits starts with sr2. A next batch of sr2 workunits will be distributed in the next 7 days.
The Siever app is now also available for 64 bit Linux systems running on ARM.
Perfect Cuboid continues with a new version for 64 bit Windows, Linux and ARM. We are checking now up to 251.
Now we are close to 1st Batch ending. For those who's interested, what's next, we inform,
after complete validation of 0-250 range we are going to publish a new app
version which will be goaled to Perfect cuboids search only. Thus it's 7 times faster
than the current is, so we expect that the next goal - 251 will be achieved quick enough.
Stay tuned!
We've successfully completed the 0-10T range verification. As was expected, we found a lot of cuboids there:
54'761 edge cuboids
94'501 face cuboids
228'198 imaginary cuboids
1'132'380 twilight cuboids
A total of 1'509'840 different cuboids.
The most fortunate were users year02 and
krzyszp who snatched the jackpot and found
7'241 edge cuboids
11'341 face cuboids
27'719 imaginary cuboids
138'903 twilight cuboids
thanks to just a one, the very first task.
On the Siever status page you see now on which base we are working and how they are progressing.
In the Perfect Cuboid subproject we have added per user statistics of found cuboids, as well as subproject status page was extended by the common statistics. 11 November at 11:11 UTC we are going to launch the 0-10T range which we skipped from the beginning, which contains almost the same amount of cuboids we've already discovered, and throw out 4 times shorter tasks to give an opportunity for all concerned users to put into the personal statistics a large number of cuboids. So, don't miss the start time.
For the ECM repunit project user astroboylok found a 73 digit prime. This number will make it into the largest primes list ever found with gmp-ecm.
We added per user statistics of found cuboids
and as well the subproject status page
was extended some common statistics.
Today we have added Hits to Perfect Cuboid subproject, so from now you can compete not only in earned Credits,
but also in the amount of found cuboids. Free-DC is already showing Hits in
Subproject Stats.
And also good news, today we "crossed the equator" of the 1st Batch, Max In Progress threshold has exceeded
249 = 562.949.953.421.312, which is the half of our 1st goal - 250.
It has been a long time, we know, that there was no news whatsoever the results of Harmonious Trees,
or Odd Weird Search. All we knew was that we found nothing, the conjectures remained safe, and even taking
on more credence. It sounds a bit anti-climatic.
But no! In this interval, we have been busy working on something. It is a research article, to be precise,
that describes what we did to make both projects possible, what we observed, and what we can do to make it better
(if there is a similar problem to be made into a volunteer computing project).
And finally, after a lot of writing and editing in between great periods of procrastination (yes, I did a PhD in math
in between, and yoyo of course needs to maintain the project alongside his work), today it is finally published!
Titled Parallel Tree Search in Volunteer Computing: a Case Study, the article can be found here:
https://link.springer.com/article/10.1007/s10723-017-9411-5
It is open access, meaning that everyone can download it and have a look freely.
Thanks to TU Graz (I am a postdoc there), FWF (the Austria founding agency) and the library of TU Graz for having an
open access arrangement with Springer. Otherwise, the authors generally have to pay thousands of dollars for the open
access option. So, enjoy if you are interested!
Here is an abstract of the article:
While volunteer computing, as a restricted model of parallel computing, has proved itself to be a successful paradigm
of scientific computing with excellent benefit on cost efficiency and public outreach, many problems it solves are
intrinsically highly parallel. However, many efficient algorithms, including backtracking search, take the form of a
tree search on an extremely uneven tree that cannot be easily parallelized efficiently in the volunteer computing
paradigm. We explore in this article how to perform such searches efficiently on volunteer computing projects.
We propose a parallel tree search scheme, and we describe two examples of its real-world implementation, Harmonious Tree
and Odd Weird Search, both carried out at the volunteer computing project yoyo@home. To confirm the observed efficiency
of our scheme, we perform a mathematical analysis, which proves that, under reasonable assumption that agrees with
experimental observation, our scheme is only a constant multiplicative factor away from perfect parallelism. Details
on improving the overall performance are also discussed.
I'm currently in Athens, Greece. If somebody wants to go out for a drink, drop me a message, e.g. in our forum.
This morning we had a problem with our database. Therefore, I had to cancel the workunits of the latest Siever batch.Sorry for the inconvenience.
The Siever application is now also availabel for Linux 64.
In our new subproject we produce Sieve Files for the CRUS-project.
We are sieving for Riesel/Sierpinski to b
conjectures where b
After less than one and a half months (14 August to 23 September), we were able to successfully complete our search project:
We have found all the smaller path records as well as all starting numbers 2 * 1016 * starting number (only such numbers are given as candidates)
which were found by other persons (mainly Tomas Olivera e Silva and Eric Roosendaal);
and thus validate our approach in the opposite direction.
We have found 4 new path records and have been able to prove that all
starting numbers
We finished so far nearly 50% of our Nontrivial Collatz Cycle search and got 500 path maxima and at least one new Path Record in Eric Roosendaals list.
We have now also badges for Perfect Cuboid and the application is also available for 64 bit Linux.
The Perfect Cuboid app is now also available for 32 and 64 bit ARM systems running with Linux.
The new subproject Perfect Cuboid is now in Test for 64 Bit Windows systems.
We have now also badges for Perfect Cuboid and the application is also available for 64 bit Linux.
We deployed a new version which is more robust and avoids some problems happend on workunit restart. Additional the progress indicator is now updated in 0.125% steps, before it was in 1% steps.
A Windows application is now available for the Nontrivial Collatz Cycle search.
The Collatz progress page shows now also the found path records.
We grant now also badges for the new Collatz application.
The application for Nontrivial Collatz Cycle is now available for 64 bit Linux @x86 and @ARM.
There will be soon a new subproject attacking an collatz issue integrated in yoyo@home. You have to enable this project in your settings and allow test applications. Linux 64 bit will be the first version.
Stephen has stopped his Muon1 project. The main write-up of the project and its results are in Chapters 7 and 8 of his thesis. Nearly 90 million simulations were done.Therefore I stopped the workunit generation for Muon.
In February 2017 Gridcoin people interviewed me about yoyo@home and yafu, my experience operating a Boinc project and my view on Gridcoin. You can listen to the interview on SoundCloud.
Vom 2.-5. Juni findet in Wieda im Harz das 8. teamübergreifende BOINC-Treffen statt. Es werden Mitglieder
verschiedener Teams und Projekte dabei sein und wir werden gemeinsamme Ausflüge unternehmen, grillen und einfach
mal Leute in der Realität treffen, die man sonst nur Online kennt.
Es sind noch einige Plätze frei. Näheres zur Teilnahmen und das Antragsformular finden sich
bei uns im Forum.
Ich freu mich Euch dort zu treffen.
Since ECM runs also on ARM I see many error on such systems. Thosesystems are mostly small single board systems
as Raspberry Pi or Odroids. They have many cores but less RAM and mostly no swap.
The ECM wokunits consume less RAM at the beginning but after some time require adhoc 1 or 2 GB of RAM. Boinc can handle it
but not so fast as the RAM is allocated and running multiple ECM workunits in parallel makes it worse. They often allocate much RAM at the same time.
tl;dr
Configure more swap in your system. Consider the old rule swap size = 2 times RAM for systems up to 2 GB.
Here a tutorial how to create more swap space: https://www.digitalocean.com/community/tutorials/how-to-add-swap-on-ubuntu-14-04#check-available-space-on-the-hard-drive-partition
Since some days native ECM apps are available for ARM 64 and 32 bit Linux systems. No need anymore to install gmp-ecm package.
The ecm P2 workunits require up to 10 GB RAM. Because of this they get double credits. Systems with less RAM should not get them.
On 64 bit Windows version 700.02 is twice as fast as version 700.01. You should cancel all 700.01 tasks to get version 700.02.
Over the weekend, we passed 25% of the total work required to prove OGR-28. Also, we opened the 18-x stub space. :) Thank you for all of your efforts. Moo!
There is now a aarch64 (ARM 64) application for ecm on Linux available. To use it you must install the package gmp-ecm with the package manager of your Linux system.Please report success or problems in our forum.
I'm working on changes of the ecm application to handle larger B1 values for the elliptic curves and which runs only one curve and stage 1 and 2 in separated workunits. This allows us to attack an additional range of composites.Most changes on the backend are already done. But now the ecm application needs to be changed. Therefore no new workunits are issued. In the next days only resent and test wokunits will be available. The new workunits will have a P1 or P2 postfix.yoyo
Last month we had 2 crashes of the server. The server just powerd off. We saw no software reason for it. Some capacitors looked strange. So we placed the disks into a new server.
The xyyxf project has finally achieved t50 (B1=43e6) on all composites. We found some prime factors or fully factored some composites. Now the project has started to enqueue numbers to partial/full t55 (B1=11e7). Most of these numbers will be ready for SNFS once we complete them. A few will likely complete ECM as soon as this weekend, with a steady stream of NFS ready composites expected thereafter. They will go to NFS@home to get them fully factored.
We accept now also Gridcoin donations to S74YbWsfW2qW2mHbw7SYfPi7PyMLtz6hV8. For other donation options, check our donation page.
Our FabLab in Marburg, Germany is one of the projects of the Google Impact Challenge. I would really appreciate if you could vote for it (the green button). Much thanks, yoyo!
I compiled the Boinc client for my small QNAP TS-219P NAS. Now yoyo@home runs also on my NAS. If you have also a ARM based QNAP system you can download the Boinc client here.
The yoyo@home project was migrated to a more powerfull and up to date server last night. If you encounter any problems please drop us a message in our forum
I just accessed an ARM system where OGR cruncher wasn't running. The OGR cruncher requires a file /lib/ld-linux.so.3, which didn't exist on this system. But there was a /lib/ld-linux-armhf.so.3. So I created the missing file with an link ln -s /lib/ld-linux-armhf.so.3 /lib/ld-linux.so.3.If OGR isn't running on your system you might do it similar to get it running.
The distributed.net central key master is back online and our personal proxy fills with stubs. The workunit generator is now able to produce fresh OGR workunits.
The distributed.net central key master has a hardware problem since 9. of July. No new OGR stubs are submitted any more. In the last days I still had stubs in my personal proxy which is used to generate Boinc workunits. But now my personal proxy is also empty. There will be no new workunits generated until the central key master comes back online.See also bovines blog posting.
We need to rerun some Harmonious Tree workunits. If you need some points there, now is your chance to catch some.
Check the forum entry from the author for an update of the project. I'll keep the project running with a lower weight.
Check the evolution@home website for an update of the author Laurence Loewe, who is currently at the University of Wisconsin-Madison.
Thanks to all Pentathlon teams. The computing power during the race was roughly 5 times more then before. 250 teams, 9122 user and 15477 computer were active in the last days.
We released an app version which runs on Android 5 (codename Lollipop). This app is now a position independent executable (PIE) which is the standard for Android 5. If you have a new smartphone or tablet, be sure to check them out.
Thank you so much for your support to yoyo@home and to Odd Weird Search! We just completed the current batch on numbers lower than 1028 with excess (or abundance) at most 1014. In this batch, we released about 230000 workunits, and we have checked 4323850414816 = 4.3*1012 abundant numbers for their "weirdness". This will take about 150 years on a single core, so we could not possibly accomplish it without you!Read the complete report here.
It is now one year that the OGR-28 project started and yoyo@home user contributes to it. So far the project finished 4.92% of all Gnodes. At the current throughput the project might finish in 2025. But we don't know about future stubs which are sent out. They might be smaller or bigger. Additionally computing power will increase in the next years. So there is a big chance to finish the project much earlier. Much thanks to all your spent CPU cycles! -yoyo-
Our Android Arm applications are currently not running on Android 5 devices. For Android 5 we have to deliver position independent executables (PIE). We are working on it. The first tests we will run in our test project yafu@home. We appreciate every Android device which is attached to yafu@home so we have many different device types and Android versions for our first public tests once the application is available.
The Boinc team tested now 1,003,453,991 GNodes of the distributed.net OGR project. This is 11.9% of the whole project.
You can send donations now also via Bitcoin to our Bitcoin address. Infos on our donation page.
The OWS project goes to it's end. Therefore I reduced the deadline to 5 days.
Several people and organizations have completed many factorizations, all important. The most welcome one from Paul Leyland's point of view, though, has to be that of 2,951-.C290 which has been the Most Wanted Number for over ten years. It was the last virgin (i.e. no known prime factors) in the base 2 tables. The factorization into p63 * p227 was found by yoyo@home on the 16th.
We released an optimized version for Intel Sandybridge architecture. Read more about it in our forum.
I will be on the Chemnitz Linux Days 2014 from 15.-16.3. in Chemnitz Germany. Rechenkraft.net has a booth in the main hall where you can meet me and other Rechenkraft.net people.
The "Chemnitz Linux Days" is a conference that deals with Linux and Open Source Software. It is open for everyone, novices and experts alike.
Check the posting about information from the author about the next stage.
Dear friends,
distributed.net is proud to announce the completion of OGR-27!
It is almost five years ago to the day that we began on this exciting journey. Almost 20,000 of you joined us.. without whom, it would have been impossible.
We have proven conclusively by the exhaustive search of all possible rulers that the previously predicted 27-mark ruler is indeed the most optimal one. We were confident that we would find a more optimal ruler during this search, but it was not to be.
We expected it to take us seven years to complete this awesome task but thanks to your efforts recruiting your friends and co-workers to our effort and a little help from Moore’s Law, we did it in five.
The best known ruler is 27/3-12-26-25-29-2-9-36-10-68-1-4-17-53-35-8-16-28-6-14-13-71-18-19-23-7 (length 553). Represented the other way, this is marks at positions 0 3 15 41 66 95 97 106 142 152 220 221 225 242 295 330 338 354 382 388 402 415 486 504 523 546 553.
In total, we verified 302,621,586 unique stubs (2,526 with 3-diffs, 179,120 with 4-diffs, 6,457,815 with 5-diffs and 295,982,125 with 6-diffs), requiring each to have been completed at least two times independently and with an identical node count. Additionally, due to a client implementation bug in some early clients, we required all stubs to have been verified at least once by a client greater than v2.9109.518. This delayed us by a few weeks towards the end of the project but was necessary to ensure that no work was skipped.
The shortest ruler was sent to us 11 times, with one user completing it twice. I will be writing to this user directly for some help picking lottery numbers!
We will be sending some distributed.net swag to the lucky winners and hope that you will join us as we move on to our next challenge!
(from http://blogs.distributed.net/2014/02/25/16/09/mikereed/)
I released some workunits for Linux 64 systems as test. We now attack a range up to 1028.
After 1,821 days we finished the OGR-27 project. All stubs were computed at least twice. The Boinc part of this distributed.net project computed more than 5% of all OGR-27 stubs. At the end we had a rate of 10%.
Now the Boinc server delivers OGR-28 workunits. This is to discover the most optimal Golomb Ruler with 28 marks. We anticipate that it will take about as long as OGR-27 has. It has some features in common with OGR-27: some of the packets will be very large (up to 1500 Gnodes), and there are three stub spaces. We expect that the first two stub spaces will take about 90 days to complete.
For the stats freaks among you, the number of stubs for each stubspace of OGR-28 is below:
Stubspace 1: 115676
Stubspace 2: 5823649
Stubspace 3: 518152118
No new application is needed, since OGR-27 clients are ready for OGR-28.
(from http://blogs.distributed.net/2014/02/18/23/23/mikereed/)
The Odd Weird Search Project finished, all workunits were computed. Many thanks to all valunteers. We currently evaluating the results and working on a successor application which allows us to search larger numbers.
Some days back I stopped recycling of Harmonious Tree workunits. We will compute the remaining ones locally.
We’re very close being able to declare OGR-27 finished, but we have just a few more stubs remaining before final completion. The previous stubspaces 27.1, 27.2, and 27.3 are now officially complete. We expect the last results in 27.4 to be received some time in the next two weeks, and then hope to begin sending out the first OGR-28 stubs within a few hours after that.
As a reminder, no new dnetc client binaries or configuration will be necessary since all existing OGR-27 (OGR-NG) clients are already capable of working on OGR-28 once we begin sending out those workunits.
Look forward to us making another blog post containing some final statistics about OGR-27 within the next two weeks!
(from http://blogs.distributed.net/2014/01/22/09/28/bovine/)
A Happy New Year to all crunchers!
User [SG-FC] hl found a 57 digit prime as a factor of the Near Repdigit Number 8*10242+9, which is the first found number in this year.
We have completed over 96% of the work and are now close to wrapping up OGR-27. Some of you may have noticed some difficulty
getting OGR packets earlier today, due to our need to begin recycling of the remaining stubs. As I write this, there are about
20 million left that need working on. It is likely that you may experience difficulty occasionally in the coming weeks when
hoping to collect OGR stubs to process. This is due to the master key server being unable to speak and chew at the same time!
(...read the remaining blog posting)
Now the yoyo@home OGR application is also available for Android devices. It runs in Native Boinc as well as in Berkeley Boinc.
The Windows XP version produced wrong results and didn't validate with other results. Version 2 now fixes this issue.
The Odd Weird Search application is now also available for Windows 64 bit systems and seems to run without big issues.
The Odd Weird Search application is now in production. In the first days the app was running very stable as well as the result verification.
Therfore the app is no more in testing mode.
The new project Odd Weird Search is
now running as test project. To get work units you must enable test applications
and must select the Odd Weird Search application in your preferenes. The application is currently only available for 64 bit Linux systems.
Since there are more ARM devices active for HAT, I increased the deadline to 3 days.
The 4th project of the BOINC Pentathlon in the discipline Mathematics (Weightlifting) is:
yoyo@home
All credits granted between
05/12/2013, 0.00 (UTC) and
05/17/2013, 0.00 (UTC) will be taken into the BOINC Pentathlon validation. Please note that pending credits cannot be taken into account!
The statistics for this project can be found at
http://www.seti-germany.de/boinc_pentathlon/statistiken/challenge.php?challengeid=4.
Have fun crunching this project and chasing the medals.
The cruncher ogr client is now up to date. The new version should run on 32 bit as well as on 64 bit systems. Please check it.
For the running race here is an very frequently updated statistics of the top 10 teams.
On the occasion of their Raid 2013 the team L'Alliance Francophone made an interview with yoyo@home.
I will be on the Linux Day in Chemnitz from 16.-17. of March. If you nearby, say hello on the Rechenkraft.net venue.
The cruncher application is now also availble for ARM devices running Linux. Now you can run it on Rasberry Pi and other ARM systems.
The HarmoniousTree project will finish soon. If you want to get a certain badge of honour for this projct you have only some days, maybe weeks, left. No new workunits will be injected, the workunits are all resents. If you have an Rasberry Pi you can run HarmoniousTrees also on the Pi. Here you can see how many workunits are left.
We are currently testing a Raspberry Pi application for Harmonious Trees. For this we are looking for tester who run a Linux on there RasPi and can attach Boinc to yoyo@home and report how the application is running on there RasPi in our forum.
The Muon1 project today hit its 40 quadrillion particle timestep milestone. That means that in the last 2.5 years, it's processed as much work as it had in the previous 9 years. Read more about it in the official press release.
Many thanks to everyone that's participated, and we hope you'll continue to participate in the future.
A retrospective of the Muon project can be read in KTetch Dureeks blog.
From 22. to 24. February I will be on the DebianMed meeting in Kiel. If somebody is interested in a drink and some smalltalk there send me a note. Boinc and yoyo@home will be one topic on the meeting.
The Harmonious Tree application is now also available for Android and runs in NativeBOINC.
The GCW tables and associated information have just been posted. There is a brand new progress file for 2013q1 which contains a grand total of zero entries.
Many people have contributed to the 532 factors discovered in 2012, mostly individuals but the yoyo@home, RSALS and NFS@home collaborations have also done valuable work. My thanks to all of these and, of course, to those who contributed ECM effort but have not yet been successful. More on that below.
Since the project went public in September 2000, over twenty thousand factors have been discovered and very nearly ten thousand complete factorizations have been found. Only ten composites under 150 digits remain to be factored. There are only four composites remaining with SNFS difficulty under 210 digits and one of those is currently 50% sieved. In the light of this progress, the snfs.txt file has now been extended to 220 digits.
Perhaps now is the time to set some targets for 2013; some easy, some hard.An easy target is to factor all composites under 150 digits
A harder target would be to factor all with SNFS difficulty under 220 digits
Another hard target is to find 500 factors in total.
A very hard target would be to raise the fully factored total to 10,000 --- this requires well over 200 complete factorizations.
Paul
If we consider the project throughput of the last days, than the project will finish in August 2013. I can't say yet what will happen afterwards. So you have time until August to catch some OGR badges.
Ich bin vom 12.-14.10. in Dresden. Falls jemand am 12. Abends Lust auf ein kleines zwangloses Treffen in Altmarktnähe hat, der schickt mit am Besten eine Mail yoyo at mailueberfall punkt de.
Now also composites of the Up For The Count project are handled with ECM. This is a new subproject now. The numbers for which we search factors are of the form xx+(x+1)(x+1), e.g. np_112 is 112112+113113.
The new application for Harmonious Trees is now deployed. We started now the work on Harmonious Trees with 37 nodes. The application will also continue on the remaining 35- and 36 node Harmonious Trees. Windows, Linux and Mac systems are supported.
We will start soon Harmonious Trees with 37 nodes. For this we prepared a slightly changed application which handles progress indicator and checkpointing better. But to deploy the new application all workunits with the old application must have finished. Afterwards the new application will be available for Linux only. The Windows version will follow later. Remaining work for 35 and 36 nodes will also be handled by the new application.
Now also composites of the CullenWoodall project are handled with ECM. This is a new subproject now.
We are happy to announce the factorization of the numerator of the 200th Bernoulli number:
N = 389 * 691 * 5370056528687 * c204
c204 = p90 * p115
p90 = 149474329044343594528784250333645983079497454292838248852612270757617561057674257880592603
p115 = 2309888494878522213154166450313710367329236616136192088115975953987911840431532723141985023484762629703896050377709
See the full announcement here.
User Mitchell of team Sicituradastra found a 63 digit factor for a NearRepdigit composite. This factor is now in this years top 10 list. It was his 14th found ECM factor.
After 1100 days the OGR-27 project completed 50% of the work. According to the current rate the project will finish in March 2015.
On special request of Paul Zimmermann I put 200 demanding workunits into the queue. They are named ecm_as_Bernoulli_B200_P67. I expect, that they require 1.8GB RAM and expect a runtime of 20h. If these 200 workunits run well I will distribute further 13000.
Harmonious Tree subproject has been running rather smoothly for a couple of months. Thanks everyone who have contributed to this subproject. We have cleared n=32,33,34, and results show that every tree with at most 34 nodes are harmonious, that is to say, the harmonious tree conjecture is correct up to 34 nodes. This extends the current result on n=31. Read more in the status update.
Since some days Muon runs new lattices. With the retirement of both Linac900Ext10tc2 and Linac900Ext9X we are moving on to Linac900Ext7Xc2 and Linac900Ext9Xc2. Both are development improvements of previous lattices, and attempt to work on phase handling, as well as investigate new designs without being side-tracked by jitter. Read more about it in the recent Muon1 blog.
Check the unOfficial Muon Blog where you can see the best design of the Linac900Removable6c2 lattice. This result was returned by yoyo@home.
I will be in London from 15. Feb - 19.. If somebody want's to go for a beer and chat about nearly everything drop me a mail. -yoyo-
The Muon1 Distributed Particle Accelerator Design Project proudly announces that today, at approximately 04:00UTC, it reached the 30 quadrillion (30,000,000,000,000,000) particle timesteps (pts)milestone. Since some years the yoyo@home Boinc project provided an important amount of this work. 32% and 56% of the current running lattices are done by yoyo@home.
Read more about this milestone in the press release.
There will be a beer table (you can't call it regular's table ;)) at the Brauhaus am Alex, map here at 29.12.11-19:45hrs, where I will meet Andreas (Constellation).
You will find us starting at the Sudhaus and then I will lay out some Rechnekraft.net flyers on our final table. Feel free to join us.
More in here for the beer table.
We wish everyone a merry christmas and a happy new year 2012!
The Harmonious Tree application is now also available for Intel- and PPC Mac.
Since some days the new Harmonious Tree App is deployed. Results of the Linux version before 0.07 did not good validate against results from Windows version. On Linux systems please abort workunits with application version 0.06 and 0.05. Version 0.06 for Windows and 0.07 for Linux seems to be running well and are validating against each other.
Now Harminous Trees with 36 nodes are in the queue and also some not finished trees with 35 and 34 nodes will be queued.
Our current Harmonious Tree App leads to some nearly endless running workunits. This will get even worse for workunits with a higher number of nodes. Therefore the batch with 36 nodes is not yet in the queue. We are working on a new Harmonious Tree app which improves this. But to deploy this new app the current running workunits must have finished. They will not validate against results computed with the new app. 6 workunits are still running. I'll wait some more days for them. But if they will not be returned I have to abort them to deploy the new app. In the first step the new app will be available for Linux, later for Windows.
Congratulations! (and thanks!) to user shauge, who today found the following 38-digit factor: 10704103333093885136919332089553661899 in the Mersenne + 2 ECM project.
Thanks so far for 5.500 votes. We are now at #890. We estimated that we need round about 1.500 more votes to stay in the top 1000 until the campain ends on the 15. and get the donation. Here is the voting link:
https://verein.ing-diba.de/sonstiges/35039/rechenkraftnet-ev
Thank you very much for your vote and support. We appreciate it very
much.
The project yoyo@home runs fully based on volunteer donations. It is
not a project financed by universities or private commercial entities.
It runs mainly on donations and money from the Rechenkraft.net e.V.
association and it's members.
Now the German non-profit society Rechenkraft.net e.V. has an unique
opportunity receiving a donation of EUR 1.000. For this your help is
needed.
A well-known German bank as launched a campain, where 1.000 non-profit
societies can win a single donation of EUR 1.000 each. The criterion for
being eligible are the votes of the internet users each society
receives.
With your vote Rechenkraft.net e.V. will be able to get among the first
1.000 societies.
The only thing you need to do is to register yourself with one of your
email addresses on the website linked below. By clicking on the link
written in an email by the bank, you confirm your vote. That's all.
(There are three votes allowed per email address of which all three can
go to the same society.)
https://verein.ing-diba.de/sonstiges/35039/rechenkraftnet-ev
Thank you very much for your vote and support. We appreciate it very
much.
The Harmonious Tree application is now also available for Intel and PPC Mac.
Congratulations to user steinrar, his found factor is now at the end of the top 50 list of largest factors found by ECM.
Alessandro Freda found a P62 to finish 853^73-1. This is an unusually large find for B1=11e6, optimal for finding 45 digit factors. This is just shy of the 63 digits currently needed for the 10 largest ECM factors this year, but makes the list of 50 largest ECM factors ever. It is both a Brent composite and a Mishima Cyclotomic Number.
Harmonious Tree has now also an application for PPC and Intel Mac. It is now also no more a test application and the deadline is 2 weeks.
The results of our Euler search are now public available at arXiv:1108.0462v1. We give a brief history of these systems and how we searched for these big solutions on Boinc. Our two Boinc projects ran from April of 2010 to July of 2011.
A Windows application for the new Harmonious Tree project is now available. You must allow test applications in your preferences to get this app. If you have any problem with the new application, report it in our forum.
Harmonious Trees are now running as new subproject. The application is currently available for Linux 32- and 64 bit systems as test application.
The Euler project finished last weekend. 4.470 user calculated 1.840.375 results and provided 704 TeraFlops. A summary about the history and the results of the Euler project will be given in the next weeks. We intent to publish the list of all found solutions together with the users who found it.
The two lattices we had (Linac900Ext-6Xc2 and -10td2) seem to have found their maximum, having not changed for a week. Of those, the 6Xc2 running on the newer client exhibited a smoother-looking optimisation curve but apparently got stuck in a local maximum in the end.
Stephen released two new lattices that change the RF phase ranges: they are actually reparameterisations of the same problems, but could optimise differently. 10tc2 is like 10td2 but shifts the phase ranges by 180 degrees so the boundary is somewhere else (this 'c2' is actually the original setup that only changed with the 'd2' lattices). 6X is like 6Xc2 except the RF phase only goes around one cycle rather than two. Having two cycles allows the phases to move around more easily but produces 2^{number of RF cavities} copies of every maximum, which might confuse the optimiser. So Stephen is going back to the original formulation on the improved v4.45 client.
The Muon1 Distributed Particel Accelerator Design Project proudly announces that today, at 14:03UTC, it reached the 25 quadrillionen (25,000,000,000,000,000) particle timesteps milestone. Yoyo@home users provided 14.6% of it. The project, which uses genetic algorithm methods, rather
than the more usual 'brute force' methods, is attempting to design the
best particle accelerator sections possible. It is part of the Neutrino
Factory project, based out of the Rutherford Appleton Lab, in near
Oxford, UK. See the full press release here.
Not much time to get your next Euler badge. The project will finish in less then 3 month.
The Muon1 Distributed Particel Accelerator Design Project proudly announces that today, at 14:03UTC, it reached the 25 quadrillionen (25,000,000,000,000,000) particle timesteps milestone. Yoyo@home users provided 14.6% of it. The project, which uses genetic algorithm methods, rather
than the more usual 'brute force' methods, is attempting to design the
best particle accelerator sections possible. It is part of the Neutrino
Factory project, based out of the Rutherford Appleton Lab, in near
Oxford, UK. See the full press release here.
An internal buffer was to small, which leads to errors of some wus on Windows hosts. This is fixed now.
In the 2nd annual BOINC Pentathlon yoyo@home was chosen as the 5th of five projects. Credit granted from 14 May 00:00 (UTC) to 19 May 00:00 (UTC) are counted for the Pentathlon.
For more information on this special event and to see the other projects selected, please visit the BOINC Pentathlon Welcome page.
The Muon application is now also available for Linux sytems. Precondition is, that you have installed the Windows emulator Wine. Just start your software package management application and install wine on your system.
The OGR development crew has recently identified and fixed some
bugs in the OGR client codebase. One of them causes the client to skip part
of a packet in very rare cases. It can happen only in OGR-27 and above, so
previous projects were not affected. Fixes are included in version 518.
Read more in Mikes blog.
The updated client also recognizes the new Intel Core i3 and AMD Phenom
processors, which are becoming increasingly popular among budget-conscious
consumers.
Now also a 64 bit Mac client is available.
There are some common questions that are asked about Muon1, including 'what is it about', 'why should I bother?', 'what's so special about it?' and 'what does it do?'. K`Tetch semi-official Muon1 blog gives answers.
Muon version 4.45 is now in operation. The most important change is in it's accuracy. Previous versions have had a slight problem with 'flutter' or noise, meaning results are not always the most accurate.
In September/October 2010, a group of users ran a detailed scan, testing a set design with only a single variable changed throughout. It used the (recently discontinued) Linac900Ext10d2 lattice, and changed only one variable, .ls5l. in its full range from 000 to 999.
Starting mid-March 2011, a new alpha version was released and the exact same scan was run again, using the new client. The changes in accuracy are quite significant compared with the previous version.
Performance wise, little has changed, and the new client crunches about as fast as the previous client, so while there's no gain, neither is there a loss, in compensation for increased accuracy.
There is no doubt though, that Muon1 leads the field in 2nd-generation, massive-scale distributed computing. Not only is it one of the few genetic-based projects, it's also one run on almost no resources, while still being not just cutting edge, but bleeding edge. For a much more detailed description of all improements of the native muon1.exe client check the blog.
From 11.-17. April I'm in Dar es Salaam, Tanzania. I hope the server continues without problems. But anyway, if somebody is also there and wants to go for a drink, just drop me an info. -yoyo-
We are testing a new subproject on Linux systems. Enable test applications to get work.
A discussion about a new subproject has started in the forum. It is about Perfect Cuboids, which is an unsolved problem in number theory. If you want to be part of the development team, join us. We need C/C++ developer and mathematicans.
We have some problems with a ecm_mp batch. I aborted the whole batch. Only Linux 64 was able to finish some work units. But to find the issue I need some Windows 64 bit tester. If you want to help, follow these instructions.
I wish all yoyo@home participants a healthy, happy and successful new year.
The cruncher application for Sparc Solaris and PS3 are now updated to distributed.net client 518. This includes an faster assembler core for PS3.
Congratulations! (and thanks!) to user [P3D] Crashtest who found the first factor for the Mersenne + 2 ECM factoring project. This 45-digit factor (128201605404515119370139202836664201936768339) is so far one of the biggest found factors of the Mersenne + 2 project.
There are some discussions ongoing to add 2 more math projects to yoyo@home. Also for evolution@home some enhancements are planned for the future. But nothing is currently very clear, so I do not state any dates. I just want to let you know that something is ongoing. I let you know if the things are more clear. -yoyo-
Somebody proposed a new sub project about Graceful Trees. Please join the discussion and raise your opinion about it.
We computed 20% of the search space in less then 4 month. Have a look to the stats and the found solutions.
ALL FACTORED! Since March, every OddPerfect number worked by yoyo@home has been completely factored - 42 numbers so far. Yoyo@home found the factors for some of these, and showed there were no small factors for the rest. The rest were finished by the RSALS project using the Special Number Field Sieve (SNFS). All of these numbers are 200 to 250 digits, and all the factorizations are wanted by working mathematicians.
I will be in London attending the BoincWorkshop and Citizen Cyberscience Summit. If anybody is interested to go for a beer in the evening drop me a message. I will be in London from 30. August - 5 September. (yoyo)
The Muon1 Distributed Particle Accelerator Design Project proudly announces that today, at
08:07GMT, it reached the 20 quadrillion (20,000,000,000,000,000) particle time-steps (pts) milestone.
This is the amount of work needed to simulate a particle for 55 hours, 33 minutes and 20 seconds,
which at an average of 90% of the speed of light (0.9c) would cover a distance of 360 Astronomical
Units - ten times the average distance between Pluto and the Sun, and three times further than the most
distance man-made object (Voyager 1) has traveled. (press release)
The Boinc community provided in total 12.4% of the power of the whole Muon1 project. For the most recent running lattices the Boinc part is between 30 and 40%.
At the end of this article is a good overview about the planned neutrino factory.
All cruncher/ogr apps are now updated to the latest stable distributed.net clients. There are bug fixes and new assembler cores available for 32- and 64 bit systems which should improve speed on selected prozessors. For a complete list of all changes check the forum.
The Euler application found already some new primitive solutions. The forum is frequently update with information which solution was found by whom.
The Euler625 application is now also available for Intel32-, Intel64- and PPC Mac systems. Much thanks to Michael.
All cruncher/ogr apps are now updated to the latest stable distributed.net clients. There are bug fixes and new assembler cores available now for 32- and 64 bit systems which should improve speed on selected prozessors up to 30%. Now also a win64 app is avaiable. For a complete list of all changes check the forum.
A new Euler application is now on test for Linx32 and Linux64 systems. To get the app you must enable test applications. Workunits are sometimes created for testing. The new Euler application searches now up to 250.000. There are 510.000 workunits in total. But first we need testers.
The project is complete!
There are 181 solutions to (6,2,5) below 117649 ! We discovered 32 new solutions during this computation, and double-checked all the existing solutions. The only sad news is that we didn't find a solution to (6,2,4). Let's hope that the next project will discover one.
Found ECM factors and Euler solutions are now send as Twitter Feed. Check also the end of the news section at the yoyo@home homepage.
Should I post found ECM factors and Euler solutions to our Twitter Feed? State your opinion in the forum.
So far, two new solutions have been discovered:
927116+475676=830276+805566+598026+147006+140296
957136+630166=910806+794236+460746+96466+34026
We can expect 30 more solutions before the end of this computation. And we can hope for a (6,2,4)...For a more detailed description of the Euler project read the description in the forum.
Euler, a new project is now included in yoyo@home. The project runs currently as test project and has short deadlines. Euler (6,2,5) computes minimal equal sums of power 6. The project is dedicated to all those who are fascinated by powers and integers.
Some ecm work units were underestimated in there memory requirements. They crashed mostly on Windows 32bit systems. This is now fixed in the wu generator. With the next batch of work units required memory is limited to 1800 M Byte. There will be of course a lot of work units which require much less memory. I just limited the top requirements.I also hope that the long running ECM will sometimes lead to a new record ECM prime factor.
In 2 weeks the Boinc community meets for 3 days in Wieda/Germany. There are still some places available. More information in our forum. I hope to see some of you there.
I hope sony just made an april fools joke on that: http://blog.eu.playstation.com/
PS3 Firmware 3.21 will be available this Thursday. It will disable the .Install Other OS. feature that was available on the PS3 systems prior to the current slimmer models, launched in September 2009. This feature enabled users to install an operating system, but due to security concerns, we.re now removing this feature.
For most of you, this won't have any impact on how you use your PS3. If you are one of the few who use the 'Other OS' feature, or if you belong to an organisation that does, then you can choose not to upgrade your system.
For each subproject I added links to the stats pages of Free-DC. Now you can see per subproject the top teams and top participiants. Thanks to Free-DC to provide these stats.
I added some new badges to the system and hope they will be sufficient for the next years. Enjoy the additional levels and have fun ;).
The factor, which was found by Jeff17, is now recorded as the biggest one in the XYYXF ecm top record list.
Jeff17 found a 57 digit prime factor for the XYYXF number 11063+63110. This is his 8. factor and our 3. in the 2010 top 10 list.
Currently, the RKN seal of approval reviews Yoyo@home. You all are invited to deliver your assessment and thus contribute to a meaningful result.
Lazarus-uk found a 68 digit record prime factor which put us on the top of the top50 list of the lagest ever found gmp-ecm factors.
We fixed a problem, that EVO was not finding it's result on Linux systems. Therefore we run a evo_B* series of short wus to see if now it runs properly. All old evo_A* wus were canceled. Please help to test and run some evo wus on Linux with wine. I would like to wish all participants of yoyo@home a very Merry Christmas and a happy New Year! As always, many thanks for your continued support of the project. THANK YOU!yoyo
You can now run evolution@home also on Linux if you have installed Wine. Read more about it in the forum.
Some new work units starting with 'ecm_nr_' includes now a new type of number for which we search factors. We want to find factors for near-repdigit numbers. A near-repdigit number is a number whose all digits are the same except one digit somewhere.
Today we had a outage of 2 hours. The power supply unit of the server decided to finish it's work. We replaced it with a new one.
Beyond found again a 55 digit number for the XYYXF ECM project. With this number yoyo@home users filled 50% of XYYXFs top20 ECM list.
In your user page you can see how many factors were found by you. If you click on this number you see which factors.
You can now run Muon also on Linux if you have istalled Wine. Read more about it in the forum.
We reached now the top position in the stats of Muon and providing more than 40% of the project power.
Greetings from Barcelona. The workshop just finished. You can find the names of the attending people and the slides of the talks on the workshop web page. The remaining slides will be uploaded in the next days. There are also rumours, that something will be uploaded on YouTube and Flickr. We also made our first public presentation of our new RNA World project, which will go public in the next days. Currently it is beeing tested by a closed alpha test group. In the meantime the server is running well, produces some ECM factors and also the long running evo wus are processing well. Thanks for all your support, yoyo.