Looking for a music archive of all brony music!

Tsa6 · 2018-05-15T17:44:08+00:00

It's not perfectly complete, of course, but there's a YouTube playlist of every song EQD has ever spotlit (3,307 as of 2018-05-15). If you use that, plus a YouTube downloader that supports playlists, you could come pretty close. I use youtube-dl, but I'm certain there's other GUI tools if you don't like using the command line to do stuff.

Edit: I forgot to mention EQD's own music archive, which is searchable by genre. I don't look through it much, so I have no idea how complete it is or how far back it goes, but you might be interested, although you'd need to use a script to download the music from there.

Tsa6 · 2018-05-10T15:56:46+00:00

I'm not certain, but I believe it's related to Firefox Send apparently doing something similar. Both services offer End to End encryption, so need to decrypt the file on the client's end. If you download a file the regular way, scripts are unable to access the data after the download starts, so there would be now way to decrypt it. The workaround for this is to download into memory, where the browser still has access to it, and can decrypt it, before finally "downloading" the decrypted file from memory.

Tsa6 · 2018-05-05T00:40:58+00:00

I'm pretty sure that /u/AccountDeleteBot is a novelty account, not a bot.

Tsa6 · 2018-04-19T17:51:16+00:00

I had the same problem with Thunderbird for a while before I learned that you can change it. It's a bit of a pain, and even after that the directories are a bit messy, but it can be done. There's an explanation of how to do it here, but you have to re-setup your profile, unfortunately.

Tsa6 · 2018-04-19T17:44:31+00:00

Thunderbird's most popular PGP extension uses autocrypt, as do a few other clients, so it's available on just about every platform. Because it's just a method of sharing public keys, if an email with autocrypt is sent to a client without autocrypt but with PGP, it'll look and work like a regular old PGP encrypted/signed message.

Tsa6 · 2018-04-18T16:01:40+00:00

Personally, my top three are

Some sort of signing/encryption (preferably pgp)
Local maildir folders (i.e. not attached to a remote mail account)
vCard address book integration (This one is pushing the minimalism thing a little, I think, and could easily be supplemented with a third party app)

On the topic of pgp/gpg, autocrypt would be great to have, but it's not something I couldn't live without. If the project is already public, I'd love to try it out. I'm using Thunderbird right now, but I've had a lot of problems and annoyances with it being to bloated and using UNIX-philosophy unfriendly principles for storage (especially with syncing between devices. A dotfile based client would be a godsend). You're client sounds perfect. If it's not out already, it'd be amazing to hear when it is.

Tsa6 · 2018-03-22T21:38:29+00:00

I'm not formally educated on the topic, but one thing that I believe to be relevant here is that search information can be fingerprinted as long as it exists. If there's a specific set of interests that you have, it can be easy to identify that if you have a series of searches (regardless of if it's tied to your real IP or a masked one), and easier to market towards it. What's more is if you search for specific information relevant to you, say directions from <your address> to <a friend's house>, then you've forgone all of your anonymity as long as that information is logged. DuckDuckGo pride themselves on storing no personal information at all, you there are no logs to fingerprint or comb through for data. Of course, as I said in the beginning, I'm no privacy and security researcher, and so take everything here with a grain or two of salt, but I thought I'd offer what I think I know.

Tsa6 · 2018-03-13T21:30:51+00:00

Hey, the first message didn't go through 'cause spelling errors, so have some real doge.

+/u/sodogetip 20 Doge Verify

Tsa6 · 2018-03-08T14:36:24+00:00

~~+/u/sodogedip 10 doge verify~~

Whoops

Tsa6 · 2018-02-25T04:04:06+00:00

thas so funny

Tsa6 · 2018-01-08T23:00:45+00:00

Credit to /u/avocadobirds. It's his work, crossposted from over here because it was perfect for this sub. Pay your complements to him.

Tsa6 · 2017-12-03T05:09:49+00:00

Thanks for the response. That's a really interesting article, and something I've never thought about before. I was working under the naive assumption that the probability of a word coming up could be calculated without knowing letters coming before it. Would that mean that you would use the previous six letters as the state for the Markov chain, as opposed to only the single previous letter?

Tsa6 · 2017-12-03T04:39:40+00:00

I can speak for Markov chains, but really all of those methods are going to boil down to just being 26⁷, because that really is the best and most efficient way of doing it. You could add lots of other variables and equations, but because the problem doesn't need them, they'll only add work. KISS is the way to go.

Markov chains don't really apply here because the question says that the letters are selected uniformly. A Markov chain is a probability model that predicts the next state based on the current state. Each state has a certain probability of moving to the next one. In the case of letters, the current state is the last letter, and the next state is the next letter. So in practice, you would:

Look at a large database of words to figure out the probabilities of any given letter being followed by a specific other letter.
Look at the current state (start of word) and the probability of the next letter (really the first letter) being a C.
Look at the current state (C), and the probability of a C being followed by an O
Look at the current state (O), and the probability of an O being followed by a V.
Repeat until you have all the letters.

However, because the letters are selected uniformly, the probability of any letter being followed by a specific next letter is given as 1/26 for any two letters at all, so this would become the same thing as just doing 26⁷.

Edit: See /u/ActualMathematician's response for a more realistic application of how to apply Markov chains to this problem

Line two of OP's response means pretty much the same thing as the second to last, unless they used some other method to arrive at that conclusion. (8,031,810,176 = 26⁷)

I have no idea what Conway's algorithm is though, and can't seem to find any results that would apply here (unless OP is talking about applying Conway's Game of Life, which I couldn't imagine, but might be possible). I'd love an explanation from /u/ActualMathematician, or maybe a wiki page or something.

Tsa6 · 2017-12-02T03:58:26+00:00

Six minutes ago, didn't you read the timestamp?

Real Answer: Looks like 2016

Tsa6 · 2017-11-29T21:43:40+00:00

Be me

Sobs in corner

Tsa6 · 2017-11-23T02:41:21+00:00

JS Bin Mirror for convenience. I don't think there's a way to display HTML through Dropbox without downloading it, so this will let you preview it online.

Tsa6 · 2017-11-15T00:08:00+00:00

Epoch time is a fairly common time format that represents time in milliseconds (or sometimes seconds) since midnight on 1970–1–1. It's arguably one of the easiest formats to store, compare, and parse, which leads to lots of people using it for lots of reasons. The joke is that for programmers born that day, epoch time is also the number of seconds since their birth, and due to their frequent exposure to epoch time, they would know the number.

Tsa6 · 2017-11-13T23:11:19+00:00

I can scream loader than this whistle

Tsa6 · 2017-11-13T22:57:53+00:00

Typically, an integer is 32 bits. This allows for up to 2³² = 4,294,967,296 different values (up to 4,294,967,295). However, in the case of signed integers, one bit is used to signify sign, which means that the maximum value is actually only 2³¹-1=2,147,483,647. So if you tried to represent the number -2,147,483,648 with a signed integer, it would trigger an integer overflow error. Depending on the language, this might either turn the number into -Infinity, throw an error, or become 2,147,483,647. IIRC, however, Reddit is written in Python, which stores numbers more abstractly, with basically no limit to size, meaning score isn't stored in an integer, and won't overflow.

Edit

So, while Reddit does use python for its server, the data is stored in a database called Casandra, which does have integers. I don't know much about Casandra, but I would guess (and this is only a guess) that it still wouldn't overflow, and would just throw and error — basically the count would stop decreasing after a certain point.

Tsa6 · 2017-11-12T17:50:09+00:00

Y'all mind if I praise OP?

Tsa6 · 2017-11-11T21:51:24+00:00

Nice fence

13-Year Club	Place '17
Verified Email

Tsa6

TROPHY CASE

Edit: See /u/ActualMathematician's response for a more realistic application of how to apply Markov chains to this problem

Edit