Block #378,064

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/27/2014, 1:31:49 PM · Difficulty 10.4217 · 6,447,490 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4b01eb2ff8ae93a1c677a9e91491f9e8b7824c0afa89e977660ab6502d573dc7

Height

#378,064

Difficulty

10.421674

Transactions

2

Size

472 B

Version

2

Bits

0a6bf2d7

Nonce

98,140

Timestamp

1/27/2014, 1:31:49 PM

Confirmations

6,447,490

Merkle Root

9a1666cc83b1792986da4a98cda2c7b217df4adc3be1051209e799bf3aaa0e10
Transactions (2)
1 in → 1 out9.2000 XPM110 B
2 in → 1 out18.5400 XPM271 B
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.578 × 10⁹⁷(98-digit number)
25784766116945684740…79157991856705290239
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.578 × 10⁹⁷(98-digit number)
25784766116945684740…79157991856705290239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.156 × 10⁹⁷(98-digit number)
51569532233891369480…58315983713410580479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.031 × 10⁹⁸(99-digit number)
10313906446778273896…16631967426821160959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.062 × 10⁹⁸(99-digit number)
20627812893556547792…33263934853642321919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.125 × 10⁹⁸(99-digit number)
41255625787113095584…66527869707284643839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.251 × 10⁹⁸(99-digit number)
82511251574226191168…33055739414569287679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.650 × 10⁹⁹(100-digit number)
16502250314845238233…66111478829138575359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.300 × 10⁹⁹(100-digit number)
33004500629690476467…32222957658277150719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.600 × 10⁹⁹(100-digit number)
66009001259380952934…64445915316554301439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.320 × 10¹⁰⁰(101-digit number)
13201800251876190586…28891830633108602879
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,531 XPM·at block #6,825,553 · 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