Frankly speaking, I was waiting for a question abo...

# mathematics

[altavir]

Frankly speaking, I was waiting for a question about why random number generation from distribution is coroutine-based. But since it never came, I can answer it (since It is important). There are several concerns, like remote chain sampling, but for now I am thinking about a feature very important to Monte-Carlo sampling. Namely, ability to use PRNG with fixed seed in a deterministic way even with parallel execution (it is important for testing). This feature does not exist in most frameworks (I believe they have something like this in Julia, but it has limitations). In kotlint, I believe, it could be done by attaching RNG or at least its seed to the coroutine context, which in turn requires deterministic order of context initialization. The issue is here: https://github.com/mipt-npm/kmath/issues/65 and I invite everyone (especially @elizarov and coroutine specialists) to the discussion. It won't be implemented in near future, but I think that if we can manage it, it would be quite an achievement.