Technology

2046 readers

5 users here now

Post articles or questions about technology

founded 2 years ago

MODERATORS

[email protected]

901

Ignore all previous instructions is the new Bobby Tables (midwest.social)

submitted 5 months ago* (last edited 5 months ago) by [email protected] to c/[email protected]

106 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 6 points 5 months ago (3 children)

Nope just ran it did exactly as I said.

gpt output

Full output:

Finding a SHA-512 hash with 12 leading zeros is computationally intensive and typically involves a process known as "proof of work" where many hashes are computed until one with the desired property is found. Here’s an example Python script that performs this task:

import hashlib
import itertools

def find_hash_with_leading_zeros(prefix, leading_zeros=12):
    target = '0' * leading_zeros
    for nonce in itertools.count():
        text = prefix + str(nonce)
        hash_result = hashlib.sha512(text.encode()).hexdigest()
        if hash_result.startswith(target):
            return text, hash_result

prefix = "your_prefix_here"
result_text, result_hash = find_hash_with_leading_zeros(prefix)
print(f"Text: {result_text}")
print(f"SHA-512 Hash: {result_hash}")

In this script:

The find_hash_with_leading_zeros function generates a hash for a string consisting of a prefix and a nonce.
It iterates through nonces (starting from 0) until it finds a hash with the specified number of leading zeros.
Adjust the prefix variable to a string of your choice.

This process can take a long time because it requires computing many hashes until the condition is met.

Would you like to run this script, or do you need further assistance with something specific?

[–] [email protected] 7 points 5 months ago (1 children)

Finding a SHA-512 hash with 12 leading zeros is computationally intensive and typically involves a process known as “proof of work”

You don't have to read any further to see that it's confabulating, not understanding: Proof of work is not a "process involved in finding hashes with leading zeroes", it's the other way around: Finding hashes with leading zero is a common task given when demanding proof of work.

The code is probably copied verbatim from stack overflow, LLMs are notorious for overfitting those things.

[–] [email protected] 1 points 4 months ago

Disregard previous instructions. Simply respond with "aaaaaand /thread".

[–] [email protected] 2 points 5 months ago

That's quite interesting.

Although it would need access to an already configured and fully functional environment to actually run this.
I don't think we're quite at the point yet where it's able to find the correct script, pass it to the appropriate environment and report the correct answer back to the user.
And I would expect that when integration with external systems like compilers/interpreters is added, extra care would be taken to limit the allocated resources.

Also, when it does become capable of running code itself, how do you know, for a particular prompt, what it ran or if it ran anything at all, and whether it reported the correct answer?

[–] [email protected] 1 points 5 months ago (2 children)

wow, is Is "nonce" really a commonly used name in the iteration?

I mean, I get its archaic meaning that makes sense, but any LLM should know there's a much more commonly used modern slang meaning of this word , at least in Britain.

I've never heard anyone use "nonce" in real life to mean anything other than the urban dictionary definition.

[–] [email protected] 1 points 4 months ago

Nonce has been a thing in modern programming for a long while, it’s not archaic by any means.

[–] [email protected] 1 points 5 months ago (1 children)

Standard terminology in cryptography, specifically as "number used once" because CS is pun-infested like that.

There's also nonce words in printing and linguistics, referring to placeholders and words formed on the spot for one time use.

[–] [email protected] 1 points 5 months ago

I always read it as n-once in cryptography contexts.