HackerTrans
TopNewTrendsCommentsPastAskShowJobs

rencrisa

no profile record

Submissions

A Guided Tour of Apple Vision Pro [video]

youtube.com
4 points·by rencrisa·2 jaar geleden·1 comments

Blockbuster Alzheimer's paper retracted by former Stanford president

stanforddaily.com
73 points·by rencrisa·3 jaar geleden·136 comments

An Easy, Fast, Open One-Handed Keyboard System

artsey.io
2 points·by rencrisa·3 jaar geleden·0 comments

Faster than Rust and C++: the PERFECT hash table [video]

youtube.com
3 points·by rencrisa·3 jaar geleden·0 comments

The zero-knowledge attack of the year might just have happened

zksecurity.xyz
5 points·by rencrisa·3 jaar geleden·0 comments

Getting Hacked and the Future of the Channel

youtube.com
1 points·by rencrisa·4 jaar geleden·2 comments

comments

rencrisa
·3 jaar geleden·discuss
> nowadays all PhD students generally take something called “Responsible Conduct of Research”

I think that is a broad generalization. I never had to take an ethics in research course as a PhD student.

> falsifying data, plagiarism, how to ethically work in animal models ... image manipulation.

My take is that this may be a "field"-dependent class. My PhD is in a non-experimental field (math); thus, we cannot have these sorts of issues (minus plagiarism).
rencrisa
·4 jaar geleden·discuss
A video documenting a food youtuber's experience of getting ransomware, and trying to recover access to their accounts.

TLDW: Know someone at Google, and they can fill out an internal form.
rencrisa
·4 jaar geleden·discuss
AES256 is still secure, assuming the encryption key has ~256 bits of entropy (32 random bytes). Assuming your master password is reasonably complex, hopefully the encryption key derived from your password has enough entropy.

Despite this, I recommend rotating all passwords (if you don't have the time, prioritize rotating passwords on important accounts / putting MFA on them). For all we know, lastpass might have had a full compromise (i.e. access to unencrypted vaults from malicious source code commits).
rencrisa
·4 jaar geleden·discuss
@utopcell do you have a reference for incremental FFT? I'm not sure if I understand what your implying.

Given a polynomial f(X), obtaining f's evaluations over the n-th roots of unity takes O(nlogn) using FFT. Are you stating that obtaining g(X) != f(X) evaluations over the n-th roots of unity should take O(n) time assuming some precomputation derived in the FFT for f?