Block #1,170,478

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/25/2015, 11:57:33 PM · Difficulty 10.9360 · 5,642,358 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ae09181bac1abf34ef53e21ae5726f81141dea252569ce8107ad35b68c80691

Height

#1,170,478

Difficulty

10.936048

Transactions

2

Size

2.04 KB

Version

2

Bits

0aefa0d8

Nonce

387,843,543

Timestamp

7/25/2015, 11:57:33 PM

Confirmations

5,642,358

Merkle Root

4101d7a5ec8d6e4bc97284ea65a019450a0c3bb230e1cc78e590ddfb29007e7a
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.

6.663 × 10⁹³(94-digit number)
66633405582225851941…10407893314853216641
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
6.663 × 10⁹³(94-digit number)
66633405582225851941…10407893314853216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.332 × 10⁹⁴(95-digit number)
13326681116445170388…20815786629706433281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.665 × 10⁹⁴(95-digit number)
26653362232890340776…41631573259412866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.330 × 10⁹⁴(95-digit number)
53306724465780681553…83263146518825733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.066 × 10⁹⁵(96-digit number)
10661344893156136310…66526293037651466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.132 × 10⁹⁵(96-digit number)
21322689786312272621…33052586075302932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.264 × 10⁹⁵(96-digit number)
42645379572624545242…66105172150605864961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.529 × 10⁹⁵(96-digit number)
85290759145249090485…32210344301211729921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.705 × 10⁹⁶(97-digit number)
17058151829049818097…64420688602423459841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.411 × 10⁹⁶(97-digit number)
34116303658099636194…28841377204846919681
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,746,733 XPM·at block #6,812,835 · 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