-
One of the issues with the jackpot is that the size of the Tasks is relative to the size of the jackpot. As in the the maximum cost of a Task is capped in relation to the size of the jackpot.
Each …
-
I'm really not sure it's worth the trouble, but we could improve the amortized times to worst-case using scheduling. Okasaki's scheme uses a separate schedule, which doesn't seem terribly compact, and…
-
_If_ that is case, do we need then to generate the corresponding Merkle Trees?
-
#95 added sliding window min/max functions with big-O optimal amortized bounds. But a new minimum/maximum can force a pause proportional to the number of elements in the window. If we instead use a mo…
-
It would be interesting to port Temboz to Google's AppEngine cloud computing platform.
-
I noticed that some methods return `Vec`s. In particular, it's `stride` and `scalar_collect`. I was wondering if it made sense to expose generic version that could use arbitrary `FromIterator` type. M…
-
## 🚀 Feature
Provide a `pin_memory_` method on tensors (note the trailing underscore) which operates in-place.
## Motivation
Pinning memory using the current `pin_memory` method creates a copy of…
-
### Query vector compression and expansion for PIR
> At a high level, our goal is to realize the following picture: the client sends one ciphertext containing an encryption of its desired index i t…
-
How can I generate/encode data with **zero** heap allocations?
Example use case: I want to generate data to write into a file, so I need to allocate a single structure, message and arena. I can pr…
-
## 목차
1. 분할 상환 분석 기법들
2. 큐
3. 이항 힙
4. 스플레이 힙
5. 페어링 힙
6. 나쁜 소식
7. 참고 사항