« first day (4554 days earlier)      last day (586 days later) » 

00:46
hihi
@AviFS hi there hello (again :p)
Sandbox posts last active a week ago: Survival Chess
 
3 hours later…
04:03
what does one call a backronym of an acronym?
i saw an advertisement somewhere for something called A.S.A.P (Accelerated Study in Associate Programs)
 
1 hour later…
05:26
@mousetail it doesn't
@SuperStormer Can you send a screenshot please?
Ah ok so the letters are visible but there are the weired icons making it hard to read
05:47
0
Q: Code Golf for Golf

Shiran YuanMy first code golf question post! Hope u like it ;-) The task is simple. Write either an stdin-stdout program or a function. Input is a 2D array which contains only either characters or the integer 0. If your language of choice does not support mixed types in an array, replace the integers with t...

 
4 hours later…
10:02
0
A: Sandbox for Proposed Challenges

Shiran YuanThe Fast and Golf-ius Challenges I am planning on creating a series of cops-and-robbers style challenges. My inspiration is the coexistance of code efficiency problems and code golfing problems on this site - and the problem that code efficiency challenged seem to be often overlooked, even though...

 
1 hour later…
11:32
0
A: Sandbox for Proposed Challenges

bsoelchSymmetrize a number Based on sequence A033865 in OEIS. Start with a positive integer n if nis a palindrome return n. Otherwise add the number obtained by reversing the digits of n to n. Repeat this until the resulting number is a palindrome (for some inputs this may not terminate). Examples: 12486 -

-78
Q: Stack Overflow at WeAreDevelopers World Congress in Berlin

RosieWe wanted to let everyone know that Stack Overflow will be at WeAreDevelopers World Congress in Berlin, Germany on July 27 and 28! We’ll be participating in several different sessions where we’ll share the work we’re doing to help developers with the challenges they’re facing in 2023 and beyond. ...

12:07
0
A: Sandbox for Proposed Challenges

bsoelchMaximal minimally Turing-Complete language I will call a language minimally Turing-complete if it is Turing-Complete, but removing any operation from the language will make it no longer Turing complete. Your goal is to write an interpreter from a NEW language, that is minimally Turing complete bu...

12:30
0
Q: Can the binary representations of argv[n] be used for numeric input?

12431234123412341234123TL;DR: Is int d = *(int*)argv[1]; allowed to obtain a integer input? A special case of this question: Can numeric input/output be in the form of byte values? This is mostly for C, C++, assembly and languages with similar properties. Lets say the programs needs a integer or floating point as input...

12:50
0
A: Sandbox for Proposed Challenges

