Block #674,020

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/11/2014, 11:43:16 PM · Difficulty 10.9652 · 6,136,150 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9d1eb6424387a9882bd608598b899c8fe5492544adf093815f6a96889ace79cb

Height

#674,020

Difficulty

10.965224

Transactions

9

Size

2.55 KB

Version

2

Bits

0af718ed

Nonce

161,372,182

Timestamp

8/11/2014, 11:43:16 PM

Confirmations

6,136,150

Merkle Root

5561f61495712feef0e69ded691815b310224e1f38ed6e3401fff3ec2fb6d5e8
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.162 × 10⁹⁷(98-digit number)
21620885665209907794…05887645394414992639
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.162 × 10⁹⁷(98-digit number)
21620885665209907794…05887645394414992639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.324 × 10⁹⁷(98-digit number)
43241771330419815588…11775290788829985279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.648 × 10⁹⁷(98-digit number)
86483542660839631176…23550581577659970559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.729 × 10⁹⁸(99-digit number)
17296708532167926235…47101163155319941119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.459 × 10⁹⁸(99-digit number)
34593417064335852470…94202326310639882239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.918 × 10⁹⁸(99-digit number)
69186834128671704941…88404652621279764479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.383 × 10⁹⁹(100-digit number)
13837366825734340988…76809305242559528959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.767 × 10⁹⁹(100-digit number)
27674733651468681976…53618610485119057919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.534 × 10⁹⁹(100-digit number)
55349467302937363953…07237220970238115839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.106 × 10¹⁰⁰(101-digit number)
11069893460587472790…14474441940476231679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.213 × 10¹⁰⁰(101-digit number)
22139786921174945581…28948883880952463359
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,725,427 XPM·at block #6,810,169 · 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