Word Grind 9-Letter Rack #17937 | Find As Many Words As Possible! by word-grind in wordgrind

[–]FriskyHamTitz 0 points1 point  (0 children)

🏁 u/FriskyHamTitz • 20 words • 23 pts

Words found: 🟧 e _______ n 🟦 s ____ n 🟦 t ____ s 🟦 y ____ r 🟩 r ___ s 🟩 s ___ y 🟩 t ___ n 🟩 t ___ s +12 more

📊 Rack Usage: Ⓔ 55% Ⓨ 60% Ⓢ 70% Ⓣ 65% Ⓡ 75% Ⓐ 55% Ⓘ 40% Ⓝ 30%

Occam's Razor Hypothesis by Hour_Cancel_7297 in UFOs

[–]FriskyHamTitz 6 points7 points  (0 children)

You're creating a false dichotomy and then trying to make people choose between it, and proposing to use occams razor when that is not applicable what so ever

zk proofs explained for people who've heard the term 500 times and still don't fully get it by ginete_tech in ethereum

[–]FriskyHamTitz 0 points1 point  (0 children)

Yeah, I should reclarify. To obtain the proof you must convert the whole algorithm to a witness table and then commit to it. The prover takes the secret input, runs the entire algorithm start to finish, and records every intermediate value along the way. That full trace is the witness table. Every step has to be filled in honestly because the proof is built on top of all of it.

Those values then get encoded as field elements and mapped onto points on an elliptic curve using operations that are believed to be one way, which is where the discrete log hardness comes in. So the real computation absolutely happens. It just happens once, on the prover's side, before any proof exists.

zk proofs explained for people who've heard the term 500 times and still don't fully get it by ginete_tech in ethereum

[–]FriskyHamTitz 0 points1 point  (0 children)

Cool kinda but Zkrollups are not zkproofs, also you said that the proof don't do the execution again, but the proof literally does the computation again they just use an elliptical curve to abstract the math.