Block #2,997,471

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/6/2019, 2:28:57 AM · Difficulty 11.2507 · 3,843,343 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
86b5bb7ee2f69f8c5e24207d9cd76fd10bbc0309047f2c610344859707ae3a06

Height

#2,997,471

Difficulty

11.250691

Transactions

29

Size

8.03 KB

Version

2

Bits

0b402d48

Nonce

166,423,314

Timestamp

1/6/2019, 2:28:57 AM

Confirmations

3,843,343

Merkle Root

c3e6424e365c11d5d0c092c9a2ec1a58ca09dea6fc4cdd3fb6aca73d9702cefe
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.498 × 10⁹⁴(95-digit number)
64983092387642669481…69196843457470390759
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.498 × 10⁹⁴(95-digit number)
64983092387642669481…69196843457470390759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.299 × 10⁹⁵(96-digit number)
12996618477528533896…38393686914940781519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.599 × 10⁹⁵(96-digit number)
25993236955057067792…76787373829881563039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.198 × 10⁹⁵(96-digit number)
51986473910114135585…53574747659763126079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.039 × 10⁹⁶(97-digit number)
10397294782022827117…07149495319526252159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.079 × 10⁹⁶(97-digit number)
20794589564045654234…14298990639052504319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.158 × 10⁹⁶(97-digit number)
41589179128091308468…28597981278105008639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.317 × 10⁹⁶(97-digit number)
83178358256182616936…57195962556210017279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.663 × 10⁹⁷(98-digit number)
16635671651236523387…14391925112420034559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.327 × 10⁹⁷(98-digit number)
33271343302473046774…28783850224840069119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.654 × 10⁹⁷(98-digit number)
66542686604946093549…57567700449680138239
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,970,863 XPM·at block #6,840,813 · 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