Block #2,235,904

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/4/2017, 1:15:25 AM · Difficulty 10.9458 · 4,600,852 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f3c8e184ff10c40fd8bc7f7fcb8ea160cbc9709d03c3264335c04a7095d4d52f

Height

#2,235,904

Difficulty

10.945837

Transactions

12

Size

3.02 KB

Version

2

Bits

0af2225c

Nonce

291,610,059

Timestamp

8/4/2017, 1:15:25 AM

Confirmations

4,600,852

Merkle Root

1d9a9eb69c4724f7424f9453295e4d8664d112f7cf03771ae79acc214fc1530a
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.

5.026 × 10⁹⁴(95-digit number)
50268592905629187684…58450134328007360201
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
5.026 × 10⁹⁴(95-digit number)
50268592905629187684…58450134328007360201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.005 × 10⁹⁵(96-digit number)
10053718581125837536…16900268656014720401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.010 × 10⁹⁵(96-digit number)
20107437162251675073…33800537312029440801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.021 × 10⁹⁵(96-digit number)
40214874324503350147…67601074624058881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.042 × 10⁹⁵(96-digit number)
80429748649006700295…35202149248117763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.608 × 10⁹⁶(97-digit number)
16085949729801340059…70404298496235526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.217 × 10⁹⁶(97-digit number)
32171899459602680118…40808596992471052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.434 × 10⁹⁶(97-digit number)
64343798919205360236…81617193984942105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.286 × 10⁹⁷(98-digit number)
12868759783841072047…63234387969884211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.573 × 10⁹⁷(98-digit number)
25737519567682144094…26468775939768422401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.147 × 10⁹⁷(98-digit number)
51475039135364288189…52937551879536844801
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,938,335 XPM·at block #6,836,755 · 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