Block #1,589,484

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/18/2016, 4:03:04 AM · Difficulty 10.6519 · 5,237,355 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
382dd26287b7d0f21a51177e775cefa7710d7a5c2f305708c74ebf4711943446

Height

#1,589,484

Difficulty

10.651862

Transactions

2

Size

971 B

Version

2

Bits

0aa6e068

Nonce

623,158,902

Timestamp

5/18/2016, 4:03:04 AM

Confirmations

5,237,355

Merkle Root

04bb476dee0fcc728680abe072c1c337f0c0e25b592a5f56e554650c955dd4d9
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.488 × 10⁹⁴(95-digit number)
14882437928866096040…62804839168989409279
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.488 × 10⁹⁴(95-digit number)
14882437928866096040…62804839168989409279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.976 × 10⁹⁴(95-digit number)
29764875857732192081…25609678337978818559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.952 × 10⁹⁴(95-digit number)
59529751715464384163…51219356675957637119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.190 × 10⁹⁵(96-digit number)
11905950343092876832…02438713351915274239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.381 × 10⁹⁵(96-digit number)
23811900686185753665…04877426703830548479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.762 × 10⁹⁵(96-digit number)
47623801372371507330…09754853407661096959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.524 × 10⁹⁵(96-digit number)
95247602744743014661…19509706815322193919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.904 × 10⁹⁶(97-digit number)
19049520548948602932…39019413630644387839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.809 × 10⁹⁶(97-digit number)
38099041097897205864…78038827261288775679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.619 × 10⁹⁶(97-digit number)
76198082195794411728…56077654522577551359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.523 × 10⁹⁷(98-digit number)
15239616439158882345…12155309045155102719
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,858,879 XPM·at block #6,826,838 · 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