Block #446,059

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/16/2014, 7:27:42 AM · Difficulty 10.3608 · 6,361,826 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e506785aeb30116bf6706b21e08661b306ee43074457c12985f3815cd19cab25

Height

#446,059

Difficulty

10.360789

Transactions

2

Size

1.16 KB

Version

2

Bits

0a5c5cae

Nonce

195,787

Timestamp

3/16/2014, 7:27:42 AM

Confirmations

6,361,826

Merkle Root

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

2.402 × 10⁹⁶(97-digit number)
24027889014836864477…19453761925110293221
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
2.402 × 10⁹⁶(97-digit number)
24027889014836864477…19453761925110293221
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.805 × 10⁹⁶(97-digit number)
48055778029673728954…38907523850220586441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.611 × 10⁹⁶(97-digit number)
96111556059347457909…77815047700441172881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.922 × 10⁹⁷(98-digit number)
19222311211869491581…55630095400882345761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.844 × 10⁹⁷(98-digit number)
38444622423738983163…11260190801764691521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.688 × 10⁹⁷(98-digit number)
76889244847477966327…22520381603529383041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.537 × 10⁹⁸(99-digit number)
15377848969495593265…45040763207058766081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.075 × 10⁹⁸(99-digit number)
30755697938991186530…90081526414117532161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.151 × 10⁹⁸(99-digit number)
61511395877982373061…80163052828235064321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.230 × 10⁹⁹(100-digit number)
12302279175596474612…60326105656470128641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.460 × 10⁹⁹(100-digit number)
24604558351192949224…20652211312940257281
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,707,115 XPM·at block #6,807,884 · 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