« first day (4583 days earlier)      last day (555 days later) » 
01:00 - 20:0020:00 - 00:00

01:00
Sandbox posts last active a week ago: Verify the Dutch ID number
 
2 hours later…
02:52
PPDispatcher pp = new PPDispatcher(lexer.getDispatchTime());
...
pp.simulate();
 
1 hour later…
04:09
0
Q: Fast and Golfiest Season 2 Looking for Advice

Shiran YuanSeason 2 is coming! Season 1 was fun and relatively well-received, but the main problem was that the scoring system is very broken. Hence I'm looking for advice about how to improve the system so that all participants have around the same difficulty for obtaining scores. The point is, around the ...

 
3 hours later…
06:58
Consider the first n coprime numbers. Is the nth one of these just the nth prime?
Cancel that question
07:23
@Simd no because the first would be 1
the rest would be primes, yes
@Bubbler only if they needed to be pairwise coprime ;-)
07:39
oh lol
Guess my favourite erroring piece of code!
the other possible answer is all integers then :P
Would be this sequence right? oeis.org/A047255
gcd(2,8) != 1
I was assuming coprime just with the previous 2 numbers
07:42
that's a weird assumption to make, but nice sequence
I was surprised it's periodic
My favourite piece of erroring code: while 1:print()
(Python 3)
@mousetail whats the intuition of why this coprime thing works anyways
whats so special about modulo 6
That's just how often the sequence repeats. 6 because 2 and 3 are the only 2 primes that matter
Hypothetically if you take the last 3 numbers instead you'd get mod 30, since 5 is the third prime
why would it repeat in the first place, im having hard time wrapping my head around that
07:51
@AidenChow odd numbers are coprime with itself -2 and -4, and you can add in 6k+2 because it is coprime with 6k-1, 6k+1, 6k+3, 6k+5 (previous two and next two)
everything there can be easily derived from gcd(a,b) = gcd(a,a-b)
Seems the period length for the last 3 coprime numbers is 125, not 30 like I hypothesized
the period is 210
You are correct
= 2x3x5x7
What would it be for 4 terms? 2x3x5x7x13x17 ? Or more? Why did we now need to consider 4 primes instead of 3
07:57
so for last n number it have period 2*3*5*...*p_k, where p_k is highest prime <= 2n-1?
thats the pattern im getting
it is unsolved for 4 terms
oh
why it work that way lol
Hypothesized to be mod 1310 though if I'm reading right
08:01
1310, thats not really product of consecutive prime anymore, wonder why that is
its like 2*5*131
typo of 2310 = 2x3x5x7x11
though "The first differences appear to be periodic with period 245589" suggests a much longer period that contains 245589 terms
bruh whats that, some other consecutive prime product?
ok nope, just some random number
no, it's unrelated to the period we're trying to guess
just that it's larger than that
08:06
@AidenChow bruh wtf im saying, wat i meant to say is 2*3*5*...*p_k, p_k is lower prime >= 2n+1 but me being dumbass im probably super wrong here lmao
@Bubbler oh so what period is that then?
we never know, at least until we compute that many terms ourselves
shouldn't take too long though
@Bubbler i mean some other guys been doing it, they havent been able to do it, how would we do it any different
maybe the term getting too big very quickly?
some other guys did find the periodicity
term gaps are at most 12, so we're looking for a number that is at most 12x245589
wtf thats huge, how we gonna calculate all that
easy, just post a challenge
08:11
O_O
well my pc is potato + i dont wanna download all these random langs so thats why ive always stayed away from fastest code lol
even a code golf should work, you can calculate 3000000 things in an instant
but like u gotta keep track of coprime and stuff right
dont u have to test factors or however u do those things
gcd is pretty fast too, you can just calculate them on the fly
You might need to do more work to actually produce a proof rather than just calculate the terms
lol ok, r u literally writing code for it rn
@mousetail well maybe finding period will help in that?
I mean you need a proof to actually find the period. Just finding something that repeats twice is not enough
but what if u get the period from the code and see if it actually work
How will you know if it keeps repeating forever or if it eventually changes?
so u prove that
08:20
Basically the proof will be too long to write manually, since it will be a 1000+ way case distinction probably. So ideally your program could also prove if the period is correct
how can a program gonna prove it? dont u need proof language like lean
Basically chain a bunch of gcd(a,b)=gcd(a,a-b) together till you can find the term f(n-period). Doesn't need to be 100% formal, you can do that yourself but you need all the terms in the proof
so what is a and b here
f(n-1) and f(n)
its just 1?
cuz the number before is coprime
08:31
Yep, but you need to prove that. You need to prove f(n) is in the sequence, and that f(n + period) is also in the sequence
err ok and gcd prove this by saying its 1?
You need to prove it's 1, you don't know the values of the sequence. First you need to prove gcd = 1 only then can you prove it's in the sequnce
0
Q: How Turing complete is you language?

