Block #2,309,699

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/26/2017, 7:02:30 AM · Difficulty 10.9084 · 4,521,488 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b37f0b45d1f1fe0ec1a78296e10b0ed23aa9ef96b2af53522526896fb6c98000

Height

#2,309,699

Difficulty

10.908414

Transactions

2

Size

869 B

Version

2

Bits

0ae88dd0

Nonce

332,639,400

Timestamp

9/26/2017, 7:02:30 AM

Confirmations

4,521,488

Merkle Root

55d71c19b542ee60a7164116127f93b8c2bfae23cfb93b8d7d0d4bda5cb2968c
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.048 × 10⁹⁵(96-digit number)
10486609792058280775…10567227152061587359
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.048 × 10⁹⁵(96-digit number)
10486609792058280775…10567227152061587359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.097 × 10⁹⁵(96-digit number)
20973219584116561550…21134454304123174719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.194 × 10⁹⁵(96-digit number)
41946439168233123101…42268908608246349439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.389 × 10⁹⁵(96-digit number)
83892878336466246203…84537817216492698879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.677 × 10⁹⁶(97-digit number)
16778575667293249240…69075634432985397759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.355 × 10⁹⁶(97-digit number)
33557151334586498481…38151268865970795519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.711 × 10⁹⁶(97-digit number)
67114302669172996962…76302537731941591039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.342 × 10⁹⁷(98-digit number)
13422860533834599392…52605075463883182079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.684 × 10⁹⁷(98-digit number)
26845721067669198784…05210150927766364159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.369 × 10⁹⁷(98-digit number)
53691442135338397569…10420301855532728319
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,893,640 XPM·at block #6,831,186 · 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