Block #658,730

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/2/2014, 3:01:39 AM · Difficulty 10.9563 · 6,148,588 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
84e92c92e58424f9f35992e0f9f51b439e8fd036cdebb2897ed765438da5fccd

Height

#658,730

Difficulty

10.956320

Transactions

6

Size

1.59 KB

Version

2

Bits

0af4d16a

Nonce

513,842,518

Timestamp

8/2/2014, 3:01:39 AM

Confirmations

6,148,588

Merkle Root

611e13b29e867fc3b9b796c7c634aae0410bb4e71029037d9a7517d66e466e7f
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.

6.173 × 10⁹⁷(98-digit number)
61731244556835428590…88514527263341987841
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
6.173 × 10⁹⁷(98-digit number)
61731244556835428590…88514527263341987841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.234 × 10⁹⁸(99-digit number)
12346248911367085718…77029054526683975681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.469 × 10⁹⁸(99-digit number)
24692497822734171436…54058109053367951361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.938 × 10⁹⁸(99-digit number)
49384995645468342872…08116218106735902721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.876 × 10⁹⁸(99-digit number)
98769991290936685744…16232436213471805441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.975 × 10⁹⁹(100-digit number)
19753998258187337148…32464872426943610881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.950 × 10⁹⁹(100-digit number)
39507996516374674297…64929744853887221761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.901 × 10⁹⁹(100-digit number)
79015993032749348595…29859489707774443521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.580 × 10¹⁰⁰(101-digit number)
15803198606549869719…59718979415548887041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.160 × 10¹⁰⁰(101-digit number)
31606397213099739438…19437958831097774081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.321 × 10¹⁰⁰(101-digit number)
63212794426199478876…38875917662195548161
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,702,559 XPM·at block #6,807,317 · 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