We add an initial "_title_" and "_abstract_" to all entry `.entry.json` files. The `bin/csv2entry.sh` tool reads the `summary.csv` file and loads the "_title_" and "_abstract_" to entry `.entry.json` files. Changed `bin/csv2entry.sh` VERSION from "1.3 2024-09-23" to "1.4 2024-09-27". Perform `make csv2entry` to perform the above and test under macOS. The `bin/cvt-submission.sh` tool adds "_title_" and "_abstract_" to the .entry.json based on the `.info.json` file. Changed `bin/cvt-submission.sh` VERSION from "1.2 2024-09-23" to "1.3 2024-09-27". The `bin/entry2csv.sh` tool forms the `summary.csv` file based on the "_title_" and "_abstract_" fields found in .entry.json files. Changed `bin/entry2csv.sh` VERSION from "1.3 2024-09-23" to "1.4 2024-09-27". Perform `make entry2csv` to perform the above and test under macOS. Added `-H` and `header=with-header-3` to the `bin/md2html.cfg` for the configuration entry for `[12][0-9][0-9][0-9]/*/README.md`. Changed `bin/md2html.sh` VERSION from "1.6 2024-08-17" to "1.7 2024-09-27". All entry `index.html` files now list the "_abstract_" in a new `<h3>abstract</h3>` header. Changed `bin/subst.entry-index.sh` VERSION from "1.6 2024-09-23" to "1.7 2024-09-27". Removed `summary.csv`. Added `summary.csv` and `summary.numbers` to `.gitignore`. Sorted the result with `bin/sgi.sh`. Perform `make quick_www` to perform the above and test under macOS. Perform `make www` to perform the above and test under macOS.
To build:
make all
There is an alternate build (same code, alternate build) that uses more memory. See Alternate code below for more details.
To use:
./weisberg
Try:
./try.sh
If you have primes(1) installed you might also wish to try:
./primes.sh number
where number is a positive number, defaulting to 15. The
try.sh script will also try :-) and do
this.
Alternate code:
If you liked what you saw from the above program, and happen to have some 512 megabytes of virtual memory lying around with to do something with you might try this build.
Alternate build:
make alt
Alternate use:
./weisberg.alt
Lesser systems will find this alternative version a good way to create a core file. :-)
Judges' remarks:
This entry confuses some C-preprocessors and some C-beautifiers.
We found one cpp that processed this source differently when
it was read on stdin instead of via cc -E.
Author's remarks:
Description
The following short program implements the "Yet Another" algorithm for generating prime numbers. It will generate all primes up to 33554432, displaying them to the standard output as it churns along. As 33554432 is rather large on most machines, this code may take quite some time to run to completion, so as an added feature, it will cease execution upon reception of a signal (any will do equally well), as well as in the event of a system shutdown or reboot.
Bugs
The alternative build (weisberg.c
compiled to weisberg.alt) has never actually run
to completion. After running for close to a week it had reached somewhere around
250e6, when it became necessary to test the reboot feature (which worked
remarkably well). As there are quite a lot of primes to be found before reaching
INT_MAX, the output produced can be quite overwhelming so it's recommended to pipe
the output through your favorite pager (more or less), and not output to a
paper output device (unless you have LOTS of paper).
Technical
The original "Yet Another Prime Program" algorithm used here was developed as a Computer Architecture course micro-programming exercise, and was designed to take full advantage of the UR300 micro-architecture to achieve blindingly fast speed. It was ported to C specifically for the IOCCC. In the conversion/obfuscation step some of (much of) the blazing speed was lost, but as a bonus, the understandability of the code was reduced to zero.