Block #497,758

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/17/2014, 6:03:06 PM · Difficulty 10.7724 · 6,319,055 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bacbe5ee35febb4cec20d35f3937751e31578bcb48fc2819830ab743cb6a57ea

Height

#497,758

Difficulty

10.772395

Transactions

5

Size

1.97 KB

Version

2

Bits

0ac5bba9

Nonce

95,037

Timestamp

4/17/2014, 6:03:06 PM

Confirmations

6,319,055

Merkle Root

2792e1f7e8acfe6c3cb667c4225ba4c84fd03da8aaeb97114194c81ca2257b1a
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.

1.499 × 10⁹¹(92-digit number)
14995173484600241718…92721449186557468001
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
1.499 × 10⁹¹(92-digit number)
14995173484600241718…92721449186557468001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.999 × 10⁹¹(92-digit number)
29990346969200483437…85442898373114936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.998 × 10⁹¹(92-digit number)
59980693938400966875…70885796746229872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.199 × 10⁹²(93-digit number)
11996138787680193375…41771593492459744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.399 × 10⁹²(93-digit number)
23992277575360386750…83543186984919488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.798 × 10⁹²(93-digit number)
47984555150720773500…67086373969838976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.596 × 10⁹²(93-digit number)
95969110301441547000…34172747939677952001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.919 × 10⁹³(94-digit number)
19193822060288309400…68345495879355904001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.838 × 10⁹³(94-digit number)
38387644120576618800…36690991758711808001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.677 × 10⁹³(94-digit number)
76775288241153237600…73381983517423616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.535 × 10⁹⁴(95-digit number)
15355057648230647520…46763967034847232001
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,778,542 XPM·at block #6,816,812 · 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