PANGRANDOMONIUM : Rhizome Function Anagram Random Generator | Zenodo
Skip to main
You are using an outdated browser. Please upgrade your browser to improve your experience.
Published July 25, 2026
| Version v1
Preprint
Open
PANGRANDOMONIUM : Rhizome Function Anagram Random Generator
Authors/Creators
Buckbriar, Byrl Raze<br>(Researcher)
Description
Herein are described principles and a scheme of random number generation styled as, pangrandomonium, or ‘pangrand’. Pangrand is a anagrammatic random number generator that uses rhizome functions as chaotic indexing and shuffling instructions to reorder and sum perfect pangrams. Brief descriptions are given for the principles of pangram summing and rhizome indexing functions, Source code of the random number generator is included herewith. The source code is attached to the PDF file.
Sections:
1. Pangrams (Holoalphabetic arrays) ;
2. Rhizome Functions ;
3. Rhizome Hardness Problems ;
4. Random Generator Methods ;
5. Errata ;
6. Source Code.
About the included demonstration software:
This random number generator mixes unpredictable timestamp entropy into a pool by using the timestamp bytes as generators for shuffling three arrays of pangram bytes. Each pangram contains the bytes 0 to 255 shuffled randomly. After much shuffling two arrays are added together for output. One array is used as the seed for the next output.
512 clock bytes are converted into 256 bytes of output in each round. The generator values are derived from an accumulator pair of 128 bits total.
This method is useful because the shuffled bytes never change value. They just change their positions in the arrays. Using the shuffled data as instructions for transforming the input data guarantees a very good distribution of random instruction values. Then we use the transformed input as instructions to repeat the process on the shuffled data arrays. Moreover, if we add the bytes across the two pangram alphabets, the output can't be correlated to the secret values. A huge number of random array states yield same output of one block yet will not match on the following block of output.
Since output values are dependent on pangram positions, and changing two value positions affects all forward transformations, it is mathematically hard for an attacker to manipulate internal state to a desired ordering. One change is likely to form a algebraic road block to further calculated changes of the pangram orderings.
Files
pangrandomonium.pub.pdf
Files<br>(149.3 kB)
Name<br>Size
Download all
pangrandomonium.pub.pdf
md5:00687163c8f2acb02731de5739b9376f
149.3 kB
Preview
Download
Additional details
Identifiers
Other
darcid:tnkr5dyugwspv4f3xzaomqcb2el76ihj
Related works
Is variant form of
Preprint:
10.5281/ZENODO.18448042
(DOI)
Software
Programming language
Pascal
393
Views
Downloads
Show more details
All versions<br>This version
Views
Total views
393
393
Downloads
Total downloads
Data volume
Total data volume
746.5 kB<br>746.5 kB
More info on how stats are collected....
Versions
External resources
Indexed in
OpenAIRE
Communities
Details
DOI
DOI Badge
DOI
10.5281/zenodo.21551292
Markdown
[](https://doi.org/10.5281/zenodo.21551292)
reStructuredText
.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.21551292.svg<br>:target: https://doi.org/10.5281/zenodo.21551292
HTML
Image URL
https://zenodo.org/badge/DOI/10.5281/zenodo.21551292.svg
Target URL
https://doi.org/10.5281/zenodo.21551292
Resource type<br>Preprint
Publisher<br>Zenodo
Rights
License
Creative Commons Attribution 4.0 International
The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited.
Read more
Copyright
Copyright (c) 2026, Byrl Raze Buckbriar (octade.net)
Citation
Export
Technical metadata
Created
July 25, 2026
Modified
July 25, 2026
Jump up
This site uses cookies. Find out more on how we use cookies
Accept all cookies<br>Accept only essential cookies