Block #2,744,937

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/12/2018, 12:24:44 AM · Difficulty 11.6470 · 4,097,633 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e4ff110ddd6fb4f690d55c6ea19cb2e5629eeb602a1d782b0de23f5bfb114adf

Height

#2,744,937

Difficulty

11.647041

Transactions

6

Size

1.96 KB

Version

2

Bits

0ba5a47c

Nonce

77,453,121

Timestamp

7/12/2018, 12:24:44 AM

Confirmations

4,097,633

Merkle Root

7337b7cacf8e1dda66e5f464e37aa2ee0cbf991d18375eca890e07081f43b1eb
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.136 × 10⁹⁴(95-digit number)
11361709357841212098…33292893802543812479
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.136 × 10⁹⁴(95-digit number)
11361709357841212098…33292893802543812479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.272 × 10⁹⁴(95-digit number)
22723418715682424197…66585787605087624959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.544 × 10⁹⁴(95-digit number)
45446837431364848395…33171575210175249919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.089 × 10⁹⁴(95-digit number)
90893674862729696790…66343150420350499839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.817 × 10⁹⁵(96-digit number)
18178734972545939358…32686300840700999679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.635 × 10⁹⁵(96-digit number)
36357469945091878716…65372601681401999359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.271 × 10⁹⁵(96-digit number)
72714939890183757432…30745203362803998719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.454 × 10⁹⁶(97-digit number)
14542987978036751486…61490406725607997439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.908 × 10⁹⁶(97-digit number)
29085975956073502973…22980813451215994879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.817 × 10⁹⁶(97-digit number)
58171951912147005946…45961626902431989759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.163 × 10⁹⁷(98-digit number)
11634390382429401189…91923253804863979519
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,984,987 XPM·at block #6,842,569 · 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