Block #1,200,543

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/19/2015, 3:16:44 PM · Difficulty 10.8147 · 5,641,766 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3cf755a67a0053313de1b263b87f1aaa910c31b4710acb2d6a7b284d45955d49

Height

#1,200,543

Difficulty

10.814708

Transactions

6

Size

1.44 KB

Version

2

Bits

0ad090b0

Nonce

29,359,021

Timestamp

8/19/2015, 3:16:44 PM

Confirmations

5,641,766

Merkle Root

2b7ff88c20ddcccad06e25183cb2898e4e97300ba99d2f83e45101fe4881999f
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.050 × 10⁹³(94-digit number)
40507758648493898238…19480955866292428201
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.050 × 10⁹³(94-digit number)
40507758648493898238…19480955866292428201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.101 × 10⁹³(94-digit number)
81015517296987796476…38961911732584856401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.620 × 10⁹⁴(95-digit number)
16203103459397559295…77923823465169712801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.240 × 10⁹⁴(95-digit number)
32406206918795118590…55847646930339425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.481 × 10⁹⁴(95-digit number)
64812413837590237181…11695293860678851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.296 × 10⁹⁵(96-digit number)
12962482767518047436…23390587721357702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.592 × 10⁹⁵(96-digit number)
25924965535036094872…46781175442715404801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.184 × 10⁹⁵(96-digit number)
51849931070072189744…93562350885430809601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.036 × 10⁹⁶(97-digit number)
10369986214014437948…87124701770861619201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.073 × 10⁹⁶(97-digit number)
20739972428028875897…74249403541723238401
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,982,878 XPM·at block #6,842,308 · 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