Block #2,205,939

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/14/2017, 4:08:24 AM · Difficulty 10.9460 · 4,635,966 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eb567c9e90029d0d8e6683f046e797799e0816397b55120e703cf65451574267

Height

#2,205,939

Difficulty

10.946026

Transactions

23

Size

5.00 KB

Version

2

Bits

0af22ebd

Nonce

750,730,922

Timestamp

7/14/2017, 4:08:24 AM

Confirmations

4,635,966

Merkle Root

54f5df10a6cc65890bfa279378d15699395af34fed722c0eb6c33fc79d5d24ba
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.

7.243 × 10⁹⁴(95-digit number)
72433380016770260428…60147453931124070401
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
7.243 × 10⁹⁴(95-digit number)
72433380016770260428…60147453931124070401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.448 × 10⁹⁵(96-digit number)
14486676003354052085…20294907862248140801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.897 × 10⁹⁵(96-digit number)
28973352006708104171…40589815724496281601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.794 × 10⁹⁵(96-digit number)
57946704013416208342…81179631448992563201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.158 × 10⁹⁶(97-digit number)
11589340802683241668…62359262897985126401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.317 × 10⁹⁶(97-digit number)
23178681605366483337…24718525795970252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.635 × 10⁹⁶(97-digit number)
46357363210732966674…49437051591940505601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.271 × 10⁹⁶(97-digit number)
92714726421465933348…98874103183881011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.854 × 10⁹⁷(98-digit number)
18542945284293186669…97748206367762022401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.708 × 10⁹⁷(98-digit number)
37085890568586373339…95496412735524044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.417 × 10⁹⁷(98-digit number)
74171781137172746678…90992825471048089601
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 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
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 2CC formula:

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