Block #307,208

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2013, 11:04:21 AM · Difficulty 9.9941 · 6,509,548 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
21534aec3fba1c54eafcbc9b017eb3957c8ac4b2bdb30f3056699f4e0a6f1633

Height

#307,208

Difficulty

9.994131

Transactions

5

Size

1.08 KB

Version

2

Bits

09fe7f65

Nonce

36,228

Timestamp

12/12/2013, 11:04:21 AM

Confirmations

6,509,548

Merkle Root

5717747bb6f496f258b1ab2053543baa0678e2b57ad7b60ed26ba21cb43d8fd7
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.

3.226 × 10⁹⁵(96-digit number)
32267625617524107769…69138440128273738239
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
3.226 × 10⁹⁵(96-digit number)
32267625617524107769…69138440128273738239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.453 × 10⁹⁵(96-digit number)
64535251235048215538…38276880256547476479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.290 × 10⁹⁶(97-digit number)
12907050247009643107…76553760513094952959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.581 × 10⁹⁶(97-digit number)
25814100494019286215…53107521026189905919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.162 × 10⁹⁶(97-digit number)
51628200988038572430…06215042052379811839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.032 × 10⁹⁷(98-digit number)
10325640197607714486…12430084104759623679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.065 × 10⁹⁷(98-digit number)
20651280395215428972…24860168209519247359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.130 × 10⁹⁷(98-digit number)
41302560790430857944…49720336419038494719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.260 × 10⁹⁷(98-digit number)
82605121580861715889…99440672838076989439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.652 × 10⁹⁸(99-digit number)
16521024316172343177…98881345676153978879
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,778,079 XPM·at block #6,816,755 · 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