The Nineteenth Byte

Mars Ultor

9:00 AM

@Mego Okay, not a pointer

Bálint

@wizzwizz4 feature-request Please create a memory tag on the RC SE

Katenkyo

@MarsUltor We can use a pointer as an array, because it points to a space in memory, but it doesn't actually have a real type

Anonymous

@Bálint You can make one yourself. Just tag something relevant with the tag.

Bálint

@Mego without 150 rep it's not possible

Anonymous

@MarsUltor Still wrong

Katenkyo

9:01 AM

Also, when we use it as an array, nothing really prevent me to look for the adress var-1

wizzwizz4

@Bálint Please use:

The BBS

General discussion for retrocomputing.stackexchange.com

Anonymous

One of my favorite C idiotisms is int* foo = {1, 2, 3}; printf("%d\n", 0[foo]);

Mars Ultor

@Mego wait people actually do that?

Katenkyo

@Mego Wait, what the fuck? Oo

wizzwizz4

@Katenkyo People actually do that.

Leaky Nun

9:03 AM

@Mego What is that?

Katenkyo

Katenkyo.exe stopped working

wizzwizz4

@Mego Why would you use printf like that?

Mars Ultor

@LeakyNun It's a common mistake for beginners in C, apparently

wizzwizz4

@Katenkyo Why would you use Windows like that?

Mars Ultor

@wizzwizz4 You don't, it's a mistake

@Katenkyo Stop botting

Leaky Nun

9:04 AM

@MarsUltor But what is it supposed to do?

wizzwizz4

@MarsUltor Hey. What's wrong with being a bot?

Anonymous

Messed up the printf call, but it's the same point

Katenkyo

@wizzwizz4 You don't chose your OS when they are booting your brain for the first time

Also, I heard dual-boot had some big side-effect on brains

Mars Ultor

@Katenkyo But how do you even have Neural Windows?

zyabin101

@MarsUltor So basically, something like [[[0x102938AB]]] pseudocode?

@Katenkyo calls 911

Anonymous

9:06 AM

foo[0] is equivalent to *(foo+0) (thanks to array references being pointers), which is equivalent to *(0+foo) by commutiativity, which is equivalent to 0[foo]

Katenkyo

@MarsUltor Yep, but it stopped NeuralNetwork.exe from executing, looks like it needs elevated privileges

Mars Ultor

@Mego you can subscript integers?

Anonymous

#include <stdio.h>

int main() {
    int foo[] = {1, 2, 3};
    printf("%d\n", 0[foo]);
    return 0;
}

Mars Ultor

@Katenkyo How are you even alive

wizzwizz4

@Mego Wow. That's... technically correct.

Leaky Nun

9:07 AM

@Mego Oh, I forgot that in C arrays are sugars. I'm too used to coding in java lol

Anonymous

ideone.com/rEFF8c

Katenkyo

@MarsUltor Studies have shown that you don't need a functioning brain to be alive

2

wizzwizz4

@MarsUltor Katenkyo passed the Turing test!

@Katenkyo +1.

Mars Ultor

@wizzwizz4 I mean Katenkyo can't run NeuralNetwork.exe because it presumably crashes windows

meaning no brain

Anonymous

@LeakyNun C arrays aren't syntactic sugar. It's just the fact that array references are promoted to pointers that makes for weirdness like that.

wizzwizz4

9:08 AM

@MarsUltor Katenkyo's borrowing my instance of the program.

Katenkyo

@MarsUltor It's the opposite, I can't run NeuralNetwork.exe because windows wil prevent it from running

wizzwizz4

Not my neural network, but my processing power.

Mars Ultor

@Katenkyo Oh, my bad

Katenkyo

And my admin didn't think of including it in the startup...

Anonymous

With int foo[] = {1, 2, 3};, foo is of type int*, but the array is definitely real, and not just syntactic sugar.

Anonymous

9:09 AM

Well, sort of

wizzwizz4

@Katenkyo I've almost ported NeuralNetwork.exe to *nix.

I'm just ironing out the inconsistencies. (Wouldn't want inconsistencies!)

Anonymous

If you look at it from a memory layout perspective, array initialization really is a fancy way of saying "please give me N consecutive memory locations".

