Kronecker in (o(p(n)^3): a Novel Approach to 80-Year-Old P-Hard Problem [pdf]
Postedabout 2 months agoActiveabout 2 months ago
github.comResearchstory
skepticalmixed
Debate
60/100
Kronecker CoefficientComputational ComplexityRepresentation Theory
Key topics
Kronecker Coefficient
Computational Complexity
Representation Theory
A research paper claims to have made a breakthrough in computing Kronecker Coefficients in O(p(n)^3) time, sparking debate among commenters about the paper's validity and methodology.
Snapshot generated from the HN discussion
Discussion Activity
Light discussionFirst comment
1s
Peak period
2
2-3h
Avg / period
1.3
Key moments
- 01Story posted
Nov 10, 2025 at 7:13 PM EST
about 2 months ago
Step 01 - 02First comment
Nov 10, 2025 at 7:13 PM EST
1s after posting
Step 02 - 03Peak activity
2 comments in 2-3h
Hottest window of the conversation
Step 03 - 04Latest activity
Nov 11, 2025 at 12:44 AM EST
about 2 months ago
Step 04
Generating AI Summary...
Analyzing up to 500 comments to identify key contributors and discussion patterns
ID: 45882617Type: storyLast synced: 11/20/2025, 1:54:04 PM
Want the full context?
Jump to the original sources
Read the primary article or dive into the live Hacker News thread when you're ready.
[1]: https://sf-labs.co/
The crypto thing (trustdog) was just a hackathon thing i recently did (which originally was supposed to be a stripe product but they restrict escrow) and i work on other stuff a lot so i dont always have time to update the personal site.
its more of an idea with some experiment (which you can see and run yourself!) and not a "paper".
I made my first contribution to google/HEIR that got pulled the other week, but there is a lot of self activity because I do this for fun! im a mechanical engineer by profession.
I dont mind if no one believes it. Just wanted to share something I thought was cool. Didn't mean to offend anyone in any way.
Code is uploaded to https://github.com/bon-cdp/heir/tree/experimental/unified-sh... if anyone is interested.