Block #446,472

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/16/2014, 2:28:10 PM · Difficulty 10.3597 · 6,380,830 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
370a36a2a967ed93a1c6227997a1fad135b9e371d69ee8df1ae20fdc6c20d766

Height

#446,472

Difficulty

10.359733

Transactions

12

Size

5.45 KB

Version

2

Bits

0a5c176e

Nonce

10,062

Timestamp

3/16/2014, 2:28:10 PM

Confirmations

6,380,830

Merkle Root

7cba9df9967c171b558751921c4ee1a055a8d028c96959a267484383a9fb56e3
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.673 × 10¹⁰⁰(101-digit number)
46735551971340741190…51160394525857269761
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.673 × 10¹⁰⁰(101-digit number)
46735551971340741190…51160394525857269761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.347 × 10¹⁰⁰(101-digit number)
93471103942681482380…02320789051714539521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.869 × 10¹⁰¹(102-digit number)
18694220788536296476…04641578103429079041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.738 × 10¹⁰¹(102-digit number)
37388441577072592952…09283156206858158081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.477 × 10¹⁰¹(102-digit number)
74776883154145185904…18566312413716316161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.495 × 10¹⁰²(103-digit number)
14955376630829037180…37132624827432632321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.991 × 10¹⁰²(103-digit number)
29910753261658074361…74265249654865264641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.982 × 10¹⁰²(103-digit number)
59821506523316148723…48530499309730529281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.196 × 10¹⁰³(104-digit number)
11964301304663229744…97060998619461058561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.392 × 10¹⁰³(104-digit number)
23928602609326459489…94121997238922117121
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,862,527 XPM·at block #6,827,301 · 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