Hacker Newsnew | past | comments | ask | show | jobs | submit | honoredb's commentslogin

Typo near the beginning, "press a petal," gave me a fascinating mental image for a second.

I'm sure it'll be informative to learn exactly why every theoretical avenue for faster-than-light travel doesn't work, but I feel like we can infer from the size of the universe that these effects don't exist; if they did, they'd dominate our observations of the universe and we'd never have thought the speed of light was a fundamental limit in the first place.


Flower petals would make an amazing tactile controller


This is a nice explanation and a cool solution. I amused myself a bit ago by trying to come up with a solution for these two constraints without reading about the crypto work, and ended up with something different. In my scheme, a voter casts a vote for a candidate and gets a receipt with the UUID of the vote, which is simply mapped to the candidate so that they can verify it online later. However, the voter can also cast any number of additional ballots, which are constrained by the system to be pairs of votes and anti-votes, each for the same candidate, and get receipts for each. For example, I support Harker, but I've been paid to vote for Dracula. I go into the voting booth and cast my vote for Harker, getting Receipt 1. Then I press an extra button to cast a fake vote for Dracula, and get Receipts 2 and 3, with 3 being a special negative ballot. I can show Receipt 2 to my briber, who can verify that it corresponds to a vote for Dracula. But secretly, I can use Receipt 1 to check that my vote for Harker was counted correctly, and Receipt 3 to see that a negative vote was also cast for Dracula, cancelling out my bribed vote.

You need to allow each voter to cast multiple fake votes, otherwise the briber/coercer could simply demand receipts for a fake vote in addition to the real ones. Could get a bit unwieldy. But the big advantage is that there's no extra complexity for the average voter, since they don't need to cast any fake votes.


The machine could give the same UUID to different voters:

- Voter 1 votes for Harker

- Voter 2 votes for Harker, gets the same UUID. The machine casts a vote for Dracula instead

It could also cast any number of fake/counter votes without the voter knowing.


You make the ID be a hash of a UUID and the voter’s name.


That allows proving who cast which vote. Instead, you could generate the ID when the vote is cast using a coin flip protocol.

Some effort would be needed to create an actual proof that the coin flip protocol doesn’t allow the voter to generate any sort of proof that they participated in the coin flips. I think the usual schemes do have this property (at least, they do if the parties don’t collide), but I haven’t seen this specifically proven.


This sounds like the method from the Rivest, 2006 paper: https://rcoh.me/posts/verifiable-voting-primer/#fn:triple


There couldn't be any limit on the number of votes/receipt for each person. If you could get a maximum of N receipts, then you could be paid to deliver all N receipts so they can be sure you haven't snuck in any additional votes.


Maybe require that additional votes be different? Then they wouldn't be able to tell which was legit.


That doesn't work with proportional representation though.


How so? The number of votes cast for each candidates is unchanged after you add the numbers up.


You're right, I misread.


How would an observer validate that only eligable voters voted?


The easy way would be to pick out a limited subset of votes and require voters to produce the receipts for them. It's not ideal since this makes the system more complicated for voters and voters are forced to use fake ballots if you want plausible deniability, but it works.

Then again, this is also a problem with existing methods isn't it?


> The easy way would be to pick out a limited subset of votes and require voters to produce the receipts for them. It's not ideal since this makes the system more complicated for voters and voters are forced to use fake ballots if you want plausible deniability, but it works.

What happens when some of the voters fail to produce the receipts? This seems inevitable even assuming good faith, but especially if it could be used to cast doubt on the legitimacy of the winning candidate (and it wouldn't even require voting against one's real preferences, given the existence of 'fake votes' in this system). Just deleting the unverified votes won't achieve much, if only a small subset are being tested.


That's pretty clever.


Naturally, you can generate awful continuations in the same style via GPT-2.

Model prompt >>> As they sprinted together down the echoing, looping ramp of the deserted Guggenheim Museum, closely pursued by three swarthy members of the resolutely vicious Cannelloni gang, square-jawed British Royal Marine art historian/world's deadliest sniper John Savage and his voluptuous young modern art critic/Navajo linguist Samantha Silver cursed architect/interior designer/writer/educator Frank Lloyd Wright for designing such a circuitous route out of the building.

>>> ======================================== SAMPLE 1 ======================================== The fact that the entire way was over a five-pointed star of the "Stars of David," which both men had tattooed on their arms, was beside the point. Neither of them would have been deterred if their pursuers had been armed with nuclear weapons, which would undoubtedly obliterate the entire museum, as well as any of the many high-rise buildings surrounding it.

At the heart of the building is an enormous, ornate winged monolith bearing the words "

======================================== SAMPLE 2 ========================================

"Just the way he built this place," Savage snarled, his hands clenched, "he'd be able to make any building disappear any time he wanted."

A couple of hours later, back at work, Silver and I were finally able to catch up with fellow explorer/writer/reporter Charles Fenton, who had been in the Museum galleries earlier in the day and stayed behind to observe our conversation. "That was quite a day!" he beamed at me.

