Block #1,357,948

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2015, 6:08:18 PM · Difficulty 10.8296 · 5,459,998 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0661bca5003e9891e50b5cbd8726ce4d967f4b7fddcdaf8101c089bac07c27f2

Height

#1,357,948

Difficulty

10.829582

Transactions

2

Size

1.35 KB

Version

2

Bits

0ad45f7c

Nonce

875,619,647

Timestamp

12/6/2015, 6:08:18 PM

Confirmations

5,459,998

Merkle Root

4411cb78541b0156ce1eadbde79660c8b198d5dcc70ca6e3048ed0883d4c7307
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.

4.660 × 10⁹⁴(95-digit number)
46605635865445348460…81581405806951175361
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
4.660 × 10⁹⁴(95-digit number)
46605635865445348460…81581405806951175361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.321 × 10⁹⁴(95-digit number)
93211271730890696920…63162811613902350721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.864 × 10⁹⁵(96-digit number)
18642254346178139384…26325623227804701441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.728 × 10⁹⁵(96-digit number)
37284508692356278768…52651246455609402881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.456 × 10⁹⁵(96-digit number)
74569017384712557536…05302492911218805761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.491 × 10⁹⁶(97-digit number)
14913803476942511507…10604985822437611521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.982 × 10⁹⁶(97-digit number)
29827606953885023014…21209971644875223041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.965 × 10⁹⁶(97-digit number)
59655213907770046029…42419943289750446081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.193 × 10⁹⁷(98-digit number)
11931042781554009205…84839886579500892161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.386 × 10⁹⁷(98-digit number)
23862085563108018411…69679773159001784321
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,787,635 XPM·at block #6,817,945 · 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