Block #851,267

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 4:27:38 AM · Difficulty 10.9707 · 5,991,569 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7d0768dde7c06820b8cf4a88c2541b02e229c440e7b1fbbf103121a4e5670640

Height

#851,267

Difficulty

10.970654

Transactions

2

Size

433 B

Version

2

Bits

0af87cc5

Nonce

1,712,079,169

Timestamp

12/13/2014, 4:27:38 AM

Confirmations

5,991,569

Merkle Root

05d12550b18d1d3ee9386c5db7c1038a29dd3b9acd00ca4a67afff1a79d0d3da
Transactions (2)
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.521 × 10⁹⁷(98-digit number)
45211480908603326585…54500841058009354241
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.521 × 10⁹⁷(98-digit number)
45211480908603326585…54500841058009354241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.042 × 10⁹⁷(98-digit number)
90422961817206653170…09001682116018708481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.808 × 10⁹⁸(99-digit number)
18084592363441330634…18003364232037416961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.616 × 10⁹⁸(99-digit number)
36169184726882661268…36006728464074833921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.233 × 10⁹⁸(99-digit number)
72338369453765322536…72013456928149667841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.446 × 10⁹⁹(100-digit number)
14467673890753064507…44026913856299335681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.893 × 10⁹⁹(100-digit number)
28935347781506129014…88053827712598671361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.787 × 10⁹⁹(100-digit number)
57870695563012258029…76107655425197342721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.157 × 10¹⁰⁰(101-digit number)
11574139112602451605…52215310850394685441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.314 × 10¹⁰⁰(101-digit number)
23148278225204903211…04430621700789370881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.629 × 10¹⁰⁰(101-digit number)
46296556450409806423…08861243401578741761
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,987,032 XPM·at block #6,842,835 · 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