Block #373,981

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/24/2014, 4:28:42 PM · Difficulty 10.4277 · 6,452,390 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
494e8bc94b7e70a51cd344f02ce0b46cf3557d3b441c2ec80db13a23fd658f45

Height

#373,981

Difficulty

10.427651

Transactions

5

Size

1.51 KB

Version

2

Bits

0a6d7a8b

Nonce

25,040

Timestamp

1/24/2014, 4:28:42 PM

Confirmations

6,452,390

Merkle Root

59eaa13dea823212be165910147764ee118931891e0b6493d9ab440f1a4d56bf
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.920 × 10¹⁰¹(102-digit number)
19202143371723724300…07408491857039907839
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.920 × 10¹⁰¹(102-digit number)
19202143371723724300…07408491857039907839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.840 × 10¹⁰¹(102-digit number)
38404286743447448601…14816983714079815679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.680 × 10¹⁰¹(102-digit number)
76808573486894897202…29633967428159631359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.536 × 10¹⁰²(103-digit number)
15361714697378979440…59267934856319262719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.072 × 10¹⁰²(103-digit number)
30723429394757958880…18535869712638525439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.144 × 10¹⁰²(103-digit number)
61446858789515917761…37071739425277050879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.228 × 10¹⁰³(104-digit number)
12289371757903183552…74143478850554101759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.457 × 10¹⁰³(104-digit number)
24578743515806367104…48286957701108203519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.915 × 10¹⁰³(104-digit number)
49157487031612734209…96573915402216407039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.831 × 10¹⁰³(104-digit number)
98314974063225468418…93147830804432814079
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,855,113 XPM·at block #6,826,370 · 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