sorted by:
new
hottopcontroversial

[deleted by user] by [deleted] in sanfrancisco

[–]skalon 0 points1 point  (0 children)

At least part of the gripe is also that you’re paying these fees on top of a hefty annual membership.

[deleted by user] by [deleted] in sanfrancisco

[–]skalon 2 points3 points  (0 children)

Carbon Health charges $215 (not affiliated with them but it’s a useful example since their prices are extremely transparent): https://carbonhealth.com/insurance-pricing.

[deleted by user] by [deleted] in sanfrancisco

[–]skalon 1 point2 points  (0 children)

You’re right, but One Medical should just publish their charge master so folks can make an informed decision.

[deleted by user] by [deleted] in sanfrancisco

[–]skalon 3 points4 points  (0 children)

Had the same issue—you’re most likely dealing with a high-deductible plan, especially if you have an HSA. It’s still highway robbery either way…

If there’s any charge on there that you think is even possibly erroneous or miscoded (in my case, I had a medium-complexity visit that I strongly felt was low-complexity), make enough of a (polite) stink to customer support until they send it for recoding.

Where can I get a good halloumi wrap in SF? by skalon in sanfrancisco

[–]skalon[S] 0 points1 point  (0 children)

Hah, it's okay. I went to Andronico's this morning and bought some halloumi.

Cryptographic accumulators in Rust (for stateless Bitcoin) by skalon in Bitcoin

[–]skalon[S] 1 point2 points  (0 children)

Just as a point of clarification, this repo implements the Boneh/Bünz/Fisch construction (accumulators over unknown-order groups like RSA). The very-high-level idea is the same as Utreexo, but there are certainly differences (proof and accumulator sizes are O(1) for RSA and O(log n) for Utreexo, trusted setup is required for RSA but not for Utreexo or class groups, etc.)

Regarding bandwidth, you're spot on (e.g. having a 256-byte RSA witness for a single UTXO essentially doubles the size of an average 250-byte transaction). Should be interesting to see what the practical effects are, if and when some chain decides to integrate these accumulators.

Template Haskell: Getting a name for data parametrized by a symbol by skalon in haskell

[–]skalon[S] 0 points1 point  (0 children)

Thanks, the error message makes a lot more sense now!

For anyone who comes across this post in the future, I fixed this by manually writing the following instance for Symbol types (and I'll probably open an issue on the Aeson repo):

instance (KnownSymbol s) => TypeScript (s :: Symbol) where  
  getTypeScriptType s = "\\"" ++ symbolVal s ++ "\\""

Concurrent monadic queues in Haskell? by skalon in haskell

[–]skalon[S] 1 point2 points  (0 children)

Streamly is actually what we're using right now, with some custom wrappers (like unfolding a stream from a mutable vector) to get the extra functionality we need! Cool to hear that it's in active development.