Block #619,194

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/6/2014, 5:53:36 AM · Difficulty 10.9470 · 6,197,902 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
57753e3be49f8afa9300cd6a99cd1fb216454b23dbc2465588bab12af3ab27a2

Height

#619,194

Difficulty

10.946964

Transactions

2

Size

2.16 KB

Version

2

Bits

0af26c3c

Nonce

1,056,473,145

Timestamp

7/6/2014, 5:53:36 AM

Confirmations

6,197,902

Merkle Root

5731115258bce6b73120e80245bccc3b221d98f82e76f3342eee79f6946d9a5f
Transactions (2)
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.

5.128 × 10⁹⁵(96-digit number)
51285783327383446657…18360709568432643279
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
5.128 × 10⁹⁵(96-digit number)
51285783327383446657…18360709568432643279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.025 × 10⁹⁶(97-digit number)
10257156665476689331…36721419136865286559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.051 × 10⁹⁶(97-digit number)
20514313330953378662…73442838273730573119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.102 × 10⁹⁶(97-digit number)
41028626661906757325…46885676547461146239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.205 × 10⁹⁶(97-digit number)
82057253323813514651…93771353094922292479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.641 × 10⁹⁷(98-digit number)
16411450664762702930…87542706189844584959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.282 × 10⁹⁷(98-digit number)
32822901329525405860…75085412379689169919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.564 × 10⁹⁷(98-digit number)
65645802659050811721…50170824759378339839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.312 × 10⁹⁸(99-digit number)
13129160531810162344…00341649518756679679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.625 × 10⁹⁸(99-digit number)
26258321063620324688…00683299037513359359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.251 × 10⁹⁸(99-digit number)
52516642127240649376…01366598075026718719
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,780,805 XPM·at block #6,817,095 · 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