Block #849,479

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2014, 8:20:29 PM · Difficulty 10.9714 · 5,995,508 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5d06b60e5b878731acde7b43f7f103a9e251ada57651e319a07b2feecc0e9716

Height

#849,479

Difficulty

10.971383

Transactions

4

Size

885 B

Version

2

Bits

0af8ac8b

Nonce

876,497,985

Timestamp

12/11/2014, 8:20:29 PM

Confirmations

5,995,508

Merkle Root

182cc18181d69224163b12e08cbb288e9749b72343430fa732a7d0012a10cc07
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.

2.766 × 10⁹⁷(98-digit number)
27663148555320568499…67707109146214318081
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
2.766 × 10⁹⁷(98-digit number)
27663148555320568499…67707109146214318081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.532 × 10⁹⁷(98-digit number)
55326297110641136998…35414218292428636161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.106 × 10⁹⁸(99-digit number)
11065259422128227399…70828436584857272321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.213 × 10⁹⁸(99-digit number)
22130518844256454799…41656873169714544641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.426 × 10⁹⁸(99-digit number)
44261037688512909599…83313746339429089281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.852 × 10⁹⁸(99-digit number)
88522075377025819198…66627492678858178561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.770 × 10⁹⁹(100-digit number)
17704415075405163839…33254985357716357121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.540 × 10⁹⁹(100-digit number)
35408830150810327679…66509970715432714241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.081 × 10⁹⁹(100-digit number)
70817660301620655358…33019941430865428481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.416 × 10¹⁰⁰(101-digit number)
14163532060324131071…66039882861730856961
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:58,004,315 XPM·at block #6,844,986 · 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