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 1406: 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 43: 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 1884: 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 1141: 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 336: 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 1504: 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 1779: 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 1135: 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 1592: 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 206: 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 1090: 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 78: 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 1091: 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 822: 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 1416: 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 365: 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 1373: 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 838: 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 879: 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 926: 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 821: 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 1323: 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 506: 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 1136: 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 392: 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 1460: 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 518: 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 215: 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 774: 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 478: 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 427: 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 243: 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 256: 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 34: 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 1220: 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 1015: 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 613: 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 826: 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 439: 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 1307: 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 965: 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 1490: 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 1503: 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 1402: 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 1666: 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 469: 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 1355: 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 1084: 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 1121: 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 1817: 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 1622: 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 1982: 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 143: 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 1579: 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 1369: 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 434: 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 756: 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 12: 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 987: 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 1314: 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 1408: 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 17: 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 936: 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 1758: 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 1039: 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 652: 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 451: 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 977: 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 282: 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 892: 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 1674: 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 1192: 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 1748: 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 1475: 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 1934: 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 101: 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 1144: 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 1282: 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 809: 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 758: 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 1296: 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 1511: 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 262: 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 1745: 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 1399: 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 588: 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 713: 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 650: 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 511: 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 311: 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 725: 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 1602: 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 16: 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 424: 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 313: 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 1233: 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 1993: 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 426: 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 1207: 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 1435: 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.