Block #478,349

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/7/2014, 12:47:58 AM · Difficulty 10.4927 · 6,332,760 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ec2f0ddc377db17c793e4e19b39324f847163bc41cd88358b35e7f39695b944a

Height

#478,349

Difficulty

10.492691

Transactions

1

Size

937 B

Version

2

Bits

0a7e2107

Nonce

77,697

Timestamp

4/7/2014, 12:47:58 AM

Confirmations

6,332,760

Merkle Root

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

8.123 × 10⁹⁸(99-digit number)
81233122752339505352…16994714158216185601
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
8.123 × 10⁹⁸(99-digit number)
81233122752339505352…16994714158216185601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.624 × 10⁹⁹(100-digit number)
16246624550467901070…33989428316432371201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.249 × 10⁹⁹(100-digit number)
32493249100935802141…67978856632864742401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.498 × 10⁹⁹(100-digit number)
64986498201871604282…35957713265729484801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.299 × 10¹⁰⁰(101-digit number)
12997299640374320856…71915426531458969601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.599 × 10¹⁰⁰(101-digit number)
25994599280748641712…43830853062917939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.198 × 10¹⁰⁰(101-digit number)
51989198561497283425…87661706125835878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.039 × 10¹⁰¹(102-digit number)
10397839712299456685…75323412251671756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.079 × 10¹⁰¹(102-digit number)
20795679424598913370…50646824503343513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.159 × 10¹⁰¹(102-digit number)
41591358849197826740…01293649006687027201
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,732,979 XPM·at block #6,811,108 · 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