Block #2,267,506

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/25/2017, 3:47:10 PM · Difficulty 10.9518 · 4,558,057 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
996aa63e4e5015d8e801a8d07bb09d475b193f9c82c871298058a7976bb9a225

Height

#2,267,506

Difficulty

10.951780

Transactions

2

Size

574 B

Version

2

Bits

0af3a7d9

Nonce

317,317,715

Timestamp

8/25/2017, 3:47:10 PM

Confirmations

4,558,057

Merkle Root

cf2413b68f52bdc72d45e4e456b4584ce68d9c6b3264fffcb950a6c489c07024
Transactions (2)
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.236 × 10⁹⁷(98-digit number)
12366862432208144036…11991436769506600959
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.236 × 10⁹⁷(98-digit number)
12366862432208144036…11991436769506600959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.473 × 10⁹⁷(98-digit number)
24733724864416288073…23982873539013201919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.946 × 10⁹⁷(98-digit number)
49467449728832576147…47965747078026403839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.893 × 10⁹⁷(98-digit number)
98934899457665152294…95931494156052807679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.978 × 10⁹⁸(99-digit number)
19786979891533030458…91862988312105615359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.957 × 10⁹⁸(99-digit number)
39573959783066060917…83725976624211230719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.914 × 10⁹⁸(99-digit number)
79147919566132121835…67451953248422461439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.582 × 10⁹⁹(100-digit number)
15829583913226424367…34903906496844922879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.165 × 10⁹⁹(100-digit number)
31659167826452848734…69807812993689845759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.331 × 10⁹⁹(100-digit number)
63318335652905697468…39615625987379691519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.266 × 10¹⁰⁰(101-digit number)
12663667130581139493…79231251974759383039
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,848,605 XPM·at block #6,825,562 · 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