Katenkyo

@Mego It's way easier to think of this as : everything is a pointer, or a basic type, nothing's in between

Mars Ultor

Also, apparently, C arrays are slightly different from C pointers

@Katenkyo Nope

Anonymous

The really fun part is when you realize that those memory locations may not actually be physically contiguous, thanks to logical addressing

Katenkyo

9:11 AM

@wizzwizz4 You should use a genetic algorythm to polish it, it should find a way to be stable

Anonymous

@Katenkyo Really, everything is either an integer, a float, or a combination thereof

Anonymous

Because even pointers are integral types

Katenkyo

@MarsUltor I've learned something today!

wizzwizz4

@Katenkyo I'm not talking about the Neural Network, I'm talking about the host program.

Anyway, I'm close enough to a genetic algorithm in that regard, when I'm programming.

Katenkyo

@Mego SUre, they are an adress, meaning it's an integer

Anonymous

9:12 AM

And you can cast integers to pointers (though you shouldn't unless you're doing some really low-level programming, like writing directly to the screen buffer)

wizzwizz4

@Mego I ♥ screen buffers.

Anonymous

@wizzwizz4 Being familiar with CP437 helps a lot with that kind of low-level programming :P

wizzwizz4

9

A: How did debugging software run without memory?

A debugger thar runs inside the debugged machine is a program, so it does need memory. Sometimes the debugger is loaded as a ROM cartridge, usually with its own RAM, so it doesn´t need to take any RAM from the running program. This is the case with, for example, the Action Replay modules for the...

Shows you how to exploit the screen buffer.

Katenkyo

@wizzwizz4 Programming should be as entertaining as a KotH

wizzwizz4

@Katenkyo It is.

Katenkyo

9:16 AM

You do some programs, put them in an arena, and select the winner to be the final delivery

Anonymous

At my first real development job (in college), I had to work with a legacy system that was truly terrible. I've complained about it at length in here before. One of the fun quirks it had was, if you wanted to print anything other than printable ASCII text to the screen, you had to do it by directly writing to the screen buffer. The built-in functionality didn't want to accept that anything other than printable ASCII existed, even though the system supported all of CP437.

Leaky Nun

@Mego Why does this and this produce different results?

Katenkyo

@Mego That's kind of... stupid?

Anonymous

So, at some point before I started working there, someone wrote an assembly library that handled writing to the screen buffer so that newbs would stop screwing it up. Then more libraries were built on top of that to do fancy things like writing text in boxes (using the box-drawing characters).

Leaky Nun

#include <stdio.h>

int main() {
    int foo[] = {2, 3, 5};
    int bar[] = {7, 11, 13};
    printf("%d\n%d\n", foo+0, bar+0);
    printf("%d\n", foo[3]);
    printf("%d\n", foo[4]);
    printf("%d\n", foo[5]);
    return 0;
}

-1081962904
-1081962892
7
11
13

#include <stdio.h>

int main() {
    int foo[] = {2, 3, 5};
    int bar[] = {7, 11, 13};
    printf("%d\n", foo[3]);
    printf("%d\n", foo[4]);
    printf("%d\n", foo[5]);
    return 0;
}

Anonymous

9:18 AM

@Katenkyo The system dated back to the 70s. Lots of stuff didn't make sense back then.

Leaky Nun

0
0
0

Anonymous

@LeakyNun The first printf is printing out memory addresses, because you're not dereferencing the pointers

Mars Ultor

@Mego Yeah, but look at the last three outputs for both

Katenkyo

@Mego That's always a pleasure to see what we did back then

Anonymous

The last three outputs can be explained due to the fact that you got lucky and got two arrays that were adjacent.

Anonymous

9:21 AM

There is no guarantee that int foo[] = {1,2,3}; int bar[] = {4,5,6}; will result in two adjacent arrays in memory (so something like [...1, 2, 3, 4, 5, 6, ...])

Anonymous

I also know that you use Linux, which zeroes out stack memory before assigning it

Anonymous

