Block #846,971

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2014, 12:27:48 AM · Difficulty 10.9720 · 5,970,772 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b01c45bf40bc6f3f8fdacb465c9be4d35c1105b5c1db7f7a58cb2bc1c2f71ec8

Height

#846,971

Difficulty

10.972009

Transactions

6

Size

1.30 KB

Version

2

Bits

0af8d599

Nonce

82,114,454

Timestamp

12/10/2014, 12:27:48 AM

Confirmations

5,970,772

Merkle Root

f67dbaf7a6956a87d8f0a0ec7e03fec1e8b43b4dfd3f27f540165099784310f5
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.876 × 10⁹⁵(96-digit number)
38763856732949606970…80380095873991955841
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.876 × 10⁹⁵(96-digit number)
38763856732949606970…80380095873991955841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.752 × 10⁹⁵(96-digit number)
77527713465899213941…60760191747983911681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.550 × 10⁹⁶(97-digit number)
15505542693179842788…21520383495967823361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.101 × 10⁹⁶(97-digit number)
31011085386359685576…43040766991935646721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.202 × 10⁹⁶(97-digit number)
62022170772719371153…86081533983871293441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.240 × 10⁹⁷(98-digit number)
12404434154543874230…72163067967742586881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.480 × 10⁹⁷(98-digit number)
24808868309087748461…44326135935485173761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.961 × 10⁹⁷(98-digit number)
49617736618175496922…88652271870970347521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.923 × 10⁹⁷(98-digit number)
99235473236350993845…77304543741940695041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.984 × 10⁹⁸(99-digit number)
19847094647270198769…54609087483881390081
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,785,999 XPM·at block #6,817,742 · 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