Block #2,153,409

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/9/2017, 3:47:44 PM · Difficulty 10.9031 · 4,679,957 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
64a70f9c0e619ea8ec6cbccd8f5be86e7c056bed05adf82a68730de6bdf6bb86

Height

#2,153,409

Difficulty

10.903086

Transactions

2

Size

1.11 KB

Version

2

Bits

0ae730ab

Nonce

1,100,768,226

Timestamp

6/9/2017, 3:47:44 PM

Confirmations

4,679,957

Merkle Root

42b236a6e2e1ef128e8d3a363ca6d332a58a556cffdfd7ff9b3e1b43cf61300a
Transactions (2)
1 in → 1 out8.4600 XPM109 B
6 in → 1 out267.1088 XPM933 B
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.169 × 10⁹³(94-digit number)
61699078676381967401…69537894151973428049
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.169 × 10⁹³(94-digit number)
61699078676381967401…69537894151973428049
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.233 × 10⁹⁴(95-digit number)
12339815735276393480…39075788303946856099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.467 × 10⁹⁴(95-digit number)
24679631470552786960…78151576607893712199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.935 × 10⁹⁴(95-digit number)
49359262941105573921…56303153215787424399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.871 × 10⁹⁴(95-digit number)
98718525882211147843…12606306431574848799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.974 × 10⁹⁵(96-digit number)
19743705176442229568…25212612863149697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.948 × 10⁹⁵(96-digit number)
39487410352884459137…50425225726299395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.897 × 10⁹⁵(96-digit number)
78974820705768918274…00850451452598790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.579 × 10⁹⁶(97-digit number)
15794964141153783654…01700902905197580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.158 × 10⁹⁶(97-digit number)
31589928282307567309…03401805810395161599
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,911,125 XPM·at block #6,833,365 · 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