Hacker News: jasonmorton

New comment by jasonmorton in "Open Source Coalition Announces 'Model-Signing' to Strengthen ML Supply Chain"

jasonmorton — Sun, 06 Apr 2025 00:57:20 +0000

This lets you verify the signature on the model. It won’t help you tell that a decision came from that model. If you want to verify the inference that a model makes, check out https://github.com/zkonduit/ezkl (our project).

New comment by jasonmorton in "Show HN: Timelock.dev – Send a secret into the future using timelock encryption"

jasonmorton — Sun, 10 Mar 2024 21:27:02 +0000

You can ZK an XGBoost or neural net with https://github.com/zkonduit/ezkl

New comment by jasonmorton in "Show HN: Turn ML/AI models into zero-knowledge proofs"

jasonmorton — Sat, 14 Oct 2023 16:32:20 +0000

Here is the twitter thread providing an introduction and some background: https://twitter.com/ezklxyz/status/1712940546182774936

Show HN: Turn ML/AI models into zero-knowledge proofs

jasonmorton — Sat, 14 Oct 2023 16:30:30 +0000

Compile almost any pytorch, tensorflow, and sklearn code into fast zero-knowledge circuits with corresponding wasm or on-chain verifiers. Ezkl aims to be the simplest way to run ML, AI, and other business logic for on-chain applications. We also offer a managed pipeline to help applications run resource intensive proving, Javascript bindings for web developers, and Python bindings for data scientists.

Comments URL: https://news.ycombinator.com/item?id=37881845

Points: 4

# Comments: 1

New comment by jasonmorton in "Decentralized Artificial Intelligence"

jasonmorton — Mon, 02 Oct 2023 13:55:19 +0000

> Checking the work takes the same resources as doing the work. > As much as this would be wonderful in a universe where it's possible, it's simply not possible.

We do live in that universe, under some currently believed assumptions. An NP-complete problem is an example of something where checking a solution is (thought to be) easier than finding one.

Zero-knowledge proofs make it such that checking that a computation (such as inference) has been done correctly is easier than doing the computation (even keeping some parts private). A great reference is here: https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.pdf

New comment by jasonmorton in "Decentralized Artificial Intelligence"

jasonmorton — Sun, 01 Oct 2023 12:17:32 +0000

One can cryptographically prove the correct inference of a small AI model now with https://github.com/zkonduit/ezkl (our open-source package).

New comment by jasonmorton in "PoisonGPT: We hid a lobotomized LLM on Hugging Face to spread fake news"

jasonmorton — Sun, 09 Jul 2023 21:07:33 +0000

Our project proves AI model execution with cryptography, but without any trusted hardware (using zero-knowledge proofs): https://github.com/zkonduit/ezkl

New comment by jasonmorton in "What's the Deal with Zkapps?"

jasonmorton — Thu, 20 Oct 2022 23:27:08 +0000

There are definitely certain scenarios, especially around verifiable compute, in which you can think of ZK as a software alternative to a secure enclave.

Interestingly, if you ask people which they would trust for a rollup, most say ZK is the more trustworthy technology. In part just because it doesn't depend on one vendor (the enclave manufacturer).

New comment by jasonmorton in "What's the Deal with Zkapps?"

jasonmorton — Thu, 20 Oct 2022 23:23:28 +0000

Here are two good places to start:

http://learn.0xparc.org/

https://www.youtube.com/playlist?list=PLj80z0cJm8QErn3akRcqv...

New comment by jasonmorton in "What's the Deal with Zkapps?"

jasonmorton — Thu, 20 Oct 2022 19:00:25 +0000

