Recent searches

No recent searches

Search options

Only available when logged in.
techhub.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
A hub primarily for passionate technologists, but everyone is welcome

Administered by:

Server stats:

4.6K
active users

techhub.social: AboutStatusProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.4.2

#interactive

3 posts3 participants1 post today
wilfred

WOW. THE INTERNET IS GOOD! THE INTERNET IS COOL!

"StoryTerra is an interactive map-based platform for exploring the stories through the lens of geography and history. Whether it's a novel set in feudal Japan, a film taking place in 1920s New York, or a video game spanning the Viking Age, Storyterra helps you discover where and when each story takes place."

storyterra.com

www.storyterra.comStoryTerraExplore stories by location and time.
#interactive#media#map
Jyrden

I rarely get properly mad on stream… but when I do, it’s theatrical nonsense 🎭 Naturally, I’ve made my rage emote #interactive because fake fury deserves flashy #streamFX 🤓
Subs can trigger a glowing red pulse, and if enough of you spam it, the rage lingers longer

*
Andrea Barontini

ia.cr/2025/1296 sounds disrupting.. looking 4 qualified opinions…

Tags to improve post exposure: #ZKP #simulator #cryptography #trustedsetup #interactive #soundness

IACR logo
IACR Cryptology ePrint Archive · Gödel in Cryptography: Effectively Zero-Knowledge Proofs for NP with No Interaction, No Setup, and Perfect SoundnessA zero-knowledge proof demonstrates that a fact (like that a Sudoku puzzle has a solution) is true while, counterintuitively, revealing nothing else (like what the solution actually is). This remarkable guarantee is extremely useful in cryptographic applications, but it comes at a cost. A classical impossibility result by Goldreich and Oren [J. Cryptol. '94] shows that zero-knowledge proofs must necessarily sacrifice basic properties of traditional mathematical proofs --- namely perfect soundness (that no proof of a false statement exists) and non-interactivity (that a proof can be transmitted in a single message). Contrary to this impossibility, we show that zero-knowledge with perfect soundness and no interaction is effectively possible. We do so by defining and constructing a powerful new relaxation of zero-knowledge. Intuitively, while the classical zero-knowledge definition requires that an object called a simulator actually exists, our new definition only requires that one cannot rule out that a simulator exists (in a particular logical sense). Using this, we show that **every falsifiable security property of (classical) zero-knowledge can be achieved with no interaction, no setup, and perfect soundness.** This enables us to remove interaction and setup from (classical) zero-knowledge in essentially all of its applications in the literature, at the relatively mild cost that such applications now have security that is "game-based" instead of "simulation-based." Our construction builds on the work of Kuykendall and Zhandry [TCC '20] and relies on two central, longstanding, and well-studied assumptions that we show are also necessary. The first is the existence of non-interactive witness indistinguishable proofs, which follows from standard assumptions in cryptography. The second is Krajícek and Pudlák's 1989 conjecture that no optimal proof system exists. This is one of the main conjectures in the field of proof complexity and is the natural finitistic analogue of the impossibility of Hilbert's second problem (and, hence, also Gödel's incompleteness theorem). Our high-level idea is to use these assumptions to construct a prover and verifier where no simulator exists, but the non-existence of a simulator is independent (in the logical sense of unprovability) of an arbitrarily strong logical system. One such logical system is the standard axioms of mathematics: ZFC.
Staatsbibliothek zu Berlin

Join us for our two-day open cultural data #hackathon "culture.explore(data)" held at the #StabiBerlin on 7 and 8 October 2025. Create your own digital projects based on #opendata and curated datasets of the @kulturSPK and the Libraries and Museums at the #OxfordUni. Unlock hidden stories by rethinking #culturalheritage and experimenting with digital forms, such as #apps, #games, #storytelling, #data visualizations or #interactive #exhibitions.

More infos 👉 lab.sbb.berlin/culture-explore

Continued thread
Ana Tudor 🐯

2️⃣ `feColorMatrix`: swap channels ☆ interactive demo, adaptive layout - check it out on @codepen codepen.io/thebabydino/full/QW

An interactive, responsive demo illustrating how `feColorMatrix` can be used to swap channels. Another very special one.

#SVG #filter #svgFilter #JS #interactive #javascript #code #coding #frontend #CSS #web #dev #webDevelopment #webDev #cssGrid #cssLayout

Behind the demo mastodon.social/@anatudor/1122

screwlisp

#programming #softwareEngineering article screwlisp.small-web.org/progra #commonLisp #asdf #systemsProgramming #series #pathnames #packaging

Really simple... Sort of... But so intricate to write. I deal with (writing a smidge of #interactive #lazyEvaluation #functionalProgramming ) :

- Tangling markdown into an asdf :class :package-inferred-system lisp system
- Doing so with scan-file and collect-file from series
- Working with lisp’s make-pathname directories.

screwlisp.small-web.org:screwlisps-knowledge/tangle common lisp asdf package markdown tangling and lisp pathnames
#literateProgramming
TrendingLive feeds
About