Block #2,205,872

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/14/2017, 2:58:13 AM · Difficulty 10.9461 · 4,634,340 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b64dfdad10bd26950bad124708420b858eb096d3cc47df24a8edb8a5d9718aed

Height

#2,205,872

Difficulty

10.946073

Transactions

12

Size

5.30 KB

Version

2

Bits

0af231df

Nonce

261,542,543

Timestamp

7/14/2017, 2:58:13 AM

Confirmations

4,634,340

Merkle Root

3cd6a0208e9117e22a8c8c708d46af692e6ee2ff3ad1a02bfa91b359aac012d0
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.

3.115 × 10⁹⁵(96-digit number)
31153861454458458093…58168731405981711999
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
3.115 × 10⁹⁵(96-digit number)
31153861454458458093…58168731405981711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.230 × 10⁹⁵(96-digit number)
62307722908916916187…16337462811963423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.246 × 10⁹⁶(97-digit number)
12461544581783383237…32674925623926847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.492 × 10⁹⁶(97-digit number)
24923089163566766475…65349851247853695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.984 × 10⁹⁶(97-digit number)
49846178327133532950…30699702495707391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.969 × 10⁹⁶(97-digit number)
99692356654267065900…61399404991414783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.993 × 10⁹⁷(98-digit number)
19938471330853413180…22798809982829567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.987 × 10⁹⁷(98-digit number)
39876942661706826360…45597619965659135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.975 × 10⁹⁷(98-digit number)
79753885323413652720…91195239931318271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.595 × 10⁹⁸(99-digit number)
15950777064682730544…82390479862636543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.190 × 10⁹⁸(99-digit number)
31901554129365461088…64780959725273087999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,966,014 XPM·at block #6,840,211 · 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