socrates1024
LightNews LightNews
banner
socrates1024.bsky.social
socrates1024
@socrates1024.bsky.social
560 followers 450 following 160 posts
junior product @ teleport.best
adjunct associate prof @ uiuc
Posts Replies Media Videos
socrates1024.bsky.social
Financial Cryptography

Final call for papers FC26
fc26.ifca.ai/cfp.html

Submission deadline: 20 September 2025

Conference:
2–6 March 2026
St. Kitts Marriott Resort
FC'26 : Call for Papers
Financial Cryptography and Data Security is a major international forum for research, advanced development, education, exploration, and debate regarding information assurance, with a specific focus on...
fc26.ifca.ai
September 14, 2025 at 12:03 PM
Reposted by socrates1024
eprint.ing.bot
Constraint-Friendly Map-to-Elliptic-Curve-Group Relations and Their Applications (Jens Groth, Harjasleen Malvai, Andrew Miller, Yi-Nuo Zhang) ia.cr/2025/1503
Abstract. Hashing to elliptic curve groups is a fundamental operation used in many cryptographic applications, including multiset hashing and BLS signatures. With the recent rise of zero-knowledge applications, they are increasingly used in constraint programming settings. For example, multiset hashing enables memory consistency checks in zkVMs, while BLS signatures are used in proof of stake protocols. In such cases, it becomes critical for hash-to-elliptic-curve-group constructions to be constraint-friendly such that one can efficiently generate succinct proofs of correctness. However, existing constructions rely on cryptographic hash functions that are expensive to represent in arithmetic constraint systems, resulting in high proving costs. We propose a constraint-efficient alternative: a map-to-elliptic-curve-group relation that bypasses the need for cryptographic hash functions and can serve as a drop-in replacement for hash-to-curve constructions in practical settings, including the aforementioned applications. Our relation naturally supports non-deterministic map-to-curve choices making them more efficient in constraint programming frameworks and enabling efficient integration into zero-knowledge proofs. We formally analyze the security of our approach in the elliptic curve generic group model (EC-GGM). Our implementation in Noir/Barretenberg demonstrates the efficiency of our construction in constraint programming: it achieves over 23× fewer constraints than the best hash-to-elliptic-curve-group alternatives, and, enables 50-100× faster proving times at scale. Image showing part 2 of abstract.
August 28, 2025 at 8:56 AM
socrates1024.bsky.social
Financial Cryptography '26 call for papers is up
fc26.ifca.ai/cfp.html

Paper submission deadline is September 16
FC'26 : Call for Papers
Financial Cryptography and Data Security is a major international forum for research, advanced development, education, exploration, and debate regarding information assurance, with a specific focus on...
fc26.ifca.ai
August 3, 2025 at 5:47 PM
Reposted by socrates1024
eprint.ing.bot
Fairness in the Wild: Secure Atomic Swap with External Incentives (Hao Chung, Elisaweta Masserova, Elaine Shi, Sri AravindaKrishnan Thyagarajan) ia.cr/2025/1086
Abstract. Atomic swaps enable asset exchanges across blockchains without relying on trusted intermediaries, and are a key component of decentralized finance (DeFi) ecosystems. Recently, Chung, Masserova, Shi, and Thyagarajan introduced Rapidash (Financial Cryptography 2025), an atomic swap protocol that remains incentive compatible under user-miner collusion, by ensuring that the honest strategy forms a coalition-resistant Nash equilibrium. However, their model assumes a closed system where players act solely based on internal protocol incentives. In practice, participants may be influenced by external incentives such as off-chain rewards or adversarial bribes, which can undermine such equilibrium guarantees. In this work, we introduce a new game-theoretic notion, bounded maximin fairness, which ensures that honest participants remain protected against rational adversaries with arbitrary but bounded external incentives. We construct an atomic swap protocol that satisfies this notion, while preserving the equilibrium properties of prior work in the absence of external influence. As we show, our protocol is easy to implement and can be instantiated even in Bitcoin’s limited scripting language. Image showing part 2 of abstract.
June 10, 2025 at 2:53 PM
Reposted by socrates1024
graze.social
We've been given an amazing opportunity with our round of funding to build out the next generation of the social web. Today, we're starting an experiment in paying that forward. Introducing Graze Grants, a project to help get other ATProto projects off the ground.
Announcement post for Graze Grants (Beta) - we're funding new ATProto work, visit Graze.social (or really the link below in the next post) to apply
May 5, 2025 at 9:32 PM
Reposted by socrates1024
kojamf.bsky.social
River Bandit Wildlife Rescue
May 28, 2025 at 3:26 PM
socrates1024.bsky.social
whenever I'm up early I make sure to send a lot of emails
June 4, 2025 at 10:07 AM
socrates1024.bsky.social
cops have their own distinct verb tense... like "I'm gonna have to ask you to step out of the vehicle"

well go on then
May 16, 2025 at 11:59 PM
Reposted by socrates1024
lmao.bsky.social
what makes a good abstraction? (and other weird thoughts and tangents)

