Block #2,481,571

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/20/2018, 9:10:49 AM · Difficulty 10.9664 · 4,360,332 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
abe7e098951e23a67c967d9d07627e430527475148ceda2a7adde99da5a769a8

Height

#2,481,571

Difficulty

10.966425

Transactions

23

Size

9.02 KB

Version

2

Bits

0af76799

Nonce

36,738,413

Timestamp

1/20/2018, 9:10:49 AM

Confirmations

4,360,332

Merkle Root

ed6f6e2683b1be8be1919a0e65a16d5603ab7bb68cd748c6df080c2511cadbff
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.

1.241 × 10⁹⁶(97-digit number)
12413440841464339149…16310322490100459519
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
1.241 × 10⁹⁶(97-digit number)
12413440841464339149…16310322490100459519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.482 × 10⁹⁶(97-digit number)
24826881682928678299…32620644980200919039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.965 × 10⁹⁶(97-digit number)
49653763365857356599…65241289960401838079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.930 × 10⁹⁶(97-digit number)
99307526731714713198…30482579920803676159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.986 × 10⁹⁷(98-digit number)
19861505346342942639…60965159841607352319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.972 × 10⁹⁷(98-digit number)
39723010692685885279…21930319683214704639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.944 × 10⁹⁷(98-digit number)
79446021385371770558…43860639366429409279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.588 × 10⁹⁸(99-digit number)
15889204277074354111…87721278732858818559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.177 × 10⁹⁸(99-digit number)
31778408554148708223…75442557465717637119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.355 × 10⁹⁸(99-digit number)
63556817108297416446…50885114931435274239
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,979,598 XPM·at block #6,841,902 · 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.
Privacy Policy·

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