djent
A reimplementation of the Fourmilab/John Walker random number test program ent with several improvements.
Science Score: 44.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
○DOI references
-
○Academic publication links
-
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (8.7%) to scientific vocabulary
Repository
A reimplementation of the Fourmilab/John Walker random number test program ent with several improvements.
Basic Info
Statistics
- Stars: 14
- Watchers: 4
- Forks: 2
- Open Issues: 0
- Releases: 1
Metadata Files
README.md
djent
djent is a reimplementation of the Fourmilab/John Walker random number test program ent.
The improvements are:
- Multiple input file names can be provided at once. This works nicely with the CSV format output.
- -h works as well as -u to get the help information.
- The filename is present in CSV output
- The symbol size can be any number of bits up to 32. ent was constrained to 1 or 8.
- The SCC test can be either wrap-around or not wrap-around.
- The SCC result can be given a lag value to get a LAG-N correlation coefficient.
- A list of filenames to analyze can be read from a text file using -i filename.
- Test condition details (Volts, temp, id etc.) can be parsed from the filename and included in output.
- MCV Min Entropy is estimated in addition to Shannon Entropy. The symbol and entropy are both reported
- The longest run and the symbol in the longest run are reported. For 1 bit-per-symbol analysis, a p-value is computed of the probability of a uniform random bit sequence having a longest run length equal to or less than the meaured run length.
```
djent -h
Usage: djent [-brRpcCuhds] [-l
Compute statistics of random data. Author: David Johnston, dj@deadhat.com
-i
Notes
* By default djent is in hex mode where it reads ascii hex data and converts it to binary to analyze.
In hex mode, the symbol length defaults to 8, so normal hex files can be treated as a representation
of bytes. The symbol length can be changed to any value between 1 and 32 bits using the -l
Examples Print this help djent -h
Analyze hex file from stdin cat datafile.hex | djent
Analyze binary file djent -b datafile.bin
Analyze several files with CSV output djent -t data1.hex data2.hex data3.hex
Analyze ascii symbols - Read in binary and set symbol size to 8. djent -b -l 8 textfile.txt
Analyze binary file with parsable filename. djent -b -t -p rawdataCID-X23PROC-TTFT1p2V25p0C_.bin ```
Owner
- Name: David Johnston
- Login: dj-on-github
- Kind: user
- Location: Oregon, USA
- Website: www.deadhat.com
- Repositories: 32
- Profile: https://github.com/dj-on-github
Arch Grumpy Coder. Designer of random things. Author of "Random Number Generators, Principles and Practices" DeGruyter Press, ISBN 978-1501515132
Citation (CITATION.cff)
# This CITATION.cff file was generated with cffinit.
# Visit https://bit.ly/cffinit to generate yours today!
cff-version: 1.2.0
title: djent
message: >-
If you use this software, please cite it using the
metadata from this file.
type: software
authors:
- given-names: David
family-names: Johnston
email: dj@deadhat.com
orcid: 'https://orcid.org/0009-0002-5149-9414'
repository-code: 'https://github.com/dj-on-github/djent'
abstract: >-
djent is a reimplementation of the Fourmilab/John Walker
random number test program ent.
The improvements are:
Multiple input file names can be provided at once. This
works nicely with the CSV format output.
-h works as well as -u to get the help information.
The filename is present in CSV output
The symbol size can be any number of bits up to 32. ent
was constrained to 1 or 8.
The SCC test can be either wrap-around or not wrap-around.
The SCC result can be given a lag value to get a LAG-N
correlation coefficient.
A list of filenames to analyze can be read from a text
file using -i filename.
Test condition details (Volts, temp, id etc.) can be
parsed from the filename and included in output.
MCV Min Entropy is estimated in addition to Shannon
Entropy. The symbol and entropy are both reported
The longest run and the symbol in the longest run are
reported. For 1 bit-per-symbol analysis, a p-value is
computed of the probability of a uniform random bit
sequence having a longest run length equal to or less than
the meaured run length.
license: GPL-2.0
GitHub Events
Total
- Push event: 2
- Fork event: 1
Last Year
- Push event: 2
- Fork event: 1