Examples include the various zkEVM projects, risc0, and slightly more limited stuff like our effort to compile PyTorch/ONNX to a zk circuit (https://github.com/zkonduit/ezkl).

Speed and memory usage is improving quickly.

New comment by jasonmorton in "EmacsConf 2021 Call for Proposals"

jasonmorton — Thu, 05 Aug 2021 20:46:02 +0000

Not OP, but for me adding or deleting a character in the middle of a paragraph in a latex doc hangs for maybe .5s or more, often. This is a fairly new phenomenon, never happened 2+ years ago.

New comment by jasonmorton in "EmacsConf 2021 Call for Proposals"

jasonmorton — Thu, 05 Aug 2021 19:25:19 +0000

I've been using emacs for many years now, and I'm sad to say that it has never been slower, despite the hardware getting better. Now it lags like crazy when editing a latex document, no matter the recent version. Something went off the rails in the last year or so, and even Atom is more responsive.

New comment by jasonmorton in "“35-50% of clicks on Reddit Ads are fraudulent”"

jasonmorton — Fri, 09 Oct 2020 18:33:43 +0000

Many ads are not clicked on by a real person, but a bot, or someone clicking ads as fast as possible because it is their job.

Many comments would be considered "fraudulent" in the same sense, in that they were not authored by a real person, but a bot, or someone writing comments as fast as possible because it is their job.

New comment by jasonmorton in "Ask HN: Parents, what are you doing for school this fall?"

jasonmorton — Mon, 17 Aug 2020 19:02:06 +0000

We've been working with Modulo as well; the experience is excellent and is constantly adapting to make it work for our kids, rather than imposing a formula. They enjoy having some autonomy in their education. It's a very nice community as well, and they have the chance to make friends all over the country.

New comment by jasonmorton in "Microsoft Contractors Are Listening to Some Skype Calls"

jasonmorton — Thu, 08 Aug 2019 18:28:28 +0000

Thanks, looks like this is: https://github.com/jitsi/jitsi-meet

New comment by jasonmorton in "Microsoft Contractors Are Listening to Some Skype Calls"

jasonmorton — Thu, 08 Aug 2019 17:09:02 +0000

Can anyone recommend a good open-source chat and call solution? I'm looking for something I can run on my own server to support friends and family, with an iOS and Android app. It doesn't have to support more than one or two video calls at a time. I figure this is sadly the long term solution.

New comment by jasonmorton in "What you may have heard about the dispute between UC and Elsevier"

jasonmorton — Wed, 07 Aug 2019 14:46:00 +0000

There are some high-quality open access journals (e.g. https://www.emis.de/journals/SIGMA/) that don't charge authors. They use arxiv overlay. It is entirely possible.

New comment by jasonmorton in "What you may have heard about the dispute between UC and Elsevier"

jasonmorton — Wed, 07 Aug 2019 14:43:20 +0000

Copyright assignments made by authors can be cancelled [1]. For papers and books from before 1994 or so (25 years from present), you can write a letter to the publisher cancelling your grant or assignment of copyright to them. The rules are complex so I might be missing some details. But there are probably a lot of researchers who could take advantage of this to put on some pressure and reclaim their work.

[1] https://www.copyright.gov/docs/203.html

New comment by jasonmorton in "Ask HN: How to self-study mathematics from the undergrad through graduate level?"

jasonmorton — Fri, 18 Jan 2019 19:08:06 +0000

Here is a proven approach for at least the first part, building foundations and being ready for graduate work. Many Berkeley Ph.D. students passed through this route. Get the book "Berkeley Problems in Mathematics." It contains historical problems from the Berkeley math prelim exam, and solutions. Now don't look at any solutions yet.

This is the exam all Berkeley math Ph.D. students must pass within three semesters of arriving to stay in the program, and the fail rate is about 50%.

You will also need reference books, advanced undergraduate and beginning graduate textbooks. Buy, download, or borrow as appropriate.

Pick a problem (start with the older ones, they are easier). Set aside 30-60 mins and try to solve it. No devices, no references at all, go to a library or a coffee shop without your devices. Dont' give up till time is over. If you cannot (usually the case), still don't look at the answer. Hit the reference books (don't look up the problem online either, it will go right to the answer and you won't learn much). Read and try to understand enough so that you can solve the problem. It is ok if you solve it this way (in the course of reading about it).

For bonus points, students studying for the exam will typically take entire old exams (available from the Berkeley website), take that to the library and just sit down for three to six hours and try to solve all the problems correctly. Then self-grade harshly. When you can do that for a recent exam (and get a good score), you will have more or less mastered undergrad math to the point that you could teach it.

Most important: you have to struggle to solve problems. Reading a solution is about as useful as watching someone else lift weights: you get minor tips on form but not any stronger.

New comment by jasonmorton in "U.S. Launches Criminal Probe into Bitcoin Price Manipulation"

jasonmorton — Thu, 24 May 2018 16:02:51 +0000

12.15 on p 167 of http://cdn.batstrading.com/resources/regulation/rule_book/BA...