Block #1,410,861

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2016, 12:19:27 AM · Difficulty 10.8048 · 5,402,092 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1db5193f497f8fd4638bb6b59566581b34fac36a10baaec6ce368172861d4446

Height

#1,410,861

Difficulty

10.804760

Transactions

50

Size

11.66 KB

Version

2

Bits

0ace04c2

Nonce

49,831,379

Timestamp

1/13/2016, 12:19:27 AM

Confirmations

5,402,092

Merkle Root

906aef0402e0b44ba9936fcc1164ed256383639660f4367a7862df250f77c763
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.

2.322 × 10⁹⁵(96-digit number)
23221286724145834960…03653464425715330879
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
2.322 × 10⁹⁵(96-digit number)
23221286724145834960…03653464425715330879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.644 × 10⁹⁵(96-digit number)
46442573448291669920…07306928851430661759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.288 × 10⁹⁵(96-digit number)
92885146896583339840…14613857702861323519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.857 × 10⁹⁶(97-digit number)
18577029379316667968…29227715405722647039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.715 × 10⁹⁶(97-digit number)
37154058758633335936…58455430811445294079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.430 × 10⁹⁶(97-digit number)
74308117517266671872…16910861622890588159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.486 × 10⁹⁷(98-digit number)
14861623503453334374…33821723245781176319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.972 × 10⁹⁷(98-digit number)
29723247006906668748…67643446491562352639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.944 × 10⁹⁷(98-digit number)
59446494013813337497…35286892983124705279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.188 × 10⁹⁸(99-digit number)
11889298802762667499…70573785966249410559
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,747,664 XPM·at block #6,812,952 · 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