Block #477,530

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2014, 12:27:35 PM · Difficulty 10.4847 · 6,347,107 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
62b7bbc34d3602eff3973dea6f7e4b7c33accfe97f99df41f15aaa1342e669b2

Height

#477,530

Difficulty

10.484714

Transactions

2

Size

1.37 KB

Version

2

Bits

0a7c163b

Nonce

137,006

Timestamp

4/6/2014, 12:27:35 PM

Confirmations

6,347,107

Merkle Root

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

3.840 × 10⁹⁸(99-digit number)
38401432830056888534…50691882103668999681
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
3.840 × 10⁹⁸(99-digit number)
38401432830056888534…50691882103668999681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.680 × 10⁹⁸(99-digit number)
76802865660113777068…01383764207337999361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.536 × 10⁹⁹(100-digit number)
15360573132022755413…02767528414675998721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.072 × 10⁹⁹(100-digit number)
30721146264045510827…05535056829351997441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.144 × 10⁹⁹(100-digit number)
61442292528091021655…11070113658703994881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.228 × 10¹⁰⁰(101-digit number)
12288458505618204331…22140227317407989761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.457 × 10¹⁰⁰(101-digit number)
24576917011236408662…44280454634815979521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.915 × 10¹⁰⁰(101-digit number)
49153834022472817324…88560909269631959041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.830 × 10¹⁰⁰(101-digit number)
98307668044945634648…77121818539263918081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.966 × 10¹⁰¹(102-digit number)
19661533608989126929…54243637078527836161
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,841,160 XPM·at block #6,824,636 · 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