Block #307,765

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2013, 6:24:09 PM · Difficulty 9.9943 · 6,522,729 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
914e4ffb54bbbe8e6c470b4f387b67128fd4c71a4e7fa665f04260cb3bcc148d

Height

#307,765

Difficulty

9.994285

Transactions

4

Size

1.89 KB

Version

2

Bits

09fe8973

Nonce

88,849

Timestamp

12/12/2013, 6:24:09 PM

Confirmations

6,522,729

Merkle Root

31445e881f99ac0ad8fdd7c3a311d9bb6f28caecde061dac10d126da3e36046f
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.

7.802 × 10⁹²(93-digit number)
78021234162510536442…29631399053361843199
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
7.802 × 10⁹²(93-digit number)
78021234162510536442…29631399053361843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.560 × 10⁹³(94-digit number)
15604246832502107288…59262798106723686399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.120 × 10⁹³(94-digit number)
31208493665004214577…18525596213447372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.241 × 10⁹³(94-digit number)
62416987330008429154…37051192426894745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.248 × 10⁹⁴(95-digit number)
12483397466001685830…74102384853789491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.496 × 10⁹⁴(95-digit number)
24966794932003371661…48204769707578982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.993 × 10⁹⁴(95-digit number)
49933589864006743323…96409539415157964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.986 × 10⁹⁴(95-digit number)
99867179728013486647…92819078830315929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.997 × 10⁹⁵(96-digit number)
19973435945602697329…85638157660631859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.994 × 10⁹⁵(96-digit number)
39946871891205394658…71276315321263718399
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,888,202 XPM·at block #6,830,493 · 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