Block #378,353

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/27/2014, 6:37:20 PM · Difficulty 10.4137 · 6,447,199 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a5f891a0237595f2d9c386f782522e1170272465a5d14c7c8a059208d609cd85

Height

#378,353

Difficulty

10.413727

Transactions

5

Size

1.08 KB

Version

2

Bits

0a69ea06

Nonce

29,220,304

Timestamp

1/27/2014, 6:37:20 PM

Confirmations

6,447,199

Merkle Root

62cf8498fe6b7282eedb6b894735da1f702a0ee29e19db729f4410da524bedb2
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.

1.039 × 10⁹⁴(95-digit number)
10393267463015793306…46479841920587044849
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
1.039 × 10⁹⁴(95-digit number)
10393267463015793306…46479841920587044849
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.078 × 10⁹⁴(95-digit number)
20786534926031586613…92959683841174089699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.157 × 10⁹⁴(95-digit number)
41573069852063173227…85919367682348179399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.314 × 10⁹⁴(95-digit number)
83146139704126346454…71838735364696358799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.662 × 10⁹⁵(96-digit number)
16629227940825269290…43677470729392717599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.325 × 10⁹⁵(96-digit number)
33258455881650538581…87354941458785435199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.651 × 10⁹⁵(96-digit number)
66516911763301077163…74709882917570870399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.330 × 10⁹⁶(97-digit number)
13303382352660215432…49419765835141740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.660 × 10⁹⁶(97-digit number)
26606764705320430865…98839531670283481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.321 × 10⁹⁶(97-digit number)
53213529410640861731…97679063340566963199
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,848,517 XPM·at block #6,825,551 · 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