Block #2,135,478

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2017, 6:20:13 AM · Difficulty 10.9010 · 4,704,118 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
39b7de32e299f229f4543ad095b01fe5889fcd7de557856d88875ba2e072b795

Height

#2,135,478

Difficulty

10.901008

Transactions

4

Size

878 B

Version

2

Bits

0ae6a873

Nonce

1,027,761,968

Timestamp

5/28/2017, 6:20:13 AM

Confirmations

4,704,118

Merkle Root

b68eb395bd67bd4b8170e7d0d00cd9708b7b78f6ad9564a2191f3bf67a62306a
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.567 × 10⁹⁴(95-digit number)
25679442365532460323…81409675073525012479
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.567 × 10⁹⁴(95-digit number)
25679442365532460323…81409675073525012479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.135 × 10⁹⁴(95-digit number)
51358884731064920646…62819350147050024959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.027 × 10⁹⁵(96-digit number)
10271776946212984129…25638700294100049919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.054 × 10⁹⁵(96-digit number)
20543553892425968258…51277400588200099839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.108 × 10⁹⁵(96-digit number)
41087107784851936517…02554801176400199679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.217 × 10⁹⁵(96-digit number)
82174215569703873034…05109602352800399359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.643 × 10⁹⁶(97-digit number)
16434843113940774606…10219204705600798719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.286 × 10⁹⁶(97-digit number)
32869686227881549213…20438409411201597439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.573 × 10⁹⁶(97-digit number)
65739372455763098427…40876818822403194879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.314 × 10⁹⁷(98-digit number)
13147874491152619685…81753637644806389759
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,961,056 XPM·at block #6,839,595 · 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