bsoelchFind the maximum possible number of disjoint sets of characters, that are Turing complete subsets of your language. Rules: You can assume your Turing complete subset is contained in/called from a main-function if that is required by your language The subsets must not share any characters (in th...

08:54
@AidenChow Example of what a subset of the proof could look like:
Prove n+6 in S:
    n%6=1:
        let a=n-2, b=n-4, We know a,b in S
        n is not divisble by 2, thus
        gcd(n-2,2)=gcd(n,4)=1
        gcd(n-2,n-n+2)=gcd(n,n-n+4)=1
        gcd(a,n-a)=gcd(n,n-b)=1
        gcd(a,n)=gcd(b,n)=1
        thus n is in S
    n%6=2:
        let a=n-1, b=n-3. We know a,b in S
        We know n can't be divisble by 3, also GCD of any number and 1=1
        gcd(n,1)=gcd(n,3)=1
        gcd(n,n-n+1)=gcd(n,n-n+3)=1
        gcd(n,n-1)=gcd(n,n-3)=1
        gcd(n,a)=gcd(n,n-3)=1
09:49
@NewPosts I feel like that's a duplicate.
What does the "nonn" keyword on OEIS mean?
 
1 hour later…
11:07
hello!
@mousetail Sequences with nonnegative terms only.
@DannyuNDos it's definitely similar to some existing challenges but i think it's not a dupe
that being said i imagine most praclangs will score 1 :P
11:38
hi @AviFS :p
11:59
@Simd oh no, A006577 has nonn, did i miss something?
11
@JoKing I just looked up the keyword!
12:16
hi @Bubbler
Why does github think it's okay to have digits that aren't 0 and 1 in a binary literal? Is it stupid?
:)
python has rotted you
@lyxαl 9 and f are just fancy ways of saying 1, and e a fancy way of saying 0
b is truthy
as are e, 9 and f
e is shorthand for "eleven" meaning 11
f is shorthand for "four" meaning 100
12:44
isn't the e for the exponent
f probably explicitly indicates it's a float
for reference, the full commit hash is 0b00e9f1cfa4643593d053a62c14a6ad9d34f68e
checkmate nerds :p
Looks like a float to me
13:05
0
A: Sandbox for Proposed Challenges

