Block #490,580

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/13/2014, 11:03:45 PM · Difficulty 10.6780 · 6,317,218 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
82d7abb2299114fea65635b13ea1843ede1eb92b242d9c9e0bab6232ef0471ea

Height

#490,580

Difficulty

10.678021

Transactions

6

Size

2.03 KB

Version

2

Bits

0aad92c3

Nonce

358,463,369

Timestamp

4/13/2014, 11:03:45 PM

Confirmations

6,317,218

Merkle Root

fe9d880ff57a08fae0bddfbc2bb43286dc0803f4b8812016a5f980d6b826a333
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.683 × 10⁹⁹(100-digit number)
46835324002297852132…38490590197783541761
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.683 × 10⁹⁹(100-digit number)
46835324002297852132…38490590197783541761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.367 × 10⁹⁹(100-digit number)
93670648004595704264…76981180395567083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.873 × 10¹⁰⁰(101-digit number)
18734129600919140852…53962360791134167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.746 × 10¹⁰⁰(101-digit number)
37468259201838281705…07924721582268334081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.493 × 10¹⁰⁰(101-digit number)
74936518403676563411…15849443164536668161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.498 × 10¹⁰¹(102-digit number)
14987303680735312682…31698886329073336321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.997 × 10¹⁰¹(102-digit number)
29974607361470625364…63397772658146672641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.994 × 10¹⁰¹(102-digit number)
59949214722941250729…26795545316293345281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.198 × 10¹⁰²(103-digit number)
11989842944588250145…53591090632586690561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.397 × 10¹⁰²(103-digit number)
23979685889176500291…07182181265173381121
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,706,417 XPM·at block #6,807,797 · 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