Block #441,558

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/13/2014, 5:34:54 AM · Difficulty 10.3490 · 6,374,752 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
08feb5149deb0926dc310e3c2c384dc9061207220ce22bee884a5f4321033b3f

Height

#441,558

Difficulty

10.349018

Transactions

4

Size

990 B

Version

2

Bits

0a59593e

Nonce

44,077

Timestamp

3/13/2014, 5:34:54 AM

Confirmations

6,374,752

Merkle Root

fba2799e98b8afbed5df700e58131006397ef89e43ee3bf414dfe65bea9a4630
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.

5.670 × 10⁹⁶(97-digit number)
56704796343077354119…90498072008587619201
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
5.670 × 10⁹⁶(97-digit number)
56704796343077354119…90498072008587619201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.134 × 10⁹⁷(98-digit number)
11340959268615470823…80996144017175238401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.268 × 10⁹⁷(98-digit number)
22681918537230941647…61992288034350476801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.536 × 10⁹⁷(98-digit number)
45363837074461883295…23984576068700953601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.072 × 10⁹⁷(98-digit number)
90727674148923766590…47969152137401907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.814 × 10⁹⁸(99-digit number)
18145534829784753318…95938304274803814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.629 × 10⁹⁸(99-digit number)
36291069659569506636…91876608549607628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.258 × 10⁹⁸(99-digit number)
72582139319139013272…83753217099215257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.451 × 10⁹⁹(100-digit number)
14516427863827802654…67506434198430515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.903 × 10⁹⁹(100-digit number)
29032855727655605308…35012868396861030401
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,774,601 XPM·at block #6,816,309 · 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