Block #1,226,183

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/7/2015, 4:44:03 PM · Difficulty 10.7358 · 5,580,689 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e9fa8216651c532237c75fc9ff1a246e3cbde15eb05cfbcc6ee39814d0a6b48

Height

#1,226,183

Difficulty

10.735816

Transactions

6

Size

3.18 KB

Version

2

Bits

0abc5e6b

Nonce

1,961,396,310

Timestamp

9/7/2015, 4:44:03 PM

Confirmations

5,580,689

Merkle Root

c8f059d136d6e41cfc3de5b4a330928f41c78772443a7d1dcad68d03dba9732c
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.846 × 10⁹⁷(98-digit number)
18469702304029786490…65024540140250275841
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.846 × 10⁹⁷(98-digit number)
18469702304029786490…65024540140250275841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.693 × 10⁹⁷(98-digit number)
36939404608059572981…30049080280500551681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.387 × 10⁹⁷(98-digit number)
73878809216119145963…60098160561001103361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.477 × 10⁹⁸(99-digit number)
14775761843223829192…20196321122002206721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.955 × 10⁹⁸(99-digit number)
29551523686447658385…40392642244004413441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.910 × 10⁹⁸(99-digit number)
59103047372895316771…80785284488008826881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.182 × 10⁹⁹(100-digit number)
11820609474579063354…61570568976017653761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.364 × 10⁹⁹(100-digit number)
23641218949158126708…23141137952035307521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.728 × 10⁹⁹(100-digit number)
47282437898316253416…46282275904070615041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.456 × 10⁹⁹(100-digit number)
94564875796632506833…92564551808141230081
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,699,083 XPM·at block #6,806,871 · 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