Block #2,260,391

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2017, 4:41:58 PM · Difficulty 10.9519 · 4,573,403 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e08a70837d1f89c91648cf62e31caa8aa6894c7b1d513acd002b94f7882be84c

Height

#2,260,391

Difficulty

10.951852

Transactions

8

Size

1.72 KB

Version

2

Bits

0af3ac91

Nonce

88,126,896

Timestamp

8/20/2017, 4:41:58 PM

Confirmations

4,573,403

Merkle Root

2e5e748910869afa23de4a6c97de6d8fcc8f840957cc0df1f4988a5011c8d516
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.486 × 10⁹³(94-digit number)
14862899837633101116…33663389501950094761
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.486 × 10⁹³(94-digit number)
14862899837633101116…33663389501950094761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.972 × 10⁹³(94-digit number)
29725799675266202232…67326779003900189521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.945 × 10⁹³(94-digit number)
59451599350532404464…34653558007800379041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.189 × 10⁹⁴(95-digit number)
11890319870106480892…69307116015600758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.378 × 10⁹⁴(95-digit number)
23780639740212961785…38614232031201516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.756 × 10⁹⁴(95-digit number)
47561279480425923571…77228464062403032321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.512 × 10⁹⁴(95-digit number)
95122558960851847143…54456928124806064641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.902 × 10⁹⁵(96-digit number)
19024511792170369428…08913856249612129281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.804 × 10⁹⁵(96-digit number)
38049023584340738857…17827712499224258561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.609 × 10⁹⁵(96-digit number)
76098047168681477714…35655424998448517121
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,914,573 XPM·at block #6,833,793 · 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