Block #665,171

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/6/2014, 8:27:26 AM · Difficulty 10.9595 · 6,145,823 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
219d502a76cdb8232fe2cc6337887fec9cf1389b2553eef87fb95d8f2a629f1a

Height

#665,171

Difficulty

10.959470

Transactions

6

Size

3.19 KB

Version

2

Bits

0af59fcd

Nonce

348,632,003

Timestamp

8/6/2014, 8:27:26 AM

Confirmations

6,145,823

Merkle Root

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

2.802 × 10⁹⁸(99-digit number)
28024782370663556397…47729430830165130561
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
2.802 × 10⁹⁸(99-digit number)
28024782370663556397…47729430830165130561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.604 × 10⁹⁸(99-digit number)
56049564741327112794…95458861660330261121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.120 × 10⁹⁹(100-digit number)
11209912948265422558…90917723320660522241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.241 × 10⁹⁹(100-digit number)
22419825896530845117…81835446641321044481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.483 × 10⁹⁹(100-digit number)
44839651793061690235…63670893282642088961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.967 × 10⁹⁹(100-digit number)
89679303586123380471…27341786565284177921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.793 × 10¹⁰⁰(101-digit number)
17935860717224676094…54683573130568355841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.587 × 10¹⁰⁰(101-digit number)
35871721434449352188…09367146261136711681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.174 × 10¹⁰⁰(101-digit number)
71743442868898704377…18734292522273423361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.434 × 10¹⁰¹(102-digit number)
14348688573779740875…37468585044546846721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.869 × 10¹⁰¹(102-digit number)
28697377147559481750…74937170089093693441
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,732,056 XPM·at block #6,810,993 · 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