Block #861,033

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2014, 5:14:59 PM · Difficulty 10.9640 · 5,955,388 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
04bf0ffde556e6aac8aabb77da03a661da6289b96ac163e875a30f306120a891

Height

#861,033

Difficulty

10.963954

Transactions

3

Size

2.66 KB

Version

2

Bits

0af6c5b2

Nonce

1,514,265,451

Timestamp

12/20/2014, 5:14:59 PM

Confirmations

5,955,388

Merkle Root

4596359d290c87955a4ed46925b449445847a9a8887530c565ffb9ae73372a17
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.

3.220 × 10⁹³(94-digit number)
32203665052723939604…55812298911069059601
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
3.220 × 10⁹³(94-digit number)
32203665052723939604…55812298911069059601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.440 × 10⁹³(94-digit number)
64407330105447879209…11624597822138119201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.288 × 10⁹⁴(95-digit number)
12881466021089575841…23249195644276238401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.576 × 10⁹⁴(95-digit number)
25762932042179151683…46498391288552476801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.152 × 10⁹⁴(95-digit number)
51525864084358303367…92996782577104953601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.030 × 10⁹⁵(96-digit number)
10305172816871660673…85993565154209907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.061 × 10⁹⁵(96-digit number)
20610345633743321347…71987130308419814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.122 × 10⁹⁵(96-digit number)
41220691267486642694…43974260616839628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.244 × 10⁹⁵(96-digit number)
82441382534973285388…87948521233679257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.648 × 10⁹⁶(97-digit number)
16488276506994657077…75897042467358515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.297 × 10⁹⁶(97-digit number)
32976553013989314155…51794084934717030401
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,775,495 XPM·at block #6,816,420 · 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