Block #852,607

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2014, 6:02:23 AM · Difficulty 10.9695 · 5,983,932 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2a2558e0fe99a0f8b1778f3725016c7d271f93f0e215e1dad03af600611e9fb5

Height

#852,607

Difficulty

10.969540

Transactions

13

Size

3.56 KB

Version

2

Bits

0af833c4

Nonce

254,251,367

Timestamp

12/14/2014, 6:02:23 AM

Confirmations

5,983,932

Merkle Root

0ca07ec02203632264e4409688481d3265621d2e41ec8e60cdd0934c9b4aed4a
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.

7.273 × 10⁹⁶(97-digit number)
72736952732757709417…36252078052291957761
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
7.273 × 10⁹⁶(97-digit number)
72736952732757709417…36252078052291957761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.454 × 10⁹⁷(98-digit number)
14547390546551541883…72504156104583915521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.909 × 10⁹⁷(98-digit number)
29094781093103083766…45008312209167831041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.818 × 10⁹⁷(98-digit number)
58189562186206167533…90016624418335662081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.163 × 10⁹⁸(99-digit number)
11637912437241233506…80033248836671324161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.327 × 10⁹⁸(99-digit number)
23275824874482467013…60066497673342648321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.655 × 10⁹⁸(99-digit number)
46551649748964934026…20132995346685296641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.310 × 10⁹⁸(99-digit number)
93103299497929868053…40265990693370593281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.862 × 10⁹⁹(100-digit number)
18620659899585973610…80531981386741186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.724 × 10⁹⁹(100-digit number)
37241319799171947221…61063962773482373121
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,936,576 XPM·at block #6,836,538 · 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