Block #401,156

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2014, 1:46:26 PM · Difficulty 10.4341 · 6,409,060 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cc01530f838807b9039485a0360c9c943fcafae69c2bafdbd4f70594ffd4fcd8

Height

#401,156

Difficulty

10.434054

Transactions

2

Size

1.40 KB

Version

2

Bits

0a6f1e27

Nonce

174,824

Timestamp

2/12/2014, 1:46:26 PM

Confirmations

6,409,060

Merkle Root

83ba180e7c4cbd3854282eef76315a3b7d5a4c62ed8c7f64062e415d805c22af
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.

1.678 × 10⁹³(94-digit number)
16781999209059071121…05483905101017716771
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
1.678 × 10⁹³(94-digit number)
16781999209059071121…05483905101017716771
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.356 × 10⁹³(94-digit number)
33563998418118142242…10967810202035433541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.712 × 10⁹³(94-digit number)
67127996836236284485…21935620404070867081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.342 × 10⁹⁴(95-digit number)
13425599367247256897…43871240808141734161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.685 × 10⁹⁴(95-digit number)
26851198734494513794…87742481616283468321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.370 × 10⁹⁴(95-digit number)
53702397468989027588…75484963232566936641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.074 × 10⁹⁵(96-digit number)
10740479493797805517…50969926465133873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.148 × 10⁹⁵(96-digit number)
21480958987595611035…01939852930267746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.296 × 10⁹⁵(96-digit number)
42961917975191222070…03879705860535493121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.592 × 10⁹⁵(96-digit number)
85923835950382444141…07759411721070986241
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,725,803 XPM·at block #6,810,215 · 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.

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