# sha256

SHA-256 is a hash algorithm that generates message digests to detect whether messages have been changed.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Searching for RH Counterexamples -- Scaling Up

DevFeed: [Searching for RH Counterexamples -- Scaling Up](<https://devfeed.tech/articles/searching-for-rh-counterexamples-scaling-up-40444.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2021/02/16/searching-for-rh-counterexamples-scaling-up/>)

Published: 2021-02-16T09:00:00Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [scaling](<https://devfeed.tech/topics/scaling.md>), [sha256](<https://devfeed.tech/topics/sha256.md>), [hash](<https://devfeed.tech/topics/hash.md>), [Database](<https://devfeed.tech/topics/database.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [disk-space](<https://devfeed.tech/tags/disk-space.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [performance](<https://devfeed.tech/tags/performance.md>), [postgres](<https://devfeed.tech/tags/postgres.md>), [programming](<https://devfeed.tech/tags/programming.md>), [refactor](<https://devfeed.tech/tags/refactor.md>), [riemann-hypothesis](<https://devfeed.tech/tags/riemann-hypothesis.md>), [scaling](<https://devfeed.tech/tags/scaling.md>), [sha256](<https://devfeed.tech/tags/sha256.md>), [software](<https://devfeed.tech/tags/software.md>)

### AI overview

This article describes scaling a search for counterexamples to the Riemann Hypothesis. It focuses on reducing storage by keeping deterministic SHA-256 summaries instead of every witness value and refactoring the application into a worker architecture.

### Source excerpt

We're ironically searching for counterexamples to the Riemann Hypothesis. Setting up Pytest Adding a Database Search Strategies Unbounded integers Deploying with Docker Performance Profiling Last time we made the audacious choice to remove primary keys from the RiemannDivisorSums table for performance reasons. To help with that, we will do two things in this post Reduce the storage footprint of the whole application (it was 60 GiB when it crashed, and we got up to 84 prime factors).

## The False Allure of Hashing for Anonymization

DevFeed: [The False Allure of Hashing for Anonymization](<https://devfeed.tech/articles/the-false-allure-of-hashing-for-anonymization-29671.md>)

Original publisher: [Read original article](<https://goteleport.com/blog/hashing-for-anonymization/>)

Author: info@goteleport.com (Kevin Nisbet)

Published: 2018-04-30T00:00:00Z

Content type: article

Language: en

Sources: [Teleport](<https://devfeed.tech/sources/teleport.md>)

Topics: [hashing](<https://devfeed.tech/topics/hashing.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Security, Privacy and Abuse Prevention](<https://devfeed.tech/topics/security-privacy-and-abuse-prevention.md>), [data](<https://devfeed.tech/topics/data.md>), [sha256](<https://devfeed.tech/topics/sha256.md>)

Tags: [cryptographic](<https://devfeed.tech/tags/cryptographic.md>), [data](<https://devfeed.tech/tags/data.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [sha256](<https://devfeed.tech/tags/sha256.md>)

### AI overview

The article explains why cryptographic hashing, including SHA-256, does not by itself make personal data anonymous. Hashes of predictable values such as usernames and email addresses can be tested against guesses and identified.

### Source excerpt

Why using cryptographic hashes doesn't make data anonymous.