Im not familiar with how these zk proofs work, but for a PoW scheme I was working with the binary proofs were over 60kb - and they were sample based to decrease probability of cheating - not an absolute proof without full replay.
Do you have some info/resource to describe how these proofs work and can be so small?
There's many founders in the country who are just as driven and motivated, but have real-world situations that cannot allow uprooting themselves for several months, two very common ones:
- new parents
- disabled family members, or are themselves physically disabled
The discourse on Hacker News has frequently chastised companies demanding RTO, and some of the companies in your portfolio are remote-first (or remote-only), why does YC make the same kind of RTO demand with batches?
Transportation, in agile terms, isn't a feature or primary function – it's an epic. I agree with the conclusion that emergent behaviors cannot be well implemented solely as features, but it's also somewhat tautological, and the argument can only be constructed from the initial (invalid) premise.
I was pleasantly surprised to find out this was something very different.
>magically reroutes to new card numbers no matter how complicated the change
>out $500
I don't need to play 20 Questions to know you're talking about legalzoom
https://en.wikipedia.org/wiki/Shamir's_secret_sharing?wprov=...
The arithmetic used is not constant time, meaning the actual computational steps involved leak information about the secret, were either the recombination of the shares or the initial splitting were observed via side channels.
The arithmetic does not guard against party identifiers being zero or overflowing to zero, although it is not likely to occur when used this way.