task stringclasses 1
value | input stringlengths 259 305 | output stringclasses 5
values | type stringclasses 1
value | focus stringclasses 1
value | difficulty stringclasses 1
value |
|---|---|---|---|---|---|
coding | Coding Hard 433: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1377: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 416: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 164: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 87: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 928: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 938: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1726: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 498: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 629: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 820: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 844: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1478: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1023: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 941: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 254: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 515: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1688: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1979: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 1820: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 487: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 560: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1290: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1412: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1736: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 524: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1880: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 705: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 839: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1538: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 1193: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1795: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 1541: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 406: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1089: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 864: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 1064: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 124: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1955: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 1709: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1494: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 466: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 878: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 1357: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1278: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 580: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 714: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 596: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 2: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 350: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1305: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 1649: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 305: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 778: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 265: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 386: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1686: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1883: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1074: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1876: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1452: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 1999: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 241: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 1487: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 818: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 1404: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 230: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 875: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1203: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1740: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1599: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 79: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 405: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 280: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 19: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 1465: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1816: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1728: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1368: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 763: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1230: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1537: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1247: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 536: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 37: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1727: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 611: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1267: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 1968: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 983: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1274: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1718: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 1973: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 473: Implement SatU1 AVX2 kernel with correct case SatU1, not SATU1, for Ryzen5 5650U — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: inline __m256i SatU1_XNOR_AVX2(__m256i a, __m256i b) { __m256i xor_res = _mm256_xor_si256(a,b); return _mm256_andnot_si256(xor_res, _mm256_set1_epi32(-1)); } // XNOR = NOT XOR, then popcount via _mm256_sad_epu8 for 16 Giga/s
Explanation: Implements IKNN-Rl1-A1 tri-tier kernel for CPU-first LLM agentic researc... | agentic | coding | hard |
coding | Coding Hard 398: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
coding | Coding Hard 1082: Implement Ntarra-DnA phase rotator with correct case Ntarra-DnA, Direction NEG/ZERO/POS, Phase PHI0/1/2 shifts 0/2/4 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def Ntarra_DnA_Compute(act, dir, phase): # Ntarra-DnA 3.17-bit
shift = {0:0, 1:2, 2:4}[phase] # PHI0 0, PHI1 2, PHI2 4
shifted = act << shift
if dir == -1: return -shifted # NEG
elif dir == 0: return 0 # ZERO
else: return shifted # POS
# Pack 2x9: 9*9=81 combos in 7-bit, 47 codes lefto... | agentic | coding | hard |
coding | Coding Hard 1939: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 1636: Implement RHT Randomized Hadamard Transform with correct case RHT, outlier flattening 10->5.07 — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def RHT_Transform(data, signs):
n=len(data)
# Random sign diagonal D
for i in range(n): data[i] *= signs[i] # +/-1
# Hadamard H_n = [H_{n-1} H_{n-1}; H_{n-1} -H_{n-1}]/sqrt(2)
h=1
while h<n:
for i in range(0,n,h*2):
for j in range(i,i+h):
u=data[j]; ... | agentic | coding | hard |
coding | Coding Hard 146: Implement PG-KVC Phase-Gated KV Cache 94% saving with correct case PG-KVC — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def PG_KVC_Push(k,v,entropy):
prec = 1 if entropy<0.5 else 2 # Phase-gated: low entropy 1-bit, high 2-bit
orig = len(k)*4 + len(v)*4
comp = (len(k)+len(v))*prec//8
saving = 1 - comp/orig # 94% saving target -80% PASS
return comp, orig, saving
Explanation: Implements IKNN-Rl1-A1 tri-tier ke... | agentic | coding | hard |
coding | Coding Hard 1980: Implement NoeSA-24 pack 13 values into 60-bit with base-24 encoding, correct case NoeSA — repo deeprcurs/IKNN-Rl1-A1 — model IKNN-Rl1-A1 — file IKNN-Rl1-A1-150M.iknn at root beside iknn.cpp — tidy — correct case SatU1 NoeSA Ntarra-DnA MoE RHT PG-KVC PEP ADLP | Solution: def NoeSA_Pack_13x24(values): # NoeSA-24 4.58-bit
assert len(values)==13
packed=0
for i,v in enumerate(values): # v in 0..23
packed += v * (24**i)
# 24^13 ~ 3e17 fits in 60-bit (1.15e18)
return packed.to_bytes(8,'little') # 60-bit in 8 bytes, 4.615 bits/param
Explanation: Implement... | agentic | coding | hard |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.