Block #371,038

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/22/2014, 2:09:17 PM · Difficulty 10.4358 · 6,444,101 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1bd35113d29daeed81ac074c96b3a2c5c1b979b122c7d693a7c72b5d9a4f8f75

Height

#371,038

Difficulty

10.435823

Transactions

2

Size

1.60 KB

Version

2

Bits

0a6f9216

Nonce

257,129

Timestamp

1/22/2014, 2:09:17 PM

Confirmations

6,444,101

Merkle Root

90fe60ab9c5d20936b3743e539e7e81befe8f8550750849c7ba0a91ca3d7c1c7
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.279 × 10⁹³(94-digit number)
22795982656139041323…58910855543727071299
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.279 × 10⁹³(94-digit number)
22795982656139041323…58910855543727071299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.559 × 10⁹³(94-digit number)
45591965312278082646…17821711087454142599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.118 × 10⁹³(94-digit number)
91183930624556165293…35643422174908285199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.823 × 10⁹⁴(95-digit number)
18236786124911233058…71286844349816570399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.647 × 10⁹⁴(95-digit number)
36473572249822466117…42573688699633140799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.294 × 10⁹⁴(95-digit number)
72947144499644932234…85147377399266281599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.458 × 10⁹⁵(96-digit number)
14589428899928986446…70294754798532563199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.917 × 10⁹⁵(96-digit number)
29178857799857972893…40589509597065126399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.835 × 10⁹⁵(96-digit number)
58357715599715945787…81179019194130252799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.167 × 10⁹⁶(97-digit number)
11671543119943189157…62358038388260505599
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,765,205 XPM·at block #6,815,138 · 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