Block #302,187

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2013, 4:14:01 PM · Difficulty 9.9926 · 6,524,867 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0c6dc78e161f7e76ecba502019535de4c993dda70d8831c80a8ae5f541f941ee

Height

#302,187

Difficulty

9.992648

Transactions

12

Size

3.49 KB

Version

2

Bits

09fe1e28

Nonce

8,950

Timestamp

12/9/2013, 4:14:01 PM

Confirmations

6,524,867

Merkle Root

e22847f4ecd8bfed12e55269c851b80ccaca59bcff42050b78c7cf34d58375cb
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.

2.512 × 10⁹⁵(96-digit number)
25125525744073293428…07623366269523966919
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
2.512 × 10⁹⁵(96-digit number)
25125525744073293428…07623366269523966919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.025 × 10⁹⁵(96-digit number)
50251051488146586857…15246732539047933839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.005 × 10⁹⁶(97-digit number)
10050210297629317371…30493465078095867679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.010 × 10⁹⁶(97-digit number)
20100420595258634743…60986930156191735359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.020 × 10⁹⁶(97-digit number)
40200841190517269486…21973860312383470719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.040 × 10⁹⁶(97-digit number)
80401682381034538972…43947720624766941439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.608 × 10⁹⁷(98-digit number)
16080336476206907794…87895441249533882879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.216 × 10⁹⁷(98-digit number)
32160672952413815589…75790882499067765759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.432 × 10⁹⁷(98-digit number)
64321345904827631178…51581764998135531519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.286 × 10⁹⁸(99-digit number)
12864269180965526235…03163529996271063039
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,860,614 XPM·at block #6,827,053 · 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