PS: Still it is important to get this code fast, because it is the
fallback for all situations where I cannot cheat and only calculate
a subset of the trust, and it is required at startup.
Dr. Arne Babenhauserheide writes:
> Hi Linus,
>
> Linus Björnstam writes:
>> I had a look and ther
Hi Linus,
Linus Björnstam writes:
> I had a look and there is quite a lot you can do. Just out of
> curiosity: how much is GC time? You are generating a lot of
> intermediate data. Instead of vector-append! maybe use something like
> the new vectorlist srfi? If you show me a flame graph and give
I had a look and there is quite a lot you can do. Just out of curiosity: how
much is GC time? You are generating a lot of intermediate data. Instead of
vector-append! maybe use something like the new vectorlist srfi? If you show me
a flame graph and give me some test data I can have a go!
--
I’d like to contribute a basic implementation of the Web of Trust in
Freenet that provides spam-detection without centralized control:
https://hg.sr.ht/~arnebab/wispwot/browse/wispwot/wispwot.scm
Currently this takes 70s to calculate aggregated trust scores on 300k
trust edges.
I hope to get thi
