Block #443,613

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/14/2014, 4:19:33 PM · Difficulty 10.3471 · 6,383,532 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b06e30f9da66b1cb26b5c4758d6e0848547a861070d18b065c2a9069ecde71e9

Height

#443,613

Difficulty

10.347060

Transactions

6

Size

1.30 KB

Version

2

Bits

0a58d8ec

Nonce

297,578

Timestamp

3/14/2014, 4:19:33 PM

Confirmations

6,383,532

Merkle Root

ebb99d5b9a5fae9c4b4fdb276dea7883f68ea0ba5c2cb5139f9811e39c1cf91e
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.942 × 10¹⁰⁰(101-digit number)
19426264762020613788…59092923693972974441
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.942 × 10¹⁰⁰(101-digit number)
19426264762020613788…59092923693972974441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.885 × 10¹⁰⁰(101-digit number)
38852529524041227576…18185847387945948881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.770 × 10¹⁰⁰(101-digit number)
77705059048082455152…36371694775891897761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.554 × 10¹⁰¹(102-digit number)
15541011809616491030…72743389551783795521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.108 × 10¹⁰¹(102-digit number)
31082023619232982060…45486779103567591041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.216 × 10¹⁰¹(102-digit number)
62164047238465964121…90973558207135182081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.243 × 10¹⁰²(103-digit number)
12432809447693192824…81947116414270364161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.486 × 10¹⁰²(103-digit number)
24865618895386385648…63894232828540728321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.973 × 10¹⁰²(103-digit number)
49731237790772771297…27788465657081456641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.946 × 10¹⁰²(103-digit number)
99462475581545542594…55576931314162913281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.989 × 10¹⁰³(104-digit number)
19892495116309108518…11153862628325826561
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,861,342 XPM·at block #6,827,144 · 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