Block #744,020

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/27/2014, 10:39:16 PM · Difficulty 10.9796 · 6,064,084 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
abe78e8cda7183ca76dbef8697b9b4989937e3894b3ecd325f43e4d0800b2cf3

Height

#744,020

Difficulty

10.979609

Transactions

6

Size

1.45 KB

Version

2

Bits

0afac7ac

Nonce

7,641,485

Timestamp

9/27/2014, 10:39:16 PM

Confirmations

6,064,084

Merkle Root

b895c86d4569170dc9cd33d6f1e32e0be6f048cf34a44ca5fbff441319a2d4c6
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.101 × 10⁹⁷(98-digit number)
11016876884029458742…34755389653314456319
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.101 × 10⁹⁷(98-digit number)
11016876884029458742…34755389653314456319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.203 × 10⁹⁷(98-digit number)
22033753768058917485…69510779306628912639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.406 × 10⁹⁷(98-digit number)
44067507536117834970…39021558613257825279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.813 × 10⁹⁷(98-digit number)
88135015072235669941…78043117226515650559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.762 × 10⁹⁸(99-digit number)
17627003014447133988…56086234453031301119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.525 × 10⁹⁸(99-digit number)
35254006028894267976…12172468906062602239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.050 × 10⁹⁸(99-digit number)
70508012057788535952…24344937812125204479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.410 × 10⁹⁹(100-digit number)
14101602411557707190…48689875624250408959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.820 × 10⁹⁹(100-digit number)
28203204823115414381…97379751248500817919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.640 × 10⁹⁹(100-digit number)
56406409646230828762…94759502497001635839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.128 × 10¹⁰⁰(101-digit number)
11281281929246165752…89519004994003271679
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,708,878 XPM·at block #6,808,103 · 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.

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