Mielke reached that conclusion after analyzing Nest Cam's power consumption. Typically a shutdown or standby mode would reduce current by as much as 10 to 100 times, Mielke said. But the Google Nest Cam's power consumption was almost identical in "shutdown" mode and when fully operational, dropping from 370 milliamps (mA) to around 340mA. The slight reduction in power consumption for the Nest Cam when it was turned "off" correlates with the disabling of the LED power light, given that LEDs typically draw 10-20mA.
In a statement to The Security Ledger, Nest Labs spokesperson Zoz Cuccias acknowledged that the Nest Cam does not fully power down when the camera is turned off from the user interface (UI). "When Nest Cam is turned off from the user interface (UI), it does not fully power down, as we expect the camera to be turned on again at any point in time," Cuccias wrote in an e-mail. "With that said, when Nest Cam is turned off, it completely stops transmitting video to the cloud, meaning it no longer observes its surroundings." The privacy and security implications are serious. "This means that even when a consumer thinks that he or she is successfully turning off this camera, the device is still running, which could potentially unleash a tidal wave of privacy concerns," Mielke wrote.
"Everybody likes free stuff, but the problem with such plans is that they allow phone and cable companies to steer their users to certain types of content. As a result, customers are less likely to visit websites that are not part of the free package." T-Mobile has said that its zero-rating plan, called Binge On, is good for consumers and for Internet businesses because it does not charge companies to be part of its free service. "Binge On is certainly better than plans in which websites pay telecom companies to be included," concludes The Times. "But it is not yet clear whether these free plans will inappropriately distort how consumers use the Internet."
Neil recently turned 76 but his passion for mathematics remains as strong as ever. Talking about a recent project, he writes: “Back in September I was looking at an old sequence in the OEIS. The sequence starts 1, 12, 123, 1234, 12345, ..., 123456789, 12345678910, 1234567891011, ... The n-th term: just write all the decimal numbers from 1 to n in a row and think of this as a big number. The entry for the sequence had a comment that it is expected that there are infinitely many terms which are primes, but that no prime was known, even though Dana Jaconsen had checked the first 64,000 terms. So I asked various friends and correspondents about this, and people extended the search somewhat. In fact Ernst Mayer has set up a cloud-source project to look for primes in the sequence, and the sequence has now been checked to nearly n = 270,000 without finding a prime. But I am hopeful that a prime will appear before we get to n = 10^6. When a prime is found, as it surely will be, it probably won't be the largest prime known, but it will be close to the record (which is held by the latest Mersenne prime). We may make it into the top ten. It will certainly be the largest known prime which is easy to write down! (Explicitly, I mean. You may know that 2^32582657-1 is prime, but you won't be able to write down the decimal expansion without using a computer).”
Neil has agreed to take some time away from his favorite sequences and answer any questions you may have. As usual, ask as many as you'd like, but please, one question per post.