Block #1,024,610

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2015, 6:33:07 AM · Difficulty 10.7542 · 5,782,215 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
204494bd322eb332188c3490f2f9b88898a4246657bb3f0e862e6ff2896bfff6

Height

#1,024,610

Difficulty

10.754177

Transactions

3

Size

3.89 KB

Version

2

Bits

0ac111c5

Nonce

880,727,178

Timestamp

4/20/2015, 6:33:07 AM

Confirmations

5,782,215

Merkle Root

e8b8f70d04d68f7b4f0820de72d8584e92a939521ff1251a68e6a133a1c5891a
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

3.216 × 10⁹⁶(97-digit number)
32164649803079752898…03562870461628556799
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
3.216 × 10⁹⁶(97-digit number)
32164649803079752898…03562870461628556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.432 × 10⁹⁶(97-digit number)
64329299606159505797…07125740923257113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.286 × 10⁹⁷(98-digit number)
12865859921231901159…14251481846514227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.573 × 10⁹⁷(98-digit number)
25731719842463802319…28502963693028454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.146 × 10⁹⁷(98-digit number)
51463439684927604638…57005927386056908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.029 × 10⁹⁸(99-digit number)
10292687936985520927…14011854772113817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.058 × 10⁹⁸(99-digit number)
20585375873971041855…28023709544227635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.117 × 10⁹⁸(99-digit number)
41170751747942083710…56047419088455270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.234 × 10⁹⁸(99-digit number)
82341503495884167421…12094838176910540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.646 × 10⁹⁹(100-digit number)
16468300699176833484…24189676353821081599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,698,702 XPM·at block #6,806,824 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy