Block #2,652,591

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2018, 5:36:37 PM · Difficulty 11.7438 · 4,178,263 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e72f622743c11ee80f6b13862e7a6f5a8dba2dbb03ae38ed81bd0a4e14b3427d

Height

#2,652,591

Difficulty

11.743805

Transactions

2

Size

573 B

Version

2

Bits

0bbe6a07

Nonce

38,457,705

Timestamp

5/7/2018, 5:36:37 PM

Confirmations

4,178,263

Merkle Root

2224f8bcb41ae9d2ed0a1931abc2532b368a300b89b24d5c0be854750d8e07ce
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.

6.086 × 10⁹²(93-digit number)
60867771644791996804…26453256262242045469
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.086 × 10⁹²(93-digit number)
60867771644791996804…26453256262242045469
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.217 × 10⁹³(94-digit number)
12173554328958399360…52906512524484090939
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.434 × 10⁹³(94-digit number)
24347108657916798721…05813025048968181879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.869 × 10⁹³(94-digit number)
48694217315833597443…11626050097936363759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.738 × 10⁹³(94-digit number)
97388434631667194886…23252100195872727519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.947 × 10⁹⁴(95-digit number)
19477686926333438977…46504200391745455039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.895 × 10⁹⁴(95-digit number)
38955373852666877954…93008400783490910079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.791 × 10⁹⁴(95-digit number)
77910747705333755909…86016801566981820159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.558 × 10⁹⁵(96-digit number)
15582149541066751181…72033603133963640319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.116 × 10⁹⁵(96-digit number)
31164299082133502363…44067206267927280639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.232 × 10⁹⁵(96-digit number)
62328598164267004727…88134412535854561279
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,890,968 XPM·at block #6,830,853 · 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