bsoelchEnumerate all polynomials The set of all polynomials with integer coefficients is countable. This means that there is a sequence that contains each polynomial with integer coefficients exactly once. Your goal is it to write a program or function that outputs such a sequence Example (you may use a...

They are on a rolll
 
1 hour later…
14:13
PSA: Please don't use VLQ/NAA flags on invalid answers. I've been seeing this a ton in the LQP queue recently. If an answer is invalid, mod flag it, as if it ends up in the low quality queue, either nothing will happen or it will get deleted without bring properly handled. If you see an invalid but otherwise okay (i.e., not spam and contains code) answer in LQP, mod flag and vote "Looks OK".
3
(oh, just realized a subset of that's already pinned lol)
Maybe a reminder on Meta could be a good idea in case people who aren't in chat have been reviewing or flagging
14:29
Probably yea, proportionally not many people ever visit chat
15:20
their loss
Well, TNB's not where the fun happens anymore I guess
(my bad)
15:44
@mousetail add the gold badge and you have 10,000 rep
Why not add all the badges?
Then I'd have 1,094, even better
@mousetail silver and bronze badges are worth 0.
Why?
Some bronze badges are harder to get than some gold badges
@mousetail because they're worse than gold
15:46
I disagree
@mousetail example?
@PlaceReporter99 Well if we're comparing value of things, one gold badge and one rep point wouldn't exactly be on the same level :p
Tag badges are harder to get than Fanatic
@PlaceReporter99 Synonymizer has only a dozen or so recipients, and it's bronze
(and most of them are mods; getting it without mod tools is even harder)
ooh, I have Synonymizer!
15:48
Peer pressure is also a tag a person with a moral compass would have difficulty getting
Pre-Sandbox: Get the most recent chat message from the nineteenth byte.
@mousetail Yea I got that one...
@RydwolfPrograms how?
Tons of similar questions
What does this one have that's new?
It's just a POST request and some JSON parsing
Yearling is probably the easiest tag to get on the site that can be awarded multiple times
15:50
ok something else
@mousetail Well, getting intentionally, that is :p
@mousetail Nice question's pretty easy too
Yea nice question is pretty easy too
Pre-Sandbox: Send any message in the Nineteenth Byte (login details will be given via input)
15:51
On this site specifically, yearling is easier on most sites
@PlaceReporter99 Even less original
It's just a POST request with some headers
@RydwolfPrograms HOW
Also we don't want to spam TNB with people testing submissions
In general questions are very unlikely to be original
Since the "interface with the internet" requirement is only really fun to golf once
If that
Maybe there could be a challenge for implementing DNS, might be a bit more original
15:54
Challenge: find a SHA-256 hash that becomes itself when hashed (hex digest)
As in. write a program to do that, or actually do that?
@RydwolfPrograms actually do that
The MD5 version of that challenge already exists I think, it would be mostly the same
but you can write a program to do that if you want
@PlaceReporter99 Do you have a billion years?
15:55
lol, finding a fixed point in SHA-256 would literally be breaking the algorithm. It would get you international notoriety
@RydwolfPrograms not illegal
the government will thank you for finding a vulnerability if you report it to them.
Should take about 10^69 years
Well...no...but if anyone was capable of doing it, they wouldn't be doing it because of your challenge
@mousetail nice
@PlaceReporter99 That's not really how it works lol
15:56
You could sell that on the black market for serious money, or maybe win some kind of prize if you are white hat
1. They'd just forward it to the NSA and you'd get pushed off a balcony
2. They'd know about it already
3. Legality has nothing to do with it
IMO it's pretty likely the US government's already got most crypto we use cracked
NIST curves? 100% believe they're klepto'd. Quantum computing? Bet the NSA has it.
And even then it's not like it matters since they've got all the manufacturers and ISPs and cellular providers
If NSA has it so do various criminal organizations
Nah, I doubt it
Things leak all the time
You can't really leak a quantum computer or the ability to tell an ISP what to do :p
16:01
Not those things no
But a algorithm that breaks RSA? If NSA has it they have it too
And if they've got klepto keys for the NIST curves and stuff, those're going to be very securely locked away. The US can take over a country if it gets bored. It's perfectly capable of keeping a few kilobytes of data safe.
I mean give me $10k budget and I could probably design an airgapped system to do the decryption without revealing the secret data, and wipe RAM when any tampering occurs
Pre-Sandbox: Given a list, generator or other appropriate data type of bits, a sequence length and the number of times to measure, report the frequency of each bitstring.
You can't protect data with force
You kinda can
Put it in an airgapped computer and have ten guys with guns and no clue what "cryptography" means stand in a circle around it with five live video feeds and not much is gonna happen to it
Not to that copy no
16:05
Put the computer in a vacuum. Have a pressure sensor. If the seal fails, empty RAM.
And explode for good measure (if the vacuum doesn't do that already) :p
That won't help at all
These organizations have plenty of budget to compute anything that needs computing, all the need is a vague idea of the approach used
I don't think you realize just how impossible it is to break anything over 128 bits
You could have every atom in the universe be used as part of your cluster and you're not breaking it any time soon
That's why you need the idea
16:08
The "idea" is a bitstring as long or longer than the private key
The data is not important, how the data is calculated which is valuable
Kleptography is the study of stealing information securely and subliminally. The term was introduced by Adam Young and Moti Yung in the Proceedings of Advances in Cryptology – Crypto '96. Kleptography is a subfield of cryptovirology and is a natural extension of the theory of subliminal channels that was pioneered by Gus Simmons while at Sandia National Laboratory. A kleptographic backdoor is synonymously referred to as an asymmetric backdoor. Kleptography encompasses secure and covert communications through cryptosystems and cryptographic protocols. This is reminiscent of, but not the same as...
If NSA can calculate it in less than 1000 years so can they, all they need is a method that takes less than 1000 years
> The Dual_EC_DRBG cryptographic pseudo-random number generator from the NIST SP 800-90A is thought to contain a kleptographic backdoor. Dual_EC_DRBG utilizes elliptic curve cryptography, and NSA is thought to hold a private key which, together with bias flaws in Dual_EC_DRBG, allows NSA to decrypt SSL traffic between computers using Dual_EC_DRBG for example.
@mousetail And that method involves the secret data
That's not used anymore
16:11
No, but I'm saying, they could have designed the NIST curves in a way that enables similar attacks
They have some big chunk of data which gives them an enormous advantage when decrypting communications using the curves they engineered
Unless you have that chunk of data though, there's no special technique you can use
So you just keep that data in a secure oracle
I highly doubt that
> Although no attack against the selected values are currently known, it's common practice to never use unexplainable magic numbers in cryptography standards, especially when those numbers are being chosen by intelligence agencies
Look at the alternatives to the NIST curves, like ed25519
They all use nothing-up-my-sleeve numbers
What's up NIST's sleeve? Probably something, given they were chosen by the NSA
And there are plenty of other examples of government intelligence agencies designing algos to give themselves backdoors
I don't doubt that
13
10
13
10
33
68
79
67
84
89
80
69
32
72
84
77
76
32
80
85
66
76
73
67
32
34
45
47
47
87
51
67
47
47
68
84
68
32
72
84
77
76
32
52
46
48
49
47
47
69
78
34
32
34
104
116
116
112
58
47
47
119
119
119
46
119
51
46
111
114
103
47
84
82
47
104
116
109
108
52
47
115
116
114
105
99
116
46
100
116
100
34
13
10
13
10
104
116
109
108
13
10
32
32
32
32
104
101
97
100
13
10
32
32
32
32
32
32
32
32
116
105
116
108
101
notice any patterns in those numbers?
While it's maybe possible they're pulling a DES and actually hiding why they chose those numbers in order to increase security, since 2001, I'm not so sure that's their goal
 
5 hours later…
21:30
@PlaceReporter99 I think you're missing a 60 and a 62...

« first day (4554 days earlier)      last day (586 days later) »