entelechy
Joined 12 years ago
Karma
933
Submissions
235
Member since
Oct 13
CEO of LoopPerfect
https://www.loopperfect.com
https://www.buckaroo.pm
View on Hacker NewsRecent submissions
Comment · 2 months ago
As someone who conducts interviews regulary - tools like this worry me a lot.
In my experience most interviewees are very awkward when using these tools thought. They usually take a lot of time to give answers to even simple questions and often seem to read things off the screen. Nevertheless worrying and i'm sure some learn how to hide their use better
Comment · 1 year ago
mostly strace and it's macos equivalent; Later we moved to ptrace and ebpf. LD_PRELOAD unfortunately doesn't work for statically linked libc.
There are also kernel probes but didn't like that it required root permissions...
Comment · 1 year ago
Love it!
We did something similar using strace/dtruss back in 2018 with https://buildinfer.loopperfect.com/ and were generating graphs (using eg. graphviz and perfetto.dev) and BUCK files on the back of that
Whilst we regrettably never came around to package it as a propper product, we found it immensly valuable in our consulting work, to pinpoint issues and aid the conversion to BUCK/Bazel. We used graphviz, https://perfetto.dev/ and couple other tools to visualise things
Recently we cicled back to this too but with a broader usecase in mind.
There are some inherent technical challanges with this approach & domain:
- syscall logs can get huge - especially when saved to disk. Our strace logs would get over 100GB for some projects (llvm was around ~50GB)
- some projects also use https and inter process communications and that needs ot be properly handled too. (We even had a customer that was retriving code from a firebird database via perl as part of the compilation step!)
- It's runtime analysis - you might need to repeat the analysis for each configuration.
Comment · 6 years ago
Indeed I didn't remember it correctly:
According to https://tfhe.github.io/tfhe/ states:
> Each binary gate takes about 13 milliseconds single-core time to evaluate, which improves [DM15] by a factor 53, and the mux gate takes about 26 CPU-ms
Addition of two bits can be implemented using 5 binary gates (fulladder) Hence to add 2 32 bit numbers ~416ms => 2 additions per second
EDIT: Shame I cannot edit my original post
Comment · 6 years ago
ohh interesting!
Are there any opensource implementations of homomorphic numerical processing?
Were there any efforts of combining both approaches?
Comment · 6 years ago
Great work!
This allows to perform arbitrary computation on untrusted devices.
However last time I checked computation in this scheme is ridiculously slow: on modern machines, cutting edge implementation of FHE manage to get around 100 integer operations per second.
Never the less there have been some brave startups trying to commercialise this technology:
https://venturebeat.com/2020/02/18/enveil-raises-10-million-...
Other interesting things build on top of FHE:
sql database where data and queries are fully encrypted: https://github.com/zerodb/zerodb
fully encripted brainfuck vm: https://github.com/f-prime/arcanevm
Comment · 7 years ago
doesn't work for me: "IP could not be resolved"
Comment · 7 years ago
The story behind the fake company:
https://www.youtube.com/watch?v=fTHg-tGvlJ8