bsoelchMultiply multivariate polynomials We already have a challenge about multiplying multiply single-variable polynomials. This challenge is about multiply two polynomials with multiple variables Your task is given two multi-variable polynomials (for instance given as polynomials with polynomials as c...

13:34
oh no
My English teacher is one of them
She just started talking about web3
Can you make her mine your homework?
Mint your homework as a NFT then make her pay to get it
Miss, I lost access to my homework wallet.
My dog ate my seed phrase
What happens when it turns out that the exchange you used to buy and store your homework nft is insolvent and that you've been rug pulled? Do you get an automatic pass for experiencing the Web3 crash course and for having diamond hands?
It really has none of the upsides of decentralization
13:48
"sorry miss, I had my homework ready to submit, but some guy who's currently in the Bahamas used customer funds to invest in another company (which he owns) and acted like a man child and now all the exchanges are dealing with the fallout of the questionable relationship preferences of the whole executive suite. Do you at least accept this tether that I just materialised out of thin air?"
The guy that used a currency they invented themself as a collateral for huge loans?
that's all of them
SBF specifically is who I was referring to
CMC rotate a single character straight line as smoothly as you can using unicode
Yea they specifically used their own coin as colleteral, which instantly become worthless then they couldn't repay their lones making it kinda worthless
Even originally it was way overvalued before the company started failing
"started"? They probably never had the funds to begin with :p
Just like how it's highly likely tether doesn't have $66 billion in reserves to match the amount of tether being circulated (you can tell by the way they just nonchalantly mint millions and probably even billions at a time)
13:56
I mean it's a ponzi scheme. They could cover their loans with the volume of investments for a while but then at some point they couldn't
All I know is that SBF being more than a little goofy is good for popcorn stocks, and good for comedy GODL
And with that I'm going for the night o/
WAIT WAIT WAIT a USD-backed cryptocurrency? LMAO
There are a lot of them, they are known as stablecoins
Usually eventually the company runs out of money to pay out
Why would you use that lol...so the idea is, you don't trust the financial system enough to use USD (whether that's for privacy or out of distrust of centralization)...but you do trust what it's backed with?
It's like the "getting COVID so I'm immune" thing where it makes no sense at first, then starts to get a little glimmer of possibly making sense, then you think it through fully and it very much does not
At least USDs value doesn't fluctuate wildly
14:04
@RydwolfPrograms there's a lot of them
Well actually...I suppose it would have one actual application, that being converting USD into stablecoin, putting it in a tumbler, then taking it out. In other words, cryptocurrency optimized for organized crime
Also the idea is the value won't be able to drop below the price of the dollar, it can go above though
I wouldn't be surprised if money launderers were the funding behind half of the cryptocurrency/web3 hype
14:31
@user119237 You’ll need 20 rep to chat. Good luck!
Ah wait that’s a third @user I think.
14:53
@TheEmptyStringPhotographer who?
@user user :p
@user oh and you’re not the real user.
@TheEmptyStringPhotographer who knows
You don't know
@user I checked your “about me”
15:04
What if the old user is the original user's account, stolen, and new user is the actual user?
@RydwolfPrograms unlikely :p
Or maybe one’s an alt
You won't know
@RydwolfPrograms hehe, closer!
@user but I know for certain that the other user is the real user.
you could be as well
What if the second user is an LLM tuned on user's chat messages
With the goal of eventually replacing user with an LLM, automating him to save money
Why pay for rent and food when you can automate your existence
Actually that sounds precisely like what user would do lol
@RydwolfPrograms replacing them with a Master of Laws?
15:11
Large Language Model, like GPT
@RydwolfPrograms I suspect this is the future of social media, nearly impossible to find real users among the multitude of bots
In a golfing language, what should the variadic intersection of zero lists be?
If the language was statically typed, it could maybe be an infinite list
Type inference isn't super useful when so much overloading exists tho
Can you make a special universe set object such that the in operator is always true?
15:24
@RydwolfPrograms Wait how would that work tho
(if I do ever design a golflang, it'll have ellipsis as a splat operator to make anything variadic)
Would the real me jump into a cryo pod?
If you then iterate over it it can just be the natural numbers or whatever, it doesn't really make sense to iterate over the universe set so any list is as good as any other
In which case, why bother automating myself?
Well so that you'll still exist in the meantime
15:25
@RydwolfPrograms You don't need static typing for infinite lists
@RydwolfPrograms Why would that matter lol
Like I can't automate my real existence, only my online presence
@user Wdym?
Python has generators
Oh. No what I meant is that static typing would be so that you know what it's a list of
Oh ok
I don't think there's really any need for lists of multiple types in golflangs, aside from ragged lists
15:27
As tuples
Oh true
I think Husk has a pair type for that reason
@mousetail I guess a way of implementing that is UniversalObject[x] == x
Yeah
Depending on the language, you might not need them
e.g. a stack-based language that allows returning multiple values
But stack-based languages can't be properly statically typed
It's useful for some of the old weird challenges that require output in multiple types, like a specific string if a number doesn't exist
15:29
^
@mousetail For those tho, they'd be expecting STDOUT, which is always a string, so stringifying the number would be valid
static typing of a stack language might make some especially dynamic manipulations impossible but it should be fine 95% of the time at least
The stack may be completely different sizes depending on the inputs
You'd need dependent types or something, I think?
A statically typed stack based language is just a reverse polish notation language right?
You can model most stack-based langs as postfix with variables
like if you loop over something and grow the stack?
15:30
Yeah
And then if you pop from it, you have no idea what you're popping
you could model that as just, like, an unknown-length stretch of all the same type
Actually I reverse my ^ statically typed stack-based would just be RPN/postfix
and have some kind of sentinel at the bottom or something like that
But what if you have 0 push true [ "foo" push ] if?
because what are you even doing with that if you don't want to know when you're at the bottom
15:32
Then you might get either a number or a string next time you pop
@UnrelatedString True true
static typing does tend to forbid that :P
Or you could automatically create a union type
Yeah but matching and stuff on tagged unions (or typeofing for untagged unions) would be pretty ungolfy I'd imagine
Alternatively...you could overload everything on every possible union, which could be interesting
Most operators would work on any type, it would just effect things like a default value or infinite list
@mousetail That's not really true at all
15:35
hypothetically you might be able to have a single modifier for matching every possible union
At least half of operators are going to be overloaded to completely different things for different types in a typical SBCS lang
in the sense that it knows how many operators to consume into the match because of the type it expects
@RydwolfPrograms It is, you just get a dynamically typed language where you can calculate the possible types at compile time
Oh wait I misread
15:52
@Adám can you explain more?
@Adám bruh i remember this facepalm
@RydwolfPrograms Hello, I am a big language model trained by @user. How I can help you today?
@Adám maybe there are no useful characters for this.
Please stop pinging me
16:06
def animate_rotation():
    characters = ['|', '╱', '━', '╲']
    while True:
        for char in characters:
            sys.stdout.write('\r' + char)
            sys.stdout.flush()
            time.sleep(0.2)
@user who is pinging you?
The other user
@Simd lol look at the date the blog post was posted
I just want something better than animate_rotation, which is rubbish
@AidenChow 2m ago?
@Simd what? no?
it says "Posted April 1, 2023 by Morten Kromberg"
ya know, like april fools
@AidenChow oh!
16:12
@user bruh why is there another copy of u
thats actually so wack
0
Q: Optimal Duck Game Moves

The ThonnuHow to play the duck game (I figured it's a bit too long to put in the challenge, so I made a Gist and linked it.) Challenge The duck game (linked above) can be solved. Your challenge today is to accept a board state and output one of the moves which will guarantee a win for the current player. F...

16:33
CMC: given empty input, output a look of disapproval (ಠ_ಠ)
@Joao-3 :-/
@Joao-3 What about for non-empty input?
undefined, but you must not output a look of disapproval
x=>x?0:"ಠ_ಠ"
@user Ooh that's smart
For non-empty inputs, it appends them to the look of disapproval, making it slightly different
16:42
x=>x+"ಠ_ಠ"
Crap I hit delete
but you're still outputting the emoticon so...
Scala, 7 bytes: _+"ಠ_ಠ"
@Joao-3 Just rules lawyering :P
one of the few times proton beats JS: ("ಠ_ಠ"+)
this python one is clever: print(["ಠ_ಠ"]\
16:43
rSNBATWPL: +{"ಠ_ಠ"
[len(input())])
you broke it
oh, crashing is allowed on non-empty imput?
Technically not outputting a look of disapproval
Actually hang on does rSNBATWPL allow unterminated string literals? It might
didn't you make the language
x=>{while(x){}"ಠ_ಠ"} in proton :P
Ooh it does
So that saves a byte
the python backslash can be useful in this type of challenge
I love how even you don't know how your parser works
16:47
@Joao-3 ...why?
Why's that backslash necessary just put it on the same line...
see i mentioned that you can't output the look with input
@realuser Tbf I wrote it a while ago
And a lot of the language isn't designed, it's just how undefined behavior happened to work
Shush I want to believe rSNASDF is a horrible cursed mess so I can feel superior
if i put it all on the same line if it had input python would complain and output ಠ_ಠ
(I.e. I wrote something as lazily as I could intentionally, so that possibilities I didn't think of would do cool stuff)
16:48
@Joao-3 How does this work?
@realuser It's supposed to be a horrible cursed mess :p
It's literally named "Radwvylf should not be allowed to design programming languages" :p
IF it has input it can't output ಠ_ಠ
@realuser It's two lines
@RydwolfPrograms cool can you Link To The Lang™?
16:49
Look at the next line
dammit this keyboard just repeats characters
Oh it's indexing into it
Interpreter: https://radvylf.github.io/rSNBATWPL/rsnbatwpl.html
Docs: https://github.com/Radvylf/rSNBATWPL
Wait no it isn't
@RydwolfPrograms lol 3.13 becomes 3.12999999999999
16:51
That's technically the case with most langs, they just pretty print it
@Joao-3 Term: input null eq { "ಠ_ಠ" println } when
if you use: cond you can replace null eq with null?
The sequel to rSNBATWPL that I just couldn't get working had what I think is the most incredible type system feature ever
Derivative and integral types, with product and sum rules for product and sum types
It was called CMOP
@RydwolfPrograms Cleaning up C's mess?
i remember you mentioned those but can't remember if you ever actually completed them
It also had a feature I absolutely loved, almost every type was additionally representable using purely a valid identifier, which was used in function overloading
16:59
like including generics
Yup
So you could have a function name like tostring_ddx'2'c8'2'c8'idx'c8
@RydwolfPrograms Wait how does tha twork
It doesn't, sadly
Now that I know multivariable calculus tho, it might be possible
17:00
@RydwolfPrograms gorgeous
They'd just be partial derivatives with respect to a type
Here were the rules:
1. Basic types and struct names refer to themselves
2. A prepended `'` makes a type an iterator (`'i32`, `''f128`, etc.)
3. A number followed by `'`-separated types forms a tuple (`1'i32`, `2'xyz'f32`, `'2''i32'''f128`, etc.)
4. A prepended `ddx'` or `idx'` can be used for differential or integral types (`idx'string`, `ddx'2'c8'2'c8'idx'c8`, etc.)
(it supported floats of sizes from 2 to 258 bits)
oh so why is that being useful, can it solve differential equations and such?
@RydwolfPrograms WHAT
@AidenChow Nah it's entirely pointless it's just absolutely hilarious
lol ok
17:03
Oh it called "options" "optors" to make fun of category theory people and ""functor""s
@RydwolfPrograms why 258 and not 256???????????????/?/?////????/?/?/??????//????///?////??
Since ints went from 0 to 256, and every number type had the same number of options
## Types

- Numbers:
- Ints: `i[0..256]`
- Unsigned ints: `c[1..257]`
- Floats: `f[2..258]`
- Positive floats: `p[1..257]`
- Strings: `string`
- Strong bool: `str`
- Bool: `bool`
- Lists: `[A]`
- Tuple: `(A, B, ...)`
- Struct: `{ x: A, y: B, ... }`, `C`, `C(A, B, ...)`, `C { x: A, y: B, ... }`, `C A`, `C A(B)`, `C A B`, ...
- Pointer: `*A`
- Function: `A | B`
- Closure: `A :-| B`
- Confederation: `A + B`
"strong bool" being str is amazing I forgot about that
genius
are non-strong bools three valued or is it identical
I believe they were three-valued yeah
17:05
Oh it had unsigned floats too lol
Which I believe didn't support 0/Infinity/NaN
Unsigned exponent or value itself unsigned?
You should support all 4 combinations
Value itself
you should have also had a signed float variant that just isn't ieee compliant in some small ways
17:06
@mousetail That might stray into reasonability
I like how the docs specify "CMOP possesses an inordinary amount of respect for ASCII." with no additional detail
Would be nice to have floats in every possible base
I'm actually really liking this language concept lol
17:35
WTF is the timeout text effect
someone put way too much work into that animation
floats in for no apparent reason
hmm, you saw ChatGPT here?
hmm? Oh, no, I just saw activity here and decided to lurk :)
lurks chaotically
How do you lurk chaotically?
17:47
@mousetail (1) be a chaos entity. (2) lurk.
:P
oh now i see the user you were talking about
@RydwolfPrograms that will be my last message in the nineteenth byte
Wait who removed it and why?
may or may not have used a tactical strike on the target
there's more than just an RO in here. I have a diamond. :P
also it's not useful to engage persistent problems that way ;)
just a hint.
@ThomasWard read the message again :p
17:56
i did
pretty sure i know who the 'bot' is though behind the scenes.
0
A: Sandbox for Proposed Challenges

mousetailPeriodicity of the family of sequences s(n) such that n(x) is the first number co-prime with the previous n elements code-golf The sequence of all numbers coprime to the previous is all natural numbers. This is OEIS 000027: 1, 2, 3, 4, 5, 6, 7, 8... The sequence starting with 1, 2, and where the...

lol. no worries
you have nothing to scare me with
18:22
0
Q: Output the smallest increasing sequence where each term is coprime to preceding three terms

mousetailThis sequence is defined as Starts with 1, 2, 3 The next element of the sequence is the first number greater than the previous three that is co-prime with each of the previous 3 elements in the sequence. In other words, if the previous 3 elements are a, b, c, then the next is the first integer n>...

19:47
anyone here familiar with kubernetes? I've been trying to follow docs.docker.com/get-started/kube-deploy for like an hour and I did everything exactly as said and there are no errors and all outputs are as the tutorial says it should be, it's just that localhost:30001 just does not load anything
I have looked at no less than 10 stack overflow posts all of which mention errors that I'm not getting or mistakes that I've quintuple checked I'm not making
You have minicube running?
yes
the outputs from kubectl get (pods | deployments | services) all looks normal, the only difference with the tutorial is that I can't actually access the webpage
logs all look normal and when I run it with docker run -dp 3000:3000 getting-started then localhost:3000 works fine
01:00 - 20:0020:00 - 00:00

« first day (4583 days earlier)      last day (555 days later) »