
rrobukef
u/rrobukef

Due to battery issues with the Charge 5, I'm not buying and looking for an alternative. What smartwatch is close in options? I'm looking for the following:
- Sport tracking for swimming and skating,
- Built-in GPS for skiing,
- Map display if possible,
- Open API's if possible
I wouldn't mind being helped, but since the problems are very specific, this is more of a rant!
I now have my Aspire almost a year. Like all things it could be improved, but still I like it and have no regrets. However, this is rapidly changing. Since I've moved, my pc started crashing on both windows and linux with resp. BSOD's and kernel panics when I try to connect to wifi. A stream of errors vomited all over my disk-space, the log-file was larger than 'yo mama. I installed the latest firmware drivers, it didn't help. No, that's wrong, it broke my GPU ... wat? Other access points with the same name and password still work. I've since stopped connecting to this access point. And slowly
I'm looking for an implementation in any language of a hashed /unordered multimap that isn't a hashmap of keys K to collections V. Most multimaps I've found are wrappers with to Map<K, Coll<V>>.
Because I need to map up to 640000 elements to a collection of values with on average 1.36 elements but up to X000 at a time I need to consider a flattened multimap. The simple approach suffers from either memory buildup, measurable quadratic time complexity or memory overhead due to unfilled buckets.
Does anyone have an example of such an unordered multimap?
EDIT: For an elliptic curve group (G,+) with generator g of prime order.
Can this be done efficiently, without discrete logarithms?
I don't think DH can be broken with just y and z, so it could be possible. Google searches for `elliptic curve inverse' didn't give relevant results.
I first thought about asking for c=g^(x²) but you can break the Diffie-Hellman encryption with this [1], so it shouldn't be possible (I'm not smart enough to accidentally break discrete log problems)
[1] Given g^a, g^b calculate g^a², g^b², g^([a+b])², g^(2ab) = g^([a+b]²-a²-b²), g^(ab) = (g^(2ab))^(1/2)
I have a table with a text column("run") that is finite (~1570 values). The length of these strings is about 30+ characters. Since each value is duplicates a lot of times I'm looking for decomposing these values in a table with a primary key (3rd normal form).
Is there support in sqlite itself to decompose this automatically? eg. insert statements keep working without changing the query. Is there a way to do this without resorting to any programming? (I'd like to keep using the command line for my simple use)