Blogpost here: lmao.bearblog.dev/minimal-abst...
May 13, 2025 at 4:28 PM
socrates1024.bsky.social
pilots address the cabin "the winds are from the east at 3 knots and the cloud layer starts at 7000 feet" like that means anything to the passengers.

I think theyre just pretending to be so unselfaware as to think everyone else is as obsessed with the weather too, affected hyper focus
May 13, 2025 at 4:42 PM
socrates1024.bsky.social
up late making slides for a conference that doesn't exist
May 13, 2025 at 1:09 AM
Reposted by socrates1024
goose.art
good terminology clarity for people who are still confused by the idea of an "AppView"
jazco.dev Jaz @jazco.dev · Apr 25
If you're indexing data from the firehose or repos and providing some kinda API for it, that's enough to be an "AppView" in my eyes.

Doesn't matter if all you're indexing is one lexicon or if you're only indexing a specific subset of those records. Still an appview to me.
April 25, 2025 at 10:12 PM
socrates1024.bsky.social
Financial Cryptography 2025 begins now in Miyakojima fc25.ifca.ai
FC'25 : Financial Cryptography 2025
Financial Cryptography and Data Security is a major international forum for research, advanced development, education, exploration, and debate regarding information assurance, with a specific focus on...
fc25.ifca.ai
April 13, 2025 at 11:41 PM
Reposted by socrates1024
sjgreenwood.bsky.social
As such, we’re excited about this opportunity to put into practice the research ideas around individual and societal recommendation quality that our team has been thinking about (proceedings.neurips.cc/paper_files/..., dl.acm.org/doi/10.1145/...)
March 10, 2025 at 3:12 PM
Reposted by socrates1024
nkgarg.bsky.social
Our vision is state-of-the-art paper recommendation that takes the best of "social" (what made academic twitter great) and "content-based" (using modern NLP). Overtime, we will add (optional!) features using follower graph, interactions, text… Only possible using Bluesky algorithmic feed features
March 10, 2025 at 6:14 PM
Reposted by socrates1024
sjgreenwood.bsky.social
While right now the feed is based only on users you follow, over time we plan to build opt-in algorithmic recommendations to help you discover paper-related content matching your interests from across #academicsky
March 10, 2025 at 3:12 PM
socrates1024.bsky.social
firefly is kind of an "authentication methods" playground, android app is my favorite though
image.png
March 16, 2025 at 8:05 PM
Reposted by socrates1024
pattonoswalt.bsky.social
Who was in charge of font spacing for this episode of MR. ED?
December 29, 2024 at 11:29 PM
Reposted by socrates1024
lizzirust.bsky.social
Beavis and Butt-Head go to Silent Hill
December 30, 2024 at 12:40 AM
Reposted by socrates1024
marlo.ooo
December 30, 2024 at 4:07 AM
Reposted by socrates1024
dril.bsky.social
Carter has passed. An accomplished man. A brilliant legacy. Although for many of us he died years ago when he refused to condemn, gamer gate
December 29, 2024 at 9:45 PM
Reposted by socrates1024
shriram.bsky.social
"I contend that my knowledge is complete!"
"Per what?!?"
"Per Martin-Löf."
December 29, 2024 at 5:42 PM
Reposted by socrates1024
opossum-systems.net
December 1, 2024 at 4:23 PM
Reposted by socrates1024
eprint.ing.bot
Field-Agnostic SNARKs from Expand-Accumulate Codes (Alexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang) ia.cr/2024/1871
Abstract. Efficient realizations of succinct non-interactive arguments of knowledge (SNARKs) have gained popularity due to their practical applications in various domains. Among existing schemes, those based on error-correcting codes are of particular interest because of their good concrete efficiency, transparent setup, and plausible post-quantum security. However, many existing code-based SNARKs suffer from the disadvantage that they only work over specific finite fields. In this work, we construct a code-based SNARK that does not rely on any specific underlying field; i.e., it is field-agnostic. Our construction follows the framework of Brakedown (CRYPTO ’23) and builds a polynomial commitment scheme (and hence a SNARK) based on recently introduced expand-accumulate codes. Our work generalizes these codes to arbitrary finite fields; our main technical contribution is showing that, with high probability, these codes have constant rate and constant relative distance (crucial properties for building efficient SNARKs), solving an open problem from prior work. As a result of our work we obtain a SNARK where, for a statement of size M , the prover time is O(MlogM) and the proof size is $O(\sqrt{M} )$. We demonstrate the concrete efficiency of our scheme empirically via experiments. Proving ECDSA verification on the secp256k1 curve requires only 0.23s for proof generation, 2 orders of magnitude faster than SNARKs that are not field-agnostic. Compared to the original Brakedown result (which is also field-agnostic), we obtain proofs that are 1.9–2.8× smaller due to the good concrete distance of our underlying error-correcting code, while introducing only a small overhead of 1.2× in the prover time. Image showing part 2 of abstract.
November 18, 2024 at 3:18 AM