For example, on Windows (using Cygwin's gcc), I get:

Anonymous

1630692478
1629388590
6409496

Leaky Nun

@Mego No, I don't.

Anonymous

OS X?

Leaky Nun

9:23 AM

@Mego No matter how many times I click "Ideone it", the two links produce the same results for the last three numbers

@Mego Win7

Mars Ultor

Wait

godbolt.org/g/1HbZ1E godbolt.org/g/mU7yEY

Anonymous

@LeakyNun What's probably happening is, in the second program, because bar isn't being accessed, the optimizer strips it out.

Leaky Nun

        movl    $2, -16(%rbp)
        movl    $3, -12(%rbp)
        movl    $5, -8(%rbp)
        movl    $7, -32(%rbp)
        movl    $11, -28(%rbp)
        movl    $13, -24(%rbp)

So they are guaranteed to be adjacent

Mars Ultor

Wait

Leaky Nun

@Mego Oh, this explains it

Mars Ultor

9:26 AM

maybe ideone uses -O2 or -O3

Anonymous

Compare: ideone.com/2QVk7l

Anonymous

With that one, successive compile/run cycles give garbage values

Anonymous

And I had it backwards - Windows zeroes out stack memory, Linux doesn't

Katenkyo

@Mego Totally forgot C's optimizer

Anonymous

And since I'm using Cygwin's gcc and libc, it doesn't either

Leaky Nun

9:28 AM

@Mego Why?

@Mego here also ideone.com/TLbdBD

Anonymous

@LeakyNun Random garbage left in memory. They're not guaranteed to be adjacent in memory, so foo[3] points to some random value.

Leaky Nun

@Mego Then why did the first one make them adjacent?

Oh, I think I'm getting it

a temp var is used for the addition

Anonymous

@LeakyNun Optimizer magic

Anonymous

It decided adjacent was better for some reason

Mars Ultor

Uh help the array is gone after optimization

Anonymous

9:30 AM

Claiming to fully understand the optimizer is a sure sign of madness

Mars Ultor

@Mego What else would it put in between?

Anonymous

@MarsUltor It's not that it would put something between them, but rather that it normally doesn't have a reason to put them adjacent.

Leaky Nun

@Mego Another question: ideone.com/TLbdBD

Helka Homba

We need a "too anal-retentive" flag...

@HelkaHomba I believe you need to supply only the "must" tags (no, date is not a "must" either). See my /// answer linked above, and you will realize it does not involve date manipulation or arithmetic. Also, I think this can get more challenging by only supplying the "must" tags. Also, before saying anything about search, I'm clarifying that if someone accepts a date challenge, he/she expects to be challenged with date/time, not just outputting a specific date/time string. That works for arithmetic too. The submitter expects to be challenged with arithmetic. — Έρικ Κωνσταντόπουλος 2 hours ago

Anonymous

For example, in the this, there is an 8-byte gap between the two

Leaky Nun

9:33 AM

@Mego godbolt.org/g/v6833O

Mars Ultor

@LeakyNun Ints are 4 bytes long

Leaky Nun

@Mego My question is, what does +1 do to a pointer?

@Mego What output are you seeing?

Mars Ultor

@LeakyNun Everyone sees the same output

Anonymous

@HelkaHomba I've noticed several unnecessary combative and anal-retentive/pedantic comments from that user

Mars Ultor

@Mego ? Where is the gap?

Anonymous

9:35 AM

@LeakyNun Look at the two addresses. There's a 12-byte difference. Subtract 4 for the size of the first pointer, and you get an 8-byte gap.

Mars Ultor

Yeah, the 8 bytes are 3 and 5

But seriously where did the values go

Anonymous

@MarsUltor Like I said before, they got optimized out because they weren't used

Anonymous

@MarsUltor You never use bar after defining it

Leaky Nun

@MarsUltor foo[0], foo[1], foo[2] are not used.

Mars Ultor

Oh, just realized that was foo[3], foo[4] and foo[5]

Anonymous

9:39 AM

@LeakyNun I was originally seeing 0 for the last 3, but that was because of a bug that I edited and fixed. Now it's outputting correctly, and my reasoning was mistaken - that's unusual, but correct. There's no need to allocate the two arrays adjacently, but the compiler decided to for some voodoo reason.

Leaky Nun

@Mego Is there anyway to access the values in between?

Like this ideone.com/TLbdBD

Mars Ultor

@Mego Because they're declared adjacently?

@Mego The compiler has no reason to put them elsewhere

@LeakyNun Just add to/subtract from the pointer

Leaky Nun

@MarsUltor Behold my link

Anonymous

@LeakyNun Like Mars said, the values in between are the values in the array. On ideone's system, sizeof(int) == 4, so 3 ints makes 12, which is precisely the gap between the start of foo and the start of bar.

Mars Ultor

@Mego But ints are always 4 bytes

Leaky Nun

9:41 AM

@Mego Yes, so when I add one it adds four instead... my question is: can you add precisely one?

Anonymous

@MarsUltor Nowhere in the C standard does it state that adjacently-defined variables must have adjacently-allocated memory.

Mars Ultor

@Mego I know, but the compiler has no reason to put them elsewhere, it's probably simplest to just leave them where they were in the code

Anonymous

@LeakyNun That would get you the second byte of a 4-byte (32-bit) integer. That's in the realm of bitshifts.

Leaky Nun

@Mego Yes, is there a way to do so?

Anonymous

@MarsUltor Right, but my point is, there's no guarantee that the compiler will do that, and relying on that behavior is unsafe and not portable.

Leaky Nun

9:42 AM

It would produce (3<<24) + (5<<16) + (7<<8) + 11

Mars Ultor

@Mego Yes, but I'm just saying that doesn't mean the compiler does it for some voodoo reason

Anonymous

@LeakyNun (a&0x00FF0000)>>16

Mars Ultor

@LeakyNun There's not way to move the pointer itself by one byte though

Anonymous

In that case, (foo[0]%0x00FF0000)>>16

Leaky Nun

@MarsUltor :(

Mars Ultor

9:44 AM

@LeakyNun It isn't needed

You usually don't want that behavior

Anonymous

Well, you could, with some hackery

Anonymous

If you take advantage of the fact that sizeof(char) == 1

Mars Ultor

wait, so just cast it to a char pointer or something?

wizzwizz4

@Mego I often do that.

@MarsUltor Then cast it back.

Mars Ultor

Casting to an int and back would work too, right?

New Main Posts

9:48 AM

0

Q: Usefulness of Four Square Theorem?

I've seen posts in the past regarding the four square theorem, and people trying to find ways of computing the outcome as fast as possible. My question is what kind of usefulness does the four square theorem bring about (in coding, or other things in real life)?

Mars Ultor

Doesn't look like it works all the time with optimization. If you have quux[2], quux[1], quux[0] where quux is a char*, the assembler says it only assigns to 2 on quux[0]

zyabin101

I'm (for the nth time) afraid that my flag gets deemed harmful ,_,

Jester Tran

int fun(char *word); // C code

fun("hello");

is that correct? (calling function, fun())

Mars Ultor

Yes

Jester Tran

thanks

Leaky Nun

9:54 AM

ideone.com/TLbdBD

It's working

Mars Ultor

wait

warning: deprecated conversion from string constant to 'char*' [-Wwrite-strings]

Anonymous

I still have no idea why my SHA-256 code isn't working: stackoverflow.com/q/37560786/2508324

zyabin101

;D

Anonymous

@MarsUltor String constants are const char*

Mars Ultor

@Mego Well, it works for 0 bytes

Katenkyo

9:56 AM

@MarsUltor Rule one in C : Never look at warnings, because there's a damn lot of them :D

Anonymous

@MarsUltor Wow, that insight totally helps me solve my problem. Thanks!

Anonymous

@Katenkyo Eww no. Use -Wall -Wextra -Werror, and only ignore them if you have a damn good reason. Warnings are the smoke alarms of compilers - they tell you when your house is about to burn down, so you can try to prevent it.

Katenkyo

@Mego (I'm half joking, even if I think that compilers tend to generate far more warning than necessary)

Anonymous

Warnings try to keep you from sticking the fork in the microwave. You should probably listen to them more.

flawr

@Mego Whats wrong with that? They do sparkle so beautifully.

Katenkyo

10:00 AM

Well, I do when I'm doing a project myself and from scratch, when you pick up a project that has already 1000+ Warnings, you tend to ignore them

flawr

1000+
SyntaxError: expected expression, got end of script

wizzwizz4

@flawr That is an important warning.

zyabin101

10:16 AM

This tutorial is a bit screwed in choice of IDE. Every Python dev ever only uses either IDLE or PyCharm.

Just look at part one of this tutorial.

I wished to make a roguelike in Python w/ libtcod, but this tutorial made me re-think my choice of stack.

Jester Tran

In C, how do you malloc a linked list with 4 nodes?

Link list = malloc(4 * sizeof(...)); // is this correct?

zyabin101

"I like Notepad++. I use it for developing in Python. Without Notepad++ it seems I'm going nowhere." --- No dev ever

levanth

@zyabin101 IDLE PyCharm/IntelliJ or Atom AFAIK

zyabin101

Atom is better than Notepad++, I admit.

Mars Ultor

> Nowhere?

@zyabin101 I use Sublime

Atom is really slow/laggy when you have many plugins

Or maybe it's just that I have too many plugins

zyabin101

10:31 AM

@MarsUltor If some dev said that, "nowhere" would seem like they won't go developing in Python without Notepad++.

Mars Ultor

Oh

I wouldn't mind using notepad++ though

Jester Tran

how do you use gdb for ./a.out?

Mars Ultor

@JesterTran gdb a.out

Jester Tran

oooooh thanks

levanth

@MarsUltor I didn't had any problems with the amount of plugins with Atom but I switched to IntelliJ recently so I don't use Atom anymore. A classmate of me used Ninja IDE or something

Jester Tran

10:49 AM

In C and with respect to linked lists, before pushing a node onto the front of a list, how do we initialise the list?

List list = makeNode('A'); // where makeNode mallocs and points new node to null and gives the node data

Leaky Nun

Why is (a&b)|(a&c)|(b&c) equivalent to (a&b)^(a&c)^(b&c)?

Mars Ultor

I could explain with a (an imaginary) Venn diagram, but IDK if that's the right way

Leaky Nun

well go ahead

Mars Ultor

basically, let a, b, and c be the circle things, & is intersection, | is union

Leaky Nun

and ^ is multiset symmetric difference

Mars Ultor

11:00 AM

sorry, too lazy to type symbols

@LeakyNun Yeah

Leaky Nun

well alright then thanks

(it's equivalent to proof by truth table, which is definitely valid)

zyabin101

11:13 AM

@EᴀsᴛᴇʀʟʏIʀᴋ hai

New Main Posts

11:51 AM

0

Q: The D+J programming challenge from Kattis

The problem is as follows: Dick is d=12 years old. When we say this, we mean that it is at least twelve and not yet thirteen years since Dick was born. Dick and Jane have three pets: Spot the dog, Puff the Cat, and Yertle the Turtle. Spot was s years old when Puff was born; Puff was p ...

math code-challenge python programming-puzzle

Katenkyo

12:03 PM

@LeakyNun I saw your question, though "could do that easily by using Bool Algebra", but you already did it :3

Leaky Nun

@Katenkyo :p

Katenkyo

Long time I didn't work with bool operators

I think the last time I did something relatively big, it was a multiplexer 1<>2 for a serial port

zyabin101

I just ran a Crawl arena tournament, by just running DCSS' arena mode repeatedly with various pairings each time.

This time, there were 3 creatures:

Arena Tournament
Participants: bat, rat, giant newt

Round 1: Round robin between 3 creatures
Round 2: Contest finishes with 1 winner

Round 1 Match 1: 50 bat v 50 rat
                 31 bat v 0 rat
Round 1 Match 2: 50 bat v 50 giant newt
                 39 bat v 0 giant newt
Round 1 Match 3: 50 rat v 50 giant newt
                  0 rat v 8 giant newt

Round 1 Results:
        bat - 2
================
 giant newt - 1
        rat - 0

Round 2 Winner: bat

Katenkyo

Bats > All

zyabin101

12:29 PM

Here is a list of plans of tournaments with 2-20 creatures:

 2: 1) DE-2c-1w
 3: 1) RR-3c-1w
 4: 1) DE-4c-1w
 5: 1) RR-5c-2w 2) DE-2c-1w
 6: 1) RR-6c-3w 2) RR-3c-1w
 7: 1) RR-7c-3w 2) RR-3c-1w
 8: 1) DE-8c-1w
 9: 1) RR-9c-4w 2) DE-4c-1w
10: 1) RR-10c-5w 2) RR-5c-2w 3) DE-2c-1w
11: 1) RR-11c-5w 2) RR-5c-2w 3) DE-2c-1w
12: 1) RR-12c-6w 2) RR-6c-3w 3) RR-3c-1w
13: 1) RR-13c-6w 2) RR-6c-3w 3) RR-3c-1w
14: 1) RR-14c-7w 2) RR-7c-3w 3) RR-3c-1w
15: 1) RR-15c-7w 2) RR-7c-3w 3) RR-3c-1w
16: 1) DE-16c-1w
17: 1) RR-17c-8w 2) DE-8c-1w
18: 1) RR-18c-9w 2) RR-9c-4w 3) DE-4c-1w

So, for the first round, c people are in that round. This is the entire tournament.

If c is a power of 2 (2, 4, 8, 16, 32...), then the first round is definitely the last round of that tournament, and it will be a double elimination knockout bracket round, with 1 winner.

That winner wins the entire tournament.

If c isn't a power of two (3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15...), then the tournament continues.

The first round will be a round robin round, with floor( c / 2 ) winners that continue to the next round.

If only one winner continues, the tournament ends and the winner of the round wins the entire tournament.

Else, the next round is defined in the same way as the first.

Ad infinitum.

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Version Comparator Given two version strings, return a positive, negative or zero value depending on which one is earlier. Version strings consist of one or more non-negative integers separated by full stops, optionally suffixed by a lowercase letter and a final non-negative integer. Examples of...

