Block #857,125

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2014, 2:43:57 PM · Difficulty 10.9677 · 5,985,254 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a91eb774d78220748cc0cfd37ee10a9ea9d23d3fa4f8c61a58411f423a6e03fd

Height

#857,125

Difficulty

10.967658

Transactions

5

Size

1.05 KB

Version

2

Bits

0af7b86e

Nonce

898,039,437

Timestamp

12/17/2014, 2:43:57 PM

Confirmations

5,985,254

Merkle Root

b1c96e176f39089ac7db0d7306f1b8dc9cd5d5380468f1baa50e7dc44580924a
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.436 × 10⁹⁶(97-digit number)
94366257373883595442…61715694539399731201
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.436 × 10⁹⁶(97-digit number)
94366257373883595442…61715694539399731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.887 × 10⁹⁷(98-digit number)
18873251474776719088…23431389078799462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.774 × 10⁹⁷(98-digit number)
37746502949553438176…46862778157598924801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.549 × 10⁹⁷(98-digit number)
75493005899106876353…93725556315197849601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.509 × 10⁹⁸(99-digit number)
15098601179821375270…87451112630395699201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.019 × 10⁹⁸(99-digit number)
30197202359642750541…74902225260791398401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.039 × 10⁹⁸(99-digit number)
60394404719285501083…49804450521582796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.207 × 10⁹⁹(100-digit number)
12078880943857100216…99608901043165593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.415 × 10⁹⁹(100-digit number)
24157761887714200433…99217802086331187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.831 × 10⁹⁹(100-digit number)
48315523775428400866…98435604172662374401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.663 × 10⁹⁹(100-digit number)
96631047550856801733…96871208345324748801
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,983,441 XPM·at block #6,842,378 · 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