Block #498,035

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/17/2014, 9:43:25 PM · Difficulty 10.7750 · 6,310,592 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f03a21742f56c4a2d553a1606bb5af625eac80e07faf4fe9e030154bceeb2d22

Height

#498,035

Difficulty

10.774996

Transactions

5

Size

26.53 KB

Version

2

Bits

0ac66623

Nonce

61,122,854

Timestamp

4/17/2014, 9:43:25 PM

Confirmations

6,310,592

Merkle Root

dc344d32cbda1f15aa2c092aee28ddb587744677c9d5e57df71ddf3ab71691b2
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.651 × 10⁹⁷(98-digit number)
86512600767689929289…90617817659064320481
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.651 × 10⁹⁷(98-digit number)
86512600767689929289…90617817659064320481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.730 × 10⁹⁸(99-digit number)
17302520153537985857…81235635318128640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.460 × 10⁹⁸(99-digit number)
34605040307075971715…62471270636257281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.921 × 10⁹⁸(99-digit number)
69210080614151943431…24942541272514563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.384 × 10⁹⁹(100-digit number)
13842016122830388686…49885082545029127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.768 × 10⁹⁹(100-digit number)
27684032245660777372…99770165090058255361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.536 × 10⁹⁹(100-digit number)
55368064491321554745…99540330180116510721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.107 × 10¹⁰⁰(101-digit number)
11073612898264310949…99080660360233021441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.214 × 10¹⁰⁰(101-digit number)
22147225796528621898…98161320720466042881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.429 × 10¹⁰⁰(101-digit number)
44294451593057243796…96322641440932085761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.858 × 10¹⁰⁰(101-digit number)
88588903186114487592…92645282881864171521
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,713,066 XPM·at block #6,808,626 · 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