Latest Tech News

Stay updated with the latest in technology, AI, cybersecurity, and more

Filtered by: int8 Clear Filter

A SQL Heuristic: ORs Are Expensive

news.ycombinator.com Unknown 2025-10-12 11:29:55

A SQL Heuristic: ORs Are Expensive Query planning is hard. Sometimes. Queries often have more than one filter (using an and clause). But the developer can often end up in situations requiring an or clause: select count(*) from application where submitter_id = :user_id or reviewer_id = :user_id; But this is slow! With 1,000,000 applications and 1000 users uniformly distributed on both columns, it takes over 100ms.1 If we rewrite it with only and s select ( select count(*) from application

Topics: create int8 null table user_id
Read More
Shop Amazon

A SQL Heuristic: Ors Are Expensive

news.ycombinator.com Unknown 2025-10-13 02:29:55

A SQL Heuristic: ORs Are Expensive Query planning is hard. Sometimes. Queries often have more than one filter (using an and clause). But the developer can often end up in situations requiring an or clause: select count(*) from application where submitter_id = :user_id or reviewer_id = :user_id; But this is slow! With 1,000,000 applications and 1000 users uniformly distributed on both columns, it takes over 100ms.1 If we rewrite it with only and s select ( select count(*) from application

Topics: create int8 null table user_id
Read More
Shop Amazon

C-sigma: Easy-to-use Sigma proofs in C using libsodium

news.ycombinator.com Unknown 2025-10-14 21:07:07

Sigma Protocols Implementation in C A clean, simple C implementation of Sigma protocols with Fiat-Shamir transformation for non-interactive zero-knowledge proofs. Features Schnorr Protocol: Prove knowledge of discrete logarithm Chaum-Pedersen Protocol: Prove discrete logarithm equality (DLEQ) Non-interactive proofs: Using Fiat-Shamir transformation with SHAKE128 Minimal API: Just 6 functions for complete functionality No abstractions: Direct use of byte arrays, no wrapper types Secure: B

Topics: 32 const proof prove uint8_t
Read More
Shop Amazon

Accelerated Game of Life with CUDA / Triton

news.ycombinator.com Unknown 2025-11-03 20:46:02

Let’s look at implementing Conway’s Game of Life using a graphics card. I want to experiment with different libraries and techniques, to see how to get the best performance. I’m going to start simple, and get increasingly complex as we dive in. The Game Of Life is a simple cellular automata, so should be really amenable to GPU acceleration. The rules are simple: Each cell in the 2d grid is either alive or dead. At each step, count the alive neighbours of the cell (including diagonals). If the c

Topics: block_size_row int8_t rowstride tl x_ptr
Read More
Shop Amazon

Writing a Game Boy Emulator in OCaml

news.ycombinator.com Unknown 2026-03-22 04:34:56

Introduction For the past few months, I have been working on a project called CAMLBOY, a Game Boy emulator written in OCaml that runs in the browser. You can try it out on the following demo page: Demo Page I included several homebrew ROMs in the demo, so please try them out (I recommend Bouncing ball and Rocket Man Demo). You can also play with it in your mobile browser as it runs at 60 FPS on recent smartphones. Repository You can find the repository here: https://github.com/linoscope/CA

Topics: arg bit type uint16 uint8
Read More
Shop Amazon
Trending Topics
Hot Now
ai 4198 apple 3358 new 2790 google 2304 content 1936
Popular
like 1693 company 1604 pro 1526 iphone 1348 app 1320 zdnet 1229 said 1228 data 1215 amazon 1034 does 1006
Emerging
reviews 986 editorial 965 game 949 samsung 863 phone 853 android 834 just 828 users 812 pixel 807 available 773
About GoKawiil

GoKawiil is a project by nerdhub.co that curates technology news from trusted sources. We built this site to provide a cleaner, more mobile-friendly experience without intrusive ads or heavy JavaScript.

Privacy

Your privacy matters. GoKawiil doesn't use Google Analytics or Facebook Pixel. The only tracking occurs through affiliate links to Amazon.

Advertising

Interested in advertising? Contact us at [email protected]