| --- Log opened Sat Jul 07 00:00:19 2012 |
| 00:06 | | Netsplit *.net <-> *.split quits: @rms, froztbyte, @jerith, Reiver, @PinkFreud |
| 00:07 | | Noah [nbarr@Nightstar-e4b6966f.tn.comcast.net] has joined #code |
| 00:07 | | Netsplit over, joins: @PinkFreud, &jerith, Reiver, froztbyte, @rms |
| 00:13 | | Derakon[AFK] is now known as Derakon |
| 00:13 | | mode/#code [+ao Derakon Derakon] by ChanServ |
| 00:25 | | You're now known as TheWatcher[t-2] |
| 00:29 | | Attilla_ [Obsolete@Nightstar-d2497510.as43234.net] has joined #code |
| 00:29 | | Attilla [Obsolete@Nightstar-3504c1a9.as43234.net] has quit [Ping timeout: 121 seconds] |
| 00:31 | | Attilla_ is now known as Attilla |
| 00:34 | | You're now known as TheWatcher[zZzZ] |
| 00:41 | | io|gone is now known as iospace |
| 00:42 | | Attilla [Obsolete@Nightstar-d2497510.as43234.net] has quit [Ping timeout: 121 seconds] |
| 00:46 | | Attilla [Obsolete@Nightstar-d2497510.as43234.net] has joined #code |
| 00:52 | | gruber is now known as gnolam |
| 01:20 | <~Vornicus> | Five sigma is somewhere around 7 9s. |
| 01:23 | < ToxicFrog> | aargh |
| 01:24 | < ToxicFrog> | fuck parsatron, fuck clojure, fuck everything |
| 01:30 | | * Vornicus recommends you relax and do some postscript hacking or something. |
| 01:57 | | Attilla [Obsolete@Nightstar-d2497510.as43234.net] has quit [Ping timeout: 121 seconds] |
| 02:06 | <@Alek> | maybe get back to basics. |
| 02:07 | <@Alek> | do some BASIC coding. |
| 02:15 | | Kindamoody[zZz] is now known as Kindamoody |
| 02:19 | | mode/#code [+o Kindamoody] by ChanServ |
| 03:29 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has quit [Operation timed out] |
| 03:33 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has joined #code |
| 03:52 | | Kindamoody is now known as Kindamoody|afk |
| 04:00 | < Noah> | http://www.youtube.com/watch?v=4gZ5rsAHMl4&feature=g-u-u |
| 04:00 | < Noah> | Ow, my head |
| 04:01 | | SmithKurosaki [smith@Nightstar-1748d158.home1.cgocable.net] has joined #code |
| 04:26 | | thalass [thalass@Nightstar-4d42bb11.bigpond.net.au] has joined #code |
| 04:26 | | * thalass ponders Evernote vs Tomboy |
| 04:26 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has quit [Connection closed] |
| 04:29 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has joined #code |
| 04:29 | < thalass> | Evernote has an android client that can do everything, afaik. Whereas Tomdroid is read-only. |
| 04:36 | <@Alek> | what are those? |
| 04:39 | < thalass> | notebook type progams with wiki-like interlinking etc. |
| 04:58 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has quit [Connection closed] |
| 05:01 | | SmithKurosaki [smith@Nightstar-1748d158.home1.cgocable.net] has quit [Ping timeout: 121 seconds] |
| 05:03 | | iospace is now known as iospacedout |
| 05:14 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has joined #code |
| 05:31 | | Syloq_Home [Syloq@NetworkAdministrator.Nightstar.Net] has quit [Client closed the connection] |
| 05:33 | | himi [fow035@Nightstar-5d05bada.internode.on.net] has quit [Ping timeout: 121 seconds] |
| 05:40 | | Syloq_Home [Syloq@NetworkAdministrator.Nightstar.Net] has joined #code |
| 05:46 | | himi [fow035@Nightstar-5d05bada.internode.on.net] has joined #code |
| 05:47 | | mode/#code [+o himi] by ChanServ |
| 06:02 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has quit [Connection closed] |
| 06:07 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has joined #code |
| 06:22 | | himi [fow035@Nightstar-5d05bada.internode.on.net] has quit [Ping timeout: 121 seconds] |
| 06:34 | | himi [fow035@Nightstar-5d05bada.internode.on.net] has joined #code |
| 06:34 | | mode/#code [+o himi] by ChanServ |
| 07:04 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has quit [Connection closed] |
| 07:13 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has joined #code |
| 07:15 | | Derakon is now known as Derakon[AFK] |
| 07:26 | | You're now known as TheWatcher |
| 07:34 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has quit [Connection closed] |
| 07:35 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has joined #code |
| 07:40 | | Kindamoody|afk is now known as Kindamoody |
| 08:47 | | You're now known as TheWatcher[afk] |
| 08:57 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has quit [Connection closed] |
| 09:44 | < froztbyte> | Noah: nice link :) |
| 09:44 | < froztbyte> | the kid who did the interview is pretty good at his stuff too: http://www.youtube.com/watch?v=z4x5FZyzLyQhttps://www.youtube.com/watch?v=z4x5FZ yzLyQ |
| 09:44 | < froztbyte> | err |
| 09:44 | < froztbyte> | https://www.youtube.com/watch?v=z4x5FZyzLyQ |
| 09:44 | < froztbyte> | wtspdojflisjf pastebuffers |
| 10:43 | | Attilla [Obsolete@Nightstar-d2497510.as43234.net] has joined #code |
| 10:44 | | Attilla [Obsolete@Nightstar-d2497510.as43234.net] has quit [[NS] Quit: ] |
| 10:55 | | Attilla [Obsolete@Nightstar-d2497510.as43234.net] has joined #code |
| 11:41 | | iospacedout is now known as iospace |
| 12:25 | | himi [fow035@Nightstar-5d05bada.internode.on.net] has quit [Ping timeout: 121 seconds] |
| 12:38 | | himi [fow035@Nightstar-5d05bada.internode.on.net] has joined #code |
| 12:38 | | mode/#code [+o himi] by ChanServ |
| 12:53 | < Tarinaky> | Stupid question... |
| 12:53 | <@Tamber> | Stupider answer. |
| 12:53 | < Tarinaky> | Is there a way of getting a positive/scalar difference without using a conditional? |
| 12:54 | <@Tamber> | abs()? |
| 12:54 | < Tarinaky> | I did say it was stupid :) |
| 12:55 | <@Tamber> | Well, I don't know if abs() is exactly the right solution to your problem; but it seems to be in the general direction of a solution, at least. :p |
| 12:55 | < Tarinaky> | It is exactly the right solution to my problem. |
| 12:55 | <@Tamber> | Hooray |
| 12:56 | < Tarinaky> | Trying to write a function that returns the number of squares/game tiles between two points... But counting diagonals as 1 instead of sqrt(2). |
| 12:57 | < Tarinaky> | Basically what I've got is to return the larger of dy or dx (where dy = y1-y0 and dx = x1-x0). |
| 12:57 | < Tarinaky> | Which I -think- is the right thing. |
| 12:58 | < Tarinaky> | Of course... I'm not sure this is the right approach to the actual problem I'm trying to solve. |
| 12:59 | < gnolam> | Which is? |
| 12:59 | < Tarinaky> | Which is to build a map describing whether a given space can be seen or not seen. |
| 12:59 | < gnolam> | PVS in 2D? |
| 12:59 | < Tarinaky> | The problem is it's seen or not seen by a list of things. |
| 12:59 | < Tarinaky> | Rather than seen or not seen around terrain. |
| 12:59 | < Tarinaky> | PVS? |
| 13:00 | < gnolam> | Potentially Visible Set. |
| 13:00 | < Tarinaky> | I don't really know what that means. |
| 13:00 | < Tarinaky> | I need to BRB though, my brothers want feeding. |
| 13:00 | < gnolam> | A culling method for 3D rendering. |
| 13:00 | < Tarinaky> | It's like having a pet with opposeable thumbs :p |
| 13:01 | < gnolam> | Basically, "For each location in the map, keep a set of which polygons /may/ be visible from that spot." |
| 13:07 | < Tarinaky> | That might be it. I better explain the problem more. |
| 13:08 | < Tarinaky> | Each unit has a Sensor level and a Stealth level. You can always see enemy units that are in the same space as friendly units. |
| 13:08 | < Tarinaky> | But at range your Sensor level has to beat their Stealth level plus the range distance. |
| 13:09 | < Tarinaky> | So if you have level 5 sensors then at 1 space away you can beat Stealth 4. At 2 spaces you can beat Stealth 3. At 3 spaces you can beat Stealth 2... |
| 13:11 | < Tarinaky> | So my thinking is, for every space on the map I need to find the closest friendly ship and work out what, effective, sensor level we have. |
| 13:14 | < Tarinaky> | Then figuring out if a ship is visible in that space is as simple as comparing it to an integer in a map. |
| 13:21 | | cpux [cpux@Nightstar-c5874a39.dyn.optonline.net] has joined #code |
| 13:26 | | Kindamoody is now known as Kindamoody|out |
| 13:44 | | * Tarinaky is confused by an error. |
| 13:44 | < Tarinaky> | return map[(x,y)] |
| 13:44 | < Tarinaky> | KeyError: ((3, 40), True) |
| 13:44 | < Tarinaky> | Is ((3,40),True) the key that was just used? |
| 13:45 | < Tarinaky> | Because I'm struggling to see ow x,y could have that value. |
| 13:45 | < Tarinaky> | (Python2) |
| 13:46 | < gnolam> | Yes. |
| 13:46 | < Tarinaky> | How the merry hell is x,y == ((3,40,True) ?# |
| 13:51 | < Tarinaky> | ARGH FUCKING ECLIPSE |
| 13:55 | | SmithKurosaki [smith@Nightstar-1748d158.home1.cgocable.net] has joined #code |
| 13:59 | | Rhamphoryncus [rhamph@Nightstar-5697f7e2.abhsia.telus.net] has quit [Client exited] |
| 14:00 | <&jerith> | Tarinaky: x=(3,40), y=True |
| 14:12 | | * Tarinaky is currently wtf ing at another bug now :/ |
| 14:12 | | * Tarinaky has... no idea why this isn't working since he used a known good/less broken procedure as a base for it :/ |
| 14:15 | < Tarinaky> | Ahah! |
| 14:34 | | SmithKurosaki [smith@Nightstar-1748d158.home1.cgocable.net] has quit [Ping timeout: 121 seconds] |
| 14:49 | | Noah [nbarr@Nightstar-e4b6966f.tn.comcast.net] has quit [Ping timeout: 121 seconds] |
| 16:12 | | himi [fow035@Nightstar-5d05bada.internode.on.net] has quit [Ping timeout: 121 seconds] |
| 16:25 | | himi [fow035@Nightstar-5d05bada.internode.on.net] has joined #code |
| 16:25 | | mode/#code [+o himi] by ChanServ |
| 17:21 | | You're now known as TheWatcher |
| 18:40 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has joined #code |
| 18:58 | | himi [fow035@Nightstar-5d05bada.internode.on.net] has quit [Connection closed] |
| 19:08 | | Noah [nbarr@Nightstar-e4b6966f.tn.comcast.net] has joined #code |
| 19:21 | | Kindamoody|out is now known as Kindamoody |
| 19:35 | | Kindamoody is now known as Kindamoody[zZz] |
| 19:40 | | Derakon[AFK] is now known as Derakon |
| 19:59 | | ShellNinja is now known as Nikolaas |
| 19:59 | | rms is now known as Masako |
| 21:08 | < Noah> | Is anyone familiar of a collision resistant hash function for files in general, particularly audio files |
| 21:10 | <@Tamber> | SHA512sum, problem solved. |
| 21:10 | <@Tamber> | :p |
| 21:12 | < Noah> | Cool, thanks |
| 21:14 | < Noah> | Though there are no collisions for 256 eitherand 224 for that matter? |
| 21:14 | <@Tamber> | Don't know. |
| 21:14 | < Noah> | It's what's wiki is saying anyway |
| 21:14 | <&McMartin> | The larger the number, the less likely it gets. |
| 21:15 | < Noah> | Of course |
| 21:15 | <&jerith> | Does it need to be entire collision-free? |
| 21:15 | < Noah> | But I'd rather deal with a 224 versus a 512 |
| 21:15 | < Noah> | jerith: Yes |
| 21:15 | <&jerith> | Why? |
| 21:16 | < Noah> | Song fingerprintting |
| 21:16 | <&McMartin> | All hashes collide, eventually, by the pigeonhole principle. |
| 21:16 | < Noah> | McMartin: Granted. |
| 21:17 | <&McMartin> | Dropbox uses SHA256 for dedup, IIRC. |
| 21:17 | < Noah> | Yea, I think 224 should be good enough for me |
| 21:19 | < Noah> | I'm going to assume there are python libraries for that too |
| 21:20 | < Noah> | hashlib |
| 21:21 | < Noah> | Hmm |
| 21:21 | < Noah> | http://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algo rithms |
| 21:21 | < Noah> | Does show collisions, even for SHA512 |
| 21:21 | <~Vornicus> | Well, duh |
| 21:22 | < Noah> | RIPEMD doesn't though? |
| 21:22 | <&McMartin> | ALL HASHES COLLIDE. |
| 21:22 | <~Vornicus> | What McM said. |
| 21:22 | < Noah> | At least for 320 and 128/256 |
| 21:22 | <&McMartin> | A hash that doesn't collide is a compression algorithm. |
| 21:22 | < Noah> | McMartin: Do hashes collide? |
| 21:23 | <~Vornicus> | All. |
| 21:23 | < Noah> | All what? |
| 21:23 | <~Vornicus> | All hashes collide. |
| 21:23 | < Noah> | What collides? |
| 21:23 | | * Tamber smacks Noah with a clue by 4. |
| 21:23 | <~Vornicus> | If I have a 256 bit hash, I am guaranteed that at least half of all 257-bit messages will have the same hash as another of those 257-bit messages. |
| 21:23 | <&jerith> | For dedup, you use the hashes to decide whether to compare the actual objects. |
| 21:24 | | * Noah was awaiting for the Cluemore |
| 21:24 | <~Vornicus> | There is absolutely no way to get around this. |
| 21:25 | < Noah> | Wait. Hashes can collide? |
| 21:25 | <&jerith> | Hashes throw awy information. |
| 21:25 | <&jerith> | Therefore, they cannot be used as an information-substitute. |
| 21:27 | <~Vornicus> | Indeed: for a k-bit hash and an n-bit message, you are guaranteed that there is at least one other n-bit message with the exact same hash for 1 - 1/(2**(n - k)) of the messages. |
| 21:33 | | Noah [nbarr@Nightstar-e4b6966f.tn.comcast.net] has quit [[NS] Quit: Leaving] |
| 21:35 | | Noah [nbarr@Nightstar-e4b6966f.tn.comcast.net] has joined #code |
| 21:36 | <&McMartin> | If all you're trying to do is make sure that you have a handy ID for each of your MP3s that's filename-independent, you can quite honestly use something hilariously shitty like MD5. |
| 21:36 | < Noah> | That's part of it |
| 21:36 | | jerith [jerith@ServerAdministrator.Nightstar.Net] has quit [Ping timeout: 121 seconds] |
| 21:37 | <&McMartin> | The weaker hash algorithms are only weak because someone can easily *deliberately construct* garbage data that happens to hash to the same thing. |
| 21:37 | < Noah> | Right, such as using password hashes |
| 22:05 | | jerith [jerith@Nightstar-bf52129d.slipgate.za.net] has joined #code |
| 22:05 | | mode/#code [+ao jerith jerith] by ChanServ |
| 22:14 | | jerith [jerith@ServerAdministrator.Nightstar.Net] has quit [[NS] Quit: leaving] |
| 22:14 | | jerith [jerith@Nightstar-bf52129d.slipgate.za.net] has joined #code |
| 22:14 | | mode/#code [+ao jerith jerith] by ChanServ |
| 23:25 | | Masako is now known as rms |
| 23:28 | | Nikolaas is now known as ShellNinja |
| 23:32 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has quit [Connection closed] |
| 23:46 | | Ariii [Ariii@Nightstar-f695463f.cicril.sbcglobal.net] has joined #code |
| --- Log closed Sun Jul 08 00:00:34 2012 |