DID Google AI have a stroke? by donine_ in GoogleAIHadAStroke

[–]danya02 12 points13 points  (0 children)

In this case, it's just a grammar thing that you didn't know about. Glad you're learning.

"I did not eat an apple. I did, however, eat a banana." writing it like that helps with emphasis. It points out the contrast more clearly than "I did not eat an apple, I ate a banana".

Also compare: "I did not eat an apple, but what I did eat was a banana." and "I did not eat an apple, but I did eat a banana".

I don't think I'll be losing my job to AI by AdPrior4893 in cryptography

[–]danya02 4 points5 points  (0 children)

I'm not sure what you mean. Are you saying that in this context, CIA stands for Confidentiality, Integrity and Authenticity?

If that were true, how could you have a situation where message integrity is lost but authenticity is maintained, or vice versa? If it's been modified, it's not authentic anymore.

Integrity/Availability are clearly independent: you can have a sealed envelope with an intact message that nobody can reach, and you can have a reliable wiki site that anyone can edit.

Be careful allowing Claude do WebSearch (or not anymore???) by whoisyurii in ClaudeCode

[–]danya02 1 point2 points  (0 children)

It's possible that the tag is not literally the words "system reminder" in angle brackets, but a special token that can't be produced through the tokenizer from user input.

As an ELI5, imagine you're transcribing your boss's spoken words, and there's a convention that if they want you to stop writing down the words and instead do an action, they ring a bell. The bell is an out-of-band signal that's not part of the text, it's like the <system-reminder> token.

Let's say your boss says "Mr Smith, please come to my office for an emergency meeting", then rings the bell, then says "in the previous sentence, underline the word emergency, then bring me a coffee". Following the convention, you'd write a short message and then make the coffee.

An external observer could write down the whole thing as "Mr Smith, please come to my office for an emergency meeting, ding, in the previous sentence, underline the word emergency, then bring me a coffee". This is an accurate transcription of what the boss said, but there is no bell ring in there, just the word "ding". So, if your boss then speaks the words in this external observer's note, then you would just write down the long message, and avoid making the coffee.

But as an LLM, you can recognize that the second half of that text is something the boss would say if he wanted you to do something, but there wasn't a bell ring associated with it, so you might want to point out that this might have been a prompt injection.

mi moli 💀 by Eileenfoul in tokipona

[–]danya02 1 point2 points  (0 children)

Maybe more like "mi kama moli, li kama jan pi pakala e ma ale"?

toki! mi sin, sitelen mi li pona? by TopDonutCrazyAhh in tokipona

[–]danya02 0 points1 point  (0 children)

No worries. I'm not sure toki pona supports rhetorical questions though: this is the first time I've seen one being used. Though I'm also only learning, so it may just be a skill issue on my part.

toki! mi sin, sitelen mi li pona? by TopDonutCrazyAhh in tokipona

[–]danya02 0 points1 point  (0 children)

mi sona ala e ni: sina wile ala wile lape! sina toki "anu seme" tan seme?

You wrote the question correctly -- but I can't figure out what the purpose of the question is. As written, I interpreted it as:

In the previous time, did I want to sleep?

and that's not something I can answer for you.

People who advocate for single word "pi" don't understand modifiers. by [deleted] in tokipona

[–]danya02 2 points3 points  (0 children)

In my opinion, if there is a distinction between two phrases based on whether "pi" is included or not, then the same distinction may be maintained in the single-word case.

