Block #2,264,132

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/23/2017, 6:51:51 AM · Difficulty 10.9521 · 4,577,099 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cb1a2de4bc9b95aaad1cc5a65b7415be7cbe080fe89853ca2d427e5cf6585324

Height

#2,264,132

Difficulty

10.952081

Transactions

2

Size

574 B

Version

2

Bits

0af3bb91

Nonce

2,090,122,986

Timestamp

8/23/2017, 6:51:51 AM

Confirmations

4,577,099

Merkle Root

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

2.391 × 10⁹⁵(96-digit number)
23917820597953241841…25245708100230163199
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.391 × 10⁹⁵(96-digit number)
23917820597953241841…25245708100230163199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.783 × 10⁹⁵(96-digit number)
47835641195906483683…50491416200460326399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.567 × 10⁹⁵(96-digit number)
95671282391812967366…00982832400920652799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.913 × 10⁹⁶(97-digit number)
19134256478362593473…01965664801841305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.826 × 10⁹⁶(97-digit number)
38268512956725186946…03931329603682611199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.653 × 10⁹⁶(97-digit number)
76537025913450373893…07862659207365222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.530 × 10⁹⁷(98-digit number)
15307405182690074778…15725318414730444799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.061 × 10⁹⁷(98-digit number)
30614810365380149557…31450636829460889599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.122 × 10⁹⁷(98-digit number)
61229620730760299114…62901273658921779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.224 × 10⁹⁸(99-digit number)
12245924146152059822…25802547317843558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.449 × 10⁹⁸(99-digit number)
24491848292304119645…51605094635687116799
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,974,207 XPM·at block #6,841,230 · 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