src_e53adb99e40ae66258
- Source-provided label
- Not reported
- Evidence class
- mentioned in report
- Confidence
- Not reported
- Observed
- Oct 04, 2026 22:00 UTC
- Retrieved
- Oct 08, 2026 03:46 UTC
SPIN: Fast Codes for Correlation Generation and Polynomial Commitments
ePrint Report: SPIN: Fast Codes for Correlation Generation and Polynomial Commitments Stanislav Peceny, Rahul Rachuri, Srinivasan Raghuraman, Peter Rindal Binary codes used in correlation generation and proof systems need strong distance, fast ordinary and transposed encoding, and regular memory access. We introduce Single-Permutation INterleaved (SPIN) codes, combining a blockwise outer encoder,
Reference details
- Source category
- Research & news
- Report title
SPIN: Fast Codes for Correlation Generation and Polynomial Commitments- First reported
- Oct 04, 2026 22:00 UTC
- Last reported
- Oct 04, 2026 22:00 UTC
- Catalog updated
- Oct 08, 2026 03:46 UTC
- Record ID
1bd17a96bf8eeafa3eae88bf6e33759f2c3cea6d0cbf6b31d7c5c1f900039041
Published indicators
Network indicators are visibly defanged. This page does not make them clickable or send them to another service.
No validated file hashes or network indicators are stored for this record.
Source observations
This record contains metadata and attribution only. It does not host, download, unpack, render, or execute malware samples.
Feed collection status
Sources represented on this page. Publication and observation dates describe the content; successful batch dates describe local collection. A recent batch does not certify complete coverage or current provider availability.
1 sources: 0 stale, 0 needing attention, 0 paused, 1 unverified.
Review source update dates and status
- src_e53adb99e40ae66258Collection status unverifiedLast successful batch: Unverified
Stale means older than twice the recorded collection interval, with a minimum of one hour; without an interval, the threshold is 24 hours. Cached content remains available while a feed is stale, paused, or unverified.