[QUOTE=DeadKiller987;31010919]Website server's hard drive fails, all backups fail, everyone's passwords are lost forever.[/QUOTE]
I said hashing a keyphrase to generate a secure password. Nothing's stored on a server, the Javascript bookmarklet just does the hashing.
[QUOTE=DeadKiller987;31010919]Website server's hard drive fails, all backups fail, everyone's passwords are lost forever.[/QUOTE]
They wouldn't be stored on a server like that (that would be horribly insecure, too). I'm pretty sure that he's talking about having the bookmarklet and script on the page, and it would hash them clientside.
EDIT: How did it not show me a post from an hour ago?
[QUOTE=Neo Kabuto;31011935]They wouldn't be stored on a server like that (that would be horribly insecure, too). I'm pretty sure that he's talking about having the bookmarklet and script on the page, and it would hash them clientside.[/QUOTE]
I love how he ninja'd you by about an hour and still said almost exactly the same thing.
[QUOTE=chimitos;31012065]I love how he ninja'd you by about an hour and still said almost exactly the same thing.[/QUOTE]
I love how Chrome does this to me all the time, even when I use the Read Posts page.
I just spent half an hour trying to figure out why OpenGL was telling me that my GLSL program had failed to link, even though the info log was empty and the shader actually worked — on two different OpenGL implementations, no less.
Then I noticed that I had written:
[code]if (!link_status); {[/code]
:suicide:
[QUOTE=Quark:;31010969][img]http://gyazo.com/583a1ff90512cb673009087e7e8ecce6.png[/img]
The Messiah has returned![/QUOTE]
Deloc has been reincarnated as a frog
I'm leaving to go camping for a week, so I'm waiting for the Polycode networking module. Might get started on the server's non-networking stuff.
[QUOTE=ZenX2;31012688]Deloc has been reincarnated as a frog[/QUOTE]
Even if Deloc reincarnated as a frog, the only person he'd be telling to "get out" would be himself. :v:
[QUOTE=Downsider;31011077]I said hashing a keyphrase to generate a secure password. Nothing's stored on a server, the Javascript bookmarklet just does the hashing.[/QUOTE]
So you would use your passphrase, it hashes on your server, comes back and you use that as the actual password? That is a pretty awesome Idea I think! + You could add extra security with a per-user salt or something.
[QUOTE=commander204;31013680]So you would use your passphrase, it hashes on your server, comes back and you use that as the actual password? That is a pretty awesome Idea I think! + You could add extra security with a per-user salt or something.[/QUOTE]
A master password for salt, then the bookmarklet hashes it. There's no server, really, just a website that helps you prepare the bookmarklet. It'd have to be prepared dynamically because there's really no secure way to store the master password as salt unless it's stored directly in the script, as Javascript doesn't have much storing capabilities and cookies could get cleared whenever.
I'll give it a shot, it's not that hard to make and could be something incredibly practical :D
[QUOTE=bobthe2lol;31009574]I'm not sure I understand that math, and I don't think I clarified enough. How would I generate a list of ones and twos that has all the combinations of 1 and 2 adding up to a specific length? Like,
[code]
{
{1,1,1,1,1,1}
{1,1,1,1,2}
{1,1,2,2}
{2,2,2}
{2,1,1,1,1}
...
}
[/code]
that sequence adds up to 6, but for any length? The page said something like, "An obvious way to generate permutations of [I]n[/I] is to generate values for the Lehmer code (possibly using the [URL="http://en.wikipedia.org/wiki/Factorial_number_system"]factorial number system[/URL] representation of integers up to [I]n[/I]!), and convert those into the corresponding permutations." Questions about that:
Its not obvious to me, shut up.
permutations of n? What is n made up of? What is n?
what the fuck is the Lehmer code, what te fuck are the factorial number system representations of integers up to n factorial?
And how do you convert them to the corresponding permutations?
The problem with technical wikipedia is that it assumes you already know what it's talking about.[/QUOTE]
The answer is
[img]http://latex.codecogs.com/gif.latex?{{b^{n+1}%20-%20b}%20\over%20{b%20-%201}}[/img]
where n is the length of the sequence and b is the amount of numbers you can have (you can have 1 and 2 in this case - so b is 2).
[editline]9th July 2011[/editline]
Assuming order matters, i.e. {1, 2} isn't the same as {2, 1}
[editline]9th July 2011[/editline]
How I thought of it - treat the sequence of numbers as a numeral system (a binary system with b=2). Count the amount of numbers you can express with n digits. Note that in a normal number system, 0 is a number, so 0001 is the same as 1. Not in this case, so you need to add together how many numbers you can express with 1 digit, with 2 digits, and so on to n digits. It becomes a geometric series.
[editline]10th July 2011[/editline]
I'm off to basic training on Monday. I don't have any open projects, but I want to program something before I'm leaving. How can I spend the last day and night
[QUOTE=ZenX2;31012688]Deloc has been reincarnated as a frog
I'm leaving to go camping for a week, so I'm waiting for the Polycode networking module. Might get started on the server's non-networking stuff.[/QUOTE]
Let's stop calling people out and start posting content again. We don't want this place to turn into the shithole that is the Lua forum.
[QUOTE=AntonioR;31009755]Been working on some kind of level editor for my 2d game (hobby, nothing comercial). It is pretty stupid, but you can make levels with it and save them [sp]to a text file :)[/sp].
You can add entities, move them around, change some parameters. You can work with parallax scrolling on and off, set layers to be visible or not, collidable or not...
It is WIP, I hope it will get better. Don't ask me how I made it, it is pretty noob-ish.
Edit: OOps, as you can see there are some bugs. Entity info and Edit Entity is not updated properly :P
[/QUOTE]
Are you still working with A2D? Remember you from the jsharbour forums
[QUOTE=Overv;31015065]Let's stop calling people out and start posting content again. We don't want this place to turn into the shithole that is the Lua forum.[/QUOTE]
I try to include content in any post I make that is even slightly off topic so I don't feel guilty
[img]http://ahb.me/3tHH[/img]
I got arguments working
Everybody ready for the next programming competition?
[QUOTE=Loli;31016435]Everybody ready for the next programming competition?[/QUOTE]
But dlaor isn't on vacation yet.
[editline].[/editline]
or otherwise taken care of.
Ahh well, he adds a nice challenge.
Also, we've been offered another $30 for the winner :v:
This one should be good. I'll start working on a thread.
Create a topic and start collecting some prices, maybe somebody with money, like garry would like to chip in.
Money is so...non personal.
[QUOTE=AtomiCasd;31016956]Money is so...non personal.[/QUOTE]
No shit.
But it's used to buy stuff and frankly I'd rather get $30 than some random objects, virtual or not.
[QUOTE=Loli;31016435]Everybody ready for the next programming competition?[/QUOTE]
But what about the minigame colla -
[QUOTE=Loli;31016614]Also, we've been offered another $30 for the winner :v:[/QUOTE]
Okay, gogogo.
Your name is the most glorious one I've ever seen with the smilie script on
finally finished my sphere... there were tons of off by 1 errors (some of them off by multiples of 3 due to me messing up the number of vertices per index and the number of indices per triangle). There's still a tiny off by 1 error at the very bottom of the sphere, I just put a TODO by it, because I just want to start on shadow mapping now. The sphere asks for a radius and the number of subdivisions and it can generate it. Right now it's 32 subdivisions, 2 units radius. (the box over there has an edge size of 1)
[img]http://i.imgur.com/r4qDd.jpg[/img]
My first try at deferred lighting, It sounds pretentious saying that because It's actually very easy to do.
[img]http://dl.dropbox.com/u/99765/44211.png[/img]
Is there an ASCII character that only takes up the bottom left or right half of it's space?
Like these:
[IMG]http://dl.dropbox.com/u/21571661/Pictures/left.png[/IMG] [IMG]http://dl.dropbox.com/u/21571661/Pictures/right.png[/IMG]
[QUOTE=layla;31019555]My first try at deferred lighting, It sounds pretentious saying that because It's actually very easy to do.
[img]http://dl.dropbox.com/u/99765/44211.png[/img][/QUOTE]
Loading Valve BSP files or just re-using the name?
If you're loading the Valve ones, are you just using the plane struct to get the normal of the surface?
I'm pretty sure BSP is a widely used format.
[editline]9th July 2011[/editline]
[url=http://en.wikipedia.org/wiki/BSP_%28file_format%29]yes, yes it is.[/url]
[url]http://dl.dropbox.com/u/11275736/s/rand.png[/url]
I have
no idea
[QUOTE=Ac!dL3ak;31021288][url]http://dl.dropbox.com/u/11275736/s/rand.png[/url]
I have
no idea[/QUOTE]
Damnit man, why did you have to open it?!
[QUOTE=Naelstrom;31021053]I'm pretty sure BSP is a widely used format.
[editline]9th July 2011[/editline]
[url=http://en.wikipedia.org/wiki/BSP_%28file_format%29]yes, yes it is.[/url][/QUOTE]
BSP is really only noted for the "Binary Space Partion" of it - The method of visibility stored in the file. But if he's doing HL2/Quakes, they're all very similar. However he could be rolling his own and using a BSP visibility solution and used the name too. Thus the asking.
Sorry, you need to Log In to post a reply to this thread.
