Block #1,539,706

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/13/2016, 5:02:49 PM · Difficulty 10.6386 · 5,287,610 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0a9e03312426427aeea13266e1cb0d332d0770fb5e5ac57c93f35730b18b1974

Height

#1,539,706

Difficulty

10.638571

Transactions

2

Size

1.21 KB

Version

2

Bits

0aa3796a

Nonce

778,765,936

Timestamp

4/13/2016, 5:02:49 PM

Confirmations

5,287,610

Merkle Root

037d28ab2a79477987734048136ad9f53d5fe0bd9e40eabca1d8f160e4db7875
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.228 × 10⁹⁴(95-digit number)
12280808504263607564…77801404007473382399
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.228 × 10⁹⁴(95-digit number)
12280808504263607564…77801404007473382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.456 × 10⁹⁴(95-digit number)
24561617008527215128…55602808014946764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.912 × 10⁹⁴(95-digit number)
49123234017054430256…11205616029893529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.824 × 10⁹⁴(95-digit number)
98246468034108860512…22411232059787059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.964 × 10⁹⁵(96-digit number)
19649293606821772102…44822464119574118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.929 × 10⁹⁵(96-digit number)
39298587213643544204…89644928239148236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.859 × 10⁹⁵(96-digit number)
78597174427287088409…79289856478296473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.571 × 10⁹⁶(97-digit number)
15719434885457417681…58579712956592947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.143 × 10⁹⁶(97-digit number)
31438869770914835363…17159425913185894399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.287 × 10⁹⁶(97-digit number)
62877739541829670727…34318851826371788799
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,862,641 XPM·at block #6,827,315 · 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