1,458 karma · joined June 16, 2015
London
https://davidadler.pages.dev/
https://github.com/mfbx9da4
dalberto [dot] adler [at] gmail [dot] com
With a founding team of just two we closed a seed round of £2.75M in July 2022. We’ve since hired two engineers. We plan on keeping the engineering team as small as possible with a highly selective hiring process. Our app is built in React Native but we are only considering candidates with significant Swift / Objective-C experience as building a high quality app often requires dipping into the native APIs. This is an opportunity to be part of a founding team building a high quality product.
Onin is a social calendar, with an emphasis on security. Conventional calendars are geared towards businesses, but Onin is designed for personal use among friends and family. Every event is paired with a chat. Above all, we prioritize the privacy of our users and guarantee that all user-generated content is protected by end-to-end encryption. Onin was founded by Ryan Brodie [0]. Ryan has had four successful exits and is a YC alumn.
Apply by sending me an email with the subject “HN Who’s Hiring” to david_at_onin_dot_co
The app: https://onin.co
With a founding team of just two we closed a seed round of £2.75M in July 2022. We’ve since hired two engineers. We plan on keeping the engineering team as small as possible with a highly selective hiring process. Our app is built in React Native but we are only considering candidates with significant Swift / Objective-C experience as building a high quality app often requires dipping into the native APIs. This is an opportunity to be part of a founding team building a high quality product.
Onin is a secure social calendar. Calendars are built for enterprise, Onin is a calendar built for friends and family. We believe that chat is the best way to plan and discuss events so every event is linked to a chat. We value highly the privacy of our users so all user content is end-to-end encrypted. Onin was founded by Ryan Brodie [0]. Ryan has had four successful exits and is a YC alumn.
Apply by sending me an email with the subject “HN who’s hiring” to david at onin dot co
What would be an example?
* Queries are encoded into sql and matcher functions
* Whenever data is mutated a change set is emitted - eg similar to immer
* This change set is used to generate SQL UPDATE statements
* The change set is also sent to matcher functions, the matcher functions update the query results accordingly
This kind of solution can be built on top of TinyBase without CRDTs.
https://www.diffnow.com/compare-clips or http://incaseofstairs.com/jsdiff/
Does anybody know any better alternatives which work with pasting?
By “crack” they mean, prove the theorem holds. They make it sound like somebody hacked into Fermat’s last theorem and found an exploit which broke a bunch of cryptography, that’s not true. (Unlike Fermat’s little theorem, which underpins RSA, Fermat’s last theorem has no relevance to crypto AFIK).
I know very little about quantum computing but my understanding is that it will just be a much more powerful computer and therefore all the current key sizes that we use for cryptography will be rendered vulnerable to brute force attacks. Maybe these algorithms just find a practical ways of increasing the key size?
It sounds like the assumption is quantum computers will actually solve some fundamental things in number theory we don’t know how to do e.g. find an efficient algorithm for prime factorisation…