unprovable

There are pedagogical books (CF. 'Counterexamples in Topology', 'Counterexamples in Analysis') that teach the nuances of subjects through counterexamples. They're popular as it's sometimes easier to learn details from a pathology or degenerate example than from just learning what is intended.

Neat! Perhaps add a wishlist or Project tab? :)

Tangentially, I recall reading a paper not that long ago that showed that under certain assumptions that Zermelo's theorem showed that making the games 'quantum games' didn't actually offer any real advantage.

It's so old skool, it's almost new again... almost... Still waiting for that third (or fourth?!) wave of XXE (or similar) bugs.

"Control iOS games through mouth movements" ... not me gurning continuously at candy crush, no siree... x-D

I've been trying to get access to CHERI for quite a while - I have a background in hardware security so was very curious to have a play. But only 'approved partners' are allowed to have access... guessing even in projects like this, Security through Obscurity still reigns.

Short and simple Chrome extension that reads the requests in a page looking for '.pdf'in URL or 'pdf' in MIME type, and then reads all the chunks and reassembles the file from the base64 provided by Chrome. Uses `Network.getResponseBody` to get the data - select a tab from the dropdown, go and reload the content (scroll all the way through if it's long), and it should find all the pieces, reassemble, and present them as a download.

Designed for getting a file out when you have to from a page that doesn't have a download button and has a CDN that you have to parse through all the chunks in order to acquire the file from raw requests.

EDIT - uses `chrome.debugger` API, so wont' work in Firefox without totally reworking it (but probably possible!)

Hard agree with this My fave workflow I did was making the first fully regulatory approved LLM workflow for a global retail bank, using GPT 3.5 in June 2023 on Azure early access. That stack is still the reference for a lot of the work we've done since and currently.

Geography has really started making the internet a lot less open... In the UK, I guess there's some kind of allowance for free access?

Nice - can't wait to see how it grows!

I think recounting how far YAML has come is actually really useful - props to the author for stating the case I think quite well!

If we couldn't make underwater datacenters work, I doubt it's half as easy to make space-based ones work.

Cobbled together with Clanker Claude over a few weekends, based on work I was doing on the RAPTOR project for automated vulnerability finding. Based on the CHEESECLOTH by Cueller et al. from USENIX '23 - https://www.usenix.org/conference/usenixsecurity23/presentat...

With a lot of disclosure chatter going around like it's 2000-and-great, perhaps we can utilise the cryptography of ZKPs and tlock cryptography to disclose bugs; I can prove the bug works in a zkVM, without anyone knowing the details of the exploit except those who have the keys. Then you can timelock it to reveal after disclosure period, or not... your choice. Either way, we can assess the risk and determine important facts about an exploit without ever diclosing it until required.

Aim - to upgrade the conversation around disclosure. It's the future, let's act like we have more options.

Update - put it on a site for folk to use: https://shadowcat.online/

I'm actually very impressed how many people are now playing with Zero Knowledge on HN... I put this out a week ago, and have seen many more popping up. Amazing!

So two parts to a reply - first is, you don't need the encryption per se, but you can add that in the case that you give it some key and then it's encrypted. I don't see the value unless you're using this to generate frames for a video, which isn't current functionality but totally doable.

Second part, Charlie Bennet said "the only entropy source is one you can trust" and the best entropy source is quantum fluctuations, so we built a fully open source phase diffusion QRNG at Quantum Village and released it. Link: https://github.com/QuantumVillage/EntropyLoop

There is a toggle where you can show what chunks have been received. This is also where the 'show specific chunk' function comes in... the receiver can see "oh, I'm only missing chunk 125, so just show me that" etc. etc.

This seems to get impressive results cross compiling models from torch (with vollo-torch) into FPGA friendly formats. Speedups look quite impressive...

With great difficulty...

Cheers!

QR code has limits, use the file transfer to chunk it. :)

If you like this, you're probably gonna like this: https://en.wikipedia.org/wiki/Chessboard_complex

Single page file transfer using QR Codes and a browser. Sending device loads a file into the page, gets chunked. Receiver gets all the chunks through a camera, tosses lightly and reassembles, CRC to garnish. Designed to push data from an old phone that had broken comms after it took a swimming lesson in a coffee mug, it's been quite handy.

An important context here is the one in which George Boole was noticing the patterns that he created an algebra out of; he was actually analysing the Chinese book I Ching... The fact that context is so lost by the amplification of what is, itself, a distillation is, as you rightly argue, the real issue. Not sure what the answer is, but it probably isn't C^* algebras.

Nice UI, but there are open source tools that do the same (network monitoring, static code analysis, etc).

There are a number of "Let's move away from mainframes"-style projects. Most prominent other I've heard of is 'Gravity' at Santander Bank (https://www.santander.com/en/stories/7-questions-on-how-grav...)

This is cool - Seeing a lot more usefulness being found for things like ASTs, SMT solvers, and other automated reasoning tools within LLM workflows. Things like this are useful as it gives an potential extra layer of confidence. Nice one.

Fun! Although, a total token sink It'll be really interesting to see how the game evolves!

TL;DR - all numbers defined in EML are computable (mainly because exp and log are computable for computable complex inputs, and the primary input ('1') is ofc computable) - this isn't as obvious as first thought, and you need some machinery from computable analysis. Ultimately, you get the canonical example of Chaitin's \Omega_U is inexpressible in EML (it's left-c.e. but not computable).

EML is also shown to be equivalent to the EL numbers due to Chow (1999). Additionally, the expressions for x*y, -x, and x^{-1} are optimal (there are no shorter EML expressions for those, by exhaustive search).

It's easy to dismiss 'Hack Now Decrypt Later' (HNDL) attacks as viable quantum threats, so this blog explores other ways that nefarious actors can utilize Shor's algorithm to leverage crime.

"Happy World Quantum Day! This year, Quantum Village is releasing a project that we think some of the lecturers/students at Imperial might find useful; a functional font for drawing quantum circuit diagrams!"