======================================== SAMPLE 3 ========================================

As they approached the main lobby, Savage turned and grinned, showing off his impressive, biceps-bound physique. There was a reason the gang of thugs had been lured here, he explained to Silver. There were two other entrances out to street level. "The most efficient way of crossing this place is by helicopter." He paused, eyes scanning the distance. "And that would require an army or navy to pull it off." He raised his gun and laughed. A few yards away, Savage and


This. Technical verification solutions help, but none of them defend very well against your CEO apparently ordering you to bypass the verification step.


So the idealized authoritarian CEO must first have ordered you to never bypass it, and then must regularly test you to ensure that it cannot be bypassed.

There's no reason this sort of authorization process couldn't be trivially handled with any one of a number of simple technologies. If there isn't already some sort of Personal Verification Service to do this, well, there's a niche to be had. Come up with a better name.


The story of a bug that caused the AI to optimize for maximally disturbing text that went unchecked because the only people authorized to stop it were asleep is a great illustration of how easy it is for an AI to "go evil" when you're not worrying about safety.


Link, please?



Not OP, but I think they're referring to: https://slatestarcodex.com/2018/10/30/sort-by-controversial/

Though I hesitate to draw strong conclusions from fiction.


I'm super distracted by the use of ԛ instead of q in this article, what's that about? Plagiarism detection? Seems bad for accessibility/SEO.


Oh, I get it, it's a defense against plagiarism detection. The article is largely plagiarized from other sources, but since they didn't contain the homographs you can't just google the unique sentence "This is a fair and legitimate question, but not the first question you want to ask." (Original source, possibly: https://www.risesmart.com/blog/6-key-questions-ask-during-sa...)


Looks like this article has been posted on multiple blogs -- the oldest one I found was on glassdoor's blog.


I assume that's different characters? How could you even tell?


They happen to look significantly different in the font in the article the way my browser is rendering it. They're using the Cyrillic character that looks like q, https://en.wikipedia.org/wiki/Qa_(Cyrillic).


Not sure why you got downvoted. It was the first thing I noticed about this generic listicle.


It's not just ԛ.

They also use: а, с, е, о, р, ѕ, and у



I love this title and abstract; we need more of this kind of plain speaking and rigor when dealing with mysticism-adjacent areas.


So now we have to consider the specter of someone writing an overly verbose review of something that reduces to "tl;dr". Someone might summarize the review by writing "tl;dr: tl;dr". Or they might express the same thing, but overly verbosely, so someone might summarize their response by writing "tl;dr: tl;dr: tl;dr". In general, if N "tl;dr"s is a valid sentiment, and any valid sentiment can be expressed overly verbosely, then N+1 "tl;dr"s are a valid sentiment, so by induction any positive integer repetition of "tl;dr"s is valid. However, there exists some number L such that L repetitions of "tl;dr" is itself too long to express the necessary point, and someone who didn't read it would want a summary, the most succinct of which would presumably be "tl;dr: tl;dr nested L times". This meta "tl;dr" itself might be expressed overly verbosely, of course...


Well done. Shame it's buried under N comments.


Nitpick: "…had 13 not been prime" is not meaningless whimsy--a prime number of images is harder to lay out on the page. Mentioning this in the caption without explaining it is whimsical, but like a lot of GEB I'd argue it's whimsy with a purpose: training the reader to look for applications of abstract concepts. The reader ideally goes "wait, what? There's no connection between those two things! Unless..."


Indeed. And it's a small but interesting sentence, because it serves as a counterexample to some theories of counterfactuals. To quote the Stanford Encyclopedia of Philosophy article on David Lewis (p □→ q means "if p were true then q"):

> The basic idea behind the alternative analysis was similar to that proposed by Robert Stalnaker (1968). Let's say that an A-world is simply a possible world where A is true. Stalnaker had proposed that p □→ q was true just in case the most similar p-world to the actual world is also a q-world. Lewis offered a nice graphic way of thinking about this. He proposed that we think of similarity between worlds as a kind of metric, with the worlds arranged in some large-dimensional space, and more similar worlds being closer to each other than more dissimilar worlds. Then Stalnaker's idea is that the closest p-world has to be a q-world for p □→ q to be true.

But "13 is prime" is the most central example of a necessary truth; in this example there _are_ no p-worlds. So the fact that this sentence is, in fact, meaningful shows that the way we use language is doing something different from Stalnaker's model.

And of course, the connection between counterfactuals, analogy making, and general intelligence is one of Hofstader's research interests, and he comes back to it in a later chapter. This example of his again kindof makes fun of counterfactual reasoning about mathematical objects:

> Related to this notion of slipping between closely related terms is the notion of seeing a given object as a variation on another object. An excellent example has been mentioned already-that of the "circle with three indentations", where in fact there is no circle at all. One has to be able to bend concepts, when it is appropriate. Nothing should be absolutely rigid.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: