< 1575936115 229892 :FreeFull!~freefull@defocus/sausage-lover QUIT : < 1575936623 160608 :Frater_EST!~adrianbib@172.242.0.73 PART :#esoteric < 1575937060 382522 :LKoen!~LKoen@lstlambert-657-1-122-23.w92-154.abo.wanadoo.fr QUIT :Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.” < 1575937467 666688 :arseniiv!~arseniiv@95.105.14.86.dynamic.ufanet.ru QUIT :Ping timeout: 250 seconds < 1575940216 995089 :shinh!~i@129.EC0234U.cyberhome.ne.jp QUIT :Ping timeout: 240 seconds < 1575940365 533925 :shinh!~i@129.EC0234U.cyberhome.ne.jp JOIN :#esoteric < 1575942599 484565 :orvira!~orvira@37.120.204.228 JOIN :#esoteric < 1575942800 719957 :Lord_of_Life_!~Lord@unaffiliated/lord-of-life/x-0885362 JOIN :#esoteric < 1575942938 825835 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 QUIT :Ping timeout: 268 seconds < 1575942972 901414 :Lord_of_Life_!~Lord@unaffiliated/lord-of-life/x-0885362 NICK :Lord_of_Life < 1575945977 196603 :ineiros!ineiros@kapsi.fi QUIT :Ping timeout: 240 seconds < 1575946036 289867 :imode!~linear@unaffiliated/imode JOIN :#esoteric < 1575946069 658397 :ineiros!ineiros@kapsi.fi JOIN :#esoteric < 1575946794 370989 :imode!~linear@unaffiliated/imode QUIT :Ping timeout: 265 seconds < 1575948791 657060 :imode!~linear@unaffiliated/imode JOIN :#esoteric < 1575948860 605238 :imode!~linear@unaffiliated/imode QUIT :Client Quit < 1575952804 168758 :orvira!~orvira@37.120.204.228 QUIT :Quit: leaving < 1575956204 910242 :ArthurStrong!~ArthurStr@slow.wreckage.volia.net QUIT :Quit: leaving > 1575963671 118547 PRIVMSG #esoteric :14[[07Ttttt14]]4 10 02https://esolangs.org/w/index.php?diff=67860&oldid=67760 5* 03Hex96 5* (+49) 10 > 1575964930 551109 PRIVMSG #esoteric :14[[07Talk:Tttt14]]4 10 02https://esolangs.org/w/index.php?diff=67861&oldid=67814 5* 03Hex96 5* (+12) 10 < 1575968224 105035 :b_jonas!~x@catv-176-63-13-230.catv.broadband.hu QUIT :Quit: leaving < 1575974598 653471 :nico_nico!~khais@arennes-653-1-264-221.w109-218.abo.wanadoo.fr JOIN :#esoteric < 1575976292 337425 :nico_nico!~khais@arennes-653-1-264-221.w109-218.abo.wanadoo.fr QUIT :Quit: WeeChat 2.6 < 1575977657 917705 :arseniiv!~arseniiv@94.41.35.79.dynamic.ufanet.ru JOIN :#esoteric < 1575979030 315918 :izabera!~izabera@unaffiliated/izabera JOIN :#esoteric < 1575979034 179113 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :hi < 1575979036 179185 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :got a problem < 1575979133 909655 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :i have a graph with 142k nodes and 2.5mil edges < 1575979163 475976 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :and i want to compute the diameter < 1575979657 801970 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :how do i make this problem tractable? < 1575979694 49183 :Taneb!~Taneb@runciman.hacksoc.org PRIVMSG #esoteric :Solve the problem of making yourself not want that? < 1575979702 124718 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :well i really want that < 1575979712 949707 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :and cloud computing is cheap < 1575979756 496183 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :so i need a way to distrubute the floyd warshall algorithm across different machines < 1575979790 257772 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :in a smart way so that machines try to do as much as they can locally and don't always compete for shared resources < 1575979841 122618 :Taneb!~Taneb@runciman.hacksoc.org PRIVMSG #esoteric :https://www3.nd.edu/~tweninge/pubs/PW_HPGM.pdf here is a paper < 1575979849 664201 :Taneb!~Taneb@runciman.hacksoc.org PRIVMSG #esoteric :It might even be helpful < 1575980194 910357 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :I don't know if I'd use floyd warshall to compute the diameter in this case at all < 1575980218 531169 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :like, given the graph is simple, you can already calculate an upper bound of the diameter < 1575980252 212784 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :how? < 1575980470 736227 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :that's a tough one I maybe think about later, but I just assumed that you can make assertions about cycle lengths which in turn will reduce the diameter < 1575980553 841643 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :like, if you have at leas as much edges as you have nodes, you will have a cycle of at least length 3 reducing the diameter from a maximum of n to a maximum of n-1 < 1575980773 81676 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :i think i can do dijkstra from each node to every other node < 1575980796 949011 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :it's trivially parallelisable by just having a local copy of the adjacency matrix on each machine < 1575980902 413103 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :is this stupid? < 1575981020 719227 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :is this really an advantage over a normal floyd warshall? < 1575981087 8047 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :i don't know how to split it across machines < 1575981098 934106 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :well < 1575981102 844719 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :ok i'm dumb < 1575981104 869944 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :no < 1575981119 335823 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :you will need to have at least n^3/(n log n) processes for that to be faster < 1575981159 125040 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :with floyd warshall you'd need to write to the shared cache all the time < 1575981166 778842 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :how do you parallelise that? < 1575981304 713521 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :not sure, that's why I wouldn't use that :D < 1575981326 942699 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :i just want an algorithm that's reasonably fast and that can be split < 1575981619 769924 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :yeah, but I would assume there exists a reasonably parallelizable algorithm to calculate the diameter of a graph that does not rely on calculating each distance and finding the maximum in those < 1575981702 771207 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :like, if you can give an upper bound on the diameter (which I believe you can), you may be able to parallelise the search based on clusters of size g(max diameter) < 1575981904 916999 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :i have a strong feeling that the diameter is like 7 < 1575981914 284780 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :but i'm not sure < 1575981997 76675 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :altho i'm not sure i understand how your idea works < 1575982092 428582 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :I am thinking about generating a transitive hull and check for completeness of the resulting graph < 1575982121 39603 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :that might work < 1575982924 779482 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :Here's another paper: https://www.ntu.edu.sg/home/arijit.khan/Papers/vertex_centric_edbt17.pdf < 1575982981 556759 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :I don't know if it's any good, but it's got a "vertex-centric" algorithm for a diameter, and there are things to parallelize algorithms like that, like our "Pregel". < 1575983033 686085 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :(TBH, it doesn't look particularly efficient, more a toy example.) < 1575983475 639499 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :fizzie: https://pregel.it/en/ < 1575983478 602228 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :looks delicious < 1575983554 556819 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :https://blog.acolyer.org/2015/05/26/pregel-a-system-for-large-scale-graph-processing/ < 1575983558 692079 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :seems like a google thing < 1575983563 777128 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :didn't know that you're at google < 1575984980 37637 :Taneb!~Taneb@runciman.hacksoc.org PRIVMSG #esoteric :izabera: did you look at the PDF I linked < 1575985193 804624 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :I don't go around advertising it, though it's not a secret either. < 1575985342 935327 :izabera!~izabera@unaffiliated/izabera PRIVMSG #esoteric :Taneb: i'm dumb and it's complicated < 1575986167 444879 :Lord_of_Life_!~Lord@unaffiliated/lord-of-life/x-0885362 JOIN :#esoteric < 1575986191 865410 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 QUIT :Ping timeout: 268 seconds < 1575986249 104803 :Lord_of_Life_!~Lord@unaffiliated/lord-of-life/x-0885362 NICK :Lord_of_Life < 1575987536 551821 :kritixilithos!~kritixili@gateway/tor-sasl/kritixilithos JOIN :#esoteric < 1575991339 577663 :LBPHacker!lbphacker@trigraph.net PRIVMSG #esoteric :lol wut < 1575991369 737919 :LBPHacker!lbphacker@trigraph.net PRIVMSG #esoteric :(ignore me, my client is acting up) < 1575991446 534528 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 JOIN :#esoteric < 1575991558 520435 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :izabera: re computing diameter, that looks borderline. do you have enough RAM to allocate a square matrix whose width and height is the number of points, or at least a triangular half of it? the elements themselves can be small, probably single bytes, possibly two bytes if the diameter is large. < 1575991576 731770 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :if you do have enough RAM for that, then use Floyd's algorithm to compute the pairwise distances < 1575991648 842190 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :that's not an impossibly large amount of memory these days, you can probably borrow some time on a machine with that much RAM < 1575991680 75234 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :izabera: are there edge weights? < 1575991821 947137 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :is computing a single transitivity step for a graph in matrix form that hard? < 1575991931 244292 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :if you suspect that the diameter is small, then you can optimize it well, you don't need a full Floyd < 1575991950 852130 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :it still won't be fast, but it will be much faster and easier than trying to figure out some distributed solution < 1575992059 94650 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :if you don't have enough RAM, then yes, run an individual BFS from each node, to make sure that you can reach all nodes of the graph in few steps < 1575992088 41729 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :in fact, that's probably faster than anything with a full matrix, because your graph is sparse enough < 1575992102 997351 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :so ignore my previous idea about a large matrix and floyd's algorithm < 1575992126 427136 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :you said your graph is very sparse, so just do a BFS from each individual node to find the distance of the farthest node from there < 1575992238 892391 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :I suggest that you implement the DFS using two arrays with one bit each for each node, to know which one you've visited in the previous step and the current step, and passes of reading through the edge list in sequence < 1575992275 791495 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :I suggest sorting the edge list for some speedup < 1575992350 429462 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :izabera: ^ that would work reasonably fast for a graph of small diameter, because you're reading the edge list sequentially, and you only need to access 284000 bits i.e. 35 kilobytes random access < 1575992439 532738 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :if you double the edge list, making it an arc list (storing each edge in both directions) and sort it by destination node, the you only need random access to one of the bit arrays and sequential access to the other bit array, so the array with random access just fits in the L1 cache < 1575992450 446435 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :so that's what I'd recommend < 1575992455 37746 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :hth < 1575992573 894055 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :this is assuming that the graph is confidental or you want to solve it yourself; otherwise just publish the graph and offer money to people for computing the diameter < 1575992720 744706 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :require solvers to give not only the diameter, but the indexes of two nodes that are that far apart, so you can verify easily < 1575992820 161009 :FireFly!znc@freenode/staff/firefly PRIVMSG #esoteric :ah yes, the O(incentive) approach < 1575992976 711579 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :wib_jonas: that would not suffice < 1575993006 169899 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :i can easily claim the diameter being 1 and give you two nodes with a distance of 1 < 1575993188 829498 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :you would need to have at least one honest participant < 1575993204 770402 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :myname: it doesn't suffice, but your solution doesn't work, because izabera can find the submission that claims the highest diameter, and run a single breadth-first search from one of the nodes that it claims to find the distance of the two nodes that it claims, and if that's 7 then that proves your submission incorrect < 1575993234 445129 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :the failure case is that everyone claims a diameter that is lower than the actual one < 1575993248 490580 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :or that izabera is DOSed by too many incorrect submissions < 1575993335 364764 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 PRIVMSG #esoteric :myname: also the spec said "i have a graph with 142k nodes and 2.5mil edges", that's not a complete graph so the diameter can't be 1 < 1575993373 100348 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :well yeah, but i should be able to find some nodes with distance 3 pretty easily < 1575993429 427067 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :oh, couldn't you just contract parts of the graph? < 1575993516 760130 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :like, if you have a path of length n > 1, you could just make that into a path of length 1 with a weight of n < 1575993548 131614 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :if you do end on a complete graph, you just need to find the biggest weight < 1575993600 237341 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :or you could just split the graph in half, substitute the missing half with a new node and try some clever merging of paths, that run through that < 1575993680 720711 :myname!~myname@ks300980.kimsufi.com PRIVMSG #esoteric :(paths meaning longest distance travels between two nodes in the later case) < 1575995159 666608 :nico_nico!~khais@arennes-653-1-264-221.w109-218.abo.wanadoo.fr JOIN :#esoteric < 1575995648 192629 :nico_nico!~khais@arennes-653-1-264-221.w109-218.abo.wanadoo.fr QUIT :Quit: WeeChat 2.6 > 1575995830 419623 PRIVMSG #esoteric :14[[07Dd14]]4 10 02https://esolangs.org/w/index.php?diff=67862&oldid=56366 5* 03Dart 5* (+4206) 10Stretching the essay to the 500 word requirement like: < 1575996563 112196 :int-e!~noone@int-e.eu PRIVMSG #esoteric :wtf is this "The download cannot be saved because an unknown error occurred." < 1575996677 24243 :int-e!~noone@int-e.eu PRIVMSG #esoteric :Oh, it's me, more specifically umatrix interfering in a way I have not identified before--it categorizes the request as "other" and blocks it. Fine. < 1575997088 921529 :zzo38!~zzo38@24-207-50-7.eastlink.ca QUIT :Ping timeout: 246 seconds < 1575997312 52967 :wib_jonas!25bf3cd1@gateway/web/cgi-irc/kiwiirc.com/ip.37.191.60.209 QUIT :Remote host closed the connection > 1575999357 545131 PRIVMSG #esoteric :14[[07Truth-machine14]]4 10 02https://esolangs.org/w/index.php?diff=67863&oldid=67519 5* 03Hex96 5* (+54) 10 > 1575999537 143503 PRIVMSG #esoteric :14[[07Dd14]]4 M10 02https://esolangs.org/w/index.php?diff=67864&oldid=67862 5* 03Dart 5* (+4) 10 < 1576000790 815051 :nico_nico!~khais@arennes-653-1-264-221.w109-218.abo.wanadoo.fr JOIN :#esoteric < 1576000980 52318 :FreeFull!~freefull@defocus/sausage-lover JOIN :#esoteric < 1576002418 577542 :mroman!b2c5e0d3@178.197.224.211 JOIN :#esoteric < 1576002461 912003 :mroman!b2c5e0d3@178.197.224.211 PRIVMSG #esoteric :huh. long time no see I guess < 1576002561 690727 :b_jonas!~x@catv-176-63-14-135.catv.broadband.hu JOIN :#esoteric < 1576002581 164044 :mroman!b2c5e0d3@178.197.224.211 PRIVMSG #esoteric :https://pastebin.com/EcuX91Hk <- and I'm already back at doing useless things. < 1576002775 266179 :kritixilithos!~kritixili@gateway/tor-sasl/kritixilithos QUIT :Quit: quit > 1576002988 413043 PRIVMSG #esoteric :14[[07Talk:Tttt14]]4 10 02https://esolangs.org/w/index.php?diff=67865&oldid=67861 5* 03Hex96 5* (+174) 10/* Other Programs */ < 1576003906 84997 :LKoen!~LKoen@lstlambert-657-1-122-23.w92-154.abo.wanadoo.fr JOIN :#esoteric < 1576004506 446987 :LKoen!~LKoen@lstlambert-657-1-122-23.w92-154.abo.wanadoo.fr QUIT :Remote host closed the connection < 1576004518 678281 :LKoen!~LKoen@lstlambert-657-1-122-23.w92-154.abo.wanadoo.fr JOIN :#esoteric < 1576005012 640267 :nico_nico!~khais@arennes-653-1-264-221.w109-218.abo.wanadoo.fr QUIT :Quit: WeeChat 2.6 < 1576006063 940068 :Boko_ggeahbf!~smokevadi@cgn-pool-83-219-136-167.tis-dialog.ru JOIN :#esoteric < 1576006092 901939 :Boko_ggeahbf!~smokevadi@cgn-pool-83-219-136-167.tis-dialog.ru QUIT :Read error: Connection reset by peer > 1576007955 542855 PRIVMSG #esoteric :14[[07User:Hex9614]]4 10 02https://esolangs.org/w/index.php?diff=67866&oldid=67774 5* 03Hex96 5* (+41) 10 > 1576007980 836768 PRIVMSG #esoteric :14[[07User:Hex9614]]4 10 02https://esolangs.org/w/index.php?diff=67867&oldid=67866 5* 03Hex96 5* (+4) 10/* List of esolangs */ < 1576008108 726137 :ArthurStrong!~ArthurStr@slow.wreckage.volia.net JOIN :#esoteric > 1576008160 545422 PRIVMSG #esoteric :14[[07414]]4 10 02https://esolangs.org/w/index.php?diff=67868&oldid=65112 5* 03Hex96 5* (+151) 10/* Hello, World! */ > 1576008195 625028 PRIVMSG #esoteric :14[[07414]]4 10 02https://esolangs.org/w/index.php?diff=67869&oldid=67868 5* 03Hex96 5* (-23) 10/* Hello, World! */ > 1576008251 692280 PRIVMSG #esoteric :14[[07414]]4 10 02https://esolangs.org/w/index.php?diff=67870&oldid=67869 5* 03Hex96 5* (+80) 10/* Cat program */ < 1576008327 72209 :b_jonas!~x@catv-176-63-14-135.catv.broadband.hu PRIVMSG #esoteric :`? 4 < 1576008329 584368 :HackEso!~h@unaffiliated/fizzie/bot/hackeso PRIVMSG #esoteric :​`4 is equivalent to `5 , except that it only repeats 4 times. Useful when you've already run a command forgetting to use `5. < 1576008745 887752 :b_jonas!~x@catv-176-63-14-135.catv.broadband.hu PRIVMSG #esoteric :can't people invent normal names for these brainfuck-equivalents? < 1576008787 988836 :b_jonas!~x@catv-176-63-14-135.catv.broadband.hu PRIVMSG #esoteric :ok, I'm not sure I'm allowed to complain, given how I name things < 1576010218 214860 :arseniiv!~arseniiv@94.41.35.79.dynamic.ufanet.ru PRIVMSG #esoteric :b_jonas: how? < 1576011697 277363 :mroman!b2c5e0d3@178.197.224.211 QUIT :Remote host closed the connection < 1576011757 222400 :djhoulihan!~djhouliha@68.183.28.54 QUIT :Ping timeout: 240 seconds < 1576012183 344608 :MDude!~MDude@97-127-187-59.cdrr.qwest.net JOIN :#esoteric < 1576017072 444088 :int-e!~noone@int-e.eu PRIVMSG #esoteric :b_jonas: I've solved the AoC problems so far over the past 6 hours. < 1576017113 344098 :shachaf!~shachaf@unaffiliated/shachaf PRIVMSG #esoteric :Today's AoC challenge: Prove that every vector space has a basis. < 1576017124 972555 :int-e!~noone@int-e.eu PRIVMSG #esoteric :KISS is such a powerful principle. < 1576017143 962688 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :I have no idea how long I've spent, because the timing starts from what's 5am here. < 1576017179 742160 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :Guess I could extrapolate from the delta between part 1 and part 2 though. < 1576017187 959402 :int-e!~noone@int-e.eu PRIVMSG #esoteric :You can still keep track of the time *you* spend. < 1576017195 74519 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :Yes, but not retroactively. :) < 1576017199 459735 :int-e!~noone@int-e.eu PRIVMSG #esoteric :Right. < 1576017201 761324 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :Well, maybe from file timestamps. < 1576017221 579816 :int-e!~noone@int-e.eu PRIVMSG #esoteric :I'm extrapolating from part 1 of the 1st day ;) < 1576017240 784611 :int-e!~noone@int-e.eu PRIVMSG #esoteric :I'll lose track if I continue doing this. < 1576017250 744602 :int-e!~noone@int-e.eu PRIVMSG #esoteric :The leaderboard scoring is atrocious, btw. < 1576017284 534652 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :I'm kind of happy it is, because otherwise I'd probably start caring about it. < 1576017300 245247 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :(In fact I did today's right when it opened, because happened to be awake.) < 1576017358 55704 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :Fortunately it's fun enough to just write those things. < 1576017583 513241 :int-e!~noone@int-e.eu PRIVMSG #esoteric :for the later problems I could reconstruct things reasonably well by the file stamps of the inputs < 1576017634 714476 :int-e!~noone@int-e.eu PRIVMSG #esoteric :Hmm, or maybe not. I have not been consistent about downloading the input when I start. < 1576017647 175408 :int-e!~noone@int-e.eu PRIVMSG #esoteric :Oh well, who really cares. < 1576017722 70326 :b_jonas!~x@catv-176-63-14-135.catv.broadband.hu PRIVMSG #esoteric :shachaf: https://www.xkcd.com/804/ I told you not to take the axiom of choice < 1576017954 383157 :int-e!~noone@int-e.eu PRIVMSG #esoteric :meh, perhaps somebody cares: wc counts of what I've produced: http://paste.debian.net/1120577/ < 1576018210 185928 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :I think my Python's been more verbose. < 1576018232 370622 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :http://ix.io/245v < 1576018270 794061 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :Well, same order of magnitude. < 1576018391 640933 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :(Flatter directory structure though.) < 1576018433 892845 :int-e!~noone@int-e.eu PRIVMSG #esoteric :I expected slightly harder problem (so more exploration) < 1576018461 389456 :int-e!~noone@int-e.eu PRIVMSG #esoteric :It's still nice not having to rename the 'input' files, but it's a minor thing. < 1576018477 436195 :int-e!~noone@int-e.eu PRIVMSG #esoteric :Also I broke the Intcode API once so having copies is actually healthy. < 1576018510 591997 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :I'm sharing, that's why I have test.py (which runs all the day*.py and compares their outputs to a golden copy). < 1576018523 154749 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :Although from the "your Intcode computer is now complete", maybe there won't be any more. < 1576018572 905886 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :I'm pretty sure I was doing these some previous year as well, but no idea where I've stashed the solutions. < 1576018597 870268 :int-e!~noone@int-e.eu PRIVMSG #esoteric :yeah, the 2019 is a bit silly :) < 1576018658 871834 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :To be fair, 'aoc2019' is the only thing in my '~/src/puzzles'. Not because there haven't been any puzzles, I just think I've used ~/tmp, ~/src/misc, or whatever. < 1576020041 957113 :Sgeo_!~Sgeo@ool-18b982ad.dyn.optonline.net QUIT :Read error: Connection reset by peer < 1576020361 844357 :LKoen!~LKoen@lstlambert-657-1-122-23.w92-154.abo.wanadoo.fr QUIT :Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.” < 1576020365 25842 :Sgeo!~Sgeo@ool-18b982ad.dyn.optonline.net JOIN :#esoteric < 1576020458 167093 :arseniiv!~arseniiv@94.41.35.79.dynamic.ufanet.ru PRIVMSG #esoteric :https://www.xkcd.com/2235 haha < 1576022071 365944 :arseniiv!~arseniiv@94.41.35.79.dynamic.ufanet.ru PRIVMSG #esoteric :luckily AoC can be googled by “aoc of code”; just "AoC" in quotes gives bizarre results, apparently lacking respect for mixed case in queries < 1576022181 970394 :int-e!~noone@int-e.eu PRIVMSG #esoteric :quick, we need an axiom of code