Block #900,354

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2015, 6:03:33 PM · Difficulty 10.9427 · 5,913,721 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2ffec71e4671e643a7ae29506513907f23a4e36c4ca8a23dde4450f5c0a1083f

Height

#900,354

Difficulty

10.942652

Transactions

2

Size

991 B

Version

2

Bits

0af1519d

Nonce

760,611,954

Timestamp

1/18/2015, 6:03:33 PM

Confirmations

5,913,721

Merkle Root

1aeb10b4e82a5172cfc8d5f1b4bd6e6545a664c373b8b7602403714a86a05a8e
Transactions (2)
1 in → 1 out8.3500 XPM116 B
5 in → 1 out16.4200 XPM784 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.345 × 10⁹⁶(97-digit number)
63452859816132161473…46272193218602068479
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.345 × 10⁹⁶(97-digit number)
63452859816132161473…46272193218602068479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.269 × 10⁹⁷(98-digit number)
12690571963226432294…92544386437204136959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.538 × 10⁹⁷(98-digit number)
25381143926452864589…85088772874408273919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.076 × 10⁹⁷(98-digit number)
50762287852905729178…70177545748816547839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.015 × 10⁹⁸(99-digit number)
10152457570581145835…40355091497633095679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.030 × 10⁹⁸(99-digit number)
20304915141162291671…80710182995266191359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.060 × 10⁹⁸(99-digit number)
40609830282324583342…61420365990532382719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.121 × 10⁹⁸(99-digit number)
81219660564649166685…22840731981064765439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.624 × 10⁹⁹(100-digit number)
16243932112929833337…45681463962129530879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.248 × 10⁹⁹(100-digit number)
32487864225859666674…91362927924259061759
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,756,680 XPM·at block #6,814,074 · 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