zyabin101

Or at least, until one definite winner is decided.

I should make a challenge for that.

wizzwizz4

12:50 PM

If a room has more than 15 messages, is it still auto-deleted after a period of inactivity?

hi

hi

kthxbye

@wizzwizz4 It is worth retaining if 15 messages are said by at least 2 different users.

wizzwizz4

@zyabin101 Ok. Thanks for the info.

Έρικ Κωνσταντόπουλος

12:56 PM

@zyabin101 lol

zyabin101

Rooms that are worth retaining are never removed, only frozen after 14 days of inactivity.

Rooms that aren't worth retaining are removed after their seventh day of existence.

Έρικ Κωνσταντόπουλος

@zyabin101 At least The Nineteenth Byte will be kept in the future, if not active at all.

@HelkaHomba L. O. L.

Katenkyo

@ΈρικΚωνσταντόπουλος I think if the 19th byte become inactive, you may delete it rather than freeze it, because it would mean that PPCG is dead

3

Έρικ Κωνσταντόπουλος

1:11 PM

@Katenkyo Who knows? After all, a "newer edition" might be made, making this one obsolete, but worth it to remain.

TimmyD

19th++ Byte

PhiNotPi

Random question: I think one time I remember hearing something about each domain name having a numerical representation: a number (not an IP address) which when typed into a browser means the same thing. Is this true?

