Block #1,412,351

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/14/2016, 1:23:22 AM · Difficulty 10.8043 · 5,430,678 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4382b53491c5ce515a44593240be7b0c957dbb12b35f5169ab842397a2977877

Height

#1,412,351

Difficulty

10.804269

Transactions

3

Size

3.24 KB

Version

2

Bits

0acde491

Nonce

656,226,126

Timestamp

1/14/2016, 1:23:22 AM

Confirmations

5,430,678

Merkle Root

dd9b021f3857beaabf1bfe34c926a0d7e4912ca91e75342829546b9e83dbbb66
Transactions (3)
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.

9.815 × 10⁹⁴(95-digit number)
98151758171787939961…73472169354866199041
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
9.815 × 10⁹⁴(95-digit number)
98151758171787939961…73472169354866199041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.963 × 10⁹⁵(96-digit number)
19630351634357587992…46944338709732398081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.926 × 10⁹⁵(96-digit number)
39260703268715175984…93888677419464796161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.852 × 10⁹⁵(96-digit number)
78521406537430351969…87777354838929592321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.570 × 10⁹⁶(97-digit number)
15704281307486070393…75554709677859184641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.140 × 10⁹⁶(97-digit number)
31408562614972140787…51109419355718369281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.281 × 10⁹⁶(97-digit number)
62817125229944281575…02218838711436738561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.256 × 10⁹⁷(98-digit number)
12563425045988856315…04437677422873477121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.512 × 10⁹⁷(98-digit number)
25126850091977712630…08875354845746954241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.025 × 10⁹⁷(98-digit number)
50253700183955425260…17750709691493908481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.005 × 10⁹⁸(99-digit number)
10050740036791085052…35501419382987816961
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,988,586 XPM·at block #6,843,028 · 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