m230900
oMiser Articles
HashFlags Technique
Notes & Work Items
|
|
m230900
oMiser Articles |
|
Status |
Date |
Description |
|
|
in progress |
2025-10-24 | Look into pseudo-random generators as ways to generate hashes from other hashes. This would have the HashFlag be treated in some manner as (part of) the current state of an RNG with significant cyclicity. One of the diehard RNGs that have easy next-random procedures might work. GB_FLIP is not suitable in this situation. Also check Knuth on this. This will influence how big we want the HashFlag to be and how we place the Flag bits. [dh:2025-11-04: I an digging around in the Stanford GraphBase and the dieharder offered good RNGs and see how the hashflags can be taken as seeds to generate new ones, especially for pairs. For enclosures and synthetics, different RNG methods could be used. For named individuals, we have the hashing on names to be of assistance.] | |
| done | 2025-09-14 |
Create this this page from the hybridForm examplar |
|
| done | 2024-02-18 |
|
|
 |
|
created 2025-09-14T19:48Z by orcmid |