Katenkyo

@ΈρικΚωνσταντόπουλος Why would we leave this room rather than renaming it?

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Plan a special tournament tags: code-golf [more tags required] I host a special tournament with any number n >= 2 of participants. Here is a list of plans of tournaments for n = 2 to 20: 2: 1) DE-2c-1w 3: 1) RR-3c-1w 4: 1) DE-4c-1w 5: 1) RR-5c-2w 2) DE-2c-1w 6: 1) RR-6c-3w 2) RR-3c-1w ...

wizzwizz4

@PhiNotPi Yes, it is. It's basically the IP address, but instead of byte.byte.byte.byte converted into decimal, it's bytebytebytebyte converted into decimal.

Έρικ Κωνσταντόπουλος

1:14 PM

@Katenkyo Big changes happen bro. A fresh start might be needed sometime.

Katenkyo

@ΈρικΚωνσταντόπουλος Yes, they do happen, but never without a reason.

zyabin101

@NewSandboxedPosts Merci.

Έρικ Κωνσταντόπουλος

@Katenkyo See edit.

zyabin101

@PhiNotPi what to do with my circuit CA? :/

zyabin101's Circuit CA

Discussion for bit.ly/volz65C | zyabin101's new circuit cellul...

wizzwizz4

@ΈρικΚωνσταντόπουλος I updated the NSP onebox.

