Block #853,256

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2014, 5:58:14 PM · Difficulty 10.9691 · 5,956,007 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f1f31db7f9be217f1ef576599cd2e33d6b2ba4de0f1e45351a02ca5a9c630764

Height

#853,256

Difficulty

10.969144

Transactions

5

Size

2.67 KB

Version

2

Bits

0af819ca

Nonce

1,749,886,911

Timestamp

12/14/2014, 5:58:14 PM

Confirmations

5,956,007

Merkle Root

e582ee4ec4da0ee6f029ae103d08f955055574461248e5e9ded59d21ca04ac7b
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.542 × 10⁹⁵(96-digit number)
15428397904952731564…18121102297099450881
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.542 × 10⁹⁵(96-digit number)
15428397904952731564…18121102297099450881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.085 × 10⁹⁵(96-digit number)
30856795809905463129…36242204594198901761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.171 × 10⁹⁵(96-digit number)
61713591619810926258…72484409188397803521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.234 × 10⁹⁶(97-digit number)
12342718323962185251…44968818376795607041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.468 × 10⁹⁶(97-digit number)
24685436647924370503…89937636753591214081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.937 × 10⁹⁶(97-digit number)
49370873295848741007…79875273507182428161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.874 × 10⁹⁶(97-digit number)
98741746591697482014…59750547014364856321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.974 × 10⁹⁷(98-digit number)
19748349318339496402…19501094028729712641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.949 × 10⁹⁷(98-digit number)
39496698636678992805…39002188057459425281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.899 × 10⁹⁷(98-digit number)
78993397273357985611…78004376114918850561
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,718,172 XPM·at block #6,809,262 · 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.

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