{"id":21651793,"url":"https://github.com/hoytech/npsp","last_synced_at":"2025-08-03T18:35:27.177Z","repository":{"id":144862801,"uuid":"52141162","full_name":"hoytech/npsp","owner":"hoytech","description":"Numerical Palindrome Search Program","archived":false,"fork":false,"pushed_at":"2016-02-20T06:58:20.000Z","size":17,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-25T05:43:00.206Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hoytech.png","metadata":{"files":{"readme":"README","changelog":null,"contributing":null,"funding":null,"license":"COPYING","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2016-02-20T06:57:35.000Z","updated_at":"2024-06-27T01:57:39.000Z","dependencies_parsed_at":"2023-05-05T12:23:59.170Z","dependency_job_id":null,"html_url":"https://github.com/hoytech/npsp","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hoytech%2Fnpsp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hoytech%2Fnpsp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hoytech%2Fnpsp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hoytech%2Fnpsp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hoytech","download_url":"https://codeload.github.com/hoytech/npsp/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244547602,"owners_count":20470103,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-25T07:49:34.429Z","updated_at":"2025-03-20T04:00:12.119Z","avatar_url":"https://github.com/hoytech.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"Numeric Palindrome Search Program\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\n  (C) 2002, HardCore Software\n\n  This program is protected by the GNU General Public License.\n  See the file \"COPYING\" for details.\n\n  Thanks to defrost for the malloc() tip, and a number of optimizations.\n  Defrost has provided advice upon and contributed optimizations to almost\n  every aspect of this code.\n\n\n\nWhat is a Numeric Palindrome\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\nA numeric palindrome is similar to an alphabetic palindrome: It reads the\nsame both forwards and backwards, for example \"A MAN, A PLAN, A CANAL PANAMA\",\nand \"12345654321\".\n\nMost numbers have the property that if added with a number comprised of it's\nown digits but reversed, they will form a numeric palindrome, or if not\nimmediatley, will become palindromes after iterating this sequence a number\nof times.\n\nExample:\n\n100 + 001 = 101\n\n743 + 347 = 1090\n1090 + 0901 = 1991\n\n\nCertain numbers, most famously 196, don't seem to form palindromes no matter\nhow many time this process is iterated. It is unknown whether eventually\nthey will form palindromes or not, however people have continued this on for\nmany million of iterations - with no end in sight.\n\nThis program was started after I was inspiried by a slashdot article. I'm\nnot particularly interested in this problem, but it seemed like it would\nbe a fun programming project, so here it is.\n\n\n\nWhy Use This Program\n~~~~~~~~~~~~~~~~~~~~\n\nNPSP is quite full featured, and it's features rival, if not surpass\nany of it's competitors.\n\n-Itsvan Standard Formatting for both saving and loading.\n-Size of computed number is only limited by your memory (and spare time, of\n course).\n-Autosaving customizable to the second.\n-Fairly optimized, thanks to defrost.\n-Save on exit.\n-User specified base of 2-16 (defrost's alternate implementation supports\n 2-36).\n-Cross platform.\n-Active memory usage reports.\n-Active Iterations per second reports.\n-Free Software (www.fsf.org)!\n-No bullshit GUI. :)\n\n\n\nHow Do I Use This Program?\n~~~~~~~~~~~~~~~~~~~~~~~~~~\n\nNPSP runs on unix and windows. Windows users have been supplied a precompiled\nbinary. You'll find it in windows/npsp.exe. Make sure cygwin1.dll is in\nthe current directory or in your windows directory.\n\nCompiling from source:\n\nOpen up cygwin or fire up a unix console, unpack the archive, switch\nto the root of the tree, and type:\n\nmake npsp\n\nor\n\nmake dnpsp\n\nnpsp is Fractal's original version with some of defrost's optimizations.\nIt also has more features in it's statuc report, along with save on exit.\ndnpsp is defrost's optimized version, and while not as feature full, is\nprobably somewhat faster.\n\nNow you can run\n\n./npsp     (from unix or cygwin)\nnpsp       (from a DOS prompt)\n\nIt will show you this:\n\nNumeric Palindrome Search Program (NPSP) V1.0\n(C) 2002, HardCore SoftWare\n\nusage: npsp \u003coptions\u003e\n\n            -i \u003cinput file (Istvan Standard Format)\u003e\n            -o \u003coutput file (Istvan Standard Format)\u003e\n            -n \u003cseed number\u003e\n            -m \u003cmaximum # of digits to find\u003e\n            -b \u003cnumeric base\u003e\n            -a \u003cseconds between autosaves\u003e\n\n\nI think it's fairly self-explanitory, so I'll just give you some examples:\n\nCompute 196 to 9000 decimal places, and save it in \"myfile.ist\".\n./npsp -n 196 -m 9000 -o myfile.ist\n\nCompute a binary lychell number to a million digits, and print the result out.\n./npsp -b 2 -n 101001 -m 1000000\n\nCompute an additional thousand digits to your previously saved myfile.ist\n(see the first example) and save it back into myfile.ist.\n./npsp -i myfile.ist -m 10000 -o myfile.ist\n\n\n\nNotes\n~~~~~\n\nNote: When loading files, the -m argument specifies the number of digits\nto go to, NOT how many more to calculate.\n\nNote: Istvan standard format doesn't save base, so be sure to specify\nthe same -b as the one you used to save the file, otherwise you will\nalmost certainly get fucked up results. (This should be fixed in Extended\nIstvan Format if it ever comes out).\n\nWindows users: Make sure cygwin1.dll is in your current directory, or in\nyour windows directory.\n\nWindows users: Use this from a DOS prompt. I don't want to say this again.\n\n\n\nCredits\n~~~~~~~\nThis program is copyright 2002 by:\n\nHardCore SoftWare and defrost,\n\nThe authors can be reached on irc.freenode.net (irc.openprojects.net)\non channel #c as Fractal and defrost.\n\nThis program is protected by the GNU General Public License.\nSee the file \"COPYING\" for details.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhoytech%2Fnpsp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhoytech%2Fnpsp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhoytech%2Fnpsp/lists"}