{"schema_version":1,"metadata":{"branch":"release","release":"7.9","architecture":"amd64","generated_at":"2026-09-09T04:04:02.361425+00:00","source_url":"https://cdn.openbsd.org/pub/OpenBSD/7.9/packages/amd64/sqlports-7.54.tgz","source_sha256":"2de00144847bf9da3a365be982f101dbb55d591ed7a915ea94984a16ab0e0404","package_count":12059,"source_kind":"sqlports"},"package":{"name":"p5-Math-Random-ISAAC-1.004p1","path":"math/p5-Math-Random-ISAAC","url":"/packages/release/math/p5-Math-Random-ISAAC/","comment":"interface to the ISAAC PRNG algorithm","homepage":"https://metacpan.org/release/Math-Random-ISAAC","maintainer":"The OpenBSD ports mailing-list <ports@openbsd.org>","description":"The ISAAC algorithm is designed to take some seed information and\nproduce seemingly random results as output.\n\nHowever, ISAAC (Indirection, Shift, Accumulate, Add, and Count) has\ndifferent goals than other commonly used algorithms. In particular, it's\nreally fast - on average, it requires only 18.75 machine cycles to\ngenerate a 32-bit value. This makes it suitable for applications where a\nsignificant amount of random data needs to be produced quickly, such\nsolving using the Monte Carlo method or for games.\n","package_architecture":"*","stem":"p5-Math-Random-ISAAC","readme":null,"dependencies":[{"path":"devel/p5-Test-LeakTrace","type":"test","package_spec":"","url":"/packages/release/devel/p5-Test-LeakTrace/"},{"path":"devel/p5-Test-NoWarnings","type":"test","package_spec":"","url":"/packages/release/devel/p5-Test-NoWarnings/"}],"reverse_dependencies":{"count":0,"url":null},"categories":["math","perl5"],"flavors":[],"only_for_architectures":[],"not_for_architectures":[]}}