Block #378,061

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/27/2014, 1:29:04 PM · Difficulty 10.4216 · 6,439,941 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
28b90f496c366af6e811043fbdc9e010836feacf6610c3458a2ff0b44ff2aae6

Height

#378,061

Difficulty

10.421630

Transactions

9

Size

2.70 KB

Version

2

Bits

0a6beff3

Nonce

169,520

Timestamp

1/27/2014, 1:29:04 PM

Confirmations

6,439,941

Merkle Root

0e8d5b90c6d1b098fa85918636db063742ba3d6ae6e9a50325a0de2ae68f7abf
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.

3.024 × 10⁹⁶(97-digit number)
30240667868760946982…26675490033243079359
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
3.024 × 10⁹⁶(97-digit number)
30240667868760946982…26675490033243079359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.048 × 10⁹⁶(97-digit number)
60481335737521893964…53350980066486158719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.209 × 10⁹⁷(98-digit number)
12096267147504378792…06701960132972317439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.419 × 10⁹⁷(98-digit number)
24192534295008757585…13403920265944634879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.838 × 10⁹⁷(98-digit number)
48385068590017515171…26807840531889269759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.677 × 10⁹⁷(98-digit number)
96770137180035030343…53615681063778539519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.935 × 10⁹⁸(99-digit number)
19354027436007006068…07231362127557079039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.870 × 10⁹⁸(99-digit number)
38708054872014012137…14462724255114158079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.741 × 10⁹⁸(99-digit number)
77416109744028024274…28925448510228316159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.548 × 10⁹⁹(100-digit number)
15483221948805604854…57850897020456632319
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,788,081 XPM·at block #6,818,001 · 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