Katenkyo

1:16 PM

@zyabin101 might be a good base for a KotH, "select your race, each race have different characteristic, everyone fight"

@ΈρικΚωνσταντόπουλος "needing a fresh start" isn't a reason

Why would you need a fresh start.

TimmyD

@PhiNotPi It's not a one-to-one correlation, though, since there are many more domain names than IPv4 addresses in existence, and lots of sites use host header information and share an IP address.

Katenkyo

@TimmyD Looks like he's speaking of an ID which is not an IP address but is unique to each domain

But I don't see how useful it would be, given that we already have DNSs who does the job

Fatalize

Brachylog is mentionned on SWI-Prolog's website, my life is complete

14

Katenkyo

@Fatalize Well played!

zyabin101

@wizzwizz4 what to do with my circuit CA? :/

wizzwizz4

1:31 PM

@zyabin101 You've done it?!?

:-D

zyabin101

I didn't.

PhiNotPi

@wizzwizz4 that's probably what I saw, although I was hoping it wouldn't be an IP address.

Mars Ultor

@wizzwizz4 ???

wizzwizz4

@MarsUltor Yes, really.

Έρικ Κωνσταντόπουλος

@Cyoce

Eᴀsᴛᴇʀʟʏ Iʀᴋ

1:36 PM

hallo

TimmyD

@PhiNotPi Well, there's also the "Registry Domain ID" which is a unique identifier for each domain ... I don't think it's possible for the browser to pull up sites using that

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@CᴏɴᴏʀO'Bʀɪᴇɴ somebody has joined the ranks of small caps:

Eʀɪᴋ ᴛʜᴇ Gᴏʟғᴇʀ, Greece

704 3 19

code-golf restricted-source string sequence array-manipulation geometry hello-world

@DrGreenEggsandHamDJ let me know if you want to later though, I probably can sometime today.

@Upgoat Paraguay.

zyabin101

@ΈρικΚωνσταντόπουλος Do you wish your profile updated? :3

Έρικ Κωνσταντόπουλος

@zyabin101 Following the trend... YEAH I wish it updated!

Eᴀsᴛᴇʀʟʏ Iʀᴋ

what updated?

zyabin101

1:44 PM

@ΈρικΚωνσταντόπουλος :D

@El'endiaStarman Update Erik's profile. It seems that he joined the ranks of small caps. And I'm sure his new look in chat is good.

And yes, he consented.

Έρικ Κωνσταντόπουλος

@EᴀsᴛᴇʀʟʏIʀᴋ @CᴏɴᴏʀO'Bʀɪᴇɴ 3 members now.

Eᴀsᴛᴇʀʟʏ Iʀᴋ

yeah

Downgoat used to have small caps also.

@ΈρικΚωνσταντόπουλος you should join our ranks, people have enough problems typing your name as-is.

Έρικ Κωνσταντόπουλος

@EᴀsᴛᴇʀʟʏIʀᴋ Now he's just lame Upgoat.

Eᴀsᴛᴇʀʟʏ Iʀᴋ

ikr

but upgoat isn't that bad, just not smallcapified

zyabin101

Or maybe... @wizzwizz4 Update Erik's profile!

You can, can't you?

Έρικ Κωνσταντόπουλος

1:47 PM

@zyabin101 How can he?

zyabin101

@ΈρικΚωνσταντόπουλος Every mod can update someone's profile to sync his main and chat profiles.

Obviously, this needs the mod's consent.

Geobits

See, this is why I don't want to be a mod. Random pings when I'm not even active to do things that would be automatic if you just wait a little while.

Έρικ Κωνσταντόπουλος

@zyabin101 @wizzwizz4 @EᴀsᴛᴇʀʟʏIʀᴋ Hmm... At least I just joined "small caps" ranks.

zyabin101

Not right now...

Eᴀsᴛᴇʀʟʏ Iʀᴋ

:D

wait

your profile might need to be refreshified

Mᴀʀs Uʟᴛᴏʀ

1:51 PM

damnit ;-; why is small caps S also s

Eᴀsᴛᴇʀʟʏ Iʀᴋ