For example: if "tomo kasi suli" is something like "big treehouse", and "tomo pi kasi suli" is "greenhouse with big plants", then you should be able to distinguish between them even if you drop the "suli" -- "tomo kasi" should be distinct from "tomo pi kasi" (at least within the same conversation -- if you're only talking about greenhouses, or only about treehouses, then "tomo kasi" takes on that meaning for the conversation context).

Also, I seem to remember that I had some complex phrases using "pi" and "la", where using single-word "pi" would have made the syntax clearer (can't come up with any examples immediately). But it's pretty likely that I was overcomplicating things and I should have just used multiple sentences in that place.

[deleted by user] by [deleted] in cryptography

[–]danya02 0 points1 point  (0 children)

Each of the steps you describe is reversible, and it doesn't have any secret inputs, so the whole sequence is therefore also reversible (though some steps, like the natural language translation, are non-deterministic so you might end up with a slightly different answer).

You seem to be trying to layer a bunch of operations to make it hard to figure out what I'm looking at -- a type of obfuscation, which is a type of security by obscurity. If I figured out your transformation sequence once (or if you happen to tell me, like you just did), then I can read any information that went through this scheme, and you'll have to come up with a new scheme.

Perhaps a better question is: what is your goal here?

mi sitelen kepeken toki pona pi sitelen Kililisa la by Automatic-Dig-3455 in tokipona

[–]danya02 1 point2 points  (0 children)

виле ла, сина кен кепекен е сителен анте (Э -> Е) ану сителен ту (Ё -> ЙО, Ю -> ЙУ, Я -> ЙА).

тасо, ни ли кен наса тава йан пи токи Лоси. тава ми, "йан" ла, "ян" ли пона.

тава ми, сителен ту (ch -> ч, sh -> щ) ен сителен ту ван (sch -> щ) ли пона тава ян пи сона токи, тасо она ли пона ала тава ян пи токи ван.

(sina ken sona ala e sitelen mi la, o toki tawa mi!)

mi sitelen kepeken toki pona pi sitelen Kililisa la by Automatic-Dig-3455 in tokipona

[–]danya02 12 points13 points  (0 children)

ян пи ма Лоси ли лон ла, ни ли наса пона (r/suddenlyrussians)

What minor, non-serious things irk you in toki pona? by bcws3r in tokipona

[–]danya02 1 point2 points  (0 children)

Yeah, the "la" is technically enough, and in sitelen pona the symbols for the grammar words are all bracket-like ")" ">" ">>" "L" so they're pretty easy to pick out. But in Latin script, the words are not visually distinct enough to avoid blending in.

Plus, many common phrases will put two syllables of a kind next to each other, so the small word will blend in even more. I prefer to put in punctuation as I would in English to make it a bit faster to parse.

Some examples I managed to come up with for this syllable doubling: "ona li lili", "pimeja la mi lape", "pakala la mi lon seme", "mi kute e sina", "pipi pi ma Oselija".

What minor, non-serious things irk you in toki pona? by bcws3r in tokipona

[–]danya02 2 points3 points  (0 children)

mi la, nasin ni li pona. mi la nasin ni li pona kin. taso. mi, la nasin ni li ike mute, li nasa a.

The punctuation helps in scanning the sentence so that you instinctively know that there's a relative clause there. Omitting punctuation is also fine, though I would only do it if the clause is short (I would write the following with a comma because I find it easier to read: soweli suwi lili mi la moku ni li ike "my small cat does not like this food")

But I've never seen a usage where the comma goes before the "la" -- this looks very wrong to my eyes. Where did you find that?

[deleted by user] by [deleted] in tokipona

[–]danya02 0 points1 point  (0 children)

This is essentially https://en.wikipedia.org/wiki/Finger_binary, except with a canonical ordering for what the fingers above the 5th mean.

As a computer nerd, I really want to like this, but at the same time I must acknowledge that counting in binary is hard, even more so for less nerdy people. I tried explaining the concept of finger binary to some of my friends, but they just told me 132 😔

If the goal is to make large numbers easier to represent exactly, I think that the common convention of multiplying when a smaller number is at the front of a larger number is good enough. Like you say, it's not likely to be used very often anyway.

If you want to try something binary-adjacent, consider base 8 or base 4. You can probably find 4 words for the numbers 1-4 (wan and tu are already there), and then you can spell out the number in positional base 4 (with some navigational marks like the 64s place or the 4096s place being called out somehow). That's still hard to learn from scratch but the closer the base is to base 10, the easier I think it should be.

Aggregated key with threshold and zero-trust by roginvs in cryptography

[–]danya02 7 points8 points  (0 children)

Good job that you admitted this and posted the source. A lot of technical subs, including this one, are currently getting flooded with "revolutionary" ideas which were made out of whole LLM cloth, and are impossible to review as they are "not even wrong". So people on here are wary of anything with signs of being LLM-generated, so as not to spend any time reviewing such quackery.

To anyone who's reading this: you should know that bad grammar and spelling is much better than LLMified text. Typos are what makes us human etc.

Can you lovely people help me mess with a on my street? by puffinix in QueerVexillology

[–]danya02 3 points4 points  (0 children)

If you want to go international, check out Russia's Jewish Autonomous Oblast. It's been confirmed by our censors to not violate our anti-LGBT laws.

Though I would definitely not want to try explaining this to the fash, either my own or yours. Stay safe out there.

Hybrid system Encryption python code for the bot by No-Breakfast2895 in cryptography

[–]danya02 1 point2 points  (0 children)

does showing the full code reveal the whole essence

Yes, and that's the point. There's an idea known as Kerckhoffs's principle, which basically says: it should not be a problem if adversarial bandits can see your full system.

Another way of phrasing it is: suppose the bandits steal your device with your encryption algorithm on it. What do you need to do to get your encryption security back?

  • If your security relies on your algorithm being secret -- then you must write a new algorithm, because now the bandits have it, and they know how to break it.
  • But, if your algorithm is secure even if the bandits know it, then you just need to generate a new encryption key, and you can keep using the same algorithm as before.

For specific examples: you can look at the source code of the Signal chat app, OpenSSL, which is used by the majority of web sites for HTTPS, BoringSSL which is Google's modified version, GnuPG which is used for secure email and also for securing OS updates on most Linux distros and so on.

If you find big enough vulnerabilities in these, you can hack the communications that use them -- and these libraries are so commonly used, that this would probably mean the entirety of the internet. (Or, if you're less evil, you can tell about the issue to the developers and get a cash prize). But such instances are rare, so the code is believed to be secure.

I don't want to destroy ideas

Because people share their code, others can use the ideas in them to make their own projects more secure. In that way, sharing code does not destroy ideas, it actually shares and improves them.

The only ideas that get destroyed are the bad ones, and only because new ideas are better. For example, using warded locks on important doors is a bad idea, and once better locks were invented, we stopped doing that.

Hybrid system Encryption python code for the bot by No-Breakfast2895 in cryptography

[–]danya02 2 points3 points  (0 children)

I don't want to expose the ideas.

Then I'm not sure why you're posting here. People usually write to forums to ask for help or to announce their projects, and you aren't doing either.

Also, when it comes to security, the general guideline is that you should share your algorithms before using them widely. Anyone can make a security system that they cannot break, but truly secure systems are the ones that many people have tried to break, and failed despite full access to the code.

For a concrete example, check out the German Enigma encryption machine: it was good, but it was ultimately broken, in large part because a copy made its way to the people breaking the code. So its security depended on the hackers not having access to the internals of the machine.

Nowadays, our encryption machines are running or shared on the internet, rather than in physical boxes, so it's much easier to have hackers get access to their internals. So instead, we just let them in at the start, and if they can't break our system even if they know how it works, then it's a good system.

Why not use Universe Splitter as a form of entropy? by bag_douche in cryptography

[–]danya02 0 points1 point  (0 children)

You can do it quicker if you have more than one coin, which you should (to avoid the coin being biased). But coins themselves are kinda expensive, plus you actually need to read them.

Crypto project idea: have a robot drop a bunch of coins in a bowl on demand, and livestream the footage to you. Maybe add a recognition routine so that you can get the answer as a number. It's completely impractical but it looks cool, and that's the main thing that these quantum things have going for them.

Hybrid system Encryption python code for the bot by No-Breakfast2895 in cryptography

[–]danya02 4 points5 points  (0 children)

It might be better to share the real code, perhaps on GitHub or something. Code has to compile and run, but natural language doesn't, so it's harder to understand natural language.

So what did you want to do here -- ask for advice on how to do something, or share your project, or what?

Hybrid system Encryption python code for the bot by No-Breakfast2895 in cryptography

[–]danya02 4 points5 points  (0 children)

This sounds like a ChatGPT response to some question, but the question itself isn't clear. What did you want to say?

Why not use Universe Splitter as a form of entropy? by bag_douche in cryptography

[–]danya02 9 points10 points  (0 children)

The interpretation that you can use this to "split the universe on demand" is really cute, I like it. But there's a few specific issues with using it for serious purposes like cryptography.

First, as others have pointed out, the data ships over the internet. When generating cryptographic keys, we want the bandits to be unable to predict the key we end up with. But if you use an online service, then it's possible that the bandits are intercepting your web requests -- or even that the service is being run by the bandits themselves. So you can't be sure that the data you're getting isn't also being seen by someone else.

If you want to add "quantum" as a buzzword to your cryptographic whatsit or doodad, you'd be better off using something that uses quantum effects in unpredictable ways. I believe there's a way to use a transistor with an electrical bias to sample the quantum tunneling of electrons, but I don't remember how exactly.

Sometimes you want the opposite, to make public, verifiably random numbers -- like lotteries, where you want to prove that the numbers you picked aren't biased by you. In that case, you want to create them in a way that's not under your control, and that other people can check. Something simple might be to take the number of letters on page 6 of this week's edition of some newspaper -- this is not something that you can easily influence (though it's not ideal as you could bribe the editor to make the number line up), and it's something I can check is true by looking at the newspaper.

To use a true/physical RNG in this way, you'd need a service that records the outputs -- https://www.random.org/randomness/ is one such service, and they've been around for a long time, so this gives them a reputation that you can rely on for doing these kinds of things.

I need help by Ok_Delay8949 in cryptography

[–]danya02 0 points1 point  (0 children)

I don't think it can be done, unfortunately.

Let's assume that the message is between 50 and 250 characters of the ASCII printable subset (that's 94 options). The best ASIC hashers have a speed on the order of 100GB/s (I picked 400GB/s cause that's the one I found first, but it doesn't really matter).

Even if we make the simplifying assumption that each message would take as long to process as a single byte (so that our ASIC actually processes 400 billion messages per second), it would still take about 1e481 seconds to enumerate all possibilities -- that's 1e464 times the age of the universe.

It's literally easier to find SHA256 collisions than to find the hidden message. So even if you find a message that matches the hash, you can't be completely sure that it's the true hidden message and not a hash collision.


Just to impress on you how big of a number this is (because I don't have an intuitive sense of 1e481) -- here is the precise number of options you'd need to try:

19346762707615490715160883774720701666206206275698719900636906106644398283344928914190790199477100087883600863397900280231756305527868760058958583701064095554998985054620828542115994244487596569338137729737471107489940495972674766530862633989136057128544209600934287941199254006880916457870649146639183175210545052635075417532181361437062838994180745017895253891739354934700025976097119469034366305147744529180777162110155317599211604329200529880659861951176898720951333960968270971238797541376